ppxscal/embedding_network huggingface dataset:
Measuring Network Parameters with Hardware Support
Authors: Kanchan Devarakonda, Sotirios G. Ziavras, Roberto Rojas-Cessa
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

To provide good QoS in a computer network, robust means to measure essential network parameters are required. A multitude of options are available to perform this task. This report details our hardware implementation of three such schemes on FPGAs (Field-Programmable Gate Arrays). The first scheme calculates the packet loss and one-way network delay using RTP over UDP; the second one uses the concept of TOPPs (Train of Packet Pairs) to measure the available bandwidth, and the third one is a partial implementation of TCP, which can be developed further to measure various parameters. Our analysis shows that these implementations can carry out efficient parameter measurements at reasonable hardware cost. In addition, experiments are used to compare three hashing schemes for storing TCP tuple information; real benchmarks are used.
A Particle Swarm Optimization Algorithm for Neighbor Selection in Peer-to-Peer Networks
Authors: Shichang Sun, Ajith Abraham, Guiyong Zhang, Hongbo Liu
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we propose a Particle Swarm Optimization (PSO) approach to the problem of Neighbor Selection (NS) in P2P Networks. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The results indicate that PSO usually required shorter time to obtain better results than Genetic Algorithm (GA), specially for large scale problems.
Conceptual Modeling of Temporal Clinical Workflows
Authors: Carlo Combi, Matteo Gozzi, Jose M. Juarez, Barbara Oliboni, Giuseppe Pozzi
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

The diffusion of clinical guidelines to describe the proper way to deal with patients' situations is spreading out and opens new issues in the context of modeling and managing (temporal) information about medical activities. Guidelines can be seen as processes describing the sequence of activities to be executed, and thus approaches proposed in the business context can be used to model them. In this paper, we propose a general conceptual workflow model, considering both activities and their temporal properties, and focus on the representation of clinical guidelines by the proposed model.
Local reasoning about storable locks
Authors: Josh Berdine
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

This talk will present a resource-oriented program logic that is able to reason about concurrent heap-manipulating programs with unbounded numbers of dynamically-allocated locks, and note an extension to storable threads. The logic is inspired by concurrent separation logic, but handles these more realistic concurrency primitives. We demonstrate that the proposed logic allows for local reasoning about programs that exhibit a high degree of information hiding in their locking mechanisms. Soundness is proved using a novel thread-local fixed-point semantics.
Allocation of Parallel Programs with Time Variant Resource Requirements
Authors: John D. Evans, Robert R. Kessler
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

This paper presents an innovative allocation strategy for parallel programs composed of communicating processes whose resource requirements vary during program execution. The primary difference between this and previous work is the incorporation into the allocation process of the estimation of variation in resource requirements over time. Experimental results are presented that compare this model with previous work and indicate that this method achieves superior allocation results without any increase in computational complexity. Results indicate a high correlation between the improvement achieved and the degree of process clustering in the parallel program.
Applying Anticipated Vertical Handover (AVHO) in Next Generation Networks
Authors: Nadine Akkari, Samir Tohme, Mahmoud Doughan
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

This paper describes an anticipated mobility between the two access technologies WLAN and UMTS considered as complementary technologies for next generation networks integration. We propose to apply Anticipated Vertical Handover (AVHO) in the integration of the third generation wireless communication (3G) from one side and WLAN 802.11 from the other side. The proposed AVHO offers mobile users, roaming in next generation networks, fast handover based on a pre-network selection such as the "make-before-break" approach used in fast MIP handovers. AVHO is adopted in the context of WLAN to UMTS handovers and vice versa to ensure service continuity with minimum HO latency and packet loss.
Crossing Boundaries: A Case Study of Employee Blogging
Authors: Lilia Efimova, Jonathan Grudin
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Editors, email, and instant messaging were first widely used by students who later brought knowledge of their uses and effective practices into workplaces. Weblogs may make such a transition more quickly. We present a study of emergent blogging practices in a corporate setting. We attended meetings, read email, documents, and weblogs, and interviewed 38 people- bloggers, infrastructure administrators, attorneys, public relations specialists, and executives. We found an experimental, rapidly-evolving terrain marked by growing sophistication about balancing personal, team, and corporate incentives and issues.
XIR: cache invalidation strategy for xml data in mobile environments
Authors: Jae-Ho Choi, Sang-Hyun Park, Myong-Soo Lee, Yon Dohn Chung, SangKeun Lee
Venue: Proceedings of the 6th ACM international workshop on Data engineering for wireless and mobile access (2007)

As eXtensible Markup Language becomes ubiquitous, XML transmission efficiency has been emerged as an important issue. The research area of XML is currently expanding into wireless environments, however, most previous works for XML broadcasting in wireless environments have not considered updating data. In this paper, we concern XML data update in wireless broadcast environments. We propose a cache invalidation strategy based on an invalidation report for XML data in wireless environments. Using our strategy, we can use the portion of cached XML data which updates only structural information. Simulations are carried out to evaluate the proposed methodology. Compared to the previous invalidation report based strategy, our strategy can reduce tuning time and increase cache hit ratio.
Search engine ranking efficiency evaluation tool
Authors: Wadee S. Alhalabi, Miroslav Kubat, Moiez Tapia
Venue: ACM SIGCSE Bulletin (2007)

In view of the recent progress in the field of internet search engines, there is a growing need for mechanisms to evaluate the performance of these useful and popular tools. So far, the vast majority of researchers have relied on the information-retrieval metrics of "precision" and "recall" that quantify the occurrence of "hits" and "misses" in the returned list of documents. What they fail to do is to measure the quality of the ranking that the search engine has provided. This paper wants to rectify the situation. We discuss the issue in some detail, and then propose a new mechanism that we believe is better suited for our needs.
Minimizing Eavesdropping Risk by Transmission Power Control in Multihop Wireless Networks
Authors: Jung-Chun Kao, Radu Marculescu
Venue: IEEE Transactions on Computers (2007)

To defend against reconnaissance activity in ad hoc wireless networks, we propose transmission power control as an effective mechanism for minimizing the eavesdropping risk. Our main contributions are given as follows. First, we cast the wth-order eavesdropping risk as the maximum probability of packets being eavesdropped when there are w adversarial nodes in the network. Second, we derive the closed-form solution of the first-order eavesdropping risk as a polynomial function of the normalized transmission radius. This derivation assumes a uniform distribution of user nodes. Then, we generalize the model to allow arbitrary user nodes distribution and prove that the uniform user distribution minimizes the first-order eavesdropping risk. This result plays an essential role in deriving analytical bounds for the eavesdropping risk given arbitrary user distributions. Our simulation results show that, for a wide range of nonuniform traffic patterns, the difference in their eavesdropping risk values from the corresponding lower bounds is 3 dB or less.
Generating american sign language classifier predicates for english-to-asl machine translation
Authors: Mitch Marcus, Martha Palmer
Venue:  (2006)

A majority of deaf 18-year-olds in the United States have an English reading level below that of a typical 10-year-old student, and so machine translation (MT) software that could translate English text into American Sign Language (ASL) animations could significantly improve these individuals' access to information, communication, and services. Previous English-to-ASL MT projects have made limited progress by restricting their output to subsets of ASL phenomena---thus avoiding important linguistic and animation issues. None of these systems have shown how to generate classifier predicates (CPs), a phenomenon in which signers use special hand movements to indicate the location and movement of invisible objects (representing entities under discussion) in space around their bodies. CPs are frequent in ASL and are necessary for conveying many concepts. This project has created an English-to-ASL MT design capable of producing classifier predicates. The classifier predicate generator inside this design has a planning-based architecture that uses a 3D "visualization" model of the arrangement of objects in a scene discussed by the English input text. This generator would be one pathway in a multi-path English-to-ASL MT design; a separate processing pathway would be used to generate classifier predicates, to generate other ASL sentences, and to generate animations of Signed English (if the system lacked lexical resources for some input). Instead of representing the ASL animation as a string (of individual signs to perform), this system encodes the multimodal language signal as multiple channels that are hierarchically structured and coordinated over time. While this design feature and others have been prompted by the unique requirements of generating a sign language, these technologies have applications for the machine translation of written languages, the representation of other multimodal language signals, and the production of meaningful gestures by other animated virtual human characters. To evaluate the functionality and scalability of the most novel portion of this English-to-ASL MT design, this project has implemented a prototype-version of the planning-based classifier predicate generator. The classifier predicate animations produced by the system have been shown to native ASL signers to evaluate the output.
Fast speaker adaptation of large vocabulary continuous density HMM speech recognizer using a basis transform approach
Authors: C. Boulis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Maximum likelihood transformation-adaptation techniques have proven successful, but it is believed that faster convergence to speaker dependent (SD) performance can be achieved if we incorporate some form of a-priori knowledge in the adaptation process. In this paper, instead of estimating one linear transform per class of models for each new speaker, we transform the speaker-independent (SI) models using multiple linear transforms and a weight vector. To reduce the number of adaptation parameters, the multiple linear transforms are generated from training speakers and the adaptation parameters consist of a single weight vector per class. This can be seen as incorporating a-priori knowledge to our estimation process. Experiments conducted on the Spoken Language Translator database in the Swedish language using SRI's DECIPHER/sup TM/ system, show that the new method outperforms maximum likelihood linear regression on very limited adaptation data.
A Framework for Dependence Based Optimization and Parallelization of Practical DO Loops
Authors: Venkata Konda, Anup Kumar
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

In this paper, we present a unified and systematic framework for the complete and efficient parallelization of a practical DO loop model. Specifically we discuss haw and in what order different transformations such as scalar expansion, array expansion, forward substitution, loop peeling, other cycle removal transformations, and various reduction recognition techniques can be integrated into a systematic framework and develop efficient algorithms for the maximal application of loop distribution. Based on the dependence concept, the framework presented optimizes the loop itself by eliminating the redundant loop nests as well as redundant code, which cannot be done by the classical data-flow analysis, thus improving the performance of the loop even on a scalar machine. The algorithms presented can also be used for the detection of induction, wraparound, flip-flop, periodic and non-linear induction variables.
How I Spent My Summer Vacation
Authors: Jim Miller
Venue: IEEE Internet Computing (2007)

Finding Internet connectivity while traveling worldwide isn't as hard as you might think but it does come with its own set of challenges.
Query-based watermarking for XML data
Authors: Xuan Zhou, HweeHwa Pang, Kian-Lee Tan
Venue: Proceedings of the 2nd ACM symposium on Information, computer and communications security (2007)

As increasing amount of XML data is exchanged over the internet, copyright protection of this type of data is becoming an important requirement for many applications. In this paper, we introduce a rights protection scheme for XML data based on digital watermarking. One of the main challenges for watermarking XML data is that the data could be easily reorganized by an adversary in an attempt to destroy any embedded watermark. To overcome it, we propose a query-based watermarking scheme, which creates queries to identify available watermarking capacity, such that watermarks could be recovered from reorganized data through query rewriting. The identifier queries are tied closely to the usability of the data, and are highly resilient to reorganization and alteration attacks. In addition, our scheme considers data semantics to avoid vulnerabilities caused by redundancy, while taking advantage of the available watermark capacity. Based on this scheme, we have designed and implemented a watermarking solution for XML, and experimentally verified the effectiveness of the solution and its potential for real world applications.
CoRaL--Policy Language and Reasoning Techniques for Spectrum Policies
Authors: Daniel Elenius, Grit Denker, Mark-Oliver Stehr, Rukman Senanayake, Carolyn Talcott, David Wilkins
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

We present the Cognitive Radio (Policy) Language (CoRaL), a new language for expressing policies that govern the behavior of cognitive radios that opportunistically share spectrum. A Policy Reasoner validates radio transmissions to ensure that they are compliant with the spectrum policies. The Policy Reasoner also discovers spectrum sharing opportunities by deriving what requirements must be fulfilled for transmissions to be valid, i.e., in compliance with policies. A novel mix of reasoning techniques is required to implement such a reasoner.
Identity Management
Authors: Craig W. Thompson, Dale R. Thompson
Venue: IEEE Internet Computing (2007)

The Identity Solutions Symposium held in Jonesboro, Arkansas, 21 to 22 February, 2007 brought together academic, industry, and government experts working on radio frequency identification (RFID), biometrics, sensors, animal identification, identity cards, RFID-enabled passports, identity theft, terrorism, retail and healthcare supply chains, demographics, privacy, security, middleware, and legislation. Here, we explore some of the issues from the symposium.
Streetscenes: towards scene understanding in still images
Authors: Tomaso A. Poggio
Venue:  (2006)

This thesis describes an effort to construct a scene understanding system that is able to analyze the content of real images. While constructing the system we had to provide solutions to many of the fundamental questions that every student of object recognition deals with daily. These include the choice of data set, the choice of success measurement, the representation of the image content, the selection of inference engine, and the representation of the relations between objects. The main test-bed for our system is the CBCL StreetScenes data base. It is a carefully labeled set of images, much larger than any similar data set available at the time it was collected. Each image in this data set was labeled for 9 common classes such as cars, pedestrians, roads and trees. Our system represents each image using a set of features that are based on a model of the human visual system constructed in our lab. We demonstrate that this biologically motivated image representation, along with its extensions, constitutes an effective representation for object detection, facilitating unprecedented levels of detection accuracy. Similarly to biological vision systems, our system uses hierarchical representations. We therefore explore the possible ways of combining information across the hierarchy into the final perception. Our system is trained using standard machine learning machinery, which was first applied to computer vision in earlier work of Prof. Poggio and others. We demonstrate how the same standard methods can be used to model relations between objects in images as well, capturing context information. The resulting system detects and localizes, using a unified set of tools and image representations, compact objects such as cars, amorphous objects such as trees and roads, and the relations between objects within the scene. The same representation also excels in identifying objects in clutter without scanning the image. Much of the work presented in the thesis was devoted to a rigorous comparison of our system to alternative object recognition systems. The results of these experiments support the effectiveness of simple feed-forward systems for the basic tasks involved in scene understanding. We make our results fully available to the public by publishing our code and data sets in hope that others may improve and extend our results. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Robust image registration for fusion
Authors: Markus Müller, Wolfgang Krüger, Günter Saur
Venue: Information Fusion (2007)

Fusion can be seen as the process of forming a uniform description of multiple information sources. The type of description depends on the application domain as well as the type of features to be considered. Features (also known as ''descriptors'') relate to iconic, symbolic, semantic or pragmatic aspects of some physical phenomenology of the real world. The process of feature extraction results in a feature map and can be top-down or bottom-up or a hybrid mixture of both. In the next step the correspondence problem (matching) of multiple feature maps has to be solved. This paper concentrates on symbolic feature extraction of straight line segments forming the feature map and their robust and precise matching with other feature maps. Together with extensions concerning point-like features these approaches form the basis of many real-time capable applications. Three of them will be described: image-to-image registration, automatic geocoding, and change detection for industrial inspection and quality assurance.
Multiresolution using principal component analysis
Authors: V. Brennan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper proposes principal component analysis (PCA) to find adaptive bases for multiresolution. An input image is decomposed into components (compressed images) which are uncorrelated and have maximum l/sub 2/ energy. With only minor modification, a single layer linear network using the generalized Hebbian algorithm (GHA) is used for multiresolution PCA. The decomposition has been successfully applied to face classification. Good results with biological signals have also been reported.
Checklists for grading object-oriented CS1 programs: concepts and misconceptions
Authors: Kate Sanders, Lynda Thomas
Venue: ACM SIGCSE Bulletin (2007)

In this paper, we begin by considering object-oriented programming concepts and typical novice misconceptions as identified in the literature. We then present the results of a close examination of student programs, in an objects-first CS1 course, in which we find concrete evidence of students learning these concepts while also displaying some of these misconceptions. This leads to the development of two checklists that educators can use when designing or grading student programs.
A Comparison of Optimized Link State Routing with Traditional Routing Protocols in Marine Wireless Ad-hoc and Sensor Networks
Authors: Pore Ghee Lye, John C. McEachen
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The performance of mobile ad-hoc networks (MANET) is related to the efficiency of the routing protocols in adapting to frequently changing network topology and link status. This paper addresses the issue by comparing the relative performance of three key ad-hoc routing protocols: Destination-sequenced Distance Vector (DSDV), Ad-hoc On-demand Distance Vector (AODV) and Optimized Link State Routing (OLSR). The protocols are tested based on two scenarios, namely, tactical networks for ships and sensor-based network nodes. Four performance metrics were measured by varying the maximum speed of mobile hosts, network size and traffic load, to assess the routing capability and protocol efficiency. The simulation results indicate that AODV performs better than OSLR and DSDV in the first scenario. Although OLSR also performed relatively well, the associated high routing overhead is the dominant reason for not choosing it. On the other hand, OLSR emerged as the protocol of choice for sensor networks, where the high routing overhead is counteracted by consistently better performance in all other metrics. Due to the slow evolution of the sensor network topology, OLSR performed satisfactorily for best effort traffic but needed subtle adjustments to balance between latency and bandwidth to meet the requirements of delay-sensitive applications.