30 research outputs found

    Simultaneously generating secret and private keys in a cooperative pairwise-independent network

    Get PDF
    This paper studies the problem of simultaneously generating a secret key (SK) and a private key (PK) between Alice and Bob, in a cooperative pairwise-independent network (PIN) with two relays. In the PIN, the pairwise source observed by every pair of terminals is independent of those sources observed by any other pairs. The SK needs to be protected from Eve, while the PK needs to be protected not only from Eve but also from the two relays. Two cooperative SK-PK generation algorithms are proposed: both of them first generate common randomness, based on the well-established pairwise key generation technique and the application of the one-time pad; but then, the two algorithms utilize the XOR operation and a specific random-binning-based SK-PK codebook to generate the expected keys, respectively. The achievable SK-PK rate regions of both the two proposed algorithms are analyzed. Of particular interest is the second algorithm with random-bing based codebook, whose achievable key rate region is demonstrated to be exactly the same as the derived outer bound, a crucial step for establishing the key capacity of this PIN model. Finally, the two proposed SK-PK generation algorithms are extended to a cooperative wireless network, where the correlated source observations are obtained from estimating wireless channels during a training phase

    The Disciples of Samuel Ely: Settler Resistance Against Henry Knox on The Waldo Patent, 1785-1801

    Get PDF
    The article recounts the controversy and violence that surrounded the claims in the Waldoborough area. This claims were made by General Henry Know and the heir to the Waldo family, British Loyalists, who sought to reclaim the land after the end of the Revolutionary War

    Trade Union News No. 3, 1968

    Get PDF

    Modelling and verifying abilities of rational agents

    Get PDF

    Regionally distributed architecture for dynamic e-learning environment (RDADeLE)

    Get PDF
    e-Learning is becoming an influential role as an economic method and a flexible mode of study in the institutions of higher education today which has a presence in an increasing number of college and university courses. e-Learning as system of systems is a dynamic and scalable environment. Within this environment, e-learning is still searching for a permanent, comfortable and serviceable position that is to be controlled, managed, flexible, accessible and continually up-to-date with the wider university structure. As most academic and business institutions and training centres around the world have adopted the e-learning concept and technology in order to create, deliver and manage their learning materials through the web, it has become the focus of investigation. However, management, monitoring and collaboration between these institutions and centres are limited. Existing technologies such as grid, web services and agents are promising better results. In this research a new architecture has been developed and adopted to make the e-learning environment more dynamic and scalable by dividing it into regional data grids which are managed and monitored by agents. Multi-agent technology has been applied to integrate each regional data grid with others in order to produce an architecture which is more scalable, reliable, and efficient. The result we refer to as Regionally Distributed Architecture for Dynamic e-Learning Environment (RDADeLE). Our RDADeLE architecture is an agent-based grid environment which is composed of components such as learners, staff, nodes, regional grids, grid services and Learning Objects (LOs). These components are built and organised as a multi-agent system (MAS) using the Java Agent Development (JADE) platform. The main role of the agents in our architecture is to control and monitor grid components in order to build an adaptable, extensible, and flexible grid-based e-learning system. Two techniques have been developed and adopted in the architecture to build LOs' information and grid services. The first technique is the XML-based Registries Technique (XRT). In this technique LOs' information is built using XML registries to be discovered by the learners. The registries are written in Dublin Core Metadata Initiative (DCMI) format. The second technique is the Registered-based Services Technique (RST). In this technique the services are grid services which are built using agents. The services are registered with the Directory Facilitator (DF) of a JADE platform in order to be discovered by all other components. All components of the RDADeLE system, including grid service, are built as a multi-agent system (MAS). Each regional grid in the first technique has only its own registry, whereas in the second technique the grid services of all regional grids have to be registered with the DF. We have evaluated the RDADeLE system guided by both techniques by building a simulation of the prototype. The prototype has a main interface which consists of the name of the system (RDADeLE) and a specification table which includes Number of Regional Grids, Number of Nodes, Maximum Number of Learners connected to each node, and Number of Grid Services to be filled by the administrator of the RDADeLE system in order to create the prototype. Using the RST technique shows that the RDADeLE system can be built with more regional grids with less memory consumption. Moreover, using the RST technique shows that more grid services can be registered in the RDADeLE system with a lower average search time and the search performance is increased compared with the XRT technique. Finally, using one or both techniques, the XRT or the RST, in the prototype does not affect the reliability of the RDADeLE system.Royal Commission for Jubail and Yanbu - Directorate General For Jubail Project Kingdom of Saudi Arabi

    Trade Union News No. 3, 1968

    Get PDF

    Multi-voxel fMRI analysis using an high throughput grid framework

    Get PDF
    Mestrado em Engenharia Biomédica - Instrumentação, Sinal e ImagemO presente trabalho apresenta uma nova abordagem à análise de imagens de RMf do cérebro, especificamente a utilização de medidas associativas na análise de séries temporais de RMf. Este tipo específico de análise, computacionalmente intensivo, requer recursos que normalmente não se encontram disponíveis em ambientes clínicos. Redes Grid é um novo paradigma de computação distribuída de elevada performance que pode ser utilizado para potenciar a utilização deste tipo de análise, disponibilizando a capacidade de computação necessária. Implementouse um framework que permite a utilização de uma infraestrutura Grid para correr este tipo de análise de forma transparente, viabilizando a sua utilização em ambientes clínicos, onde o tempo é um factor crítico. ABSTRACT: This work, introduces a new approach to fMRI brain image analysis, namely multivoxel fMRI association analysis. The problem associated with this type of approach is that requires a large computing capacity that is not normally available at clinical sites. To enable this specific type of analysis we are required to use High Performance Computing paradigms. In this context we analysed the use of Grid computing and implemented a framework that allows running the multivoxel fMRI association analysis using a grid infrastructure resources. The use of this framework makes this type of analysis usable in clinical environments where time constraints can have a vital importance
    corecore