ppxscal/embedding_network huggingface dataset:
Discarte: a disjunctive internet cartographer
Authors: Rob Sherwood, Adam Bender, Neil Spring
Venue: ACM SIGCOMM Computer Communication Review (2008)

Internet topology discovery consists of inferring the inter-router connectivity ("links") and the mapping from IP addresses to routers ("alias resolution"). Current topology discovery techniques use TTL-limited "traceroute" probes to discover links and use direct router probing to resolve aliases. The often-ignored record route (RR) IP option provides a source of disparate topology data that could augment existing techniques, but it is difficult to properly align with traceroute-based topologies because router RR implementations are under-standardized. Correctly aligned RR and traceroute topologies have fewer false links, include anonymous and hidden routers, and discover aliases for routers that do not respond to direct probing. More accurate and feature-rich topologies benefit overlay construction and network diagnostics, modeling, and measurement. We present DisCarte, a system for aligning and cross-validating RR and traceroute topology data using observed engineering practices DisCarte uses disjunctive logic programming (DLP), a logical inference and constraint solving technique, to intelligently merge RR and traceroute data. We demonstrate that the resultant topology is more accurate and complete than previous techniques by validating its internal consistency and by comparing to publicly-available topologies. We classify irregularities in router implementations and introduce a divide-and-conquer technique used to scale DLP to Internet-sized systems.
Algebraic Analysis of Bifurcation and Limit Cycles for Biological Systems
Authors: Wei Niu, Dongming Wang
Venue: Proceedings of the 3rd international conference on Algebraic Biology (2008)

In this paper, we show how to analyze bifurcation and limit cycles for biological systems by using an algebraic approach based on triangular decomposition, Gröbner bases, discriminant varieties, real solution classification, and quantifier elimination by partial CAD. The analysis of bifurcation and limit cycles for a concrete two-dimensional system, the self-assembling micelle system with chemical sinks, is presented in detail. It is proved that this system may have a focus of order 3, from which three limit cycles can be constructed by small perturbation. The applicability of our approach is further illustrated by the construction of limit cycles for a two-dimensional Kolmogorov prey-predator system and a three-dimensional Lotka---Volterra system.
Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
Authors: Tobias Marschall, Sven Rahmann
Venue: Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2008)

We present probabilistic arithmetic automata (PAAs), which can be used to model chains of operations whose operands depend on chance. We provide two different algorithms to exactly calculate the distribution of the results obtained by such probabilistic calculations. Although we introduce PAAs and the corresponding algorithm in a generic manner, our main concern is their application to pattern matching statistics, i.e. we study the distributions of the number of occurrences of a pattern under a given text model. Such calculations play an important role in computational biology as they give access to the significance of pattern occurrences. To assess the practicability of our method, we apply it to the Prosite database of amino acid motifs and to the Jaspar database of transcription factor binding sites. Regarding the latter, we additionally show that our framework permits to take binding affinities predicted from a physical model into account.
Proceedings of the ACM SIGPLAN workshop on Generic programming
Venue: International Conference on Functional Programming (2008)

It is our great pleasure to welcome you to the ACM SIGPLAN Workshop on Generic Programming 2008 - WGP 2008, held in Victoria, Canada, on 20th September 2008. The workshop is sponsored by ACM SIGPLAN and is affiliated with the 13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008). Previous Workshops on Generic Programming have been held in Marstrand (affiliated with MPC), Ponte de Lima (affiliated with MPC), Nottingham (informal workshop), Dagstuhl (IFIP TC2/IFIP WG2.1 Working Conference), Oxford (informal workshop), Utrecht (informal workshop) and Portland (affiliated with ICFP). The call for papers generated 10 submissions. Each paper was evaluated by at least three members of the programme committee with the help of additional reviewers. During a five-day virtual meeting, the programme committee selected 6 papers for presentation at the workshop. The papers cover a variety of topics, including software architectures, data abstraction, and generic programming in a dependently typed setting. We hope that the proceedings will serve as a valuable reference for both researchers and students.
The Height of Factorization Forests
Authors: Manfred Kufleitner
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

We show that for every homomorphism from A + to a finite semigroup S there exists a factorization forest of height at most 3 ¿ S ¿ ¿ 1. Furthermore, we show that for every non-trivial group, this bound is tight. For aperiodic semigroups, we give an improved upper bound of 2 ¿ S ¿ and we show that for every n ¿ 2 there exists an aperiodic semigroup S with n elements which reaches this bound.
An Overview of Fuzzy Relational Calculus and Its Applications
Authors: Etienne E. Kerre
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

The calculus of relations has been very important during the past 40 years from theoretical as well as from practical point of view. The development of fuzzy set theory, particularly in the framework of relational calculus has undoubtly increased the interest in this domain of science.
Dynamic Data Driven Applications Systems (DDDAS) --- A Transformative Paradigm
Authors: Frederica Darema
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

The Dynamic Data Driven Applications Systems (DDDAS), paradigm entails the ability to dynamically incorporate data into an executing application simulation, and in reverse, the ability of applications to dynamically steer measurement processes. The ability to augment the traditional application modeling with such dynamic data inputs, acquired in real time, online, or existing as archival data, creates the possibility of entirely new capabilities through improved applications modeling, improved instrumentation methods, and systems management methods, enhancing the analysis and prediction capabilities of application simulations, improving the efficiency of simulations and the effectiveness of measurement systems, including providing powerful methodology of management of heterogeneous sensor networks. The dynamic integration of the computational and measurement aspects in DDDAS environments entail a unified of the computational and instrumentation application platform. In this presentation we will discuss the ensuing DDDAS computational model in the context of examples of novel capabilities enabled through its implementation in many application areas.An overview of the state of the art will be presented. A discussion of how to connect U.S. and European or Asian DDDAS-like projects will be initiated for all present at the DDDAS workshop.
Blind Deconvolution of MIMO-IIR Systems: A Two-Stage EVA
Authors: Mitsuru Kawamoto, Yujiro Inouye, Kiyotaka Kohno
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

This paper deals with a blind deconvolution (DB) problem for multiple-input multiple-output infinite impulse response (MIMO-IIR) systems. To solve this problem, we propose an eigenvector algorithm (EVA). In the proposed EVA, two kinds of EVAs are merged so as to give a good performance: One is an EVA and the other is a Robust EVA (REVA) which works with as little sensitive to Gaussian noise as possible. Owing to this combination, two drawbacks of the conventional EVAs can be overcome. Simulation results show the validity of the proposed EVA.
Deterministic asymptotic Cramér-Rao bound for the multidimensional harmonic model
Authors: Rémy Boyer
Venue: Signal Processing (2008)

The harmonic model sampled on a P-dimensional grid contaminated by an additive white Gaussian noise has attracted considerable attention with a variety of applications. This model has a natural interpretation in a P-order tensorial framework and an important question is to evaluate the theoretical lowest variance on the model parameter (angular-frequency, real amplitude and initial phase) estimation. A standard Mathematical tool to tackle this question is the Cramer-Rao bound (CRB) which is a lower bound on the variance of an unbiased estimator, based on Fisher information. So, the aim of this work is to derive and analyze closed-form expressions of the deterministic asymptotic CRB associated with the M-order harmonic model of dimension P with P>1. In particular, we analyze this bound with respect to the variation of parameter P.
CKBLS: an interactive system for collaborative knowledge building and learning
Authors: Kathiravelu Ganeshan
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

In this paper, I review some current technologies and software used in collaborative knowledge building and learning in general and then discuss the interactive system I designed to facilitate collaborative knowledge building and learning in tertiary education. This system is used in conjunction with a wireless intelligent personal electronic response system in the classroom. Contributors and learners are also able to access this system remotely.
I/O Efficient Dynamic Data Structures for Longest Prefix Queries
Authors: Moshe Hershcovitch, Haim Kaplan
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

We present an efficient data structure for finding the longest prefix of a query string p in a dynamic database of strings. When the strings are IP-addresses then this is the IP-lookup problem. Our data structure is I/O efficient. It supports a query with a string p using $O(\log_{B}(n)+\frac{|p|}{B})$ I/O operations, where B is the size of a disk block. It also supports an insertion and a deletion of a string p with the same number of I/O's. The size of the data structure is linear in the size of the database and the running time of each operation is O(log(n) + |p|).
Generating Sound and Resource-Aware Code from Hybrid Systems Models
Authors: Madhukar Anand, Sebastian Fischmeister, Jesung Kim, Insup Lee
Venue: Model-Driven Development of Reliable Automotive Services: Second Automotive Software Workshop, ASWSD 2006, San Diego, CA, USA, March 15-17, 2006, Revised Selected Papers (2006)

Modern real-time embedded systems are complex, distributed, feature-rich applications. Model-based development of real-time embedded systems promises to simplify and accelerate the implementation process. Although there are appropriate models to design such systems and some tools that support automatic code generation from such models, several issues related to ensuring correctness of the implementation with respect to the model remain to be addressed.In this work, we investigate how to derive sampling rates for distributed real-time systems generated from a hybrid systems model such that there are no switching discrepancies and the resources spent in achieving this are a minimum. Of particular interest are the resulting mode switching semantics and we propose an approach to handle faulty transitions and compute execution rates for minimizing missed transitions.
The Grid Resource Broker workflow engine
Authors: M. Cafaro, I. Epicoco, M. Mirto, D. Lezzi, G. Aloisio
Venue: Concurrency and Computation: Practice Experience (2008)

Increasingly, complex scientific applications are structured in terms of workflows. These applications are usually computationally and-or data intensive and thus are well suited for execution in grid environments. Distributed, geographically spread computing and storage resources are made available to scientists belonging to virtual organizations sharing resources across multiple administrative domains through established service-level agreements. Grids provide an unprecedented opportunity for distributed workflow execution; indeed, many applications are well beyond the capabilities of a single computer, and partitioning the overall computation on different components whose execution may benefit from runs on different architectures could provide better performances. In this paper we describe the design and implementation of the Grid Resource Broker (GRB) workflow engine. Copyright &copy; 2008 John Wiley & Sons, Ltd.
A comparative study of ElGamal based digital signature algorithms
Authors: Ramzi A. Haraty, A. N. El-Kassar, Bilal M. Shebaro
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

A powerful and practical public-key and digital signature scheme was produced by ElGamal. ElGamal public-key and digital signature scheme were modified from the domain of natural integers, Z, to the domains of Gaussian integers, Z[i], and polynomials over finite fields, F[x]. We implement the classical and modified ElGamal digital signature scheme to compare and to test their functionality, reliability and security. To test the security of the algorithms we use a famous attack algorithm called Baby-Step-Giant algorithm which works in the domain of natural integers. We enhance the Baby-Step-Giant algorithm to work with the modified ElGamal digital signature algorithms.
On a fast algorithm for computing the laplacian eigenpairs via commuting integral operators
Authors: Xiaodong Xue
Venue:  (2007)

N. Saito recently proposed a new method to analyze and represent data recorded on a domain &Omega; of general shape in Rd by expanding the data into a set of the eigenfunctions of Laplacian defined over &Omega;. Instead of directly solving the Laplacian eigenvalue problem on &Omega; via the Helmholtz equation (which can be quite complicated and costly), he found an integral operator commuting with the Laplacian, which shares the eigenfunctions with the Laplacian. After discretization, the eigenvalue problem for this integral operator is converted to that of a symmetric kernel matrix. A conventional approach of computing selected eigenvalues of such a matrix is, for instance, an implicitly re-started Lanezos method (IRLM), which costs O( kN2) floating point operations where k is related to the number of the selected eigenvalues and the distribution of the eigenvalues. This approach is prohibitively expensive for a large kernel matrix that is often generated by a dense sampling of the domain. The kernel function of this integral operator for a domain in R2 , however, is of the special form K( x, y) = &ndash; 12p log ||x &ndash; y||, i.e., the fundamental solution of the Laplacian. This kernel function represents the potential at point x due to a charge located at point y. This fact allows us to apply the ideas of Fast Multipole Method (FMM) and Hierarchical Semi-Separable (HSS) representation to exploit the structure of the kernel matrix. In this thesis, we investigate a hierarchical matrix-splitting scheme and the low rank property of the submatrices generated by the splitting scheme. By doing so, we design a hierarchical matrix decomposition method that leads to a fast algorithm of matrix-vector multiplication which costs O(N). By supplying our fast matrix-vector multiplication routine to IRLM, we obtain an eigenvalue solver that costs O(kN). 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
On the Monotonicity of Weak Searching
Authors: Boting Yang, Yi Cao
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

In this paper, we propose and study two digraph searching models: weak searching and mixed weak searching. In these two searching models, each searcher must follow the edge directions when they move along edges, but the intruder can move from tail to head or from head to tail along edges. We prove the monotonicity of the mixed weak searching model by using Bienstock and Seymour's method, and prove the monotonicity of the weak searching model by using LaPaugh's method. We show that both searching problems are NP-complete.
Case-Specific Reliability Assessment for Improved False Positive Reduction with an Information-Theoretic CAD System
Authors: Piotr A. Habas, Jacek M. Zurada, Georgia D. Tourassi
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

The study presents an application of the case-specific reliability analysis framework for quality evaluation of mammographic CAD detections. First, the original framework is modified so that it can be applied to a featureless case-based CAD system that relies on principles of information theory (IT). Then, the IT-CAD system is applied for false positive reduction of visual cues provided by a pre-screening algorithm. The study is based on mammograms from the Digital Database of Screening Mammography (DDSM) and is focused on mass detection. Experimental results show that assessment of the expected accuracy for each individual CAD cue facilitates 11%-18% further reduction of false positives while operating at high mass detection rates.
Three-Dimensional Numerical Modeling of a Deep Excavation Adjacent to Shanghai Metro Tunnels
Authors: Y. M. Hou, J. H. Wang, L. L. Zhang
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Due to rapid construction and limited urban area in Shanghai, some deep excavations are very close to the existing metro tunnels or sensitive superstructures. Therefore the safety of the adjacent tunnels and surrounding structures become an important issue during design and construction of these deep excavations. This paper presents a 3D finite-element modeling using the finite element analysis program ABAQUS for an oversize deep excavation in Shanghai soft deposits. The excavation is the excavation of the north square underground shopping center of Shanghai South Railway Station. Two cases of numerical analyses assuming anisotropic and isotropic soil stiffness respectively are conducted. The estimated wall deflection and ground movements are compared with the field monitoring results. It is found that soil stiffness anisotropy has a significant effect on the accuracy of prediction of the diaphragm wall deflection and the ground movement around excavation for the oversize excavation in Shanghai soft deposits. The calculated ground movements of the anisotropic case agree well with the field measurements.
Process Information-Driven 3D Working Procedure Model Construction
Authors: Yunfei Shi, Shusheng Zhang, Haitao Fan, Julu Cao, Yan Yang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

The Working Procedure Model (WPM), which is composed by a set of models, is used to describe a process of a part made from roughcast to product. And the WPM plays a key role while part being produced. The process information comprises process drawing and process steps and shows a sequencing and asymptotic course that a part is made. The 3D model can’t be constructed automatically by the existing method of parameterized design. Focusing on process sheets, this paper studies how to apply and implement the Natural Language Understanding into the 3D reconstruction is researched. The method of asymptotic approximation product was proposed, which constructs 3D process model automatically and intelligence. Compared with the traditional 3D model reconstruction based on orthographic projections or engineering drawing, the process information has some advantages followed. On the one hand, the reconstruction object is translated from the complicated engineering drawing into a series of more simple process drawing. With added plentiful process information for reconstruction, the disturbances are avoided such as irrelevant graph, symbol and label etc. And more, the form change of both neighbor process drawings is so little that the engineering drawings interpretation is no difficulty; in addition, the abnormal solution and multi-solution can be avoided during reconstruction, and the problems how to be applicable to more objects is solved ultimately. Therefore, the utility method for 3D reconstruction model will be possible. On the other hand, the WPM not only includes the information about parts characters, but also can deliver the information of design, process and engineering to the downstream.
Modeling of Carrier Transport in Nanowires
Authors: T. Gurov, E. Atanassov, M. Nedjalkov, I. Dimov
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

We consider a physical model of ultrafast evolution of an initial electron distribution in a quantum wire. The electron evolution is described by a quantum-kinetic equation accounting for the interaction with phonons. A Monte Carlo approach has been developed for solving the equation. The corresponding Monte Carlo algorithm is NP-hard problem concerning the evolution time. To obtain solutions for long evolution times with small stochastic error we combine both variance reduction techniques and distributed computations. Grid technologies are implemented due to the large computational efforts imposed by the quantum character of the model.
Immune-Inspired Online Method for Service Interactions Detection
Authors: Jianyin Zhang, Fangchun Yang, Kai Shuang, Sen Su
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Service composition technique aims to integrate several Web services to meet the increasing user demand that a single service can not satisfy. But it also brings the potential of abnormal message interactions among the composed services which lead to the service interactions problem resembling the feature interactions in the telecommunication area. Inspired by the similarities between the immune system and the service interactions detection system, this paper presents an online method to detect the service interactions problem by using ideas from the immune principles. The method overcomes the drawbacks of static methods, and conduces to an effective detection of not only known feature interactions, but also previously unknown ones.