ppxscal/embedding_network huggingface dataset:
Internet technology for future space missions
Authors: James Rash, Keith Hogie, Ralph Casasanta
Venue: Computer Networks and ISDN Systems (2005)

Ongoing work at National Aeronautics and Space Administration Goddard Space Flight Center (NASA/GSFC), seeks to apply standard Internet applications and protocols to meet the technology challenge of future satellite missions. Internet protocols and technologies are under study as a future means to provide seamless dynamic communication among heterogeneous instruments, spacecraft, ground stations, constellations of spacecraft, and science investigators.The primary objective is to design and demonstrate in the laboratory the automated end-to-end transport of files in a simulated dynamic space environment using off-the-shelf, low-cost, commodity-level standard applications and protocols. The demonstrated functions and capabilities will become increasingly significant in the years to come as both earth and space science missions fly more sensors and the present labor-intensive, mission-specific techniques for processing and routing data become prohibitive.This paper describes how an IP-based communication architecture can support all existing operations concepts and how it will enable some new and complex communication and science concepts. The authors identify specific end-to-end data flows from the instruments to the control centers and scientists, and then describe how each data flow can be supported using standard Internet protocols and applications. The scenarios include normal data downlink and command uplink as well as recovery scenarios for both onboard and ground failures. The scenarios are based on an Earth orbiting spacecraft with downlink data rates from 300 kbps to 4 Mbps. Included examples are based on designs currently being investigated for potential use by the Global Precipitation Measurement (GPM) mission.
MEADOWS: modeling, emulation, and analysis of data of wireless sensor networks
Authors: Qiong Luo, Lionel M. Ni, Bingsheng He, Hejun Wu, Wenwei Xue
Venue: Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004 (2004)

In this position paper, we present MEADOWS, a software framework that we are building at HKUST for modeling, emulation, and analysis of data of wireless sensor networks. This project is motivated by the unique need of intertwining modeling, emulation, and data analysis in studying sensor databases. We describe our design of basic data analysis tools along with an initial case study on HKUST campus. We also report our progress on modeling power consumption for sensor databases and on wireless sensor network emulation for query processing. Additionally, we outline our future directions on MEADOWS for discussion and feedback at the workshop.
Adaptive Counting Networks
Authors: Srikanta Tirthapura
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Counting networks are well studied parallel and distributed data structures, which are useful in synchronization applications such as distributed counting and load balancing. However, current constructions of counting networks are static, since their width (the degree of parallelism), and hence the size of the network, have to be fixed in advance. This present an obstacle in efficiently implementing them in a large distributed system whose size may be changing, due to nodes joining and leaving the network. We present an adaptive construction of the bitonic counting network. Our network tunes its width to the system size in a distributed and local way. With high probability, the effective "width" of the network is .(N/log² N), where N is the number of nodes currently in the system, and the effective "depth" of the network is O(log² N). In contrast, a static implementation would have the same width irrespective of the system size. When the system size changes, the network adapts by splitting or merging its components. All decisions and actions are decentralized: these include the decision of when to split and merge the components, and the action of splitting and merging them. Our construction is layered on an overlay network which provides an efficient peer-to-peer lookup service, and uses the recursive structure present in the bitonic network to adapt its implementation. Though we discuss the bitonic network, our technique could be applied to build an adaptive implementation of any distributed data structure which can be decomposed in a recursive way.
Efficiently parallelizable problems on a class of decomposable graphs
Authors: Sun-Yuan Hsieh
Venue: Journal of Computer and System Sciences (2005)

In the literature, there are quite a few sequential and parallel algorithms to solve problems on decomposable graphs utilizing distinct techniques. Trees, series-parallel graphs, outerplanar graphs, and bandwidth-k graphs all belong to decomposable graphs. Let Td(|V|,|E|) and Pd (|V|,|E|) denote the time complexity and processor complexity required to construct a parse tree representation TG for a decomposable graph G = (V, E) on a PRAM model Md. We define a general problem-solving paradigm to solve a wide class of subgraph optimization problems on decomposable graphs in O(Td(|V|,|E|)+log|V(TG)|) time using O(Pd(|V|, |E|) + |V(TG)|/log|V(TG|) processors on Md. We also demonstrate the following examples fitting into our paradigm: (1) The maximum independent set problem on trees, (2) The maximum matching problem on series-parallel graphs, and (3) The efficient domination problem on series-parallel graphs. Our results improve the previously best known results of (1) and (2).
Adobe Acrobat 7.0 QuickSteps, 1 edition
Authors: Marty Matthews, Carole Boggs Matthews
Venue:  (2005)

Here is a full-color, fast reference to the most popular electronic document exchange program--Adobe Acrobat. Release 7 is a major upgrade with new features that include enhanced PDF creation, watermarks, improved collaboration functions, digital signature capability, and more. All these and more features are covered in the book. Color screenshots with callouts show and explain exactly what you'll see on your computer screen while you're doing a task. The lengthwise layout of the book provides a more open, visual display and allows the book to lie flat for easy reference. Learn to: Create, view, and edit PDFs Use distiller Create interactive forms Add links and multimedia Establish document security
Automatic Agent and Data Mining for e-Commerce
Authors: Charles C. Willow
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

One of the major problems of managing information systems for e-Commerce or m-Commerce is to estimate the memory utilization for its set of servers, among others. In particular, along with system security and fault tolerance, memory management is perhaps the most frequently observed challenge that the IS/IT manager faces on a daily basis. A framework for building an automated intelligent agent for memory management under the client-server architecture is suggested in this paper. Further, possible applications of the framework in terms of data mining are suggested.
Fault tolerant deployment and topology control in wireless ad hoc networks: Research Articles
Authors: Xiang-Yang Li, Peng-Jun Wan, Yu Wang, Chih-Wei Yi
Venue: Wireless Communications Mobile Computing (2004)

We consider a large-scale of wireless ad hoc networks whose nodes are distributed randomly in a two-dimensional region &Omega; (more specifically, a unit square). Given n wireless nodes V, each with transmission range rn, the wireless networks are often modeled by graph G (V, rn) in which two nodes are connected if and only if their Euclidean distance is no more than rn. We first consider how to relate the transmission range with the number of nodes in a fixed area such that the resulted network can sustain k fault nodes in its neighborhood with high probability when all nodes have the same transmission range. We show that, for a unit-area square region &Omega;, the probability that the network G (V, rn) is k-connected is at least ${\rm e}^{-{\rm e}^{-\alpha}}$ when the transmission radius rn satisfies $n \pi r_n^2 \ge {\rm ln}\ n \,+ (2k - 3) {\rm ln}\, {\rm ln}\, n - 2 \,{\rm ln}(k - 1)! + 2 \alpha \ {\rm for} \, k >\,1$ and n sufficiently large. This result also applies to mobile networks when the moving of wireless nodes always generates randomly distributed positions. We also conduct extensive simulations to study the practical transmission range to achieve certain probability the network being k-connectivity, when the number of nodes n is not large enough. The relation between the minimum node degree and the connectivity of graph G (V, r) is also studied. Setting the transmission range of all nodes to rn guarantees the k-connectivity with high probability, but some nodes may have excessive number of neighbours in the graph G (V, rn). We then present a localized method to construct a subgraph of the network topology G (V, rn) such that the resulting subgraph is still k-connected but with much fewer communication links maintained. We show that the constructed topology has only O (k&thinsp;&middot;&thinsp;n) links and is a length spanner. Here a graph H&thinsp;&sube;&thinsp;G is spanner for graph G, if for any two nodes, the length of the shortest path connecting them in H is no more than a small constant factor of the length of the shortest path connecting them in G. Finally, we conduct some simulations to study the practical transmission range to achieve certain probability of k-connected when n is not large enough. Copyright &copy; 2004 John Wiley & Sons, Ltd.
One evaluation of model-based testing and its automation
Authors: A. Pretschner, W. Prenninger, S. Wagner, C. Kühnel, M. Baumgartner, B. Sostawa, R. Zölch, T. Stauner
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Model-based testing relies on behavior models for the generation of model traces: input and expected output---test cases---for an implementation. We use the case study of an automotive network controller to assess different test suites in terms of error detection, model coverage, and implementation coverage. Some of these suites were generated automatically with and without models, purely at random, and with dedicated functional test selection criteria. Other suites were derived manually, with and without the model at hand. Both automatically and manually derived model-based test suites detected significantly more requirements errors than hand-crafted test suites that were directly derived from the requirements. The number of detected programming errors did not depend on the use of models. Automatically generated model-based test suites detected as many errors as hand-crafted model-based suites with the same number of tests. A sixfold increase in the number of model-based tests led to an 11% increase in detected errors.
Prototype of Fault Adaptive Embedded Software for Large-Scale Real-Time Systems
Authors: Derek Messie, Mina Jung, Jae C. Oh, Shweta Shetty, Steven Nordstrom, Michael Haney
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

This paper describes a comprehensive prototype of large-scale fault adaptive embedded software developed for the proposed Fermilab BTeV high energy physics experiment. Lightweight self-optimizing agents embedded within Level 1 of the prototype are responsible for proactive and reactive monitoring and mitigation based on specified layers of competence. The agents are self-protecting, detecting cascading failures using a distributed approach. Adaptive, reconfigurable, and mobile objects for reliablility are designed to be self-configuring to adapt automatically to dynamically changing environments. These objects provide a self-healing layer with the ability to discover, diagnose, and react to discontinuities in real-time processing. A generic modeling environment was developed to facilitate design and implementation of hardware resource specifications, application data flow, and failure mitigation strategies. Level 1 of the planned BTeV trigger system alone will consist of 2500 DSPs, so the number of components and intractable fault scenarios involved make it impossible to design an ýexpert systemý that applies traditional centralized mitigative strategies based on rules capturing every possible system state. Instead, a distributed reactive approach is implemented using the tools and methodologies developed by theReal-Time Embedded Systems group.
Rewriting systems and the modelling of biological systems: Conference Reviews
Authors: Jean-Louis Giavitto, Grant Malcolm, Olivier Michel
Venue: Comparative and Functional Genomics (2004)

This paper gives a brief survey of the use of algebraic rewriting systems for modelling and simulating various biological processes, particularly at the cellular level. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Development and implementation of a parallel algorithm for the fast design of oligonucleotide probe sets for diagnostic DNA microarrays: Research Articles
Authors: H. Meier, A. Krause, M. Kräutner, A. Bode
Venue: Concurrency and Computation: Practice Experience (2004)

We describe an accurate method for the automatic parallel generation of oligonucleotide probe sets for DNA microarrays. This approach includes a component for high-performance specificity evaluation of designed probes in large data sets. The three main algorithmic components of the method, namely probe preselection, hybridization prediction and probe selection are explained in detail. We introduce new combinatorial techniques for the efficient selection of probe sets of high differentiation capability even from sequence databases of conserved homologous genes. These techniques include the automatic generation of group specific probes as well as the design of excluding probes. A basic prototype has been implemented including a shared memory parallelization. Test runs have been performed on a multiprocessor personal computer with subsets of a small subunit ribosomal ribonucleic acid database, containing very conserved sequence data. The applicability of our program is pointed out by designing a set of oligonucleotide probes that shall allow a comprehensive parallel identification and differentiation of several groups of extremophilic prokaryotes by DNA microarray. The probe set is accessible via the Internet. On applying the parallel version on a dual processor system an efficiency of 80&percnt; was achieved. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Inexact Matrix-Vector Products in Krylov Methods for Solving Linear Systems: A Relaxation Strategy
Authors: Amina Bouras, Valérie Frayssé
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

Embedded iterative linear solvers are being used more and more often in linear algebra. An important issue is how to tune the level of accuracy of the inner solver to guarantee the convergence of the outer solver at the best global cost. As a first step towards the challenging goal of controlling embedded linear solvers, inexact Krylov methods are used as a model of inner-outer iterations with external Krylov scheme. This paper experimentally shows that Krylov methods for solving linear systems can still perform very well in the presence of carefully monitored inexact matrix-vector products. This surprising behavior of inexact Krylov methods, as opposed to Newton-like methods, is investigated in detail, and potentially important applications are mentioned. A new relaxation strategy for the inner accuracy is proposed for Krylov methods with inexact matrix-vector products; its efficiency is supported by a wide range of numerical experiments on different algorithms and contrasted against other potential approaches.
Managing server energy and operational costs in hosting centers
Authors: Yiyu Chen, Amitayu Das, Wubi Qin, Anand Sivasubramaniam, Qian Wang, Natarajan Gautam
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

The growing cost of tuning and managing computer systems is leading to out-sourcing of commercial services to hosting centers. These centers provision thousands of dense servers within a relatively small real-estate in order to host the applications/services of different customers who may have been assured by a service-level agreement (SLA). Power consumption of these servers is becoming a serious concern in the design and operation of the hosting centers. The effects of high power consumption manifest not only in the costs spent in designing effective cooling systems to ward off the generated heat, but in the cost of electricity consumption itself. It is crucial to deploy power management strategies in these hosting centers to lower these costs towards enhancing profitability. At the same time, techniques for power management that include shutting down these servers and/or modulating their operational speed, can impact the ability of the hosting center to meet SLAs. In addition, repeated on-off cycles can increase the wear-and-tear of server components, incurring costs for their procurement and replacement. This paper presents a formalism to this problem, and proposes three new online solution strategies based on steady state queuing analysis, feedback control theory, and a hybrid mechanism borrowing ideas from these two. Using real web server traces, we show that these solutions are more adaptive to workload behavior when performing server provisioning and speed control than earlier heuristics towards minimizing operational costs while meeting the SLAs.
A Game-Theoretic Analysis on the Conditions of Cooperation in a Wireless Ad Hoc Network
Authors: Seema Bandyopadhyay, Subhajyoti Bandyopadhyay
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

To enable proper functioning of wireless ad hoc networks, all nodes in the network are expected to cooperate in forwarding each otherýs packet. But relaying other nodesý packets involves spending energy without getting any immediate revenue. Hence, due to the constraints on available energy the nodes usually have in such networks, from an individual nodeýs point of view, the best response is always not to cooperate. We model this problem as a repeated game and show analytically that given a suitable punishment mechanism, individual nodes can be deterred from their selfish behavior, and cooperation can emerge as the best response. We also show that generosity by other nodes cannot be part of a credible deterrent mechanism.
The Lisp Machine manual
Authors: Daniel Weinreb, David Moon
Venue: Issue 78 (October 1981) (1981)

This 471-page, softcover manual describes the programming language and software environment of the Lisp Machine developed at M.I.T.'s Artificial Intelligence Laboratory over the past 8 years. The Lisp Machine is the result of a successful experiment in computer science: a distributed computing system consisting of a network of powerful 32-bit personal computers, implemented with custom hardware and software as complete, interactive graphical workstations. Each machine consists of a 32-bit computer with 64 megabytes of virtual memory, 1 to 16 megabytes of main memory, 80 megabytes (or larger) disk, 800x900 graphics display (color optional), mouse, keyboard, speaker and 4 million bit/second local network interface, which allows connections to other Lisp Machines, primers and file servers.
Using potential energy to measure work related activities for persons wearing upper limb prostheses
Authors: Nancy Black, Edmund N. Biden, Jeremy Rickards
Venue: Robotica (2005)

This study presents a novel means of assessing upper limb tasks by using mechanical energy. Potential energy quantifies six work related activities, studied for 20 working-age non-prosthesis users and three powered below elbow prosthesis users. Two marker trajectories on each of the upper arms, forearms, and hands were captured using a 3-camera VICON 140&trade; system. Task and arm dominance of non-prosthesis users are highly significant ($p\,{<}\,0.01$) with arm dominance effects being more pronounced for prosthesis users. Qualitative inter-repetition consistency is also concordant with observed increased cumulative trauma disorders among prosthesis users.
Attractors for partly dissipative lattice dynamic systems in l2×l2
Authors: Xiaojun Li, Chengkui Zhong
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper, we study the asymptotic behavior of solutions for the partly dissipative lattice dynamical systems in l2 × l2. We prove the asymptotic compactness of the solutions and then establish the existence of the global attractor in l2 × l2. The upper semicontinuity of the global attractor is also considered by finite-dimensional approximations of attractors for the lattice systems.
A computer screen-based simulator for hierarchical fuzzy logic monitoring and control of depth of anaesthesia
Authors: J. S. Shieh, D. A. Linkens, J. E. Peacock
Venue: Mathematics and Computers in Simulation (2004)

A computer screen-based simulator has been developed to simulate the administration of intravenous and analgesic drugs. It merges on-line measurements (such as systolic arterial pressure (SAP) and heart rate (HR)) and nonnumerical clinical signs (such as sweating, lacrimation and pupil response), using anaesthetists' experience or self-organizing fuzzy logic control (SOFLC) algorithms to administer drugs into a patient. The hierarchical control architecture includes five parts, which are: monitoring depth of anaesthesia (DOA), drug controller, deciding the sensitivity of the patient, narcotic supplementation and recovery time. It has been developed to predict drug profiles, control the drug levels and assess recovery time during anaesthesia. Meanwhile, linguistic rules and fuzzy set theory have been used to model a patient's SAP and HR during induction and maintenance stages. Successful simulation results have given confidence to perform on-line clinical trials in operating theatre.
Longest paths and cycles in faulty star graphs
Authors: Jung-Heum Park, Hee-Chul Kim
Venue: Journal of Parallel and Distributed Computing (2004)

In this paper, we investigate the star graph S"n with faulty vertices and/or edges from the graph theoretic point of view. We show that between every pair of vertices with different colors in a bicoloring of S"n, n>=4, there is a fault-free path of length at least n!-2f"v-1, and there is a path of length at least n!-2f"v-2 joining a pair of vertices with the same color, when the number of faulty elements is n-3 or less. Here, f"v is the number of faulty vertices. S"n, n>=4, with at most n-2 faulty elements has a fault-free cycle of length at least n!-2f"v unless the number of faulty elements are n-2 and all the faulty elements are edges incident to a common vertex. It is also shown that S"n, n>=4, is strongly hamiltonian-laceable if the number of faulty elements is n-3 or less and the number of faulty vertices is one or less.