ppxscal/embedding_network huggingface dataset:
Performance Analysis and Evaluation of Mellanox ConnectX InfiniBand Architecture with Multi-Core Platforms
Authors: Sayantan Sur, Matthew J. Koop, Lei, Dhabaleswar K. Panda
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

InfiniBand is an emerging networking technology that is gaining rapid acceptance in the HPC domain. Currently, several systems in the Top500 list use InfiniBand as their primary interconnect, with more being planned for near future. The fundamental architecture of the systems are undergoing a sea-change due to the advent of commodity multi-core computing. Due to the increase in the number of processes in each compute node, the network interface is expected to handle more communication traffic as compared to older dual or quad SMP systems. Thus, the network architecture should provide scalable performance as the number of processing cores increase. ConnectX is the fourth generation InfiniBand adapter from Mellanox Technologies. Its novel architecture enhances the scalability and performance of InfiniBand on multi-core clusters. In this paper, we carry out an in-depth performance analysis of ConnectX architecture comparing it with the third generation InfiniHost III architecture on the Intel Bensley platform with Dual Clovertown processors. Our analysis reveals that the aggregate bandwidth for small and medium sized messages can be increased by a factor of 10 as compared to the third generation InfiniHost III adapters. Similarly, RDMA-Write and RDMA-Read latencies for 1-byte messages can be reduced by a factor of 6 and 3, respectively, even when all cores are communicating simultaneously. Evaluation with communication kernel Halo reveals a performance benefit of a factor of 2 to 5. Finally, the performance of LAMMPS, a molecular dynamics simulator, is improved by 10% for the in.rhodo benchmark.
Canonical source reconstruction for MEG
Authors: Jérémie Mattout, Richard N. Henson, Karl J. Friston
Venue: Computational Intelligence and Neuroscience (2007)

We describe a simple and efficient solution to the problem of reconstructing electromagnetic sources into a canonical or standard anatomical space. Its simplicity rests upon incorporating subject-specific anatomy into the forward model in a way that eschews the need for cortical surface extraction. The forward model starts with a canonical cortical mesh, defined in a standard stereotactic space. The mesh is warped, in a nonlinear fashion, to match the subject's anatomy. This warping is the inverse of the transformation derived from spatial normalization of the subject's structural MRI image, using fully automated procedures that have been established for other imaging modalities. Electromagnetic lead fields are computed using the warped mesh, in conjunction with a spherical head model (which does not rely on individual anatomy). The ensuing forward model is inverted using an empirical Bayesian scheme that we have described previously in several publications. Critically, because anatomical information enters the forward model, there is no need to spatially normalize the reconstructed source activity. In other words, each source, comprising the mesh, has a predetermined and unique anatomical attribution within standard stereotactic space. This enables the pooling of data from multiple subjects and the reporting of results in stereotactic coordinates. Furthermore, it allows the graceful fusion of fMRI and MEG data within the same anatomical framework.
Towards practically feasible answering of regular path queries in lav data integration
Authors: Manuel Tamashiro, Alex Thomo, Srinivasan Venkatesh
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Regular path queries (RPQ's) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ's have received great attention in the context of semistructured data, which are data whose structure is irregular, partially known, or subject to frequent changes. One of the most important problems in databases today is the integration of semistructured data from multiple sources modeled as views. The well-know paradigm of computing first a view-based rewriting of the query, and then evaluating the rewriting on the view extensions is indeed possible for RPQ's. However, computing the rewriting is computationally hard as it can only be done (in the worst case) in not less than 2EXPTIME. In this paper, we provide practical evidence that computing the rewriting is hard on the average as well. On the positive side, we propose automata-theoretic techniques, which efficiently compute and utilize instead the complement of the rewriting. Notably using the latter, it is possible to answer a query, and this makes the view-based answering of RPQ's fairly feasible in practice.
Extended abstract: an environment for design verification of smart card systems using attack simulation in SystemC
Authors: K. Rothbart, U. Neffe, Ch. Steger, R. Weiss
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

In this paper an environment for design verification of smart cards using security attack simulation in SystemC is presented. The method for automatic instrumentation of the SystemC code is described, also depicted is the process by which design robustness against attacks is verified. This process involves the system behavior analysis using an extended control flow graph. The results discuss the system behavior analysis of a Java Card/spl trade/ Virtual Machine.
Effective Processing over Continuous Data Stream
Authors: Misook Bae, Jun Park, Buhyun Hwang, Jiseung Nam
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Due to a late and out-of-order arrival of infinite, unbound and multiple input streams, processing continuous queries over them may lead to producing an inaccurate answer or delaying query execution. Particularly, to minimize this delay time, previous works have used timeout technique without considering the frequency of timeouts. It results in decreasing the accuracy of query execution results since the more the frequency of timeouts, the more the loss of data. We propose a AQP-SWTO method using StB that stores operator's state and a window time-out method based on the waiting time for the next tuple by resetting the size of a queue according to the frequency of timeouts. It reduces a loss rate of data and increases the tuples output-rate. We compare AQP-SWTO method with an existing method and use output-rate and response time as criteria for performance evaluation. As a result of experiment, our proposed method shows an improvement in system performance.
A new electronic traveler's check scheme based on one-way hash function
Authors: Horng-Twu Liaw, Jiann-Fu Lin, Wei-Chen Wu
Venue: Electronic Commerce Research and Applications (2007)

Nowadays, electronic commerce is booming on the Internet and becoming more popular. Many kinds of electronic services have been developed. The most successful are the electronic payment systems such as the electronic cash/check and wallet. Most electronic payment systems are based on an elaborate discrete logarithm that raises an important issue regarding efficiency. Therefore, Hsien et al. proposed an electronic traveler's check system in 2001 using a discrete logarithm. In this paper, we propose a new electronic traveler's check system based on one-way hash function to improve efficiency and cost. Furthermore, our proposed scheme supports an on-line and off-line electronic traveler's check system of practical flexibility for use in the real world.
Predicting opponent's moves in electronic negotiations using neural networks
Authors: Réal Carbonneau, Gregory E. Kersten, Rustam Vahidov
Venue: Expert Systems with Applications: An International Journal (2008)

Electronic negotiation experiments provide a rich source of information about relationships between the negotiators, their individual actions, and the negotiation dynamics. This information can be effectively utilized by intelligent agents equipped with adaptive capabilities to learn from past negotiations and assist in selecting appropriate negotiation tactics. This paper presents an approach to modeling the negotiation process in a time-series fashion using artificial neural network. In essence, the network uses information about past offers and the current proposed offer to simulate expected counter-offers. On the basis of the model's prediction, ''what-if'' analysis of counter-offers can be done with the purpose of optimizing the current offer. The neural network has been trained using the Levenberg-Marquardt algorithm with Bayesian Regularization. The simulation of the predictive model on a testing set has very good and highly significant performance. The findings suggest that machine learning techniques may find useful applications in the context of electronic negotiations. These techniques can be effectively incorporated in an intelligent agent that can sense the environment and assist negotiators by providing predictive information, and possibly automating some negotiation steps.
A Unified TCP Enhancement for Wireless Mesh Networks
Authors: Chunlei Liu, Fangyang Shen, Min-Te Sun
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

The recent emergence of wireless mesh networks as a quick and inexpensive way to access the Internet has gained attention in the networking field. While using multiple radios improves network throughput, it undermines TCP's underlying assumptions. When deployed in wireless mesh networks, TCP faces four challenges: transmission errors, packet reordering due to multipath routing, multihop connections and congestion. If not handled properly, they can incorrectly trigger TCP congestion control mechanisms and cause poor performance. In this paper, we propose a new TCP enhancement, named Congestion Coherence, to address these challenges. Simulation results confirm that this enhancement significantly improves TCP performance in wireless mesh networks.
Introduction of summative and formative web-based assessment to the circuit theory course
Authors: Jerzy Rutkowski, Katarzyna Moscinska
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Over the last few years the Circuit Theory course at Silesian University of Technology, Gliwice, Poland has been gradually converted into blended e-course [1]. Recently the Web-based assessment (WBA) has been introduced [2]. The application of WBA enables to decrease costs and first of all enhance quality of learning. The authors describe their first experience with summative as well as formative assessment. The summative assessment proved to be very successful, even though some modifications should be introduced. The results of formative assessment are less satisfactory, due to the students' attitude to learning. The paper describes the applied forms of assessments, enlightens the main difficulties and provides some tips for teachers introducing WBA, especially in case of technical university courses.
Tools for Configuring Interactive Picture-Processing Systems
Authors: G. E. Pfaff
Venue: IEEE Computer Graphics and Applications (1982)

Emphasis is on tailor-made configurations in this interactive system from West Germany. Its modular structures and well-defined interfaces support a variety of applications and equipment.
Adaptive Distance Estimation and Localization in WSN using RSSI Measures
Authors: Abdalkarim Awad, Thorsten Frunzke, Falko Dressler
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Localization is one of the most challenging and important issues in wireless sensor networks (WSNs), especially if cost-effective approaches are demanded. In this paper, we present intensively discuss and analyze approaches relying on the received signal strength indicator (RSSI). The advantage of employing the RSSI values is that no extra hardware (e.g. ultrasonic or infra-red) is needed for network-centric localization. We studied different factors that affect the measured RSSI values. Finally, we evaluate two methods to estimate the distance; the first approach is based on statistical methods. For the second one, we use an artificial neural network to estimate the distance.
Difficulty-aware Hybrid Search in Peer-to-Peer Networks
Authors: Hanhua Chen, Hai Jin, Yunhao Liu, Lionel M. Ni
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

By combining an unstructured protocol with a DHT-based global index, hybrid Peer-to-Peer (P2P) improves search efficiency in terms of query recall and response time. The key challenge in hybrid search is to estimate the number of peers that can answer a given query. Existing approaches assume that such a number can be directly obtained by computing item popularity. In this work, we show that such an assumption is not always valid, and previous designs cannot distinguish whether items related to a query are distributed in many peers or are in a few peers. To address this issue, we propose QRank, a difficulty-aware hybrid search, which ranks queries by weighting keywords based on term frequency. Using rank values, QRank selects proper search strategies for queries. We conduct comprehensive trace-driven simulations to evaluate this design. Results show that QRank significantly improves the search quality as well as reducing system traffic cost compared with existing approaches.
Special Feature The Total Computer Security Problem: an Oveview
Authors: K. S. Shankar
Venue: Computer (1977)

As society becomes more dependent on computers, computer crime is becoming not only more disastrous in its potential impact, but also more attractive to the criminal.1-3However, with adequate protection techniques, data theft can be prevented. This paper analyzes the total computer system security problem, using six major factors to sort out the issues involved. The entire problem is visualized in Figure 1, with the six factors listed along the left-hand side.
Computer Image Generation for Flight Simulation
Authors: B. J. Schachter
Venue: IEEE Computer Graphics and Applications (1981)

Visual simulation seems to imply image realism-though visual simulation systems can produce realistic images, their main goal Is training effectiveness.
A service-based Workflow Model for Virtual Enterprise
Authors: Wu Shaofei, Wei Siying, Zhang Jinlong
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Some modeling methods of virtual enterprise have been proposed such as workflow coordination modeling, supply chain modeling and agent-based modeling. But they all have some insufficient in some aspects to be improved. For example, they are difficult to be realized in process dynamic optimization. This paper proposes a service-based model for Virtual Enterprise workflows. Modeling the workflow execution as a cooperation of services allows different organizations to interact via well-defined interfaces. The paper primarily covers three models: the conceptual model of workflow for virtual enterprise, the service model and the execution model, it discusses the agile service choice and transfer mechanism of the virtual enterprise and shows how the execution can be optimized by selecting services depending on their contribution to quality criteria of the workflow. The model proposed in this paper has referenced and practical value for the thorough research and realization of the system.
SEER: a security experimentation EnviRonment for DETER
Authors: Stephen Schwab, Brett Wilson, Calvin Ko, Alefiya Hussain
Venue: Proceedings of the DETER Community Workshop on Cyber Security Experimentation and Test on DETER Community Workshop on Cyber Security Experimentation and Test 2007 (2007)

Configuring a security experiment can be tedious, involving many low level and repetitive configuration tasks. In order to make DETER's capabilites accessible to users at all skill levels, we have designed and implemented a Security Experimentation EnviRonment (SEER) that provides security researchers the ability to create, plan, and iterate through a large range of experimental scenarios with relative ease. SEER integrates various tools for configuring and executing experiments and provides a user-friendly interface for experimenters to use the tools. SEER aims to support a wide range of experimentation requirements such that many researchers will prefer to interact with DETER through it, fostering collaboration within the security research community.
On the Design and Evaluation of Data Bases
Authors: P. Scheuermann
Venue: Computer (1978)

Within the past few years data base management systems have received an increasingly large share of the computing world's efforts. They are attractive, despite their high processing cost, because they relieve the programmer of the need to program gram frequently used operations such as access methods for complicated data structures and variable- length fields, records, and files. As data base management systems become more flexible they also allow unanticipated queries to be answered with relative ease.
In search for a widely applicable and accepted software quality model for software quality engineering
Authors: Marc-Alexis Côté, Witold Suryn, Elli Georgiadou
Venue: Software Quality Control (2007)

Software Quality Engineering is an emerging discipline that is concerned with improving the approach to software quality. It is important that this discipline be firmly rooted in a quality model satisfying its needs. In order to define the needs of this discipline, the meaning of quality is broadly defined by reviewing the literature on the subject. Software Quality Engineering needs a quality model that is usable throughout the software lifecycle and that it embraces all the perspectives of quality. The goal of this paper is to propose the characteristics of a quality model suitable for such a purpose, through the comparative evaluation of existing quality models and their respective support for Software Quality Engineering.
AUV-Aided Localization for Underwater Sensor Networks
Authors: Melike Erol, Luiz Filipe M. Vieira, Mario Gerla
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

We propose a localization scheme for underwater acoustic sensor networks (UWSN) that does not require a priori infra-structure or synchronization between nodes. An Autonomous Underwater Vehicle (AUV) aids in localizing the sensor nodes while roaming across the underwater sensor field. The objectives of this paper are to describe how to localize nodes using AUV and to describe the tradeoffs involved, i.e. ratio of localized nodes and localization accuracy. We show that localization success improves as the duration of the AUV localization process increases. In addition, we investigated localization using two methods, bounding-box and triangulation. The former achieves a higher localization ratio but with a higher error. In certain scenarios, we achieved 100% nodes localized with 3% error.
A Reconfigurable Parallel Processor with Microprogram Control
Authors: Yoshikuni Okada, Hiroaki Tajima, Ryoichi Mori
Venue: IEEE Micro (1982)

This system's microprogrammable features, implemented through a simple data routing scheme, require only about 18 percent of the total number of processing-element gates.
Built-In Self-Test of Field Programmable Analog Arrays based on Transient Response Analysis
Authors: T. R. Balen, J. V. Calvano, M. S. Lubaszewski, M. Renovell
Venue: Journal of Electronic Testing: Theory and Applications (2007)

In this work a strategy for testing analog networks, known as Transient Response Analysis Method, is applied to test the Configurable Analog Blocks (CABs) of Field Programmable Analog Arrays (FPAAs). In this method the Circuit Under Test (CUT) is programmed to implement first and second order blocks and the transient response of these blocks to known input stimuli is analyzed. Taking advantage of the inherent programmability of the FPAAs, a BIST-based scheme is used in order to obtain an error signal representing the difference between fault-free and faulty CABs. Two FPAAs from different manufacturers and distinct architectures are considered as CUT. For one of the devices there is no detailed information about its structural implementation. For this reason, a functional fault model based on high-level parameters of the transfer function of the programmed blocks is adopted, and then, the relationship between these parameters and CAB component deviations is investigated. The other considered device allows a structural programming in which the designer can directly modify the values of programmable components. This way, faults can be injected by modifying the values of these components in order to emulate a defective behavior. Therefore, it is possible to estimate the fault coverage and test application time of the proposed functional test method when applied to both considered devices.
Validating Adequacy and Suitability of Business-IT Alignment Criteria in an Inter-Enterprise Maturity Model 202
Authors: Roberto Santana Tapia, Maya Daneva, Pascal van Eck
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Aligning requirements of a business with its information technology is currently a major issue in enterprise computing. Existing literature indicates important criteria to judge the level of alignment between business and IT within a single enterprise. However, identifying such criteria in an inter-enterprise setting - or re-thinking the existing ones - is hardly addressed at all. Business-IT alignment in such settings poses new challenges, as in inter-enterprise collaborations, alignment is driven by economic processes instead of centralized decision-making processes. In our research, we develop a maturity model for business-IT alignment in inter-enterprise settings that takes this difference into account. In this paper, we report on a multi-method approach we devised to confront the validation of the business-IT alignment criteria that we included in the maturity model. As independent feedback is critical for our validation, we used a focus group session and a case study as instruments to take the first step in validating the business-IT alignment criteria. We present how we applied our approach, what we learnt, and what the implications were for our model.
Mobile Party: A Mobility Management Solution for Wireless Mesh Network
Authors: Mehdi Sabeur, Ghazi Al Sukkar, Badii Jouaber, Djamal Zeghlache, Hossam Afifi
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

In this paper we propose the Mobile Party protocol, a new scheme for mobility management in the context of mesh networks. While most of proposed solutions for mobility management issue are routing protocol- independent mechanisms, our proposal integrates routing and mobility management functionalities together in the same scheme. This enhances considerably the performance of our proposal as shown in this paper. Moreover, the proposed protocol can be combining with Mobile IP to provide a global mobility management scheme at both micro and micro levels in case of non-Mobile Party nodes. Through simulations and performance studies, we demonstrate that the proposed scheme provides a viable solution for mobility and routing management, assuring scalability and seamless communications.