ppxscal/embedding_network huggingface dataset:
DIMACS Workshop on Design and Formal Verification of Security Protocols
Authors: DIMACS
Venue:  (1997)

DIMACS Workshop on Design and Formal Verification of Security 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
DIRSMIN: a fault-tolerant switch for B-ISDN applications using dilated Reduced-Stage MIN
Authors: Tianming Zhang, A. K. Somani
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Develops and analyzes a dilated high performance fault tolerant fast packet multistage interconnection network (MIN). In this new design, the links at the input and the output stages of a dilated banyan-based MIN are rearranged to create multiple routes for each source-destination pair in the network after removing one stage in the network. These multiple paths are link- and node-disjoint. Fault tolerance at low latency is achieved by sending multiple copies of each input packet simultaneously using different routes and different priorities. This guarantees that high throughput is maintained even in the presence of fault. Throughput is analyzed using simulation and analysis and the authors show that the new design has considerably higher performance in the presence of a faulty switching element (SE) or link in comparison to dilated networks.
Improving Protocol Performance by Dynamic Control of Communication Resources
Authors: Daniela Ivan-Rosu, Karsten Schwan
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

A problem frequently faced by complex distributed applications is to control the interaction of their communication and computational activities such that they jointly adhere to desired performance and timing requirements. This research concerns communication infrastructures able to cope with the varying processing and QoS requirements imposed on them by application programs. Specifically, we describe and evaluate \Comm, a communication infrastructure enabling the on-line adaptation of a protocol's resource usage to currently available resources and application requirements. The key feature of \Comm is its dynamic (auto-)configurability, which is its support of on-line configuration transparent to application programs. Such configuration is performed by a heuristic that accommodates changes in a connection's resource requirements by reallocating resources based on its knowledge of actual resource usage by other active connections. The heuristic's design and implementation are based on extensive investigations of the manner in which alternative assignments of protocol tasks to underlying processing resources can influence program-level latency and throughput requirements.
Programming for Parallelism on the FPSBUS
Authors: Francesca Verdier, Shahin Khan
Venue:  (1988)

We discuss Parallel Processing on multiple FPS M64 series (M64/40, 140, 145, 50, 60) processors, using the FPSBUS. The FPSBUS hardware and software provide an efficient method of achieving real (i.e. wall clock time) application speed-ups in a message-passing parallel environment, similar to the programming model of most massively parallel systems. The FPSBUS programming environment is described. A simple implementation of a matrix multiply and an LU factorization algorithm are discussed and timing results are presented. Synchronous Direct Memory Access transfers were used to measure the FPSBUS speed. For two M64/60''s, the peak transfer speed is approached as the size of transferred data increases, and the synchronous latency was determined to be 3.4 milliseconds. With the use of asynchronous data transfer routines, we have observed significant speed-up on programs of relatively fine granularity.
Interactive exploration and modeling of large data sets: A case study with Venus light scattering data
Authors: Jarke J. Wijk, Hans J.W. Spoelder, Willem Knibbe, Kamran E Shahroudi
Venue:  (1997)

We present a system where visualization and the control of the simulation are integrated to facilitate interactive exploration and modeling of large data sets. The system was developed to estimate properties of the atmosphere of Venus from comparison between measured and simulated data. Reuse of results, distributed computing, and multiple views on the data were the major ingredients to create an effective environment.
An object-oriented framework for modular resource management
Authors: C. A. Waldspurger, W. E. Weihl
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

The authors present a flexible object-oriented framework for specifying modular resource management policies in concurrent systems. The framework generalizes the basic abstractions they originally developed for lottery scheduling. It is independent of the underlying proportional-share scheduler; a variety of probabilistic and deterministic algorithms can be used, including a min-funding revocation algorithm that they introduce for space-shared resources. The framework supports diverse resources and policies, including both proportional shares and guaranteed reservations. A repayment mechanism prevents allocation distortions caused by transfers of resource rights. Key framework concepts are analogous to features of object-oriented languages.
Immersing the Scientist in Data: Interactive Visualization of Unstructured Scientific Data on Concurrent Architectures
Authors: Michael E. Palmer
Venue:  (1994)

No abstract available.
A methodology for hiding knowledge in databases
Authors: Tom Johnsten, Vijay V. Raghavan
Venue: Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14 (2002)

In this paper, we present a methodology to analyze the impact of data mining technology on database security. Our methodology consists of six steps that make up a new data analysis process that we call Knowledge Hiding in Databases (KHD). The specific contributions of this paper include a description of the KHD process, and the initial application of KHD to classification and association mining algorithms.
Analysis of bearing features of rock-socketed piles using neural networks
Authors: Y. Huang, W. M. Ye, Y. Q. Tang
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

Rock-socketed piles have a number of bearing features which differentiate them from other types of piles. The current design procedure for the complex geotechnical engineering system is still highly empirical. The paper investigates the feasibility of using neural networks to analyze the bearing features of rock-socketed piles. A simple back-propagation neural network is used to model the relationship between length-diameter ratio, socketed length, soil property, rock property and the bearing capacity of the rock-socketed pile. After learning from a set of pile static load test data records, the neural network model gives the relative importance of the various input factors.
Limiting disruption in multiagent replanning
Authors: Thomas Bartold, Edmund Durfee
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Multiagent systems sometimes undergo changes that cause coordination commitments to become insufficient or out of date, such that the coordinated agent plans need to be repaired or replaced. When recoordination becomes necessary, disruption to the commitments made by the agents in their original plans should be minimized. We approach the problem of minimizing disruption by augmenting pre-existing coordination technology by developing metrics and automated processes for it to rank and potentially recommend new coordination commitments more rapidly. In this paper, we explain, examine, and evaluate our new metrics and processes, demonstrating empirically that flexible measures of disruption can streamline the coordination process.
Architectural composition in the electronic design studio: conceptual design using CAD visualisation and virtual reality modelling
Authors: A. Dobson
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

The paper evaluates the possibilities for the use of computer aided design and desktop virtual reality technologies as tools for architectural composition. An experimental teaching programme involving undergraduate architectural students at the University of Luton, in which aspects of compositional theory are explored through the direct creation of architectural form and space in digital formats is described. In the programme principles of architectural composition, based upon the ordering and organisation of typological architectural elements according to established rules of composition are introduced to the students through the study of recognised works of design theory. CAD and desktop virtual reality are then used to define and manipulate architectural elements, and to make formal and spatial evaluations of the environments created. The paper describes the theoretical context of the work, assesses the suitability of the software used for performing compositional manipulations, and evaluates the qualities of immersion and intuitive feedback which virtual reality based modelling can offer in the design visualisation process. The teaching programme utilises standard software packages, including AutoCAD, and 3D Studio, as well as Superscape VRT, a PC based desktop VR package.
A bio-inspired robotic mechanism for autonomous locomotion in unconventional environments
Authors: Darío Maravall, Javier de Lope
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

This chapter presents a robotic mechanism aimed at navigating in unconventional environments like rigid aerial lines - power, telephone, railroad - and reticulated structures - ladders, grills, bars, etc -. A novel method of obstacle avoidance for this mechanism is also introduced. The computation of collision-free trajectories generally requires the analytical description of the physical structure of the environment and the solution of the kinematic equations. For dynamic, uncertain environments with unknown obstacles, however, it is very hard to get real-time collision avoidance by means of analytical techniques. The main strength of the proposed method resides, precisely, in that it departs from the analytical approach, as it does not use formal descriptions of the location and shape of the obstacles, nor does it solve the kinematic equations of the mechanism. Instead, the method follows the perception-reason-action paradigm and is based on a reinforcement learning process guided by perceptual feedback, which can be considered as biologically inspired at the functional level. From this perspective, obstacle avoidance is modeled as a multi-objective optimization problem. The method, as shown in the chapter, can be straightforwardly applied to real-time collision avoidance for articulated mechanisms, including conventional manipulator arms.
Relational Algebraic Techniques for the Synthesis of Sparse Matrix Programs
Authors: Vladimir Kotlyar
Venue:  (1999)

Sparse matrix computations are ubiquitous in computational science. However, the development of high-performance software for sparse matrix computations is a tedious and error-prone task, for two reasons. First, there is no standard way of storing sparse matrices, since a variety of formats are used to avoid storing zeros, and the best choice for the format is dependent on the problem and the architecture. Second, for most algorithms, it takes a lot of code reorganization to produce an efficient sparse program that is tuned to a particular format. We view the problem of supporting effective development of high-performance sparse matrix codes as one of {\em generic programming}. Generic programming is a discipline of designing and implementing software components which can be used when there is a set of {\em related data structures} supporting a common semantics described by an API or protocol, and a set of {\em common algorithms} that can be formulated in terms of this API. When designing a generic programming system one must address the following fundamental questions: -How do we represent efficient algorithms independently of any particular data-representation scheme? -How do we provide an interface to a diverse set of data-structures? -How do we ``knit'''' together the representation of the algorithms and the representation for the data to obtain an efficient implementation? This dissertation presents a {\em relational algebraic model} for automatically generating efficient sparse codes starting with dense matrix codes and specification of sparse matrix formats. Our techniques are based on viewing arrays as relations and the execution of DOALL loop nests and loops with reductions as evaluation of queries over these relations. Storage formats are specified to the compiler through search and enumeration access methods and their costs. Code restructuring is then formulated as the search for the most efficient plan for the query. The main step in this process is the identification of simultaneous enumeration of data structures (relational joins) and the determination of the best implementations of this enumeration. This software architecture not only provides for a clean design of the compiler, but it also exposes additional opportunities for code optimization and has led us to more general transformation algorithms than previously reported in the literature. We present experimental data that demonstrates that the code generated by our compiler achieves performance competitive with that of hand-written codes for important computational kernels.
Content-Based Image Visualization
Authors: George Gagaudakis
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The proliferation of content-based image retrieval techniques has highlighted the need to understand the relationship between image clustering based on low-level image features and image clustering made by human users. In conventional image retrieval systems, a range of features such as color, texture, and shape typically characterizes images. However, little is known to what extent these low-level features can be effectively combined with information visualization techniques such that users may explore images in a digital library according to visual similarities. In this article, we compared and analyzed a number of Pathfinder networks of images generated based on such features. Salient structures of images are visualized according to features extracted from color, texture, and shape orientation. Implications for visualizing and constructing hypermedia systems are discussed.
Language-Based Security
Authors: Dexter Kozen
Venue:  (1999)

Security of mobile code is a major issue in today''s global computing environment. When you download a program from an untrusted source, how can you be sure it will not do something undesirable? In this paper I will discuss a particular approach to this problem called language-based security. In this approach, security information is derived from a program written in a high-level language during the compilation process and is included in the compiled object. This extra security information can take the form of a formal proof, a type annotation, or some other form of certificate or annotation. It can be downloaded along with the object code and automatically verified before running the code locally, giving some assurance against certain types of failure or unauthorized activity. The verifier must be trusted, but the compiler, code, and certificate need not be. Java bytecode verification is an example of this approach. I will give an overview of some recent work in this area, including a particular effort in which we are trying to make the production of certificates and the verification as efficient and invisible as possible.
Computing Integrals Involving the Matrix Exponential
Authors: Charles Van Loan
Venue:  (1976)

A new algorithm for computing integrals involving the matrix exponential is given. The method employs diagonal Pade approximation with scaling and squaring. Rigorous truncation error bounds are given and incorporated in a FORTRAN subroutine. The computational aspects of this program are discussed and compared with existing techniques.
Dreamweaver Ultradev 4: Bases de Datos En la Web
Authors: Cesar Perez Lopez
Venue:  (2002)

:Macromedia Dreamweaver UltraDev 4 es un programa orientado a la creacion de aplicaciones Web que interactuan con bases de datos. Este software, junto con el programa de complemento grafico Macromedia Fireworks 4 y el programa de diseno creacion y administracion de sitios y paginas Web Macromedia Dreamweaver 4, constituyen un potente conjunto de herramientas para crear paginas Web de alta calidad y administrar sitios Web con acceso a bases de datos. Macromedia Dreamweaver UltraDev 4 permite crear conexiones de base de datos en la Web para sitios ASP, ColdFusion o JSP. Tambien posibilita simplificar las tareas de creacion de paginas dinamicas, la codificacion manual de secuencias de comandos de servidores y la escritura de comportamientos de servidor personalizados. Asimismo, es posible crear paginas que restrinjan el acceso al sitio a usuarios nuevos y que requieran el establecimiento de una conexion a los usuarios ya registrados en anteriores visitas. En este libro se reune el trabajo con Macromedia Dreamweaver UltraDev 4, comenzando desde el nivel inicial y profundizando secuencialmente en el contenido del programa hasta alcanzar un nivel avanzado en el trabajo en la Web con bases de datos. De forma ordenada se trata la creacion de paginas que realizan busquedas en bases de datos, que editan registros de bases de datos, que controlan el acceso al sitio y otras tareas caracteristicas de las bases de datos en la Web. El texto se adapta tanto al entorno Microsoft Windows (sistemas operativos 9.x, Me, 2000 y NT) como al entorno Macintosh (sistemas Mac OS 8,6 o 9.x), siendo su manejo valido para los usuarios de ambas plataformas.
Query processing in the ROL system
Authors: Mengchi Liu, Weidong Yu
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

The ROL system is a novel deductive object-oriented database system that has been implemented at the University of Regina. It provides a uniform rule-based declarative language for defining, manipulating and querying databases, which integrates important features of deductive databases and object-oriented databases. It supports object identity, complex objects, classes, class hierarchies, multiple inheritance with overriding and blocking, and schema definition. It also supports structured values such as functor objects and sets, treating them as first class citizens, and providing powerful mechanisms for representing both partial and complete information about sets. This paper describes the query processing mechanism in the ROL system. A novel feature is that it effectively combines the top-down and bottom-up strategies and automatically decides which evaluation strategies to use based on the nature of the query and data in the databases.
Messages versus messengers in distributed programming
Authors: M. Fukuda, L. F. Bic, M. B. Dillencourt, F. Merchant
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Messengers are autonomous objects, each capable of navigating through the underlying network and performing various tasks at each node. Messenger applications are written using navigational commands rather than the send/receive primitives of conventional message-passing approaches. In this paper we contrast the two programming styles. The navigational style generally results in a smaller semantic gap between abstract algorithm descriptions and their actual implementations, which makes programs easier to construct, understand, and maintain. Other advantages of the navigational programming style include the ability to compute in unknown or dynamically changing network topologies.
Fitting strains and displacements by minimizing dislocation energy
Authors: C. A. Felippa, K. C. Park
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

We present a procedure for matching a displacement field to a given strain field, or vice-versa, over an arbitrary domain, which can be a finite element. The fitting criterion used is minimization of a dislocation energy functional. The strain field, whether given or fitted, need not be compatible. The method has four immediate applications: (i) finite element stiffness formulation based on fitting assumed-natural-strain (ANS) fields to node displacements; (ii) pointwise recovery of an internal displacement field in ANS elements as required for consistent mass, body load or geometric stiffness computations; (iii) recovery of smoothed strains from node displacements for stress post-processing, and (iv) system identification and damage detection from experimental data. The article focuses on application (i) for the strain fitting (SF) problem and (ii) for the displacement fitting (DF) problem. The separation of mean and deviatoric strains is emphasized whenever it is found convenient to simplify calculations.
Estimation and Prediction of Evolving Color Distributions for Skin Segmentation Under Varying Illumination
Authors: Leonid Sigal, Stan Sclaroff
Venue:  (1999)

Abstract A novel approach for real-time skin segmentation in video sequences is described. The approach enables reliable skin segmentation despite wide variation in illumination during tracking. An explicit second order Markov model is used to predict evolution of the skin color (HSV) histogram over time. Histograms are dynamically updated based on feedback from the current segmentation and based on predictions of the Markov model. The evolution of the skin color distribution at each frame is parameterized by translation, scaling and rotation in color space. Consequent changes in geometric parameterization of the distribution are propagated by warping and re-sampling the histogram. The parameters of the discrete-time dynamic Markov model are estimated using Maximum Likelihood Estimation, and also evolve over time. Quantitative evaluation of the method was conducted on labeled ground-truth video sequences taken from popular movies.
A Triangle-based Unstructured Finite Volume Method for Chemically Reactive Hypersonic Flows
Authors: Enrico Bertolazzi, Gianmarco Manzini
Venue:  (1999)

A triangle-based unstructured finite volume method is developed for non-stationary chemically reactive hypersonic calculations. The method is based on a Steger-Warming flux vector-splitting approach generalized to mixtures of thermally perfect gases. Second order-in-space and -time accuracy is provided by limited flux blending and an implicit multi-stage time marching scheme. The final stiff non-linear problem resulting from discretization presents a very peculiar block diagonal structure. This allows a decoupling of the species and gas dynamic equations in smaller sub problems. A linear algebra argument based on M-matrix theory allows also to show that the method guarantees positivity of species mass densities and vibrational energies under a reasonable CFL-like constraint. Finally, a set of 2-D numerical test cases illustrates the performance of the method.
Long-time behavior for the full one-dimensional Fremond model for shape memory alloys
Authors: Pierluigi Colli, Philippe Laurencot, Ulisse Stefanelli
Venue:  (2000)

This note deals with a well-posed one-dimensional initial-boundary value problem related to the Fremond thermomechanical model of structural phase transitions in shape memory materials. The long-time behavior is investigated and it is proved that the omega-limit set in a suitable topology only contains stationary states.