ppxscal/embedding_network huggingface dataset:
An efficient distributed channel allocation algorithm based on dynamic channel boundaries
Authors: Chi Chung Lam
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

In a mobile computing environment efficient allocation of wireless channels is consequential to the system performance. This paper presents a distributed channel allocation algorithm based on the concept of dynamic channel boundaries. Under this scheme, each mobile service station (MSS) is assigned a contiguous range of channel not overlapping with those of its neighbors. Channel boundaries between adjacent MSSs are dynamically adjustable through voluntary withdrawals. High efficiency is provided by two important features: early boundary expansion and need-based boundary redrawing. This algorithm imposes a low message volume on the fixed network, has short response times to connection requests and achieves high channel utilization under both evenly and unevenly distributed loads. Channel utilization is further improved if a MSS may borrow channels from its neighbors. Simulation results indicate this algorithm outperforms other distributed channel allocation algorithms.
A Proposal for Accurately Modeling Frequency-Dependent On-Chip Interconnect Impedance
Authors: Li-Fu Chang, Keh-Jeng Chang, Christophe Bianchi
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Skin effects should be considered for accurate deep-submicron (DSM, 0.35mm and below) interconnect modeling [1][2][3]. Conventionally the sheet-r for uniform or plasma-etched conductors is reasonably constant, so the frequency-dependent skin effect can be found by straightforward field simulations, which require sheet-r being constant [4][5][6]. In that case, the skin-depth is primarily function of harmonic frequency and the environment. However, for damascene-processed conductors, the sheet-r is function of line width [7]. Therefore, the impedance (resistance and inductance in this paper) has to be determined by field solvers using a new methodology we propose in this paper: For each DSM technology, sets of interconnect structures with comprehensive range of line widths and neighbors for each metal level are provided and simulated in advance. In this way, a library for each DSM technology is available for accurate and efficient VLSI interconnect modeling. Future work is provided at the end of this paper.
Similar Classifiers and VC Error Bounds
Authors: Eric Bax
Venue:  (1997)

We improve error bounds based on VC analysis for classes with sets of similar classifiers. We apply the new error bounds to separating planes and artificial neural networks.
Developing a European Technical Reference Digital Library
Authors: Antonella Andreoni, Maria B Baldacci, Stefania Biagioni, Carlo Carlesi, Donatella Castelli, Pasquale Pagano, Carol Peters
Venue:  (1999)

The development of a European digital library for grey literature is described. The aim has been to provide a digital library for scientists working in the areas of information science and applied mathematics and also to build a test-bed for research activities. The service has been implemented as part of NCSTRL (the US Networked Computer Science Technical Reference Library) and developed, extending the Dienst system used by NCSTRL, to meet the requirements of the European scientific community. The additional functionality is described and the difficulties encountered when trying to extend an existing architecture, protocol and system are discussed.
What is Many-Valued Logic ?
Authors: Jean-Yves Béziau
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

Firstly we examine the definition of many-valued logic within the framework of (logical) matrix theory. Secondly we discuss the general result, challenging the existence of many-valued logic, according to which every logic may be seen as two-valued. Thirdly we analyze the principle of bivalence and show that it appears at a deeper level than one usually thinks.
A Prototype Hotel Browsing System Using Java3D
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Java3D is an application-centred approach to building 3D worlds. We use Java3D and VRML to design a prototype WWW-based 3D Hotel Browsing system. A Java3D scene graph viewer was implemented to interactively explore objects in a virtual universe using models generated by a commercial computer graphics suite and imported using a VRML file loader. A special collision prevention mechansim is also devised. This case study is reported here by reviewing the current aspects of the prototype system. 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
A Linearization of the Lambda Calculus and Consequences
Authors: A. J. Kfoury
Venue:  (1996)

Abstract If every lambda-abstraction in a lambda-term M binds at most one variable occurrence, then M is said to be "linear". Many questions about linear lambda-terms are relatively easy to answer, e.g. they all are beta-strongly normalizing and all are simply-typable. We extend the syntax of the standard lambda-calculus L to a non-standard lambda-calculus L^ satisfying a linearity condition generalizing the notion in the standard case. Specifically, in L^ a subterm Q of a term M can be applied to several subterms R1,...,Rk in parallel, which we write as (Q. R1 \wedge ... \wedge Rk). The appropriate notion of beta- reduction beta^ for the calculus L^ is such that, if Q is the lambda- abstraction (\lambda x.P) with m\geq 0 bound occurrences of x, the reduction can be carried out provided k = max(m,1). Every M in L^ is thus beta^-SN. We relate standard beta-reduction and non-standard beta^-reduction in several different ways, and draw several consequences, e.g. a new simple proof for the fact that a standard term M is beta-SN iff M can be assigned a so-called ``intersection'''' type (``top'''' type disallowed).
Group formation with split rule in social dilemmas
Authors: Tomohisa Yamashita, Koichi Kurumatani, Robert L. Axtell, Azuma Ohuchi
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this research, we propose group formation that enhances the performance of multiagent systems in the Social Dilemmas. As the mechanisms for group formation, mutual choice mechanism for 2-IPD is extended to that for N-IPD. Furthermore, group split based on the metanorm of mutual choice is introduced. As a result of simulations with an evolutionary approach, we confirm the enhancement of the performance of the systems consisting of self-interest agents.
An Approach to Experimental Evaluation of Software Understandability
Authors: K. Shima, Y. Takemura, K. Matsumoto
Venue: Proceedings of the 2002 International Symposium on Empirical Software Engineering (2002)

Software understandability is one of important characteristics of software quality because it can influence cost or reliability at software evolution in reuse or maintenance. However, it is difficult to evaluate software understandability in practice because understanding is an internal process of humans. This paper proposes "software overhaul" as a method for externalizing the process of understanding and presents a probability model to use process data of overhaul to estimate software understandability. An example describes an overhaul tool and an application of it.
Fast Detection of Common Geometric Substructure in Proteins
Authors: Paul Chew, Klara Kedem, Jon Kleinberg, Dan Huttenlocher
Venue:  (1998)

We consider the problem of identifying common three-dimensional substructures between proteins. Our method is based on comparing the shape of the $\alpha$-carbon backbone structures of the proteins in order to find 3D rigid motions that bring portions of the geometric structures into correspondence. We propose a geometric representation of protein backbone chains that is compact yet allows for similarity measures that are robust against noise and outliers. We represents the structure of the backbone as a sequence of unit vectors, defined by each adjacent pair of $\alpha$-carbons; we then define a measure of the similarity of two protein structures based on the RMS (root mean squared) distance between corresponding orientation vectors in the two proteins. Our measure has several advantages over standard position-based RMS measures that are commonly used for comparing protein shapes. In particular, the measure behaves well for comparing substructures, because unlike position-based measures the nonmatching portions of the structure do not dominate the measure. At the same time, it avoids the quadratic space and computational difficulties associated with the use of distance matrices and contact maps. We show applications of our approach to detecting common contiguous substructures in pairs of proteins, as well as the more difficult problem of identifying common protein domains (i.e., larger substructures that are not necessarily contiguous along the protein chain).
Research Report: Volume Rendering for Relational Data
Authors: Barry G. Becker
Venue: Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97) (1997)

A method for efficiently volume rendering dense scatterplots of relational data is described. Plotting difficulties that arise from large numbers of data points, categorical variables, interaction with non-axis dimensions, and unknown values, are addressed by this method. The domain of the plot is voxelized using binning and then volume rendered. Since a table is used as the underlying data structure, no storage is wasted on regions with no data. The opacity of each voxel is a function of the number of data points in a corresponding bin. A voxel's color is derived by averaging the value of one of the variables for all the data points that fall in a bin. Other variables in the data may be mapped to external query sliders. A dragger object permits a user to select regions inside the volume.
Two-Level Method on Unstructured Meshes with Convergence Rate Independent of the Coarse-Space Size
Authors: Petr Vanek, Jitka Krizkova
Venue:  (1995)

A two-level algorithm for unstructured meshes with a coarse-space size independent rate of convergence is developed based on polynomial smoothing of prolongators given by unknowns aggregation. A coarse level is generated algebraically using a system of possibly large subdomains. Numerical experiments confirm the theory and demonstrate that the method performs well also on a general class of problems with highly variable coefficients.
On Building Non-Intrusive Performance Instrumentation Blocks for CORBA-Based Distributed Systems
Authors: Baskar Sridharan, Aditya P. Mathur, Balakrishnan Dasarathy
Venue: Proceedings of the 4th International Computer Performance and Dependability Symposium (2000)

A non-intrusive, reusable framework for collecting performance statistics of CORBA-based distributed systems is proposed. The usefulness of the framework in the context of comparing performance improvement techniques is described. Also discussed is application of this framework to a large telecommunications application and experimental results on its relative overhead.
An implementation of capabilities on the PDP-11/45
Authors: Charles Hoch, J. C. Browne
Venue: ACM SIGOPS Operating Systems Review (1980)

This paper defines a capability implementation which uses the memory management hardware and the TRAP instruction of the higher members of the Digital Equipment Corporation PDP-11/XX (XX = 34, 45, 55, 70) to create a capability architecture processor. No modifications to hardware are necessary. The architecture created has a strong similarity to that of the Plessey 250. An operating system based on this architecture could provide a basis for implementation of highly reliable and secure software systems on a common and inexpensive minicomputer.
The Art of 3-D Computer Animation and Effects, Third Edition, 3 edition
Authors: Isaac Victor Kerlow
Venue:  (2003)

:Providing solid conceptual and critical basics through a combination of technical explanations and creative techniques, this updated edition addresses the newest techniques available in the latest software programs and hardware. The author guides the reader along a step-by-step approach to creating and outputting fully rendered three-dimensional computer still images, animations, and effects.
Calculus of Variations in Discrete Space for Constrained Nonlinear Dynamic Optimization
Authors: Yixin Chen, Benjamin W. Wah
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and space. We first show that path dominance in dynamic programming cannot be applied when there are general constraints that span across multiple stages, and that node dominance, in the form of Euler-Lagrange conditions developed in optimal control theory in continuous space, cannot be extended to that in discrete space. This paper is the first to propose efficient dominance relations, in the form of local saddle-point conditions in each stage of a problem, for pruning states that will not lead to locally optimal paths. By utilizing these dominance relations, we develop efficient search algorithms whose complexity, despite exponential, has a much smaller base as compared to that without using the relations. Finally, we demonstrate the performance of our algorithms on some spacecraft planning and scheduling benchmarks and show significant improvements in CPU time and solution quality as compared to those obtained bythe existing ASPEN planner. 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
Model checking agentspeak
Authors: Rafael H. Bordini, Michael Fisher, Carmen Pardavila, Michael Wooldridge
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper introduces ASF, a variation of the BDI logic programming language ASL intended to permit the model-theoretic verification of multi-agent systems. After briefly introducing ASF and discussing its relationship to ASL, we show how ASF programs can be transformed into Prm, the model specification language for the Spin model-checking system. We also describe how specifications written in a simplified form of BDI logic can be transformed into Spin-format linear temporal logic formulae. With our approach, it is thus possible to automatically verify whether or not multi-agent systems implemented in ASF satisfy specifications expressed as BDI logic formulæ. We illustrate our approach with a short case study, in which we show how BDI properties of a simulated auction system implemented in ASF were verified.
Specification and Solution of Dependability Models of Fault-tolerant Systems
Authors: Manish Malhotra
Venue:  (1993)

The modeling and analysis methodology consists of three main phases: model specification, model generation, and model solution. We consider some specific problems in each of these areas. First, we establish a hierarchy of dependability model types according to their modeling power. Algorithms to convert one model type into another are provided. We show that fault-trees with repeated events (FTRE) are the most powerful combinatorial model type. Then we show how Petri-net based models can be used for dependability modeling. Algorithms to convert a FTRE model to equivalent generalized stochastic Petri net (GSPN) and stochastic reward net (SRN) models are presented. Our comparison reveals that SRNs permit a much more concise description of dependability models than GSPNs do. We then present a methodology for formal expression of hierarchy in model specification and solution that offers a unified view of various kinds of hierarchical modeling techniques including iterative hierarchical modeling based on fixed-point iteration, non-iterative hierarchical modeling, reward-based performability modeling, behavioral decomposition, and approximate model decomposition. Model generation consists of converting from the specification-model-type to solution-model-type. We consider the conversion of semi-Markov models to Markov models using the technique of phase approximations. We describe a complete approach to phase-approximations, including choice of phase-approximation class, estimation of the selected parameters, and implementation of the approximation approach in a modeling toolkit. We also describe a new hybrid approach for parameter estimation that combines moment-matching with least squares fitting. Model solution is the next step after model generation. We describe an approach to design efficient methods for numerical transient solution of stiff Markov chains. Our approach uses a combination of explicit and implicit ODE methods. Finally we describe an application of dependability modeling and analysis. We model and analyze dependability of disk array systems. We develop detailed models and introduce new measures to compare various RAID (Redundant Arrays of Inexpensive Disks) architectures. The coverage of disk failures is analytically computed based on the error detection and correction mechanism. Models that take into account placement strategies of support hardware are also developed.
Trust in information sources as a source for trust: a fuzzy approach
Authors: Cristiano Castelfranchi, Rino Falcone, Giovanni Pezzulo
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The aim of this paper is to show how relevant is a trust model based on beliefs and their credibility.The approaches to the study of trust are various and very different from each of other. In our view, just a socio-cognitive approach to trust would be able to analyse the sub-components on which the final decision to trust or not is taken. In this paper we show an implementation of our socio-cognitive model of trust developed using the so-called Fuzzy Cognitive Maps. The model allows to distinguish between internal and external attributions and it introduced a degree of trust derived from the credibility of the trust beliefs, while the credibility of the beliefs derives from their sources and the sources' number, convergence, reliability (i.e. trust).With this implementation we show how the different components may change and how their impact can change depending on the specific situation and from the agent heuristics or personality. In particular, we analyse the different nature of the belief sources and their trustworthiness. We assumed different types of belief sources. For each trustier's belief one should consider what the content of the belief is, who/what the source is, how this source evaluates the belief, how the trustier evaluates this source (with respect to this belief). In addition for considering the contribution of different sources we need a theory of how they combine. The interesting thing in this paper is that starting from finding the sources of trust we are obliged to consider the trustworthiness of these sources.
A lower bound for the job insertion problem
Authors: Tamás Kis, Alain Hertz
Venue: Discrete Applied Mathematics (2003)

This note deals with the job insertion problem in job-shop scheduling: Given a feasible schedule of n jobs and a new job which is not scheduled, the problem is to find a feasible insertion of the new job into the schedule which minimises the makespan. Since the problem is NP-hard, a relaxation method is proposed to compute a strong lower bound. Conditions under which the relaxation provides us with the makespan of the optimal insertion are derived. After the analysis of the polytope of feasible insertions, a polynomial time procedure is proposed to solve the relaxed problem. Our results are based on the theory of perfect graphs and elements of polyhedral theory.
Lambda Logic
Authors: Leonid Rudin
Venue:  (1981)

The main aim of this paper is to formulate ¿natural¿ logical foundations for type-free lambda-calculus. The importance of such foundations for analyzing arbitrary order computational properties of programs is emphasized.
Multidimensional Multistage K-NN Classifiers for Handwritten Digit Recognition
Authors: I. Soraluze, C. Rodriguez, F. Boto, A. Pérez
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper analyses the application of multistage classifiers based on the k-NN rule to the automatic classification of handwritten digits. The discriminating capacity of a k-NN classifier increases as the size and dimensionality of the reference pattern set (RPS) increases. This supposes a problem for k -NN classifiers in real applications: the high computational costrequired. In order to accelerate the process of calculating the distance to each pattern of the RPS, some authors propose the use of condensing techniques. These methods try to reduce the size of the RPS without losing classification power. Our alternative proposal is based on hierarchical classifiers with rejection techniques and incremental learning that reduce the computational cost of the classifier. We have used 270,000 digits (160,000 digits for training and 110,000 for the test) of the NIST Special Data Bases 19 and 3 (SD19 and SD3) asexperimental data sets. The best non-hierarchical classifier achieves a hit rate of 99.50%. The hierarchical classifier achieves the same hit ratio, but with 24.5 times lower computational cost than best non-hierarchical classifier found in our experimentation and 6 times lower than Hart's Algorithm.
Relative Neighborhood Graphs in Three Dimensions
Authors: K P Agarwal, Jiri Matousek
Venue:  (1991)

\indent The relative neighborhood graph (RNG) of a set $S$ of $n$ points in $ {\bf R}^{d}$ is a graph $(S, E),$ where $(p,q) \in E$ if and only if there is no point $z \in S$ such that max ${\{d(p,z),d(q,z)\}} > d(p,q).$ We show that in ${\bf R}^{3}, \mbox {RNG}(S)$ has $O (n^{4/3})$ edges. We present a randomized algorithm that constructs RNG($S$) in expected time $O (n^{3/2+ \epsilon})$ assuming that the points of $S$ are in general position. If the points of $S$ are arbitrary, the expected running time is $O (n^{7/4+ \epsilon })$. These algorithms can be made deterministic without affecting their asymptotic running time.
Electric Suspenders: A Fabric Power Bus and Data Network for Wearable Digital Devices
Authors: Michael M. Gorlick
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

One goal of wearable computing is to create digital devices that are as easy to don and as comfortable to wear as common articles of clothing such as blouses, pants, and belts. New forms of woven materials such as conductive webbings, which incorporate durable electrical conductors directly into the matrix of the weave, offer exciting possibilities for closely integrating digital electronics with conventional clothing. However, many practical obstacles hinder the adoption of these materials, not the least being a lack of reliable electrical connectors for the interconnection of conventional electronics with conductive fabrics.We present a simple and workable design for just such connectors and demonstrate how a commonplace article of clothing --- suspenders --- can be transformed into an effective power bus and data network for wearable digital devices. Both the power bus and the data network are described in detail, including the mechanics of attachment and an outline of the network protocols. The techniques illustrated here can be readily applied to other articles of clothing and accessories.