ppxscal/embedding_network huggingface dataset:
Sustaining cooperation in multi-hop wireless networks
Authors: Ratul Mahajan, Maya Rodrig, David Wetherall, John Zahorjan
Venue: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2 (2005)

Multi-hop wireless networks are vulnerable to free-riders because they require nodes to forward packets for each other. Deployed routing protocols ignore this issue while proposed solutions incorporate complicated mechanisms with the intent of making free-riding impossible. We present Catch, a protocol that falls between these extremes. It achieves nearly the low mechanism requirements of the former while imposing nearly as effective barriers to free-riding as the latter. Catch is made possible by novel techniques based on anonymous messages. These techniques enable cooperative nodes to detect nearby free-riders and disconnect them from the rest of the network. Catch has low overhead and is broadly applicable across routing protocols and traffic workloads. We evaluate it on an 802.11 wireless testbed as well as through simulation.
An Optimized Grid-Based, OGC Standards-Compliant Collaborative Software System for Serving NASA Geospatial Data
Authors: Aijun Chen, Liping Di, Yaxing Wei, Yuqi Bai, Yang Liu
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

It is now common for academic institutes, government sectors and commercial corporations all over the world to engage in collaborative, complex applications. Most of them require international and interoperable access to large quantities of distributed, heterogeneous geospatial data, services, computing abilities and other facilities. The Open Grid Services Architecture (OGSA) implemented through the Globus Toolkit, provides an applicable and convenient software infrastructure for securely sharing computational resources within a Virtual Organization. In this paper, based on the Globus Toolkit, we propose an open, reusable, optimized, standards-compliant, and Grid-enabled geospatial software system for archiving, managing, querying and serving NASA earth observing system data. We apply Grid technologies to OGC Web services to make them Grid-enabled and deploy them into the system. These services can be invoked either by OGC users or by Grid users in the Grid environment. Any OGSA-compliant Grid services can be deployed into the system, and can invoke or be invoked by our or other Grid services in our Virtual Organization to securely access each other's data and other computational resources after we authorize access. A Catalogue Service Federation (CSF) with an OGC standard interface is developed to interact with other Grid or non-Grid geospatial catalogue services for querying and serving much more geospatial data. An intelligent Grid Service Mediator (iGSM) and Replica Optimization Service (ROS), both of which are Grid services, are proposed to distribute and optimize user requests for data and services in the system. All of the Grid-enabled geospatial services can be reused to construct more complex and functional services by forming a service-chain.
An iterative method for designing orthogonal two-channel FIR filter banks with regularities
Authors: R. Bregovic
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

An efficient iterative method is described for designing orthogonal two-channel perfect-reconstruction FIR filter banks in such a way that the low-pass analysis filter has the given number of fixed zeros at z=-1 and its energy in the given stopband region is minimized. When using the resulting two-channel filter bank for generating discrete-time wavelet banks, the number of vanishing moments is equal to the number of zeros being located at z=-1. The proposed design scheme is fast and the convergence to the optimum solution is independent of the starting-point filter bank. Compared to the two-channel filter bank equivalents designed in the minimax sense as proposed by Rioul and Duhamel (1994), the regularities of the resulting wavelets are increased and the stopband energies of the subfilters are decreased. If there are no constraints on the number of zeros at z=-1, then the resulting banks are useful building blocks in generating frequency-selective multi-channel filter banks and octave filter banks.
Mobile Agent and Web Service Integration Security Architecture
Authors: Junqi Zhang, Yan Wang, Vijay Varadharajan
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Mobile agent technology and Web Service technology compensate each other and play very important roles in eservice applications. The mechanism of Web Services technology naturally provides a platform for deploying mobile agent technology. Therefore, the integration of the mobile agent technology and Web Service technology has been actively investigated in recent years. On the other hand, the security issues of the integration system have not drawn much attention. In this paper, we present a new security architecture for the integration of mobile agent and theWeb Services technology. This architecture provides a new authentication scheme for Web service provider to verify the mobile agent owner's identity by employing an identity-based signature protocol without using the username/password pair, which is infeasible for mobile agent. We also propose a new Web services and mobile agent system confidentiality protocol, which provides an alternative method to current security mechanisms without using Certification Authorities (CA) based public key infrastructure. With this scheme, it can simplify the key management and reduce the computation load particularly for group-oriented web services. In addition, this scheme also inherently has the non-repudiation property.
Automatic target recognition using modularly cascaded vector quantizers and multilayer perceptrons
Authors: L. A. Chan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

An automatic target recognition classifier is constructed of a set of vector quantizers (VQs) and multilayer perceptrons (MLPs) that are modularly cascaded. A dedicated VQ codebook is constructed for each target at a specific range of aspects. Each codebook is a set of block feature templates that are iteratively adapted to represent a particular target at a specific range of aspects. These templates are further trained by a modified learning vector quantization (LVQ) algorithm that enhances their discriminatory power. The mean squared errors resulting from matching the input image with the block templates in each each codebook are input to an array of window MLPs (WMLPs). Each WMLP is trained to recognize its intended-target at a specific range of aspects. The outputs of the WMLPs are manipulated and fed into a target MLP (TMLP) that produces the final recognition results. A recognition rate of 65.3 percent is achieved on a highly cluttered test set.
Incremental Mining of Sequential Patterns over a Stream Sliding Window
Authors: Chin-Chuan Ho, Hua-Fu Li, Fang-Fei Kuo, Suh-Yin Lee
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Incremental mining of sequential patterns from data streams is one of the most challenging problems in mining data streams. However, previous work of mining sequential patterns from data streams is almost focused on mining of patterns from stream of item-sequences, not stream of itemset-sequences. In this paper, we propose an efficient single-pass algorithm, called IncSPAM, to maintain the set of sequential patterns from itemset-sequence streams with a transaction-sensitive sliding window. An effective bit-sequence representation of items is used in the proposed algorithm to reduce the time and memory needed to slide the windows. Experiments show that the proposed IncSPAM algorithm is efficient for mining sequential patterns over data streams.
Volume Rendering Phenotype Differences in Mouse Placenta Microscopy Data
Authors: Richard P. Sharp, Randall Ridgway, Kishore Mosaliganti, Pamela Wenzel, Tony Pan, Alain de Bruin, Raghu Machiraju, Kun Huang, Gustavo Leone, Joel H. Saltz
Venue: Computing in Science and Engineering (2007)

The authors examine phenotype differences in wildtype and retinoblastoma (Rb) knockout specimens of mouse placenta. Their method for volume visualization of tissue-level intermixing at a microscopic scale reveals differences between the specimens that aren't obvious in a stack of 2D images alone.
ADLS: Attack Detection for Wireless Localization Using Least Squares
Authors: Yingying Chen, Wade Trappe, Richard P. Martin
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Obtaining accurate positions of wireless devices is critical for location-dependent services. However, as more location-based services are deployed, the more tempting the localization service is as a target for malicious attacks. In this work, we propose an Attack Detection scheme using Least Squares (ADLS) for localization in wireless networks. ADLS is based on statistical significance testing. We provide both a theoretical formulation and analytic solution for our ADLS scheme. We further conducted a trace-driven evaluation by applying signal strength attacks to real data collected in an office building. Our experimental study provides strong evidence for the effectiveness of ADLS with high detection rates and low false positive rates.
Hidden productivity losses in computer systems
Authors: Yu. S. Yakovlev
Venue: Cybernetics and Systems Analysis (2007)

Based on an analysis of procedures of access to memory cells of computers and distributed computer systems (CSs), an estimate is given for time expenditures for address formation that do not belong to the category of direct expenditures for information processing in a processor and, hence, fall into the category of expenditures determining "hidden productivity losses" in a CS. Recommendations on the elimination of such losses during the creation of a CS are given.
Towards a semantic-aware file store
Authors: Zhichen Xu, Magnus Karlsson, Chunqiang Tang, Christos Karamanolis
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

Traditional hierarchical namespaces are not sufficient for representing and managing the rich semantics of today's storage systems. In this paper, we discuss the principles of semantic-aware file stores. We identify the requirements of applications and end-users and propose to use a generic data model to capture and represent file semantics. A distinct challenge that we face is to handle dynamic evolution of the data schemas. Further, we outline a framework of basic relations and tools for generating and using semantic metadata. The proposed data model and framework are aimed to be more generic and flexible than what is offered by existing semantic file systems. We envision a range of applications and tools that will exploit semantic information, ranging from personal storage systems with features for advanced searching and roaming access, to enterprise systems supporting distributed data location or archiving.
Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree and Grid Topologies
Authors: Yoram Revah, Michael Segal
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

We address the problem of gathering information in sensor webs consisting of sensors nodes, where in a round of communication sensor nodes have messages to be sent to a distant central node (called the base station) over shortest path. There is a wide range of data gathering applications like: target and hazard detection, environmental monitoring, battlefield surveillance, etc. Consequently, efficient data collection solutions are needed to improve the performance of the network. In this paper, we take into account the fact that interference can occurs at the reception of a message at the receiver sensor. In order to save redundant retransmissions and energy, we assume a known distribution of sources (each node wants to transmit at most one packet) and one common destination. We provide a number of scheduling algorithms jointly minimizing both the completion time and the average packet delivery time. We define our network model using directional antennas and consider Ring, Tree, and Grid Network (and its generality) topologies. All our algorithms run in low-polynomial time.
A framework for managing and enforcing security policies in service-oriented systems
Authors: Stephen S. Yau
Venue:  (2006)

A major advantage of the emerging service-oriented computing technology is its ability to enable rapid formation of large-scale distributed systems by composing massively available services to achieve the system goals, regardless of the programming languages and platforms used to develop and run these services. For these systems which often involve interactions among multiple organizations over various networks, how to manage and enforce security policies is the prime concern in assuring that only authorized users or systems have the access to massively available services. However, with the increasing scalability and flexibility required by the dynamic service-oriented computing environments, manage and enforce security policies in such systems is a very challenging task. Existing research efforts have not sufficiently addressed this challenging task for enabling systematic security policy management and enforcement in service-oriented systems. In this dissertation research, a framework based on formal foundations is developed for dynamically, yet systematically, managing and enforcing security policies in service-oriented systems. This framework includes a security policy meta-model and a runtime security policy execution model for security decision making and enforcement. The security policy meta-model will be used to provide unambiguous security policy specifications and to facilitate sound and complete security policy reasoning, such as consistency checking, redundancy analysis, security policy specification composition, and automated security service synthesis from declarative security policy specifications. Analysis of expressiveness of this security policy meta-model is also provided in this dissertation. The runtime security policy execution model is developed for enforcing the security policies with provable correctness. This framework will also include tools for generating and deploying security services to compute and enforce security decisions based on security policies, credentials and situational information. With this framework, various parties of large-scale service-oriented systems can easily manage and enforce security policies to meet their security requirements under various situations. Examples are provided to show the effectiveness of the framework.
Occlusion culling for stereoscopic display of complex mechanical sets
Authors: I. Mansa, A. Amundarain, A. Garcia-Alonso, L. Matey
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper explores the benefits that can be achieved for stereoscopic visualization when using occlusion culling strategies. The virtual environments analysed in this paper are complex mechanical sets that are not densely occluded. Those which are built up by dense geometric sets like aerospace engines composed of thousands of components and millions of polygons. The algorithm uses occlusion queries and succeeds in improving the frame rate of the stereoscopic visualization with an effective scheduling of the queries. Different coherences, including stereo coherence, are used to achieve this effective scheduling. An aggressive approach has been also validated for inclusion in the proposal. The occlusion culling algorithm can be easily implemented and provides a significant boost in performances.
Integrating laboratory and computer exercises into electric power engineering education
Authors: J. W. Cote
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The electrical engineering (EE) department at the University of Alaska Fairbanks (UAF) has always been committed to providing a laboratory or hands-on intensive curriculum in addition to the theory. However, the electric power industry now relies heavily on computer based simulation, analysis, and design tools. The well-rounded engineering graduate needs to be prepared for this type of work environment. The electric power option at UAF has developed a curriculum which begins with a strong laboratory experience. Successive exercises then transition into computer based simulation, analysis, and design.
Understanding Parallel Repetition Requires Understanding Foams
Authors: Uriel Feige, Guy Kindler, Ryan O'Donnell
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

Motivated by the study of Parallel Repetition and also by the Unique Games Conjecture, we investigate the value of the "Odd Cycle Games" under parallel repetition. Using tools from discrete harmonic analysis, we show that after d rounds on the cycle of length m, the value of the game is at most 1 - (1/m) \cdot \Omega(\sqrt d) (for d \leqslant m^2, say). This beats the natural barrier of 1 - \Theta (1/m)^2 \cdot d for Raz-style proofs [31, 21] (see [11]) and also the SDP bound of Feige-Lovasz [14, 17]; however, it just barely fails to have implications for Unique Games. On the other hand, we also show that improving our bound would require proving nontrivial lower bounds on the surface area of high-dimensional foams. Specifically, one would need to answer: What is the least surface area of a cell that tiles \mathbb{R}^d by the lattice \mathbb{Z}^{d}?
Inference of Gene Regulatory Networks from Time Series Expression Data: A Data Mining Approach
Authors: Patrick C. H. Ma, Keith C. C. Chan
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The developments in large-scale monitoring of gene expression have made the reconstruction of gene regulatory networks (GRNs) feasible. Before one can infer the overall structures of GRNs, it is important to identify, for each gene in a network, which other genes can affect its expression and how they can affect it. Many existing methods to reconstructing GRNs are developed to generate hypotheses about the presence or absence of interactions between genes so that laboratory experiments can be performed afterwards for verification. Since, they are not intended to be used to predict if a gene has any interactions with other genes from an unseen sample. This makes statistical verification of the reliability of the discovered interactions difficult. In addition, some of them cannot make use of the temporal evidence in the data and also cannot take into account the directionality of regulation. For these reasons, we propose an effective data mining approach in this paper. For performance evaluation, it has been tested using real expression data. Experimental results show that it can be effective. The sequential associations discovered can reveal known gene regulatory relationships that could be used to infer the structures of GRNs.
Calliope: a distributed, scalable multimedia server
Authors: Andrew Heybey, Mark Sullivan, Paul England
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

Calliope is a distributed multimedia server constructed from personal computers. Preliminary performance measurements indicate that Calliope can be scaled from a single PC producing about 22 MPEG-1 video streams to hundreds of PCs producing thousands of streams. The system can store both variable-and constant-rate video and audio encodings and can deliver them over any network supported by the underlying operating system. Calliope is cost-effective because it requires only commodity hardware and portable because it runs under Unix.
Load Redistribution in Heterogeneous Systems
Authors: Tomas Koutny, Jiri Safarik
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Today, a number of distributed schedulers exist, but they are centralized or they are too complex and thus require collecting of an important amount of knowledge. In this paper, we present a decentralized method for load distribution, which uses algorithm with modest complexity. In addition, it takes into account the heterogeneity of deployed hardware.
Supporting truly object-oriented debugging of C++ programs
Authors: James O. Coplien
Venue: Proceedings of the 6th conference on USENIX Sixth C++ Technical Conference - Volume 6 (1994)

Most debuggers do not support an object-oriented debugging model. A debugger should be able to provide the view that each object is an independent entity with its own breakpoint behavior. We also would like the debugger to plant a breakpoint on the "right" member function when a polymorphic identifier is involved. The technology used in most C++ implementations does not support these features as well as the rich run-time environments commonly provided for symbolic languages. This paper introduces the need for such constructs, and presents algorithms that can be used to implement them in the framework of common symbolic debuggers.
Efficient trust management policy analysis from rules
Authors: Katia Hristova, K. Tuncay Tekle, Yanhong A. Liu
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

This paper describes a systematic method for deriving efficient algorithms and precise time complexities from extended Datalog rules as it is applied to the analysis of trust management policies specified in SPKI/SDSI, a well-known trust management framework designed to facilitate the development of secure and scalable distributed computing systems. The approach of expressing policy analysis problems as extended Datalog rules is much simpler than previous techniques for analysis of SPKI/SDSI policies. Our method also derives better, more precise time complexities than before in addition to generating complete algorithms and data structures. The method is general, with many applications beyond policy analysis. It extends our previous method for Datalog to handle list constructors, external functions, and queries.
Software radio - architectural requirements, research and development challenges
Authors: Z. Salcic, C. F. Mecklenbrauker
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Software radio becomes one of the central themes of wireless communications this decade. As the complexity of computations and system requirements of the software radio go beyond the capabilities of current technologies, we identify major technology, development and research issues and the possible approach to its gradual implementation. We present our approach to the software radio implementation and describe a scenario for experimenting with various concepts that will be integrated in software radio. We discuss underlying system architectures, system design tools and their hierarchy, design flow and describe the platform and design flow used in our experiments.
Chaotic attractors with symmetries of the triangle groups
Authors: Rui-song Ye
Venue: Proceedings of the Computer Graphics International 2005 (2005)

The chaotic attractors with symmetries of the triangle groups are visualized in the hyperbolic plane. Using probabilistic iterated function systems that involve both affine transformations of the plane and isometries of triangle groups, we can create intriguing and exotic attractor's images. The derived images are of self-similarity and of infinitely fine structure; they contain symmetries associated with the triangle groups as well. The method provides a novel approach for devising tiling patterns with symmetries.