ppxscal/embedding_network huggingface dataset:
Hybrid routing and bridging strategies for large scale mobile ad hoc networks
Authors: Symeon Papavassiliou
Venue:  (2004)

Multi-hop packet radio networks (or mobile ad-hoc networks) are an ideal technology to establish &ldquo;instant&rdquo; communication infrastructure for military and civilian applications in which both hosts and routers are mobile. In this dissertation, a position-based/link-state hybrid, proactive routing protocol (Position-guided Sliding-window Routing&mdash;PSR) that provides for a flat, mobile ad-hoc routing architecture is described, analyzed and evaluated. PSR is based on the superposition of link-state and position-based routing, and it employs a simplified way of localizing routing overhead, without having to resort to complex, multiple-tier routing organization schemes. A set of geographic routing zones is defined for each node, where the purpose of the ith routing zone is to restrict propagation of position updates, advertising position differentials equal to the radius of the (i-1)th routing zone. Thus, the proposed protocol controls position-update overhead generation and propagation by making the overhead generation rate and propagation distance directly proportional to the amount of change in a node's geographic position. An analytical model and framework is provided, in order to study the various design issues and trade-offs of PSR routing mechanism, discuss their impact on the protocol's operation and effectiveness, and identify optimal values for critical design parameters, under different mobility scenarios. In addition an in-depth performance evaluation, via modeling and simulation, was performed in order to demonstrate PSR's operational effectiveness in terms of scalability, mobility support, and efficiency. Furthermore, power and energy metrics, such as path fading and battery capacity considerations, are integrated into the routing decision (cost function) in order to improve PSR's power efficiency and network lifetime. It is demonstrated that the proposed routing protocol is ideal for deployment and implementation especially in large scale mobile ad hoc networks. Wireless local area networks (WLAN) are being deployed widely to support networking needs of both consumer and enterprise applications, and IEEE 802.11 specification is becoming the de facto standard for deploying WLAN. However IEEE 802.11 specifications allow only one hop communication between nodes. A layer-2 bridging solution is proposed in this dissertation, to increase the range of 802.11 base stations using ad hoc networking, and therefore solve the hotspot communication problem, where a large number of mobile users require Internet access through an access point. (Abstract shortened by UMI.)
Intuitive Annotation of User-Viewed Objects forWearable AR Systems
Authors: Ryuhei TENMOKU, Masayuki KANBARA, Naokazu YOKOYA
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

By realizing augmented reality on wearable computers, it is possible to overlay annotations on the real world based on the user's current position and orientation. However, it is dif?cult for the user to understand links between annotations and real objects intuitively when the scene is complicated or many annotations are overlaid at the same time. This paper describes a view management method which emphasizes user-viewed real objects and their annotations using 3D models of the real scene. The proposed method highlights the objects viewed by the user. In addition, when the viewed object is occluded by other real objects, the object is complemented by using a synthetic image, which is made from 3D models, on the overlaid image.
Is My Software "Good Enough" to Release? - A Probabilistic Assessment
Authors: Susan K. Donohue, Joanne Bechta Dugan, Charles L. Brown
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

We present the basics of a probabilistic methodology to assess the overall quality of software preparatory to its release through the evaluation of process and product evidence, the 'Good Enough' to Release" (GETR) Methodology, in this paper. GETR Methodology has three main elements: a model whose elements represent activities and artifacts identified in the literature as being effective assessors of software quality, a process for populating certain parts of the model, and methods for analyzing the importance of contributions made by individual evidence to the determination of overall system quality. First, the methodology's components are briefly introduced. A demonstration of how the methodology can be applied is then given through two case studies reviewing release assessments for inhouse developed analytical tools. The robustness of the model is also illustrated by the results of the case studies.
Analysis of Alternating-Priority Queueing Models with (Cross) Correlated Switchover Times
Authors: Robin Groenevelt, Eitan Altman
Venue: Queueing Systems: Theory and Applications (2005)

This paper analyzes a single server queueing system in which service is alternated between two queues and the server requires a (finite) switchover time to switch from one queue to the other. The distinction from classical results is that the sequence of switchover times from each of the queues need not be i.i.d. nor independent from each other; each sequence is merely required to form a stationary ergodic sequence. With the help of stochastic recursive equations explicit expressions are derived for a number of performance measures, most notably for the average delay of a customer and the average queue lengths under different service disciplines. With these expressions a comparison is made between the service disciplines and the influence of correlation is studied. Finally, through a number of examples it is shown that the correlation can significantly increase the mean delay and the average queue lengths indicating that the correlation between switchover times should not be ignored. This has important implications for communication systems in which a common communication channel is shared amongst various users and where the time between consecutive data transfers is correlated (for example in ad-hoc networks). In addition to this a number of notational mistakes in well-known existing literature are pointed out.
The monitoring and early detection of internet worms
Authors: Cliff C. Zou, Weibo Gong, Don Towsley, Lixin Gao
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

After many Internet-scale worm incidents in recent years, it is clear that a simple self-propagating worm can quickly spread across the Internet and cause severe damage to our society. Facing this great security threat, we need to build an early detection system that can detect the presence of a worm in the Internet as quickly as possible in order to give people accurate early warning information and possible reaction time for counteractions. This paper first presents an Internet worm monitoring system. Then, based on the idea of "detecting the trend, not the burst" of monitored illegitimate traffic, we present a "trend detection" methodology to detect a worm at its early propagation stage by using Kalman filter estimation, which is robust to background noise in the monitored data. In addition, for uniform-scan worms such as Code Red, we can effectively predict the overall vulnerable population size, and estimate accurately how many computers are really infected in the global Internet based on the biased monitored data. For monitoring a nonuniform scan worm, especially a sequential-scan worm such as Blaster, we show that it is crucial for the address space covered by the worm monitoring system to be as distributed as possible.
Scheduling communication in multithreaded programs: experimental results: Research Articles
Authors: Juan Carlos Gomez, Vernon Rego, V. S. Sunderam
Venue: Concurrency and Computation: Practice Experience (2006)

When the critical path of a communication session between end points includes the actions of operating system kernels, there are attendant overheads. Along with other factors, such as functionality and flexibility, such overheads motivate and favor the implementation of communication protocols in user space. When implemented with threads, such protocols may hold the key to optimal communication performance and functionality. Based on implementations of reliable user-space protocols supported by a threads framework, we focus on our experiences with internal threads' scheduling techniques and their potential impact on performance. We present scheduling strategies that enable threads to do both application-level and communication-related processing. With experiments performed on a Sun SPARC-5 LAN environment, we show how different scheduling strategies yield different levels of application-processing efficiency, communication latency and packet-loss. This work forms part of a larger study on the implementation of multiple thread-based protocols in a single address space, and the benefits of coupling protocols with applications. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Preventing Deadlock with Dynamic Message Scheduling
Authors: Ernesto Gomez, Yasha Karant, Keith Schubert
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Although deadlock is not completely avoidable in distributed and parallel programming, we here describe theory and practice of a system that allows us to limit deadlock to situations in which there are true circular data dependences or failure of processes that compute data needed at other processes. This allows us to guarantee absence of deadlock in SPMD computations absent process failure. Our system guarantees optimal ordering of communication statements. We gratefully acknowledge the support of the US National Science Foundation under Award CISE EIA 9810708 without which this work would not have been possible.
On the flexibility of WS-agreement for job submission
Authors: Rizos Sakellariou, Viktor Yarmolenko
Venue: Proceedings of the 3rd international workshop on Middleware for grid computing (2005)

This paper considers extensions to the WS-Agreement specification, namely the Guarantee Terms of WS-Agreement [1]. Experiences and conclusions drawn are in the context of Agreement-based job management systems. A key idea of these extensions is the use of functions for the Guarantee Terms of the Agreement rather than constant values or ranges. Functions may contain variables defined in a particular agreement or be drawn from the known set of reference variables, such as wall-clock time, job start time, etc. We show that such an approach can potentially reduce the negotiation overheads associated with job renegotiation and/or reduce the number of failed agreements.
Eliminating Inter-Thread Interference in Register File for SMT Processors
Authors: Hua Yang, Gang Cui, Xiaozong Yang
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

For simultaneous multithreaded (SMT) processors, a large rename register file (RRF) is indispensable for holding intermediate results of in-flight instructions from multiple threads. Meanwhile, inter-thread interferences lower the efficiency of RRF badly, exacerbating the pressure on RRF design. We propose Thread-Sensitive Register Renaming (TSRR), which tracks the performance variations and dynamically tunes the amount of rename registers available to each thread. In contrast to the traditional fullyshared RRF, this partly-shared scheme of TSRR guarantees (1) each thread has opportunities to fully exhibit its performance potential, (2) each thread can occupy just a reasonable number of rename registers, eliminating harmful inter-thread conflicts, and (3) the poorest-performance thread neither hinder other threads nor starve itself.
Computing and our relationship to work
Authors: Joel W. Goldstein
Venue: ACM SIGSOC Bulletin (1975)

Surveys of public attitudes toward computers suggest that, for most people, most of the time, the machines are not seen as having great importance in their lines. Yet there are developments occurring which may produce profound effects with important social consequences. It is now recognized that the automobile allowed and accelerated the development of specialized institutions, and changed residential patterns which, in turn, changed the nature and function of the family. An examination of the history of the automobile reveals that these important but indirect effects were not even hinted at (Flink, 1970). It is now time to see if it is possible to understand and anticipate the potential human impact of computation.
Interview with Dana Plautz
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2006)

In our first issue of 2006, the Interviews column features video interviews with two of our distinguished advisory board members, Dr. Nicholas Negroponte and Ms. Dana Plautz. Ms. Dana Plautz, formerly at Intel Research, is the Studio Director at Second Story Interactive. I conducted a video interview with Dana on November 24, 2005, at the Digital Hollywood conference in Los Angeles, California. In the video interview, you will hear Dana's answers to the following questions: 1. You are the chairperson of the Art and Entertainment Research Council at the Intel Corporation. How has Intel been promoting art and entertainment research? 2. Can you give us some examples of art research versus entertainment research? 3. What are the most effective ways to bridge the gap between academic research and industrial product development? 4. Can you share with us some of the exciting projects at the Intel Multimedia Lab? 5. As a result of the R D spending by Intel and other technology companies, how do you see the future of entertainment?
Edge-Directions of Standard Polyhedra with Applications to Network Flows
Authors: Shmuel Onn, Uriel G. Rothblum, Yoav Tangir
Venue: Journal of Global Optimization (2005)

Recent results show that edge-directions of polyhedra play an important role in (combinatorial) optimization; in particular, a d-dimensional polyhedron with |D| distinct edge-directions has at most O(|D|d-1) vertices. Here, we obtain a characterization of the directions of edges that are adjacent to a given vertex of a standard polyhedron of the form P = {x : Ax = b, l¿ x¿ u, tightening a standard necessary condition which asserts that such directions must be minimal support solutions of the homogenous equation Ax = 0 which are feasible at the given vertex. We specialize the characterization for polyhedra that correspond to network flows, obtaining a graph characterization of circuits which correspond to edge-directions. Applications to partitioning polyhedra are discussed.
CLUGO: A Clustering Algorithm for Automated Functional Annotations Based on Gene Ontology
Authors: In-Yee Lee, Jan-Ming Ho, Ming-Syan Chen
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

We address the issue of providing highly informative and comprehensive annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a set of candidate terms for inferring target properties is collected and form a unique distribution on the GO directed acyclic graph (DAG). We propose a novel ontology-based clustering algorithm — CLUGO, which considers GO hierarchical characteristics and the clustering of term distributions. By identifying significant groups in the distributions, CLUGO assigns comprehensive and correct annotations for a target. According to the results of experiments with automated sequence functional annotations, CLUGO represents a considerable improvement over our previous work — GOMIT in terms of recall while maintaining a similar level of precision. We conclude that given a GO candidate term distribution, CLUGO is an efficient ontology-based clustering algorithm for selecting comprehensive and correct annotations.
Novel BCD Adders and Their Reversible Logic Implementation for IEEE 754r Format
Authors: Himanshu Thapliyal, Saurabh Kotiyal, M. B. Srinivas
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

IEEE 754r is the ongoing revision to the IEEE 754 floating point standard and a major enhancement to the standard is the addition of decimal format. This paper proposes two novel BCD adders called carry skip and carry look-ahead BCD adders respectively. Furthermore, in the recent years, reversible logic has emerged as a promising technology having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. It is not possible to realize quantum computing without reversible logic. Thus, this paper also paper provides the reversible logic implementation of the conventional BCD adder as the well as the proposed Carry Skip BCD adder using a recently proposed TSG gate. Furthermore, a new reversible gate called TS-3 is also being proposed and it has been shown that the proposed reversible logic implementation of the BCD Adders is much better compared to recently proposed one, in terms of number of reversible gates used and garbage outputs produced. The reversible BCD circuits designed and proposed here form the basis of the decimal ALU of a primitive quantum CPU.
Using Predictive Adaptive Parallelism to Address Portability and Irregularity
Authors: David L. Wangerin, Isaac D. Scherson
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

A semi-dynamic system is presented that is capable of predicting the performance of parallel programs at runtime. The functionality given by the system allows for ef- ficient handling of portability and irregularity of parallel programs. Two forms of parallelism are addressed: loop level parallelism and task level parallelism.
An Adaptive On-Line HW/SW Partitioning for Soft Real Time Reconfigurable Systems
Authors: Ghaffari Fakhreddine, Michel Auguin, Abid Mohamed, Benjemaa Maher
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

We present here a new HW/SW partitioning approach. This partitioning method is called an On- line Partitioning Algorithm (0.P.A) which consists to adapt dynamically the architecture to the processing requirements. A scheduling heuristic is associated to this partitioning approach. We compare our method with an 08-line static HW/SW partitioning approach.
On the Distribution of Sequential Jobs in Random Brokering for Heterogeneous Computational Grids
Authors: Vandy Berten, Joel Goossens, Emmanuel Jeannot
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Scheduling stochastic workloads is a difficult task. In order to design efficient scheduling algorithms for such workloads, it is required to have a good in-depth knowledge of basic random scheduling strategies. This paper analyzes the distribution of sequential jobs and the system behavior in heterogeneous computational grid environments where the brokering is done in such a way that each computing element has a probability to be chosen proportional to its number of CPUs and (new from the previous paper) its relative speed. We provide the asymptotic behavior for several metrics (queue sizes, slowdowns, etc.) or, in some cases, an approximation of this behavior. We study these metrics for a variety of workload configurations (load, distribution, etc.). We compare our probabilistic analysis to simulations in order to validate our results. These results provide a good understanding of the system behavior for each metric proposed. This will enable us to design advanced and efficient algorithms for more complex cases.
Pragmatic Consistency Management in Industrial Requirements Specifications
Authors: Jan Scheffczyk, Uwe M. Borghoff, Andreas Birk, Johannes Siedersleben
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Industrial requirements specifications suffer from consistency problems, particularly in multi-angular or temporal relationships between different specification results. Current consistency management tools generate too many repairs, lack support for temporal relationships, and are poorly integrated into development processes. In this paper we evaluate our consistency management method on how it improves quality of industrial specifications: We formalize (temporal) consistency rules and generate a few domainspecific repairs for inconsistencies. We demonstrate our method using an example specification. Since the effort for formalization is tunable to specific applications and our prototype shows satisfactory performance, we are confident that our contributions scale to an industrial setting.
Improving the prediction of the clinical outcome of breast cancer using evolutionary algorithms
Authors: M. Wahde, Z. Szallasi
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

There exist several methods for binary classification of gene expression data sets. However, in the majority of published methods, little effort has been made to minimize classifier complexity. In view of the small number of samples available in most gene expression data sets, there is a strong motivation for minimizing the number of free parameters that must be fitted to the data. In this paper, a method is introduced for evolving (using an evolutionary algorithm) simple classifiers involving a minimal subset of the available genes. The classifiers obtained by this method perform well, reaching 97% correct classification of clinical outcome on training samples from the breast cancer data set published by van't Veer, and up to 89% correct classification on validation samples from the same data set, easily outperforming previously published results.
Tracking Camouflaged Objects with Weighted Region Consolidation
Authors: Zhuan Qing Huang, Zhuhan Jiang
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

We propose an iterative method of Weighted Region Consolidation to track a camouflaged object within a background of very close colour in an image sequence, where the colours for both the object and the background are unsteady with large noises. More precisely, we will first detect the object motion based on both spatial and intensity densities by locating pixels with high motion probabilities from the difference data of successive frames. We then enhance the moving object iteratively, i.e. to consolidate the object region, by evaluating for each pixel its weighted overall neighbourhood intensity based on the pixel distances and intensity. The contour of the object's moving area is then constructed, with an additional iterative process to refine the contour of the object in the current frame. We also propose to further refine the object contour, if needed, by the consideration of the neighbourhood intensities and shape similarity, the propagation of the initial contour, as well as the incorporation with other scattered and sketchy object boundaries obtained by another modified weight-based method applied on the edge map. Our proposed tracking scheme should be able to be eventually applied to monitoring the behavior of camouflaged wild life for their protection.