ppxscal/embedding_network huggingface dataset:
TCP performance over mobile ad hoc networks: a quantitative study: Research Articles
Authors: Vaidyanathan Anantharaman, Seung-Jong Park, Karthikeyan Sundaresan, Raghupathy Sivakumar
Venue: Wireless Communications Mobile Computing (2004)

In this paper, we study the performance of the transmission control protocol (TCP) over mobile ad-hoc networks. We present a comprehensive set of simulation results and identify the key factors that impact TCP's performance over ad-hoc networks. We use a variety of parameters including link failure detection latency, route computation latency, packet level route unavailability index, and flow level route unavailability index to capture the impact of mobility. We relate the impact of mobility on the different parameters to TCP's performance by studying the throughput, loss-rate and retransmission timeout values at the TCP layer. We conclude from our results that existing approaches to improve TCP performance over mobile ad-hoc networks have identified and hence focused only on a subset of the affecting factors. In the process, we identify a comprehensive set of factors influencing TCP performance. Finally, using the insights gained through the performance evaluations, we propose a framework called Atra consisting of three simple and easily implementable mechanisms at the MAC and routing layers to improve TCP's performance over ad-hoc networks. We demonstrate that Atra improves on the throughput performance of a default protocol stack by 50&percnt;&ndash;100&percnt;. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A Dependency Chain Clustered Microarchitecture
Authors: Satish Narayanasamy, Hong Wang, Perry Wang, John Shen, Brad Calder
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In this paper we explore a new clustering approach for reducing the complexity of wide issue in-order processors based on EPIC architectures. Complexity effectiveness is achieved by heavily clustering the pipeline from decode to commit stage without the need for any direct bypass between clusters. This is made possible by assuming support for executing compiler-constructed traces. One trace is executed at a time by executing its coarse-grained dependency chains (DCs) in different in-order clusters. Since the DCs of a trace are mutually data independent of each other they can be executed in different clusters without any direct communication between them. To execute DCs in narrower clusters without compromising ILP, a compiler algorithm that splits large DCs by duplicating instructions is proposed. Through cycle accurate simulations we show that a DC processor with one 3-wide, one 2-wide and one 1-wide in-order pipeline, could achieve performance equivalent to a 6-wide inorder superscalar processor. Since a clustered DC microarchitecture is complexity efficient, it is amenable to higher clock frequencies and will also be easier to design and validate than a 6-wide monolithic design.
Designing Templates for Cellular Neural Networks Using Particle Swarm Optimization
Authors: Hiram A. Firpi, Erik D. Goodman
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Designing or learning of templates for cellular neural networks constitutes one of the crucial research problems of this paradigm. In this work, we present the use of a particle swarm optimizer, a global search algorithm, to design a template set for a CNN. A brief overview of the algorithms and methods is given. Design of popular templates will be performed using the search algorithm described.
Active Management of Scientific Data
Authors: Beth Plale, Jay Alameda, Bob Wilhelmson, Dennis Gannon, Shawn Hampton, Al Rossi, Kelvin Droegemeier
Venue: IEEE Internet Computing (2005)

Sophisticated data-distribution schemes and recent developments in sensors and instruments that can monitor the lower kilometers of the atmosphere at high levels of resolution have rapidly expanded the quantity of information available to mesoscale meteorology. The myLEAD personalized information-management tool helps geoscience users make sense of this vastly expanded information space. myLEAD extends the general Globus metadata catalog service and leverages a well-known general and extensible schema. Its orientation makes it an active player in large-scale distributed computation environments characterized by interacting grid and Web services.
Static and adaptive distributed data replication using genetic algorithms
Authors: Thanasis Loukopoulos, Ishfaq Ahmad
Venue: Journal of Parallel and Distributed Computing (2004)

Fast dissemination and access of information in large distributed systems, such as the Internet, has become a norm of our daily life. However, undesired long delays experienced by end-users, especially during the peak hours, continue to be a common problem. Replicating some of the objects at multiple sites is one possible solution in decreasing network traffic. The decision of what to replicate where, requires solving a constraint optimization problem which is NP-complete in general. Such problems are known to stretch the capacity of a Genetic Algorithm (GA) to its limits. Nevertheless, we propose a GA to solve the problem when the read/write demands remain static and experimentally prove the superior solution quality obtained compared to an intuitive greedy method. Unfortunately, the static GA approach involves high running time and may not be useful when read/write demands continuously change, as is the case with breaking news. To tackle such case we propose a hybrid GA that takes as input the current replica distribution and computes a new one using knowledge about the network attributes and the changes occurred. Keeping in view more pragmatic scenarios in today's distributed information environments, we evaluate these algorithms with respect to the storage capacity constraint of each site as well as variations in the popularity of objects, and also examine the trade-off between running time and solution quality.
Complex Neural Networks as Future Tools in Imagery Analysis
Authors: Olaf Sporns
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Brain networks are uniquely capable of generating and integrating information collected from multiple sources in real time. The application of structural and information theoretical measures to such networks has begun to unravel the crucial ingredients that ensure their rapid and robust performance. We suggest the use of information theoretical measures in applications that mimic some of these biological processing principles. We discuss candidate measures, their implementation in neural networks, their applicability to various sets of artificial and natural stimuli, and their future use in the automated analysis of aerial images.
Book review: Computer User's Dictionary by Bryan Pfaffenberger (Que Corporation, 1990)
Venue: ACM SIGSMALL/PC Notes (1991)

What does bad page break, firmware, postprocessor, read-only attribute, and Wingz have in common? They are all words found in the 488 pages of the Computer User's Dictionary.
Mobile multi-access IP: a proposal for mobile multi-access management in future wireless IP networks
Authors: Süleyman Altuntaş, Buyurman Baykal
Venue: Computer Networks and ISDN Systems (2005)

As the wireless networking technologies advance rapidly, providing mobile users with roaming freely in heterogeneous wireless access domains, the need for multi-access arises. This paper introduces the Mobile Multi-Access Management Architecture (MMA-IP) for IP-based future wireless networks. MMA-IP enables mobile users to utilize multiple access domains synchronously and to switch between different access domains. In order to handle multi-access operations, MMA-IP defines a new special mobility agent, called Multi-Access Agent (MAA). The MAA is the first point for incoming packets destined to the mobile node. Upon reception of these packets, MAA routes them via different access domains according to the mobile's preferences. MMA-IP allows mobile nodes to indicate their preferences in the form of preference messages and these preferences are stored in MAA for use in multi-access decisions. It is also noted that this concept paper intends to shed light on future improvements on IP in 4G networks.
Agile software reuse recommender
Authors: Frank McCarey, Meló Cinnéide
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
An accurate technique for measuring the wireless side of wireless networks
Authors: Jihwang Yeo, Moustafa Youssef, Tristan Henderson, Ashok Agrawala
Venue: Papers presented at the 2005 workshop on Wireless traffic measurements and modeling (2005)

Wireless monitoring (WM) is a passive approach for capturing wireless-side traffic with rich MAC/PHY layer information. WM can suffer, however, from low capture performance, i.e., high measurement loss, due to the unreliable wireless medium. In this paper, we experimentally show that WM can perform reliable and accurate measurements on wireless traffic, in actual, non-ideal channel conditions.We demonstrate how to increase capture performance by merging traces from multiple monitoring devices. This merging enables WM to capture over 99% of the IP layer traffic and over 97% of the MAC/PHY frames in a controlled experiment. Our results indicate that WM enables reliable analysis of the collected traces, and should encourage the wireless research community to use this technique for a wide variety of research areas, such as traffic analysis, user mobility and handoff analysis, and MAC/PHY anomaly detection.
Space efficient dynamic orthogonal range reporting
Authors: Yakov Nekrich
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

In this paper we present new space e cient dynamic data structures for orthogonal range reporting.The described data structures support planar range reporting queries in time O (log n +k log log(4 n/(k +1)))and space O (n log log n ), or in time O (log n+k )and space O (n log e n )for any e > 0. Both data structures can be constructed in O (n log n )time and support insert and delete operations in amortized time O (log 2 n )and O (log n log log n )respectively. These results match the corresponding upper space bounds of Chazelle [6] for the static case. We also present a dynamic data structure for d -dimensional range reporting with search time O (log d .1 n +k ),update time O (log d n ),and space O (n log d .2+e n )for any e > 0.
Three-Building and Typical City Multiple-Building Simulations
Authors: James T. Baylot, Byron J. Armstrong, Denis D. Rickman, Tommy L. Bevins
Venue: Proceedings of the 2004 Users Group Conference (2004)

This paper summarizes research conducted in FY 2004 under High Performance Computing Modernization Program (HPCMP) DoD Challenge Project C-83 "Evaluation and Retrofit for Blast Protection in Urban Terrain." The ERDC is continuing the development of improved models for predicting the blast environment for high-explosive detonations in urban terrain.This is an integrated experimental analytical program, where high performance computing (HPC) simulations are used to assist in designing experiments. The experiments are used to validate the numerical simulations, and the validated numerical simulations are used to help in understanding the phenomenology associated with blast in urban terrain. The experimentaland numerical research are used to develop engineering models that can be used to quickly predict effects of adjacent structures on the blast load on a structure of interest. The primary focus of the FY 04 research was the simulation of a blast environment for a collection of three buildings and the extension of the simulations to include a typical multi-building environment. This report summarizes the comparison of a three-building simulation with a companion experiment. Numerical simulations are then used to study the effects of five buildings and a typical city configuration of multiple buildings.
Exploiting processor groups to extend scalability of the GA shared memory programming model
Authors: Jarek Nieplocha, Manoj Krishnan, Bruce Palmer, Vinod Tipparaju, Yeliang Zhang
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Exploiting processor groups is becoming increasingly important for programming next-generation high-end systems composed of tens or hundreds of thousands of processors. This paper discusses the requirements, functionality and development of multilevel-parallelism based on processor groups in the context of the Global Array (GA) shared memory programming model. The main effort involves management of shared data, rather than interprocessor communication. Experimental results for the NAS NPB Conjugate Gradient benchmark and a molecular dynamics (MD) application are presented for a Linux cluster with Myrinet and illustrate the value of the proposed approach for improving scalability. While the original GA version of the CG benchmark lagged MPI, the processor-group version outperforms MPI in all cases, except for a few points on the smallest problem size. Similarly, processor groups were very effective in improving scalability of a Molecular Dynamics application
Efficient parallel processing of competitive learning algorithms
Authors: Kentaro Sano, Shintaro Momose, Hiroyuki Takizawa, Hiroaki Kobayashi, Tadao Nakamura
Venue: Parallel Computing (2004)

Vector quantization (VQ) is an attractive technique for lossy data compression, which has been a key technology for data storage and/or transfer. So far, various competitive learning (CL) algorithms have been proposed to design optimal codebooks presenting quantization with minimized errors. Although algorithmic improvements of these CL algorithms have achieved faster codebook design than conventional ones, limitations of speedup still exist when large data sets are processed on a single processor. Considering a variety of CL algorithms, parallel processing on flexible computing environment, like general-purpose parallel computers is in demand for a large-scale codebook design. This paper presents a formulation for efficiently parallelizing CL algorithms, suitable for distributed-memory parallel computers with a message-passing mechanism. Based on this formulation, we parallelize three CL algorithms: the Kohonen learning algorithm, the MMPDCL algorithm and the LOJ algorithm. Experimental results indicate a high scalability of the parallel algorithms on three different types of commercially available parallel computers: IBM SP2, NEC AzusA and PC cluster.
Addendum to Etude on theme of Dijkstra
Authors: S. O. Shilova, N. V. Shilov
Venue: ACM SIGACT News (2004)

After publication of our paper Etude on theme of Dijkstra in September issue of v.35 of SIGACT News [1], we had a very interesting communication with Dr. John Hershberger related to the topic of the paper. Etude was not a research paper, but presented a tutorial for undergraduate students who are engaged with programming contests (like ACM ICPC). The tutorial was a part of a special undergraduate course at Novosibirsk State University (Russia) and was based on E. Dijkstra's heuristic search solution of non-crossing matching problem on the plane.
Efficient techniques for transition testing
Authors: Xiao Liu, Michael S. Hsiao, Sreejit Chakravarty, Paul J. Thadikaran
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2005)

Scan-based transition tests are added to improve the detection of speed failures in sequential circuits. Empirical data suggests that both data volume and application time will increase dramatically for such transition testing. Techniques to address the above problem for a class of transition tests, called enhanced transition tests, are proposed in this article.The first technique, which combines the proposed transition test chains with the ATE repeat capability, reduces test data volume by 46.5&percent; when compared with transition tests computed by a commercial transition test ATPG tool. However, the test application time may sometimes increase. To address the test time issue, a new DFT technique, Exchange Scan, is proposed. Exchange scan reduces both data volume and application time by 46.5&percent;. These techniques rely on the use of hold-scan cells and highlight the effectiveness of hold-scan design to address test time and test data volume issues. In addition, we address the problem of yield loss due to incidental overtesting of functionally-untestable transition faults, and we formulate an efficient adjustment to the algorithm to keep the overtest ratio low. Our experimental results show that up to 14.5&percent; reduction in overtest ratio can be achieved, with an average overtest reduction of 4.68&percent;.
Power Conservation Schemes for Energy Efficient Data Propagation in Heterogeneous Wireless Sensor Networks
Authors: Ioannis Chatzigiannakis, Athanasios Kinalis, Sotiris Nikoletseas
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

We propose, implement and evaluate new energy conservation schemes for efficient data propagation in wireless sensor networks. Our protocols are adaptive, i.e. locally monitor the network conditions and accordingly adjust towards optimal operation choices. This dynamic feature is particularly beneficial in heterogeneous settings and in cases of re-deployment of sensor devices in the network area. We implement our protocols and evaluate their performance through a detailed simulation study using our extended version of ns-2. In particular we combine our schemes with known communication paradigms. The simulation findings demonstrate significant gains and good trade-offs in terms of delivery success, delay and energy dissipation.
Layout of Graphs with Bounded Tree-Width
Authors: Vida Dujmovic, Pat Morin, David R. Wood
Venue: SIAM Journal on Computing (2005)

A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queue-number. A three-dimensional (straight-line grid) drawing of a graph represents the vertices by points in $\mathbb{Z}^3$ and the edges by noncrossing line-segments. This paper contributes three main results:(1) It is proved that the minimum volume of a certain type of three-dimensional drawing of a graph G is closely related to the queue-number of G. In particular, if G is an n-vertex member of a proper minor-closed family of graphs (such as a planar graph), then G has a $\mathcal{O}(1) \times \mathcal{O}(1) \times \mathcal{O}(n)$ drawing if and only if G has a $\mathcal{O}(1)$ queue-number.(2) It is proved that the queue-number is bounded by the tree-width, thus resolving an open problem due to Ganley and Heath [Discrete Appl. Math., 109 (2001), pp. 215--221] and disproving a conjecture of Pemmaraju [Exploring the Powers of Stacks and Queues via Graph Layouts, Ph. D. thesis, Virginia Polytechnic Institute and State University, Blacksburg, VA, 1992]. This result provides renewed hope for the positive resolution of a number of open problems in the theory of queue layouts.(3) It is proved that graphs of bounded tree-width have three-dimensional drawings with $\mathcal{O}(n)$ volume. This is the most general family of graphs known to admit three-dimensional drawings with $\mathcal{O}(n)$ volume.The proofs depend upon our results regarding track layouts and tree-partitions of graphs, which may be of independent interest.
Design for verification for asynchronously communicating Web services
Authors: Aysu Betin-Can, Tevfik Bultan, Xiang Fu
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

We present a design for verification approach to developing reliable web services. We focus on composite web services which consist of asynchronously communicating peers. Our goal is to automatically verify properties of interactions among such peers. We propose a design pattern that eases the development of such web services and enables a modular, assume-guarantee style verification strategy. In the proposed design pattern, each peer is associated with a behavioral interface description which specifies how that peer will interact with other peers. Using these peer interfaces we automatically generate BPEL specifications to publish for interoperability. Assuming that the participating peers behave according to their interfaces, we verify safety and liveness properties about the global behavior of the composite web service during behavior verification. During interface verification, we check that each peer implementation conforms to its interface. Using the modularity in the proposed design pattern, we are able to perform the interface verification of each peer and the behavior verification as separate steps. Our experiments show that, using this modular approach, one can automatically and efficiently verify web service implementations.
On Processing and Registration of Forward-Scan Acoustic Video Imagery
Authors: S. Negahdaripour, P. Firoozfam, P. Sabzmeydani
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Producing high-resolution underwater imagery in range of visibility conditions is a capability of critical demand for a number of applications. New generation of forward-scan acoustic video cameras, becoming available for commercial applications in recent years, produce images with considerably more target details that optical systems in turbid waters. Previous computer processing of sonar imagery has dominantly involved target segmentation, classification and recognition by exploiting 2-D visual cues from texture, or object/shadow shape in a single frame. Processing of video is becoming more and more important because of various applications that involve target tracking, object identification in search and inspection, self localization and mapping, among many other applications. This paper addresses the image registration problem for acoustic video, and the pre-processing steps to be applied to the raw video from a DIDSON acoustic camera for image calibration, filtering and enhancement to achieve reliable results.
Reversible computation with quantum-dot cellular automata (QCA)
Authors: Craig S. Lent, Sarah E. Frost, Peter M. Kogge
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Quantum-dot cellular automata (QCA) is a strategy in which binary data is represented by charge configuration within a multi-dot cell. Data is transmitted to nearest neighbors by the Coulombic interaction. An electric field acts as a clock and imposes directionality on circuits. We have explored the connection between logical reversibility and physical reversibility in the context of a QCA system, explicitly calculating the energy dissipated by performing an erasure as a function of the time over which it is performed [1]. Further, we present a Bennett-style clocking scheme to implement reversible computation that is natural to the circuits to minimize the amount of information that is erased. Molecular QCA may provide a practical implementation of reversible computing
A Scalable Pricing Model for Bandwidth Allocation
Authors: Adel S. Elmaghraby, Anup Kumar, Mehmed M. Kantardzic, Mostafa Gamal Mostafa
Venue: Electronic Commerce Research (2005)

In this paper, we present a scalable pricing model for dynamic bandwidth allocation. Using simulation we demonstrate that service providers can achieve increased revenue as well as better resource utilization without compromising user specified levels of Quality of Service (QoS). Our model allows for increasing the revenue while maintaining an acceptable level of QoS, this is done by selecting an appropriate bandwidth allocation policy, to reduce the number of blocked users.