ppxscal/embedding_network huggingface dataset:
Scaling an optimistic parallel simulation of large-scale interconnection networks
Authors: Nilesh Choudhury, Yogesh Mehta, Terry L. Wilmarth, Eric J. Bohm, Laxmikant V. Kalé
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Parallel computers today are designed with larger number of processors than ever before, connected by large scale Interconnection Networks. Communication is the key to achieving high performance on such machines, making the study of Interconnection Networks important. Parallel simulations of Interconnection Networks present a unique problem characterized by fine-grained computation and strong dependence among events. The absence of large lookaheads makes it unsuitable to use a conservative simulation. Using an optimistic Parallel Discrete Event Simulation allows us to extract reasonable parallelism from this simulation. In this paper we present BigNetSim, an Interconnection Network simulator. We analyze its performance and present techniques related to enhancing performance and scaling it to a large number of processors on different artificial traffic patterns and real application logs. Inspite of the overheads of a parallel optimistic simulation, we have achieved a breakeven with sequential simulation at four processors and demonstrate perfect scaling to 128 processors.
Soups 2006
Authors: Janice Y. Tsai, Serge Egelman
Venue: IEEE Security and Privacy (2006)

A report of the second annual Symposium on Usable Privacy and Security (SOUPS 2006) held at Carnegie Mellon University (CMU) 12-14 July 2006.
Perspectives for cryptographic long-term security
Authors: Johannes Buchmann, Alexander May, Ulrich Vollmer
Venue: Communications of the ACM (2006)

Cryptographic long-term security is needed, but difficult to achieve. Use flexible cryptographic tools, and have replacements ready.
When Fisher meets Fukunaga-Koontz: A New Look at Linear Discriminants
Authors: Sheng Zhang, Terence Sim
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

The Fisher Linear Discriminant (FLD) is commonly used in pattern recognition. It finds a linear subspace that maximally separates class patterns according to Fisher's Criterion. Several methods of computing the FLD have been proposed in the literature, most of which require the calculation of the so-called scatter matrices. In this paper, we bring a fresh perspective to FLD via the Fukunaga-Koontz Transform (FKT). We do this by decomposing the whole data space into four subspaces, and show where Fisher's Criterion is maximally satisfied. We prove the relationship between FLD and FKT analytically, and propose a method of computing the most discriminative subspace. This method is based on the QR decomposition, which works even when the scatter matrices are singular, or too large to be formed. Our method is general and may be applied to different pattern recognition problems. We validate our method by experimenting on synthetic and real data.
A Type System for the Relational Calculus of Object Systems
Authors: Liang Zhao, Xiangpeng Zhao, Quan Long, Zongyan Qiu
Venue: Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems (2006)

Being a successful technique in software practice, Object Orientation (OO) is a hot topic in academic research fields. Among many formalisms, rCOS, a refinement calculus of object-oriented systems based on Unifying Theories of Programming (UTP), has been proven a promising one in the sense of its applications to incremental software constructions, the formal use of UML, etc. However, equipped with a semantics reasoning on both static and dynamic properties, rCOS is not designed for static checking. We believe introducing static checking will extend the power of rCOS. In this paper, we develop a type system for rCOS and prove some type safety theorems. To make the theoretical results of this paper convincible and easy to be understood, we follow the traditional approaches of type systems construction. That is, we use an operational semantics as the basic explanation of rCOS language in spite of the fact that rCOS is originally developed in a denotational framework.
WSMOViz: An Ontology Visualization Approach for WSMO
Authors: Mick Kerrigan
Venue: Proceedings of the conference on Information Visualization (2006)

The Web Service Modeling Ontology (WSMO) is a conceptual model for creating semantic descriptions that can be used to resolve interoperability issues between web services. These descriptions can be used to dynamically discover, compose, mediate, select and invoke web services. Tool support for WSMO is in its infancy and there is a need for tools that support the creation of WSMO descriptions and provide value added features to the users of such tools by exposing the complexities that exist within these descriptions. This paper introduces WSMOViz, an integrated ontology engineering and ontology visualization tool for WSMO, supporting the user through the ontology engineering process.
Impact of radio propagation models in vehicular ad hoc networks simulations
Authors: Dominique Dhoutaut, Anthony Régis, François Spies
Venue: Proceedings of the 3rd international workshop on Vehicular ad hoc networks (2006)

Vehicular ad hoc networks use new protocols to enable security, services and other inventive applications to be run onboard many types of vehicles. In their design phase, those protocols and applications need to be extensively simulated but most of the work in the simulator field concentrates on the medium access and higher layer protocols. In this paper, through real world experimentations we first characterize the behavior of the channel regarding losses, we deduce a set of properties needed for lightweight models still producing relevant results. Then we implement them in a model we called shadowing-pattern which we finally use in a VANET distinctive scenario where it considerably modifies the results of a data propagation application.
Micro to Macro Game Theory in a Multi-Agent System
Authors: Michael Harre
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Recently there has been interest in the study of Multi- Agent Systems where these systems can be described using the principles of game-theory. In particular the Minority Game has been used to study the relationship between trading behaviour and volatility of financial markets while micro-economic games have been studied in order to understand how agents adapt to each others behaviour at the level of agent-agent interactions. This paper introduces a model which enables the numerical study of the collective adaptation of agents when a parameter \phi is adjusted, varying the relative contribution of local and global interactions to the adaptive dynamics of the agents. The model also allows for the variation in a memory parameter which attenuates an agents history. It is demonstrated that for two different types of local interaction between the agents, co-operative and non-co-operative, there are significant memory dependent differences in the volatility of the system.
Audiovisual Gestalts
Authors: Gianluca Monaci, Pierre Vandergheynst
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper presents an algorithm to correlate audio and visual data generated by the same physical phenomenon. According to psychophysical experiments, temporal synchrony strongly contributes to integrate cross-modal information in humans. Thus, we define meaningful audiovisual structures as temporally proximal audio-video events. Audio and video signals are represented as sparse decompositions over redundant dictionaries of functions. In this way, it is possible to define perceptually meaningful audiovisual events. The detection of these cross-modal structures is done using a simple rule called Helmholtz principle. Experimental results show that extracting significant synchronous audiovisual events, we can detect the existing cross-modal correlation between those signals even in presence of distracting motion and acoustic noise. These results confirm that temporal proximity between audiovisual events is a key ingredient for the integration of information across modalities and that it can be effectively exploited for the design of multi-modal analysis algorithms.
On Mining Micro-array data by Order-Preserving Submatrix
Authors: Lin Cheung, Kevin Y. Yip, David W. Cheung, Ben Kao, Michael K. Ng
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

We study the problem of pattern-based subspace clustering. Unlike traditional clustering methods that focus on grouping objects with similar values on a set of dimensions, clustering by pattern similarity finds objects that exhibit a coherent pattern of rises and falls in subspaces. Applications of pattern-based subspace clustering include DNA micro-array data analysis, automatic recommendation systems and target marketing systems. Our goal is to devise pattern-based clustering methods that are capable of (1) discovering useful patterns of various shapes, and (2) discovering all significant patterns. We argue that previous solutions in pattern-based subspace clustering do not satisfy both requirements. Our approach is to extend the idea of Order-Preserving Submatrix (or OPSM). We devise a novel algorithm for mining OPSM, show that OPSM can be generalized to cover most existing pattern-based clustering models, and propose a number of extension to the original OPSM model.
Secure Web Service Discovery: Overcoming Challenges of Ubiquitous Computing
Authors: Slim Trabelsi, Jean-Christphe Pazzaglia, Yves Roudier
Venue: Proceedings of the European Conference on Web Services (2006)

Dynamic and self-organizing systems like those found in ubiquitous computing or semantic web based scenarios raise numerous challenges regarding trust and privacy. Service discovery is a basic feature of SOA deployment in such systems, given that entities need to locate services they can describe but that they do not necessarily know. PKI based solutions to securing this mechanism, which require a preliminary key distribution, are therefore rendered awkward and contrived. In contrast, the new concept of Attribute Based Encryption, derived from Identity Based Encryption schemes, makes it possible to create secret communication channels with unknown services based solely on some attributes that are part of their description and in a decentralized fashion, that is, without the introduction of any additional trusted third party like a registry. This paper discusses how such a scalable solution to enabling secure and decentralized discovery protocols can be implemented and put to use. After reviewing the security properties that are expected, the paper then goes on to detail how to extend the WS-Discovery Web Service protocol with such mechanisms. Preliminary experimental results based on an implementation of this extended protocol are finally presented.
A real-time panoramic vision system for autonomous navigation
Authors: Sumantra Dasgupta, Amarnath Banerjee
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The paper discusses a panoramic vision system for autonomous navigation purposes. It describes a method for integrating data in real-time from multiple camera sources. The views from adjacent cameras are visualized together as a panorama of the scene using a modified correlation based stitching algorithm. A separate operator is presented with a particular slice of the panorama matching the user's viewing direction. Additionally, a simulated environment is created where the operator can choose to augment the video by simultaneously viewing an artificial 3D view of the scene. Potential applications of this system include enhancing quality and range of visual cues, navigation under hostile circumstances where direct view of the environment is not possible or desirable.
Supervision of adaptive fuzzy controllers for manufacturing systems
Authors: Karim Tamani, Georges Habchi, Reda Boukezzoula
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The control of manufacturing systems is a problem due to its complexity and conflicting goals within the different production objective. In this article, in order to cope with some of these difficulties, we introduce a two-level fuzzy logicbased control structure, allowing the division of the complex control problem into elementary production modules. The proposed approach is characterized by two hierarchical levels. On the lower level of the hierarchy, each production module is designed as an adaptive fuzzy controller which acts independently from the others to regulate the flow of the material into a system, and on the upper level, a supervisor adjusts the parameters of the sub-controllers in order to improve the overall performance and restrict the system to the admissible domain. This leads to hierarchical and distributed control structure.
Classification of Normal, Benign and Malignant Tissues Using Co-occurrence Matrix and Bayesian Neural Network in Mammographic Images
Authors: Leonardo de O. Martins, Alcione M. dos Santos, Aristofanes C. Silva, Anselmo C. Paiva
Venue: Proceedings of the Ninth Brazilian Symposium on Neural Networks (2006)

This work analyzes the application of the co-occurrence matrix to the characterization of breast tissue as normal, benign or malignant in mammographic images. The method characterization is based on a process that selects, using forward selection technique, from all computed measures which best discriminate among normal, benign and malignant tissues. Then, a Bayesian neural network is used to evaluate the ability of these features to predict the classification for each tissue sample. To verify this application we also describe tests that were carried out using a set of 218 tissues samples, 68 benign and 51 malignant and 99 normals. The result analysis has given an accuracy of 86.84%, which means encouraging results. The preliminary results of this approach are very promising in characterizing breast tissue.
Internet-Based Collaborative Virtual Simulations with Area of Interest Management
Authors: A. Diabi, S. Shirmohammadi, A. Gillmore, P. Lacombe, J. C. de Oliveira
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

IP multicast is typically used to support message transmission among entities in collaborative virtual simulations running on Intranets, specially military training simulations. But, IP Multicast is mostly not available on the Internet. Alternatively, researches have in recent years proposed the use of Application Layer Multicasting techniques (ALM) to alleviate this problem and to allow a somewhat scalable message passing among peers in a group of users on the Internet. As the number of users grows in the session, efficient handling of resources and scalable communication between users becomes critical due to network traffic and computation required to track all objects. The solution typically used is to partition the virtual simulation into a number of areas, and to manage each area separately. This is known as Area of Interest Management (AoIM). In this paper, we propose a peer-to-peer communication architecture for collaborative simulations along with a suitable AoIM solution. Our architecture uses both proxies and endsystems to provide a number of communication services suitable for Intranet, Internet, and hybrid-based collaborative virtual simulations.
The 3-Wide-Diameter of the Hyper-L Triple-Loop Network
Authors: Hsun-Wen Chang, San-Yu Chen
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

The wide-diameter of a network has been considered as an important measurement of faulttolerance. The bwide-diameter of a network is dejined as the minimum length I such that, between any two nodes, there are three disjoint paths of length at most 1 . With small diameter D and simple structure, the hyper- L triple-loop network, denoted by HL(l,m, n) , has been showed to be a good construction for a triple-loop network. Hwang and Lin proved that the 3-wide-diameter of hyper- L tripleloop network is at most D + 2 . In this paper, we exactly present the 3-wide-diameter of hyper- L tripleloop network. We prove that the 3-wide-diameter is D + 1 except two cases with D + 2 .
PULSATINGSTORE: An Analytic Framework for Automated Storage Management
Authors: Lin Qiao, Divyakant Agrawal, Amr El Abbadi, Balakrishna R. Iyer
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Self-management of large information technology components, such as DBMSs, has emerged as one important problem in the area of autonomic computing. In particular, automated storage management is critical for most data-intensive applications. The reason is that the storage maintenance cost manifests one of the biggest factors in the overall operational cost. At the same time, due to the interactive nature of most applications, users typically pose the QoS constraints on IO access performance. Hence it is crucial to ensure that the applications are not underprovisioned (giving rise to the risk of QoS violation) or over-provisioned (resulting in high operational costs). Such issue gets further complicated when the application workload keeps changing. In this paper, we present a novel analytic framework, PULSATINGSTORE, for autonomically managing the storage to balance the cost and performance in an online manner. In particular, given the workload characteristics of an application and storage QoS requirement, our PULSATINGSTORE framework is capable of scheduling the up-migration (in the case of under-provisioning) or down-migration (in the case of over-provisioning) with the optimal or near-optimal cost while still maintaining the QoS constraint.
Collecting and Harnessing Rich Session Histories
Authors: Howard Goodell, Chih-Hung Chiang, Curran Kelleher, Alex Baumann, Georges Grinstein
Venue: Proceedings of the conference on Information Visualization (2006)

To be most useful, evaluation requires detailed observation and effective analysis of a full spectrum of system use. We have developed an approach and architecture for in-depth data collection and analysis of all use of a visualization system. User interface components in a large visualization and analysis platform automatically record user actions, and can restore previous system states on demand. Audio and text annotations are collected and indexed to states, allowing users to find a comment and restore the system state in which they made it; then explore actions before and after. History is visible as data; so a variety of visual displays and analysis techniques may be used to develop insights about the user's experience. States of any part of the interface may be analyzed separately. Actions are categorized in a taxonomy as the user interface is built, allowing comparison of similar patterns in all tools. History data can co-exist with other data during data exploration, supporting further individual or group data exploration.
The Making of Trigger and the Agile Engineering of Artist-Scientist Collaboration
Authors: Francis T. Marchese
Venue: Proceedings of the conference on Information Visualization (2006)

The agile process approach used in software engineering was adapted as a foundation for the management of the multimedia art installation project titled "Trigger." By beginning with requirements engineering and risk management assessments, instead of rigid planning, the project was designed with flexibility that allowed for iterative adjustment. The residency period drew the artist, Jody Zellen, and the computer scientists together for agile learning by the processes of doing and testing. This style of management allowed the group to act decisively with incomplete information, thereby successfully finishing the project in time to meet a rigid deadline.
Hierarchical hippocratic databases with minimal disclosure for virtual organizations
Authors: Fabio Massacci, John Mylopoulos, Nicola Zannone
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2006)

The protection of customer privacy is a fundamental issue in today&#x2019;s corporate marketing strategies. Not surprisingly, many research efforts have proposed new privacy-aware technologies. Among them, Hippocratic databases offer mechanisms for enforcing privacy rules in database systems for inter-organizational business processes (also known as virtual organizations). This paper extends these mechanisms to allow for hierarchical purposes, distributed authorizations and minimal disclosure supporting the business processes of virtual organizations that want to offer their clients a number of ways to fulfill a service. Specifically, we use a goal-oriented approach to analyze privacy policies of the enterprises involved in a business process. On the basis of the purpose hierarchy derived through a goal refinement process, we provide algorithms for determining the minimum set of authorizations needed to achieve a service. This allows us to automatically derive access control policies for an inter-organizational business process from the collection of privacy policies associated with different participating enterprises. By using effective on-line algorithms, the derivation of such minimal information can also be done on-the-fly by the customer wishing to access a service.
Chirp-Based Image Watermarking as Error-Control Coding
Authors: Behnaz Ghoraani, Sridhar Krishnan
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper, we use post processing methods to compensate the bit errors occurred in watermark embedding and extracting. Forward error correction (FEC)-based and chirp-based techniques are applied to encode and shape the embedded watermark message so that even at the presence of some bit error rates (BERs) in the extracted watermark, the watermarking algorithm be able to successfully estimate the correct embedded watermark message. Repetition and Bose-Chaudhuri-Hocquenghem (BCH) codings are used as two well-known FEC schemes, and discrete polynomial transform (DPPT) and Hough-Radon transform (HRT) are utilized as two chirp detectors in chirp-based watermarking. Robustness of all the proposed post processing methods are tested for checkmark benchmark attacks, and we found that the chirp-based watermarking using the DPPT chirp detector offers the highest watermark extraction rate, and the best bit error compensation even at BERs of higher than 17%.
Delay-Tolerant Network Technologies Coming Together
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2006)

The Delay-Tolerant Network Research Group is a working group of the Internet Research Task Force, the research sister of the Internet Engineering Task Force standards body. DTNRG originated indiscussions surrounding the inadequacies of TCP/IP for deep-space and interplanetary communications,but it has become a focal point for standardizing overlay technologies that address disconnectednetwork environments on Earth as well.