ppxscal/embedding_network huggingface dataset:
On Counting Fixed Point Configurations in Star Networks
Authors: Predrag T. Tosic
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09 (2005)

We study herewith some aspects related to predictability of the long-term global behavior of the star topology based infrastructures when all the nodes, including the central node, are assumed to function reliably, faultlessly and synchronously. In particular, we use the nonlinear complex systems concepts and methodology, coupled with those of computational complexity, to show that, simple as the star topology is, determining and predicting the longterm global behavior of the star-based infrastructures are computationally challenging tasks. More formally, determining various configuration space properties of the appropriate star network abstractions is shown to be hard in general. We particularly focus herein on the computational (in)tractability of counting the "fixed point" configurations of a class of formal discrete dynamical systems defined over the star interconnection topology.
A Self-Organizing Lookup Service for Dynamic Ambient Services
Authors: Klaus Herrmann, Gero Muhl, Michael Jaeger
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

The provisioning of Ambient Services is gaining importance as users become more and more embedded in environments that are saturated with electronic devices. In our previous work, we have proposed the Ad hoc Service Grid (ASG) approach as a means for deliberately setting up an infrastructure for providing Ambient Services at medium-sized locations like shopping malls. In this paper, we introduce a self-repairing Lookup Service architecture that is able to handle dynamic services in an AGS. These services can autonomously replicate and migrate within an ASG to optimize resource usage and message latency. Our Lookup Service is able to cope with the inconsistencies caused by service migrations efficiently by applying a lazy, request-driven update protocol. We discuss the architecture and the protocols employed by the Lookup Service. Moreover, we provide experimental results that show the efficiency and effectiveness of our approach.
On the mean radius of permutation polytopes
Authors: Raymond Robb
Venue: Discrete Applied Mathematics (2005)

After calculating the mean value of the support function for the simplex of the coordinate vectors over the unit sphere, we find the mean for a number of polytopes, including the Birkhoff and Asymmetric Traveling Salesman polytopes, and discuss what the latter means for the corresponding Asymmetric Traveling Salesman Problem. We also discuss how to apply these results to efficiently count the vertices of certain other permutation polytopes.
On AS-level path inference
Authors: Z. Morley Mao, Lili Qiu, Jia Wang, Yin Zhang
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

The ability to discover the AS-level path between two end-points is valuable for network diagnosis, performance optimization, and reliability enhancement. Virtually all existing techniques and tools for path discovery require direct access to the source. However, the uncooperative nature of the Internet makes it difficult to get direct access to any remote end-point. Path inference becomes challenging when we have no access to the source or the destination. Moveover even when we have access to the source and know the forward path, it is nontrivial to infer the reverse path, since the Internet routing is often asymmetric.In this paper, we explore the feasibility of AS-level path inference without direct access to either end-points. We describe RouteScope-a tool for inferring AS-level paths by finding the shortest policy paths in an AS graph obtained from BGP tables collected from multiple vantage points. We identify two main factors that affect the path inference accuracy: the accuracy of AS relationship inference and the ability to determine the first AS hop. To address the issues, we propose two novel techniques: a new AS relation-ship inference algorithm, and a novel scheme to infer the first AS hop by exploiting the TTL information in IP packets. We evaluate the effectiveness of RouteScope using both BGP tables and the AS paths collected from public BGP gateways. Our results show that it achieves 70% - 88% accuracy in path inference.
Segmentation of High Resolution Satellite Images by Direction and Morphological Filters
Authors: Tomoko Tateyama, Zensho Nakao, Xian Yan Zeng, Yen-Wei Chen
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

This paper examines images taken from IKONOS to extract several features such as road relations automatically. We propose a new method which combines color, texture information and shape information for segmentation of high resolution satellite images. The method uses color and texture information for global segmentaiton, and shape information for local analysis. We propose a new direction filter which pays its attention to road features having information on specific directionality. We also propose another new morphology filter which is used as a length filter extracting length of each region more efficiently.
Optimistic replication
Authors: Yasushi Saito, Marc Shapiro
Venue: ACM Computing Surveys (CSUR) (2005)

Data replication is a key technology in distributed systems that enables higher availability and performance. This article surveys optimistic replication algorithms. They allow replica contents to diverge in the short term to support concurrent work practices and tolerate failures in low-quality communication links. The importance of such techniques is increasing as collaboration through wide-area and mobile networks becomes popular.Optimistic replication deploys algorithms not seen in traditional &ldquo;pessimistic&rdquo; systems. Instead of synchronous replica coordination, an optimistic algorithm propagates changes in the background, discovers conflicts after they happen, and reaches agreement on the final contents incrementally.We explore the solution space for optimistic replication algorithms. This article identifies key challenges facing optimistic replication systems---ordering operations, detecting and resolving conflicts, propagating changes efficiently, and bounding replica divergence---and provides a comprehensive survey of techniques developed for addressing these challenges.
A Grid Service Module for Natural-Resource Managers
Authors: Dali Wang, Eric A. Carr, Mark R. Palmer, Michael W. Berry, Louis J. Gross
Venue: IEEE Internet Computing (2005)

Applying a grid service module built on grid middleware to natural-resource management facilitates transparent use of high-performance ecosystem modeling packages without requiring users to handle underlying computational issues.(Across Trophic-Level System Simulation) From a software development perspective, this novel grid service module can be deployed by researchers across multiple disciplines to allow decision makers or the public to exploit fully functional scientific computation on grids.
Opinions on matters connected with the evaluation of programs and methods for integrating ordinary differential equations
Authors: Fred T. Krogh
Venue: ACM SIGNUM Newsletter (1972)

Eighty-seven items which might be considered in the evaluation of programs for solving differential equations are listed, and ten experts in the field give their opinions on the importance of each item.
A Hybrid Artificial Immune and Mobile Agent Intrusion Detection Based Model for Computer Network Operations
Authors: R. B. Machado, A. Boukerche, J. B. M. Sobral, K. R. L. Juca, M. S. M. A. Notare
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07 (2005)

Agent Based Models are the natural extension of the Ising or Cellular Automata-like models which have been used in the past decades to simulate various physical phenomena. By taking advantages of the main features of such models, coupled with nature based models such as artificial immune systems we present a novel artificial immune and agent based intrusion detection model for large computer networks. Our solution is based upon several security levels, event based model, and a simple computational abstraction where an anomaly detection technique is designed to monitor the users' registrations to the operational targeted system, e.g., UNIX-like implementation. In our model, the events' generation model is processed using the Unix Syslog-ng tool, the events' analysis using the Logcheck tool, while the activities of the users and the execution of the both reactive and pro-active events' activities are implemented within an artificial immune and mobile agent based infrastructure. We have implemented and designed our model to differentiate among attacks, security violations, and several other security levels. In this paper we present our model, and show how mobile agent and artificial immune paradigms can be used to design efficient intrusion detection systems. wealso discuss the validation of our model followed by a set of experiments we have carried out to evaluate the performance of our model using realistic case studies.
Directional secant method for nonlinear equations
Authors: Heng-Bin An, Zhong-Zhi Bai
Venue: Journal of Computational and Applied Mathematics (2005)

We present a directional secant method, a secant variant of the directional Newton method, for solving a single nonlinear equation in several variables. Under suitable assumptions, we prove the convergence and the quadratic convergence speed of this new method. Numerical examples show that the directional secant method is feasible and efficient, and has better numerical behaviour than the directional Newton method.
Counterexamples to the nonorientable genus conjecture for complete tripartite graphs
Authors: M. N. Ellingham, Chris Stephens, Xiaoya Zha
Venue: European Journal of Combinatorics (2005)

In 1976, Stahl and White conjectured that the minimum nonorientable genus of Kl,m,n (where l ≥ m ≥ n) is ⌈(l-2)(m+n-2)/2⌉. We prove that K4,4,1, K4,4,3, and K3,3,3 are counterexample to this conjecture. We also show that all other complete tripartite graphs Kl,m,n with l ≥ m ≥ n and l ≤ 5 satisfy the conjecture. Moreover, all complete tripartite graphs with l ≤ 5 satisfy the similar conjecture for orientable genus.
Block linear majorants in quadratic 0-1 optimization
Authors: Endre Boros, Isabella Lari, Bruno Simeone
Venue: Discrete Applied Mathematics (2004)

A usual technique to generate upper bounds on the optimum of a quadratic 0-1 maximization problem is to consider a linear majorant (LM) of the quadratic objective function f and then solve the corresponding linear relaxation. Several papers have considered LMs obtained by termwise bounding, but the possibility of bounding groups of terms simultaneously does not appear to have been given much attention so far. In the present paper a broad and flexible computational framework is developed for implementing such a strategy. Here is a brief overview of our approach: in the first place, a suitable collection of "elementary" quadratic functions of few variables (typically, 3 or 4) is generated. All the coefficients of any such function (block) are either 1 or -1, and agree in sign with the corresponding coefficients of the given quadratic function. Next, for each block, a tightest LM (i.e., one having the same value as the block in as many points as possible), or a closest LM (i.e., one minimizing the sum of slacks) is computed. This can be accomplished through the solution of a small mixed-integer program, or a small linear program, respectively. Finally, the objective function is written as a weighted sum of blocks, with non-negative weights. Replacing in this expression each block by the corresponding LM yields an LM of f. We shall choose the weights in this process so that the maximum value of the resulting linear function is as small as possible. This amounts to a large-scale (but still polynomial-size) linear program, which may be solved exactly or, for larger instances, approximately by truncated column generation. The results of a set of 480 numerical tests with up to 200 variables are presented: the upper bounds on the quadratic optimum obtained by the above procedure are (provably) never worse, and often turn out to be substantially sharper, than those resulting from termwise bounding. Moreover, our bounds turn out to be close to the optimum in many (although not all) instances of some well-known benchmarks.
Self Organising Wayfinding Support for Lifelong Learners
Authors: Colin Tattersall, Jocelyn Manderveld, Bert Berg, René Es, José Janssen, Rob Koper
Venue: Education and Information Technologies (2005)

Lifelong learning puts learner self-direction centre-stage. However, increased responsibility should not come at the price of over-burdening or abandonment of learners as they progress along their learning journey. This paper introduces an approach to wayfinding support for lifelong learners based on self-organisation theory. It describes an architecture which supports the recording, processing and presentation of collective learner behaviour designed to create a feedback loop informing learners of successful paths towards the attainment of learning goals. The approach is presented as an alternative to methods of achieving adaptation in hypermedia-based learning environments which involve learner modelling. The article concludes with a discussion of the questions being addressed in our ongoing research.
A performance evaluation of a pre-emptive on-demand distance vector routing protocol for mobile ad hoc networks: Research Articles
Authors: Azzedine Boukerche, Liqin Zhang
Venue: Wireless Communications Mobile Computing (2004)

Mobile ad hoc networks are useful for providing communication support where no fixed infrastructure exists or the deployment of a fixed infrastructure is not economically profitable and movement of communicating parties is allowed. Therefore, it is not possible to establish a priori and fixed paths for message delivery through the network. Because of their importance, routing and packets dropped problems, mainly due to the path breaking, are among the most studied problem in mobile and wireles ad hoc networks. Multi-path protocols can be useful for the purpose of balancing congestion and decreasing the delay, by routing packets along different paths. However, they may allow only source-based load balancing decisions. In this paper, we present a pre-emptive ad hoc on-demand distance vector routing protocol for mobile and wireless ad hoc networks. We present the algorithm, discuss its implementation and report on the performance results of simulation of several workload models on ns-2. Our results indicate that a scheme based on scheduling a path-discovery routine before the current in-use link breaks is feasible and that such a mechanism can increase the number of packets delivered and decrease the average delay per packet. It also improves the throughput (packet delivered ratio) and balances the traffic between different source&ndash;destination pairs. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Modeling Fractures and Barriers as Interfaces for Flow in Porous Media
Authors: Vincent Martin, Jérôme Jaffré, Jean E. Roberts
Venue: SIAM Journal on Scientific Computing (2005)

We consider a fractured porous medium that is studied at a scale such that the fractures can be modeled individually. Models for flow in which the fractures are interfaces between subdomains are presented. These models take into account interactions between the fractures and the surrounding porous medium. Existence and uniqueness of the solution to the model problem are proved. Error estimates show convergence as $\mathcal{O}(\max\{h,d\})$ in the L2 norm, where h is the mesh size and d the fracture width. Numerical experiments confirm the theoretical results.
A cross-layer cost-function based rate adaptation mechanism for the WCDMA system with multi-class services by transport format selection: Research Articles
Authors: Li-Chun Wang, Ming-Chi Chen, Yi-Cheng Chen
Venue: Wireless Communications Mobile Computing (2005)

The growing demand of high speed multi-class data transmissions poses new challenges on wireless networks. The major objectives of the next generation wireless networks include: (1) achieving high data throughput in the fast varying wireless channel; (2) transmitting multi-class data by service multiplexing; and (3) controlling the delay for delay sensitive service. To achieve these goals, in the context of wideband code division multiple access (WCDMA) system, we propose a cost-function based rate adaptation mechanism by taking account of both physical layer channel impacts and higher layer performance parameters, such as buffer occupancy and service priority. We implement this cross-layer rate mechanism by exploiting the transport format (TF) selection procedure in the medium access control (MAC) layer of the WCDMA system. Through the proposed cross-layer cost function, the TF selection procedure can dynamically adapt suitable spreading factors every transmission time interval (TTI), usually 10&ndash;80&thinsp;ms. Through simulations in a flat Rayleigh fading channel, we show that the proposed cross-layer cost-function based rate adaptation mechanism can effectively improve throughput and reduce the buffer occupancy for multi-class services for the WCDMA system at the cost of slightly higher power efficiency. Copyright &copy; 2005 John Wiley & Sons, Ltd.
A Web Surfer Model Incorporating Topic Continuity
Authors: Sankar K. Pal
Venue: IEEE Transactions on Knowledge and Data Engineering (2005)

This paper describes a surfer model which incorporates information about topic continuity derived from the surfer's history. Therefore, unlike earlier models, it captures the interrelationship between categorization (context) and ranking of Web documents simultaneously. The model is mathematically formulated. A scalable and convergent iterative procedure is provided for its implementation. Its different characteristic features, as obtained from the joint probability matrix, and their significance in Web intelligence are mentioned. Experiments performed on Web pages obtained from WebBase confirm the superiority of the model.
Microsoft Windows XP Networking and Security Inside Out (Inside Out)
Authors: Ed Bott, Carl Siechert
Venue:  (2005)

Configure and manage your PC network-and help combat privacy and security threats-from the inside out! This book packs hundreds of timesaving solutions, troubleshooting tips, and workarounds, all in concise, fast-answer format.
The evolution of protein interaction networks in regulatory proteins: Conference Reviews
Authors: Gregory D. Amoutzias, David L. Robertson, Erich Bornberg-Bauer
Venue: Comparative and Functional Genomics (2004)

Interactions between proteins are essential for intracellular communication. They form complex networks which have become an important source for functional analysis of proteins. Combining phylogenies with network analysis, we investigate the evolutionary history of interaction networks from the bHLH, NR and bZIP transcription-factor families. The bHLH and NR networks show a hub-like structure with varying &gamma; values. Mutation and gene duplication play an important role in adding and removing interactions. We conclude that in several of the protein families that we have studied, networks have primarily arisen by the development of heterodimerizing transcription factors, from an ancestral gene which interacts with any of the newly emerging proteins but also homodimerizes. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Advanced eager scheduling for Java-based adaptive parallel computing: Research Articles
Authors: Michael O. Neary, Peter Cappello
Venue: Concurrency and Computation: Practice Experience (2005)

Javelin 3 is a software system for developing large-scale, fault-tolerant, adaptively parallel applications. When all or part of their application can be cast as a master&ndash;worker or branch-and-bound computation, Javelin 3 frees application developers from concerns about inter-processor communication and fault tolerance among networked hosts, allowing them to focus on the underlying application. The paper describes a fault-tolerant task scheduler and its performance analysis. The task scheduler integrates work stealing with an advanced form of eager scheduling. It enables dynamic task decomposition, which improves host load-balancing in the presence of tasks whose non-uniform computational load is evident only at execution time. Speedup measurements are presented of actual performance on up to 1000 hosts. We analyze the expected performance degradation due to unresponsive hosts, and measure actual performance degradation due to unresponsive hosts. Copyright &copy; 2005 John Wiley & Sons, Ltd.
WebDAV: Versatile Collaboration Multiprotocol
Authors: Jim Whitehead
Venue: IEEE Internet Computing (2005)

The first installment of the new Standards Track explores the Web Distributed Authoring and Versioning protocol. WebDAV supports remote collaborative authoring of Web sites and individual documents, remote access to documentmanagement systems, and more. It is the most popular network file-system protocol for use across the wide-area Internet, and it has been integrated intoexisting authoring tools of many types.WebDAV defines a series of extensions to the set of methods defined by HTTP version 1.1 and contains a set of features that can be used in numerous settings.
Low power test generation for path delay faults using stability functions
Authors: M. M. Vaseekar Kumar, S. Tragoudas
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

A recent work describes an ATPG for path delay faults that limits the power dissipated by the test patterns to a given bound. However, the power dissipated by the intermediate patterns while applying the test patterns in a sequence is not considered. Experiments with test patterns derived from different ATPGs has shown that the switching activity due to intermediate patterns dissipate considerable power. This paper proposes a method to incorporate stability functions in a functional ATPG to derive test vectors that guarantee reduced power dissipation by the intermediate patterns without loss in PDF coverage.
Plasticity of user interfaces: towards an evolution model based on conceptual graphs
Authors: Alexandre Demeure, Gaëlle Calvary
Venue: Proceedings of the 15th French-speaking conference on human-computer interaction on 15eme Conference Francophone sur l'Interaction Homme-Machine (2003)

This paper deals with Plasticity of User Interfaces (UI). Plasticity refers to the ability of UIs to withstand variations of context of use while preserving usability. By context of use, we mean a <user, platform, environment< triplet. Adaptation is a three-step process involving recognition of the situation, computation of a reaction to cope with the situation, and execution of the reaction. This paper covers both computation and execution of the reaction. It proposes a graph of descriptions and an evolution model for respectively capitalizing UIs and specifying the adaptation to perform in case of change of context of use. These notions are based on conceptual graphs.
A Protocol for Designated Confirmer Signatures Based on RSA Cryptographic Algorithms
Authors: Li Ping, Lin Yaping
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Itýs essential on algorithm design of designated confirmer signatures to construct proofs satisfying security requirements such as unforgeablility, non-transferability, invisibility and zero-knowledge. A designated confirmer signature protocol (RSA-DCSV) is proposed, based on RSA encryption and signature schemes in forms of RSA extended modular computations. Proofs for a designated verifier is considered. Security analysis on RSA-DCSV is also addressed.