ppxscal/embedding_network huggingface dataset:
Making the Internet Go Away
Authors: Grenville Armitage
Venue: IEEE Internet Computing (2004)

Grenville Armitage Centre for Advanced Internet Architectures, Swinburne University of TechnologyDo not adjust your set. Do not click Reload. This issueýs Peer to Peer title is correct. I do want the Internet ý as we know it today ý to go away. And, for our industryýs sake, I want all of you in the data-networking-research, equipment-vendor, and service-provider communities to make it happen ý soon.
Edge caching for directory based web applications: algorithms and performance
Authors: Apurva Kumar, Rajeev Gupta
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

In this paper, a dynamic content caching framework is proposed for deploying directory based applications at the edge of the network, closer to the client. The framework consists of a Lightweight Directory Access Protocol (LDAP) directory cache and the offloaded application running at a proxy. The LDAP directory cache is an enhanced LDAP proxy server which stores results and semantic information for search requests (queries) and answers incoming queries which are semantically contained in them. A simplified query containment approach based on the concept of LDAP templates is proposed. Caching algorithms have been proposed which take advantage of referential locality in the access pattern. A generic framework is used to offload the application at the edge and to support prefetching of LDAP queries based on application logic. A real enterprise directory application and real workloads are used to evaluate performance of the caching algorithms. The LDAP directory cache architecture, along with the proposed algorithms can be used to improve performance and scalability of directory based services.
Performance of optimum and suboptimum OFDM-CPM receivers over multipath fading channels: Research Articles
Authors: Imran A. Tasadduq, Raveendra K. Rao
Venue: Wireless Communications Mobile Computing (2005)

A class of orthogonal frequency division multiplexing-continuous phase modulation (OFDM-CPM) signals is introduced in which binary data sequence is mapped to complex symbols using the concept of correlated phase states of a CPM signal. Canonical optimum and suboptimum multiple-symbol-observation OFDM-CPM receivers are derived. Multipath channel with AWGN is assumed. The receivers are analyzed for bit error rate (BER) performance in terms of high- and low-SNR bounds. These bounds are illustrated as a function of parameter h, time delay and attenuation level. It is shown that OFDM-CPM systems, with h=0.5,0.25 and an observation interval length of two symbols, can outperform conventional OFDM-PSK system for a two-ray multipath model. Copyright &copy; 2005 John Wiley & Sons, Ltd.
A Multiplatform P2P System: Its Implementation and Applications
Authors: Nobuhiro Nakamura, Souichirou Takahama, Leonard Barolli, Jianhua Ma, Kaoru Sugita
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Peer-to-Peer (P2P) computing offers many attractive features, such as collaboration, self-organization, load balancing, availability, fault tolerance and anonymity. However, it also faces many serious challenges. In our previous work, we implemented a synchronous P2P collaboration platform called TOMSCOP. Based on the elementary peer group services offered by the JXTA general framework, TOMSCOP provides the extra four types of services: synchronous message transportation, peer room administration, peer communication support and application space management. By using the four services, different kinds of shared applications for various specific purposes can be relatively easily developed and associated collaborative cyber spaces or communities can be quickly built across the JXTA virtual network overlaid on top of the existing physical networks. However, the TOMSCOP was implemented only in Windows XP OS. In this paper, we extend our previous work and present the implementation of a Multi-Platform P2P System (MPPS). The proposed system operates very smoothly in UNIX Solaris 9 OS, LINUX Suse 9.1 OS, Mac OSX, and Windows XP. In the future study, we would like to evaluate the implemented P2P platform and compare its performance with other P2P systems.
Architectural support in industry: a reflection using C-POSH
Authors: R. J. Bril, R. L. Krikhaar, A. Postma
Venue: Journal of Software Maintenance: Research and Practice (2005)

Software architecture plays a vital role in the development (and hence maintenance) of large complex systems (containing millions of lines of code) with a long lifetime. It is therefore required that the software architecture is also maintained, i.e., sufficiently documented, clearly communicated, and explicitly controlled during its life-cycle. In our experience, these requirements cannot be met without appropriate support.Commercial-off-the-shelf support for architectural maintenance is still scarcely available, if at all, implying the need to develop appropriate proprietary means. In this paper, we reflect upon software architecture maintenance taken within three organizations within Philips that develop professional systems. We extensively describe the experience gained with introducing and embedding of architectural support in these three organizations. We focus on architectural support in the area of software architecture recovery, visualization, analysis, and verification.In our experience, the support must be carried by a number of pillars of software development, and all of these pillars have to go through a change process to ensure sustainable embedding. Managing these changes requires several key roles to be fulfilled in the organization: a champion, a company angel, a change agent, and a target. We call our reflection model C-POSH, which is an acronym for Change management of the four identified pillars of software development: Process, Organization, Software development environment, and Humans. Our experiences will be presented in terms of the C-POSH model.
Approximately counting integral flows and cell-bounded contingency tables
Authors: Mary Cryan, Martin Dyer, Dana Randall
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, generalising a result of Dyer, Kannan and Mount (1997). We apply this to approximating the number of contingency tables with prescribed cell bounds when the number of rows is constant, but the row sums, column sums and cell bounds may be arbitrary. We provide an fpras for this problem via a combination of dynamic programming and volume estimation. This generalises an algorithm of Cryan and Dyer (2002) for standard contingency tables, but the analysis here is considerably more intricate.
Combatting the effects of underflow and overflow in determining real roots of polynomials
Authors: Seppo Linnainmaa
Venue: ACM SIGNUM Newsletter (1981)

A new method, requiring no extended number range, is presented to prevent all harmful effects caused by both underflow and overflow when any polynomial equation with real coefficients is to be solved for real roots. Examples of polynomial equations are given having no conventional scaling possibility where replacing either overflowed numbers by the largest possible number or underflowed numbers by zero leads to badly erroneous results. The proposed method is capable to solve also these equations correctly. Also other successful methods, based on extended range of numbers, are discussed.
(Re)configuration algorithms for peer-to-peer over ad hoc networks
Authors: Fernanda P. Franciscani, Marisa A. Vasconcelos, Rainer P. Couto, Antonio A. F. Loureiro
Venue: Journal of Parallel and Distributed Computing (2005)

A peer-to-peer network over an ad hoc infrastructure is a powerful combination that provides users with means to access different kinds of information anytime and anywhere. In this paper we study the (re)configuration issue in this highly dynamic scenario. We propose three (re)configuration algorithms especially concerned with the constraints of the environment presented. The algorithms aim to use the scarce resources of the network in an efficient way, improving the performance and the network lifetime. The algorithms were simulated and we used a simple Gnutella-like algorithm as comparison. The results show that the algorithms achieved their goals, presenting a good cost-benefit relation.
Order SVM: a kernel method for order learning based on generalized order statistics
Authors: Hideto Kazawa, Tsutomu Hirao, Eisaku Maeda
Venue: Systems and Computers in Japan (2005)

In this paper, we address the problem of learning the order of a group of items. This study assumes that items have unobserved &ldquo;scores&rdquo; and are ranked by the score. The goal is to derive an approximate scoring function given ordered lists of items without their scores. We extend the notion of order statistics to any order and prove that the distribution functions of the extended statistics are scoring functions. We then propose a learning algorithm, Order SVM, that can approximate the distribution functions. Order SVM is experimentally compared with other learning algorithms using artificial data and important sentence selection data. The results show that Order SVM performs well on both datasets whereas the other methods show good performance on only one of the datasets. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 36(1): 35&ndash;43, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10630
Block Learning Bayesian Network Structure from Data
Authors: Yi-feng Zeng, Kim-leng Poh
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Existing methods for learning Bayesian network structures run into the computational and statistical problems because of the following two reasons: a large number of variables and a small sample size for enormous variables. Adopting the divide and conquer strategies, we propose a novel algorithm, called block learning algorithm, to learn Bayesian network structures. The method partitions the variables into several blocks that are overlapped with each other. The blocks are learned individually with some constraints obtained from the learned overlap structures. After that, the whole network is recovered by combining the learned blocks. Comparing with some typical learning algorithms on golden Bayesian networks, our proposed methods are efficient and effective. It shows a large potential capability to be scaled up.
A Customizable Component for Low-Level Communication Software
Authors: Thiago Robert C. Santos, Antonio Augusto Frohlich
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

This paper discusses the design of a customizable component that encapsulates a raw baseline communication architecture and a set of lightweight protocols. These protocols can act in specific points of the baseline architectureýs algorithm in order tailor communication or provide new services according to the requirements of specific classes of applications. An implementation of the described component is currently being used by the application-oriented parallel programming environment SNOW, which provides specially tailored run-time systems for parallel applications running on dedicated clusters.
Polynomial approximation of analytic functions on a finite number of continua in the complex plane
Authors: Vladimir Andrievskii
Venue: Journal of Approximation Theory (2005)

The Dzjadyk-type theorem concerning the polynomial approximation of functions on a continuum in the complex plane C is generalized to the case of polynomial approximation of functions on a compact set in C which consists of a finite number of continua.
Geometry theorem proving by decomposing polynomial system into strong regular sets
Authors: Yong-Bin Li, Wu Liu, Xiao-Lin Xiang
Venue: Journal of Computer Science and Technology (2004)

This paper presents a complete method to prove geometric theorem by decomposing the corresponding polynomial system into strong regular sets, by which one can compute some components for which the geometry theorem is true and exclude other components for which the geometry theorem is false. Two examples are given to show that the geometry theorems are conditionally true for some components which are excluded by other methods.
Eliciting design requirements for maintenance-oriented IDEs: a detailed study of corrective and perfective maintenance tasks
Authors: Andrew J. Ko, Htet Aung, Brad A. Myers
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Recently, several innovative tools have found their way into mainstream use in modern development environments. However, most of these tools have focused on creating and modifying code, despite evidence that most of programmers' time is spent understanding code as part of maintenance tasks. If new tools were designed to directly support these maintenance tasks, what types would be most helpful? To find out, a study of expert Java programmers using Eclipse was performed. The study suggests that maintenance work consists of three activities: (1) forming a working set of task-relevant code fragments; (2) navigating the dependencies within this working set; and (3) repairing or creating the necessary code. The study identified several trends in these activities, as well as many opportunities for new tools that could save programmers up to 35% of the time they currently spend on maintenance tasks.
Harmonic retrieval in the presence of non-circular Gaussian multiplicative noise: performance bounds
Authors: Philippe Ciblat, Mounir Ghogho, Philippe Forster, Pascal Larzabal
Venue: Signal Processing (2005)

We address the problem of harmonic retrieval in the presence of multiplicative and additive noise sources. In the new context of a complex-valued non-circular Gaussian multiplicative noise, we express the Cramér-Rao bound (CRB) as well as the asymptotic (large sample) CRB in closed form. Below a certain SNR threshold and/or when the number of samples is not large enough, the CRB becomes too optimistic and therefore we also derive the Barankin bound (BB). The new theoretical expressions for the CRB and BB are then used to study the behavior of the performance bound with respect to the signal parameters. We especially describe the region (in terms of SNR and number of samples) for which the CRB and the BB differ. Finally we compare the performance of the square-power-based frequency estimate, which is equivalent to the non-linear least-squares-based estimate, to these bounds.
A Novel QoS Multicast Model in Mobile Ad Hoc Networks
Authors: Guojun Wang, Jiannong Cao, Lifan Zhang, Keith C. C. Chan, Jie Wu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09 (2005)

Multicast applications for large-scale Mobile Ad hoc NETworks (MANETs) require an efficient and effective Quality of Service (QoS)-aware multicast model. The new requirements to guarantee QoS are high availability and good load balancing due to limited bandwidth and transmission power of Mobile Nodes (MNs). We propose a logical Hypercube-based Virtual Dynamic Backbone (HVDB) model for QoS-aware multicast communications. In this model, high fault tolerance and small diameter of hypercubes are the basis for high availability, and regularity and symmetry of hypercubes contribute to good load balancing. Based on this model, we design proactive local logical route maintenance, summary-based membership update, and logical location-based multicast routing algorithms in large-scale MANETs.
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint
Authors: Claude-Guy Quimper, Alexander Golynski, Alejandro López-Ortiz, Peter Beek
Venue: Constraints (2005)

Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraint programming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications.
Solution Form and Simple Iteration of a Nonsymmetric Algebraic Riccati Equation Arising in Transport Theory
Authors: Lin-Zhang Lu
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

We are interested in computing the minimal positive solution of a nonsymmetric algebraic Riccati equation arising in transport theory. We show that this computation can be done via computing only the minimal positive solution of a vector equation, which is derived from the special form of solutions of the Riccati equation. A simple iterative method is presented for solving the vector equation. The simple iteration is much more efficient than the Gauss--Jacobi method presented by Juang in [Linear Algebra Appl., 230 (1995), pp. 89--100] for the Riccati equation. The symmetric case and bounds of the minimal positive solution are also considered. Numerical experiments are given.
Adaptive Visualization Pipeline Decomposition and Mapping onto Computer Networks
Authors: Mengxia Zhu, Qishi Wu, Nageswara S. V. Rao, S. Sitharama Iyengar
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper discusses algorithmic and implementation aspects of a remote visualization system, which adaptively decomposes and maps the visualization pipeline onto a wide-area network. Visualization pipeline modules such as filtering, geometry extraction, rendering, and display are dynamically assigned to network nodes to achieve minimal total delay or maximal frame rate. Polynomial-time optimal algorithms using the dynamic programming method to compute the optimal decomposition and mapping are proposed. We implemented an OpenGL-based remote visualization system. We evaluated its performance using a deployment at three geographically distributed nodes.
Interference Power Sum with Log-Normal Components in Ad-Hoc and Sensor Networks
Authors: R. Hekmat, P. Van Mieghem
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

The log-normal shadowing radio model has frequently been used to model radio propagation conditions. There exist accurate calculation methods for estimation of interference power sum statistics in fixed-topology wireless networks based on this radio model. Here we publish essential additions to these estimation methods to expand their use to sensor networks and ad-hoc networks with changing topology. To our best knowledge this has not been done before. Taking into account radio propagation conditions, density of nodes, size of the network, traffic load per node and MAC protocol characteristics we present a calculation method for the estimation of interference power sum statistics in wireless ad-hoc and sensor networks. The accuracy of the calculation method is verified by simulations. We highlight the influence of MAC protocols on interference and show that an increase in network size or in node density does not necessarily lead into higher interference values. Our results can be deployed to estimate the network capacity.
Persistence of travelling wave solutions of a fourth order diffusion system
Authors: Y. N. Kyrychko, M. V. Bartuccelli, K. B. Blyuss
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper the extended Burgers-Huxley equation with the fourth-order derivative is considered. First, the convergence to the uniform steady state is proved, which means the solution of the equation with positive initial data will remain positive for time t sufficiently large. Then, the persistence of the travelling wave solution for the extended equation on the unbounded domain is investigated. We have proved that this solution will persist under small perturbation of the equation.
Biomedical informatics and granularity: Conference Papers
Authors: Anand Kumar, Barry Smith, Daniel D. Novotny
Venue: Comparative and Functional Genomics (2004)

An explicit formal-ontological representation of entities existing at multiple levels of granularity is an urgent requirement for biomedical information processing. We discuss some fundamental principles which can form a basis for such a representation. We also comment on some of the implicit treatments of granularity in currently available ontologies and terminologies (GO, FMA, SNOMED CT). Copyright &copy; 2004 John Wiley & Sons, Ltd.
Adaptable Java Agents (AJA): a tool for programming of multi-agent systems
Authors: Mihal Badjonski, Mirjana Ivanovic, Zoran Budimac
Venue: ACM SIGPLAN Notices (2005)

Agent-building tools have an important role in popularizing agent technology. This paper describes a new agent-programming tool AJA. AJA consists of two programming languages: HADL for defining of higher-level agent constructs and Java+ for low-level programming of these constructs. Among other interesting features AJA presents an original approach of incorporating artificial intelligence techniques, such as artificial neural nets, into a programming language.
Radian reduction for trigonometric functions
Authors: Mary H. Payne, Robert N. Hanek
Venue: ACM SIGNUM Newsletter (1983)

An accurate reduction poses little difficulty for arguments of a few radians. However for, say, a CRAY1, H format on the VAX, or double extended in the proposed IEEE standard, the maximum argument which might be presented for reduction is of the order of 2^16000 radians. Accurate reduction of such an argument would require storage of &pi; (or its reciprocal) to over 16,000 bits. Direct reduction by division (or multiplication) then requires generation of a somewhat larger number of bits in the result in order to guarantee the accuracy of the reduction. Of these bits only the low few bits of the integer part of the quotient (product) and enough bits to correctly round the remainder are relevant; the rest will be discarded.
Evaluation of the capability of interaction
Authors: Xingwu Liu
Venue: ACM SIGGROUP Bulletin (2003)

Interaction, as an important computing paradigm, is far beyond incremental technological development. Various models such as interaction machines and process algebras have been developed to help design and analyze interaction systems. However, little is reported on the computability theory of interaction, and the design and analysis still have to be performed in an ad hoc way. Hence, the question is: how to uniformly evaluate the power of interaction? Roughly, I plan to explore this question in three steps. The first is to find out a universal formal model for interaction. The second is to abstract the tasks of interaction. The third is to evaluate the capability of interaction in terms of the results of step 1 and 2. The anticipated result may be expressed as a hierarchy that extends Chomsky hierarchy from above. Possible application of the hierarchy is also presented.
Covering points with a polygon
Authors: Gill Barequet, Yuval Scharf, Matthew T. Dickerson
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

We present a diagram that captures containmen information for scalable rotated and ranslated versions of a convex polygon. For a given polygon P and a contact point q in a point set S , the diagram parameterizes possible translations, rotations, and scales of he polygon in order to represent containmen regions for each additional point v ∈ S . We present geometric and combinatorial properties for this diagram, and describe how it can be computed and used for solving several geometric problems.