ppxscal/embedding_network huggingface dataset:
Formal security evaluation of ad hoc routing protocols
Authors: Todd R. Andel
Venue:  (2007)

Research into routing protocol development for mobile ad hoc networks has been a significant undertaking since the late 1990's. Secure routing protocols for mobile ad hoc networks provide the necessary functionality for proper network operation. If the underlying routing protocol cannot be trusted to follow the protocol operations, additional trust layers cannot be obtained. For instance, authentication between nodes is meaningless without a trusted underlying route. Security analysis procedures to formally evaluate these developing protocols have been significantly lagging, resulting in unstructured security analysis approaches and numerous secure ad hoc routing protocols that can easily be broken. Evaluation techniques to analyze security properties in ad hoc routing protocols generally rely on manual, non-exhaustive approaches. Nonexhaustive analysis techniques may conclude a protocol is secure, while in reality the protocol may contain unapparent or subtle flaws. Using formalized exhaustive evaluation techniques to analyze security properties increases protocol confidence. Intertwined to the security evaluation process is the threat model chosen to form the analysis. Threat models drive analysis capabilities, affecting how we evaluate trust. Current attacker threat models limit the results obtained during protocol security analysis over ad hoc routing protocols. Developing a proper threat model to evaluate security properties in mobile ad hoc routing protocols presents a significant challenge. If the attacker strength is too weak, we miss vital security flaws. If the attacker strength is too strong, we cannot identify the minimum required attacker capabilities needed to break the routing protocol. To solve these problems, we contribute to the field in the following ways: Adaptive Threat Modeling. We develop an adaptive threat model to evaluate route discovery attacks against ad hoc routing protocols. Adaptive threat modeling enables us to evaluate trust in the ad hoc routing process and allows us to identify minimum requirements an attacker needs to break a given routing protocol. Automated Security Evaluation. We develop an automated evaluation process to analyze security properties in the route discovery phase for on-demand source routing protocols. Using the automated security evaluation process, we are able to produce and analyze all topologies for a given network size. The individual network topologies are fed into the SPIN model checker to exhaustively evaluate protocol models against an attacker attempting to corrupt the route discovery process. Our contributions provide the first automated exhaustive analysis approach to evaluate ad hoc on-demand source routing protocols.
Volumetric Assessment of Breast Tissue Composition from FFDM Images
Authors: Keith Hartman, Ralph Highnam, Ruth Warren, Valerie Jackson
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

We present first results from a new automated algorithm for the volumetric measurement of the composition of breast tissue from digital mammograms. The new algorithm overcomes issues in previous implementations through better segmentation and use of additional information We measure the success of the new algorithm using an overall quality metric based upon the results from a large multi-site, multi-vendor, multi-detector set of digitally acquired mammograms.
Online Slant Identification Algorithm Using Vector Rules
Authors: Rohayu Yusof, Shuzlina Abdul Rahman, Marina Yusoff, Sofianita Mutalib, Azlinah Mohamed
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

Signatures are among the most widely accepted personal attributes for identity verification. There are a lot of features that can be discovered in signature which are either dynamic or static features type. An algorithm needs to be designed to extract these signature features. Online system uses pressure sensitive tablets to capture signature of individual as they sign thus analysis can be done directly and immediately. This research explored slant feature algorithm since signature is usually slanted due to the mechanism of handwriting and the human personality. The proposed algorithm are used to formulate the Signature Extraction Features System (SEFS) which provides a set of tools that allow the users to extract slant features in signature automatically for analysis purposes. Twenty individuals from different background are randomly selected to have their signature taken. Their signatures are captured on a tablet and the SEFS would than gather and store the raw data. The image of the signature that is created by the SEFS would be used as samples for the questionnaire to identify the features of slant, where the questionnaires are given to human expert for evaluation. The results from the SEFS are compared with the result from the questionnaire. Results produced by the algorithm for slant extraction shows 85% identical answers compared to the outcome by human expert. These show that the algorithm proposed are promising for further exploration.
A Probabilistic Model for User Relevance Feedback on Image Retrieval
Authors: Roberto Paredes, Thomas Deselaers, Enrique Vidal
Venue: Proceedings of the 5th international workshop on Machine Learning for Multimodal Interaction (2008)

We present a novel probabilistic model for user interaction in image retrieval applications which accounts for consistency among the retrieved images and considers the distribution of images in the database which is searched for. Common models for relevance feedback do not consider this and thus do not incorporate all available information. The proposed method is evaluated on two publicly available benchmark databases and clearly outperforms recent competitive methods.
Ranking Attributes Using Learning of Preferences by Means of SVM
Authors: Alejandro Hernández-Arauzo, Miguel García-Torres, Antonio Bahamonde
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

A relaxed setting for Feature Selection is known as Feature Ranking in Machine Learning. The aim is to establish an order between the attributes that describe the entries of a learning task according to their utility. In this paper, we propose a method to establish these orders using Preference Learning by means of Support Vector Machines (SVM). We include an exhaustive experimental study that investigates the virtues and limitations of the method and discusses, simultaneously, the design options that we have adopted. The conclusion is that our method is very competitive, specially when it searchs for a ranking limiting the number of combinations of attributes explored; this supports that the method presented here could be successfully used in large data sets.
Using Computer Simulation to Understand Mutation Accumulation Dynamics and Genetic Load
Authors: John Sanford, John Baumgardner, Wes Brewer, Paul Gibson, Walter Remine
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Long-standing theoretical concerns about mutation accumulation within the human population can now be addressed with numerical simulation. We apply a biologically realistic forward-time population genetics program to study human mutation accumulation under a wide-range of circumstances. Using realistic estimates for the relevant biological parameters, we investigate the rate of mutation accumulation, the distribution of the fitness effects of the accumulating mutations, and the overall effect on mean genotypic fitness. Our numerical simulations consistently show that deleterious mutations accumulate linearly across a large portion of the relevant parameter space. This appears to be primarily due to the predominance of nearly-neutral mutations. The problem of mutation accumulation becomes severe when mutation rates are high. Numerical simulations strongly support earlier theoretical and mathematical studies indicating that human mutation accumulation is a serious concern. Our simulations indicate that reduction of mutation rate is the most effective means for addressing this problem.
Five Perspectives on Case Based Reasoning
Authors: Zhaohao Sun, Jun Han, Dong Dong
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

This article examines case-based reasoning (CBR) from five dif ferent perspectives: cognitive, process-oriented, logical, intelligent, and hy brid perspective. These five perspectives cover the majority of CBR research and development and classify CBR into five categories consequently: Cog nitive CBR, process CBR, logical CBR, intelligent CBR and hybrid CBR. This article looks at each of these perspectives on CBR from a unified view point taking into account corresponding fundamentals, applications and re lated issues. The proposed approach can facilitate research and development of CBR and its applications.
Paving the Way to eGovernment Transformation: Interoperability Registry Infrastructure Development
Authors: Aikaterini-Maria Sourouni, Fenareti Lampathaki, Spiros Mouzakitis, Yannis Charalabidis, Dimitris Askounis
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

During the last decades eGovernment has been a vivid, dynamic research and development area. As services are being transformed, electronic documents and web services appear every day in many countries, the involved stakeholders are in urgent need for an instrument to structure governmental administration processes, service composition and provision - in a way that eGovernment transformation can be constantly managed. This paper presents the creation of an eGovernment ontology, and the development of a knowledge-based registry of governmental services in Greece. This Registry is an advanced web portal, devoted to the formal description, composition and publishing of traditional, electronic and web services, including the relevant electronic documents, information systems and as well the process descriptions and the work-flow models in an integrated knowledge base. Through such a repository, the discovery of services by users or systems has been automated, resulting in an important tool for achieving interoperable eGovernment transformation.
Monitoring the QoS for Web Services
Authors: Liangzhao Zeng, Hui Lei, Henry Chang
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Quality of Service (QoS) information for Web services is essential to QoS-aware service management and composition. Currently, most QoS-aware solutions assume that the QoS for component services is readily available, and that the QoS for composite services can be computed from the QoS for component services. The issue of how to obtain the QoS for component services has largely been overlooked. In this paper, we tackle this fundamental issue. We argue that most of QoS metrics can be observed/computed based on service operations. We present the design and implementation of a high-performance QoS monitoring system. The system is driven by a QoS observation model that defines IT- and business-level metrics and associated evaluation formulas. Integrated into the SOA infrastructure at large, the monitoring system can detect and route service operational events systemically. Further, a model-driven, hybrid compilation/interpretation approach is used in metric computation to process service operational events and maintain metrics efficiently. Experiments suggest that our system can support high event processing throughput and scales to the number of CPUs.
T Wave Alternans Features for Automated Detection
Authors: Tomas Kulvičius, Minija Tamošiūnaitė, Rimas Vaišnys
Venue: Informatica (2005)

T wave features suitable for automatic T wave alternans detection in low signal-to-noise ratio electrocardiograms are explored using a correlation-to-template-based algorithm for detecting T waves of variable duration. Amplitude and area features of T waves are found to be notably less sensitive to template selection than are duration features. T wave alternans features and measures which can be determined more stably provide better classification accuracy of patients with and without coronary artery lesions.
The Coordination of Two Parallel Machines Scheduling and Batch Deliveries
Authors: Hua Gong, Lixin Tang
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

In this paper, we consider a two-identical-parallel-machine scheduling problem with batch delivery. Although NP-hardness of this problem has been already proved by Hall and Potts, but they did not give the pseudo-polynomial-time algorithm for the problem. We prove the problem is NP-hard in the ordinary sense by constructing a pseudo-polynomial-time algorithm for the problem. We also give a polynomial-time algorithm to solve the case when the job assignment to parallel machines is given.
Author Name Disambiguation for Citations Using Topic and Web Correlation
Authors: Kai-Hsiang Yang, Hsin-Tsung Peng, Jian-Yi Jiang, Hahn-Ming Lee, Jan-Ming Ho
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

Today, bibliographic digital libraries play an important role in helping members of academic community search for novel research. In particular, author disambiguation for citations is a major problem during the data integration and cleaning process, since author names are usually very ambiguous. For solving this problem, we proposed two kinds of correlations between citations, namely, Topic Correlation and Web Correlation, to exploit relationships between citations, in order to identify whether two citations with the same author name refer to the same individual.The topic correlation measures the similarity between research topics of two citations; while the Web correlation measures the number of co-occurrence in web pages. We employ a pair-wise grouping algorithm to group citations into clusters. The results of experiments show that the disambiguation accuracy has great improvement when using topic correlation and Web correlation, and Web correlation provides stronger evidences about the authors of citations.
Information Agents Handling Semantic Data as an Extension to Process Monitoring Systems
Authors: Teppo Pirttioja, Ilkka Seilonen, Antti Pakonen, Aarne Halme, Kari Koskinen
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

An approach to extend process monitoring with the help of information agents (IA) handling semantic data is presented in this paper. According to this approach, an operator of a process automation system can configure monitoring tasks that a group of IAs performs proactively. The monitoring tasks are assumed to be composites which refer to several process observations and their logical relations. The purpose of these composite monitoring tasks is to enhance the work of the operator by letting him to supervise process phenomena at a higher level of abstraction instead of following a large amount of simple measurement data. The monitoring agents operate as a multi-agent system consisting of agents with capabilities to combine both numerical and symbolic information from several data sources. The agents can setup and execute user configured monitoring tasks cooperatively. The approach is illustrated with test scenarios using data from an industrial paper making process.
Estimation of State Variables in Semiautogenous Mills by Means of a Neural Moving Horizon State Estimator
Authors: Karina Carvajal, Gonzalo Acuña
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

A method of moving horizon state estimation (MHSE) including a recurrent neural network as the dynamic model is used as an estimator of the filling level of the mill for a semiautogenous ore grinding process. The results are compared to those of a simple neural network acting as an estimator. They show the advantages of the Neural-MHSE, especially concerning robustness under large perturbations of the state variables (index of agreement > 0.9), which would favor its application to industrial scale processes.
Crosstalk-Aware Placement
Authors: Jinan Lou, Wei Chen
Venue: IEEE Design Test (2004)

With today's rapidly shrinking process geometries, designers must address crosstalk, electromigration, IR drop, and other effects earlier in the design cycle to achieve signal integrity. The authors present a new placement algorithm that minimizes crosstalk and increases design speed 8% on average, in comparison with a traditional timing-driven, congestion-aware placement flow.
An Adaptive Index-Based Algorithm Using Time-Coordination in Mobile Computing
Authors: Yanping Gao, Changhui Deng, Yandong Che
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Checkpointing is one of the commonly used techniques to provide fault-tolerance in distributed systems so that the system can operate even if one or more components have failed. However, mobile computing systems are constrained by low bandwidth, mobility, lack of stable storage, frequent disconnections and limited battery life. Hence, checkpointing protocols having lesser number of synchronization messages and fewer checkpoints are preferred in mobile environment. There are two different approaches, although not orthogonal, to checkpoint mobile computing systems namely, time-based and index-based. Our protocol is an integration of these two approaches, though not first of its kind. In the present exposition, an index-based checkpointing protocol has been developed, which uses time to indirectly coordinate the creation of consistent global checkpoint for mobile computing systems. The proposed algorithm is non-blocking, adaptive, and does not use any control message. Compared to other contemporary checkpointing algorithms, it is computationally more efficient because it takes lesser number of checkpoints and does not need to compute dependency relationships.
PresenceRemote: Embracing Ambiguity in the Design of Social TV for Senior Citizens
Authors: Tomas Sokoler, Marcus Sanchez Svensson
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

This paper reports on our early experiences with the design of Social TV for senior citizens. Even though there seems to be a straight forward match between new interactive TV technologies on the rise and the notion of supporting social interaction amongst elderly TV viewers it is not at all clear how these technologies can accommodate the specific challenges related to the everyday life of elderly people. In particular, using an example concept - the PresenceRemote - we will discuss how the stigma associated with being lonely, an inherent part of senior living, can be addressed by leaving room for unarticulated intentions of use in our design of Social TV. The 'PresenceRemote' is an enhanced TV remote control making it possible for you to notice others and be noticed by peers within your local neighborhood as you watch TV.
Low-cost methods for error detection in multi-core systems
Authors: Daniel Sorin
Venue:  (2008)

There is broad consensus among academic and industrial researchers in computer architecture that hardware faults, both transient and permanent, will become significantly more frequent as CMOS feature sizes continue to shrink. Circuit-level techniques alone are insufficient to overcome this problem, and therefore system designers have begun to add fault tolerance features to processor micro-architectures and memory systems. Many of the techniques used today were developed in a time when fault coverage was the primary optimization target; hardware, power, and performance costs were only secondary concerns. These priorities do not accurately reflect the needs of today's commodity systems, which are very sensitive to manufacturing and performance costs and can trade-off some amount of fault coverage to reduce these costs.In my dissertation work I have developed novel error detection techniques with significantly lower area and performance costs than those traditionally used in high availability designs. These savings were made possible by a guiding principle of verifying high-level system tasks rather than checking correct operation of specific low-level components. This high-level, end-to-end approach to error-detection has distinct advantages over checking low-level components in terms of applicability to a wide range of systems, coverage of complex component interactions, and implementation cost. The major challenge in developing end-to-end checkers is to find high-level tasks that are both relevant and verifiable at runtime. I approached this problem by decomposing system-level tasks into sub-tasks that are more easily verifiable and, when combined, are sufficient to ensure correctness of a high-level task. Such a decomposition is a step back from a full end-to-end design and requires additional assumptions about the underlying system, but I found the resulting cost and complexity benefits to outweigh the loss in flexibility that comes with them.I have applied the ideas of task decomposition and high-level checking to processor cores, memory systems, and the I/O system, in order to develop low-cost checkers for each of these subsystems. The checking mechanisms resulting from this work are highly effective in detecting errors and incur lower hardware and performance cost than mechanisms with comparable error coverage proposed in the past.
Co-simulation Tools for Networked Control Systems
Authors: Ahmad T. Al-Hammouri, Michael S. Branicky, Vincenzo Liberatore
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

In this paper, we argue that simulation of Networked Control Systems (NCSs) needs to be carried out through co-simulation, which requires the joint and simultaneous simulation of both physical and communication networks dynamics. Co-simulation enables construction of synthetic large-scale networks and workloads, replay of collected traces, and obtaining a complete snapshot of both the network behavior and the physical systems states. Therefore, co-simulation provides in-depth understanding of the interaction between communication networks and physical systems dynamics. In this paper, we overview three co-simulation tools that we have developed for NCS co-simulation. The first two tools are extensions to ns-2 called Agent/Plant and NSCSPlant; the third tool integrates Modelica and ns-2. For each tool, we present demonstrative case studies that highlight its capabilities.
A New Mobile Payment Method for Embedded Systems Using Light Signal
Authors: Hoyoung Hwang, Moonhaeng Huh, Siwoo Byun, Sungsoo Lim
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

This paper presents a new type of digital payment method and algorithm for embedded systems including mobile phone and other handheld devices. In the conventional mobile payment system, a payment signal transmitting device and a wireless internet connection device are separately provided to mobile systems. Therefore, the production cost of the mobile devices increases, and the complexity and the size of the mobile devices grow. In order to solve the problems, a new digital payment method using light signal containing payment-related information is suggested for mobile phone and embedded devices. The new method provides an economic and efficient solution to mobile payment system by updating embedded software without need of additional hardware modules to mobile devices.