20 research outputs found

    Congenial Web Search : A Conceptual Framework for Personalized, Collaborative, and Social Peer-to-Peer Retrieval

    Get PDF
    Traditional information retrieval methods fail to address the fact that information consumption and production are social activities. Most Web search engines do not consider the social-cultural environment of users' information needs and the collaboration between users. This dissertation addresses a new search paradigm for Web information retrieval denoted as Congenial Web Search. It emphasizes personalization, collaboration, and socialization methods in order to improve effectiveness. The client-server architecture of Web search engines only allows the consumption of information. A peer-to-peer system architecture has been developed in this research to improve information seeking. Each user is involved in an interactive process to produce meta-information. Based on a personalization strategy on each peer, the user is supported to give explicit feedback for relevant documents. His information need is expressed by a query that is stored in a Peer Search Memory. On one hand, query-document associations are incorporated in a personalized ranking method for repeated information needs. The performance is shown in a known-item retrieval setting. On the other hand, explicit feedback of each user is useful to discover collaborative information needs. A new method for a controlled grouping of query terms, links, and users was developed to maintain Virtual Knowledge Communities. The quality of this grouping represents the effectiveness of grouped terms and links. Both strategies, personalization and collaboration, tackle the problem of a missing socialization among searchers. Finally, a concept for integrated information seeking was developed. This incorporates an integrated representation to improve effectiveness of information retrieval and information filtering. An integrated information retrieval process explores a virtual search network of Peer Search Memories in order to accomplish a reputation-based ranking. In addition, the community structure is considered by an integrated information filtering process. Both concepts have been evaluated and shown to have a better performance than traditional techniques. The methods presented in this dissertation offer the potential towards more transparency, and control of Web search

    Advanced languages and techniques for trust negotiation.

    Get PDF
    The Web is quickly shifting from a document browsing and delivery system to a hugely complex ecosystem of interconnected online applications. A relevant portion of these applications dramatically increase the number of users required to dynamically authenticate themselves and to, on the other hand, to identify the service they want to use. In order to manage interactions among such users/services is required a flexible but powerful mechanism. Trust management, and in particular trust negotiation techniques, is a reasonable solution. In this work we present the formalization of the well known trust negotiation framework Trust-X, of a rule-based policy definition language, called X-RNL. Moreover, we present the extension of both the framework and of the language to provide advanced trust negotiation architectures, namely negotiations among groups. We also provide protocols to adapt trust negotiations to mobile environments, specifically, we present protocols allowing a trust negotiation to be executed among several, distinct, sessions while still preserving its security properties. Such protocols have also been extended to provides the capability to migrate a ongoing trust negotiation among a set of known, reliable, subjects. Finally, we present the application of the previously introduced trust negotiation techniques into real world scenarios: online social networks, critical infrastructures and cognitive radio networks

    A holistic architecture using peer to peer (P2P) protocols for the internet of things and wireless sensor networks

    Get PDF
    Wireless Sensor Networks (WSNs) interact with the physical world using sensing and/or actuation. The wireless capability of WSN nodes allows them to be deployed close to the sensed phenomenon. Cheaper processing power and the use of micro IP stacks allow nodes to form an “Internet of Things” (IoT) integrating the physical world with the Internet in a distributed system of devices and applications. Applications using the sensor data may be located across the Internet from the sensor network, allowing Cloud services and Big Data approaches to store and analyse this data in a scalable manner, supported by new approaches in the area of fog and edge computing. Furthermore, the use of protocols such as the Constrained Application Protocol (CoAP) and data models such as IPSO Smart Objects have supported the adoption of IoT in a range of scenarios. IoT has the potential to become a realisation of Mark Weiser’s vision of ubiquitous computing where tiny networked computers become woven into everyday life. This presents the challenge of being able to scale the technology down to resource-constrained devices and to scale it up to billions of devices. This will require seamless interoperability and abstractions that can support applications on Cloud services and also on node devices with constrained computing and memory capabilities, limited development environments and requirements on energy consumption. This thesis proposes a holistic architecture using concepts from tuple-spaces and overlay Peer-to-Peer (P2P) networks. This architecture is termed as holistic, because it considers the flow of the data from sensors through to services. The key contributions of this work are: development of a set of architectural abstractions to provide application layer interoperability, a novel cache algorithm supporting leases, a tuple-space based data store for local and remote data and a Peer to Peer (P2P) protocol with an innovative use of a DHT in building an overlay network. All these elements are designed for implementation on a resource constrained node and to be extensible to server environments, which is shown in a prototype implementation. This provides the basis for a new P2P holistic approach that will allow Wireless Sensor Networks and IoT to operate in a self-organising ad hoc manner in order to deliver the promise of IoT

    A framework for the visualisation and control of ubiquitous devices, services and digital content

    Get PDF
    The General Organization for Technical Education and Vocational Training, Riyadh, Saudi Arabia, has developed a special feeding program for the students at its institutions. The effects of this program on the nutritional and health status of these students have not been evaluated yet, and since no published dietary research has been performed on Technical and Vocational young adult male students, the present work was undertaken to investigate the nutritional status of this community in Riyadh, Kingdom of Saudi Arabia. After a pilot survey, it was decided to use a selfcompleted questionnaire combined with personal interview to investigate the nutritional status of 690 students randomly selected from the study population. Dietary data was collected by two methods: usual weekly intakes "diet history" and actual daily intakes "diet diary". The nutrient intakes were calculated using the unilever Dietary Analysis Program (UNIDAP). The statistical Package for the social Science (SPSS/PC+) was employed to analyse the data; statistical significance of relationships between certain sets of data was determined by chi-square analysis. Some general factors affecting the nutritional status of these students were identified, their nutritional habits and attitudes were investigated, and the average daily intakes of energy, the macronutrients, and selected micronutrients were calculated. The main results of this study shows that the majority of the study population are adolescent, moderately active individuals, and have lower than the standard range of the Body Mass Index; anaemia is the most stated health problem; meal-skipping and eating between meals are common habits amongst the students. Regarding nutrient intake, there was an energy, polyunsaturated fat, and vitamin C deficiency; adequate intake of saturated fat, dietary fibre, retinol, and zinc; more than adequate intake of protein, total fat, cholesterol, thiamin, riboflavin, calcium, and iron. Recommendations are given which aim to improve the nutrition of technical and vocational students

    Interoperability between information systems of the results of clinical analysis and electronic record of the patient

    Get PDF
    The issue of interoperability between institutions in underdeveloped countries always presents good opportunities for science to contribute to substantial improvements in real-world issues. Basic support systems, such as health institutions, are among those that can benefit most from scientific advances. This paper reports an analysis made on the lack of interoperability between health institutions, specifically with regard to the interaction between physicians' offices and clinical analysis laboratory. This research was validated with a real practical use case that is presented in this paper. In order to make the information stored in different computer applications of the health information system (HIS), more specifically in the Hospital Center Dr. Ayres de Menezes, in São Tomé and Príncipe, interoperable, two distinct applications were developed, Patient Management System (PMS) and Clinical Analysis Laboratory Management System (LMS) to implement interoperability between them. In this way, take advantage of the interoperability logic implemented between these two applications and later integrate other systems. The PMS requests medical exams through your Medical Consultation panel. The second system, LMS receives the exam request and after the exams are processed and validated, the results are sent to the requesting system. To make the interoperability service effective, the SOAP protocol was used, which allowed the exchange of information synchronously between these two applications, allowing for faster transactions of patients' pathological data, and greater confidentiality of this same information. And as the work progressed, we felt the need to create a functional prototype with REST to meet the cloud model proposal.A questão da interoperabilidade entre instituições em países subdesenvolvidos sempre apresenta boas oportunidades para a ciência contribuir para melhorias substanciais em questões do mundo real. Os sistemas de apoio básico, como as instituições de saúde, estão entre os que mais podem se beneficiar dos avanços científicos. Este trabalho relata uma análise feita sobre a falta de interoperabilidade entre instituições de saúde, especificamente no que diz respeito à interação entre consultórios médicos e laboratórios de análises clínicas. Esta pesquisa foi validada com um caso de uso prático real que é apresentado neste trabalho. De forma a tornar a informação armazenada nas diferentes aplicações informáticas do sistema nacional de saúde (SIS), mais concretamente no Centro Hospitalar Dr. Ayres de Menezes, em São Tomé e Príncipe, interoperáveis, foram desenvolvidas duas aplicações distintas, Sistema de Gestão de Pacientes (SGP) e Sistema de Gestão do Laboratório de Análises Clínicas (SGL) para implementar a interoperabilidade entre eles. Desta forma, aproveitar a lógica implementada entre estas duas aplicações e posteriormente integrar outros sistemas. O SGP solicita exames médicos através do seu painel de Consulta Médica. O segundo sistema, o SGL, recebe a solicitação dos exames e após os exames serem processados e validados, os resultados são enviados ao sistema solicitante. Para tornar o serviço de interoperabilidade efetivo, foi utilizado o protocolo SOAP, que permitiu a troca de informações de forma síncrona entre essas duas aplicações. Por outro lado, sentimos a necessidade de criar um protótipo funcional com REST para atender a proposta do modelo em nuvem

    Towards a Framework for DHT Distributed Computing

    Get PDF
    Distributed Hash Tables (DHTs) are protocols and frameworks used by peer-to-peer (P2P) systems. They are used as the organizational backbone for many P2P file-sharing systems due to their scalability, fault-tolerance, and load-balancing properties. These same properties are highly desirable in a distributed computing environment, especially one that wants to use heterogeneous components. We show that DHTs can be used not only as the framework to build a P2P file-sharing service, but as a P2P distributed computing platform. We propose creating a P2P distributed computing framework using distributed hash tables, based on our prototype system ChordReduce. This framework would make it simple and efficient for developers to create their own distributed computing applications. Unlike Hadoop and similar MapReduce frameworks, our framework can be used both in both the context of a datacenter or as part of a P2P computing platform. This opens up new possibilities for building platforms to distributed computing problems. One advantage our system will have is an autonomous load-balancing mechanism. Nodes will be able to independently acquire work from other nodes in the network, rather than sitting idle. More powerful nodes in the network will be able use the mechanism to acquire more work, exploiting the heterogeneity of the network. By utilizing the load-balancing algorithm, a datacenter could easily leverage additional P2P resources at runtime on an as needed basis. Our framework will allow MapReduce-like or distributed machine learning platforms to be easily deployed in a greater variety of contexts

    Prototyping a peer-to-peer session initiation protocol user agent

    Get PDF
    The Session Initiation Protocol (SIP) has in recent years become a popular protocol for the exchange of text, voice and video over IP networks. This thesis proposes the use of a class of structured peer to peer protocols - commonly known as Distributed Hash Tables (DHTs) - to provide a SIP overlay with services such as end-point location management and message relay, in the absence of traditional, centralised resources such as SIP proxies and registrars. A peer-to-peer layer named OverCord, which allows the interaction with any specific DHT protocol via the use of appropriate plug-ins, was designed, implemented and tested. This layer was then incorporated into a SIP user agent distributed by NIST (National Institute of Standards and Technology, USA). The modified user agent is capable of reliably establishing text, audio and video communication with similarly modified agents (peers) as well as conventional, centralized SIP overlays

    Designing peer-to-peer overlays:a small-world perspective

    Get PDF
    The Small-World phenomenon, well known under the phrase "six degrees of separation", has been for a long time under the spotlight of investigation. The fact that our social network is closely-knitted and that any two people are linked by a short chain of acquaintances was confirmed by the experimental psychologist Stanley Milgram in the sixties. However, it was only after the seminal work of Jon Kleinberg in 2000 that it was understood not only why such networks exist, but also why it is possible to efficiently navigate in these networks. This proved to be a highly relevant discovery for peer-to-peer systems, since they share many fundamental similarities with the social networks; in particular the fact that the peer-to-peer routing solely relies on local decisions, without the possibility to invoke global knowledge. In this thesis we show how peer-to-peer system designs that are inspired by Small-World principles can address and solve many important problems, such as balancing the peer load, reducing high maintenance cost, or efficiently disseminating data in large-scale systems. We present three peer-to-peer approaches, namely Oscar, Gravity, and Fuzzynet, whose concepts stem from the design of navigable Small-World networks. Firstly, we introduce a novel theoretical model for building peer-to-peer systems which supports skewed node distributions and still preserves all desired properties of Kleinberg's Small-World networks. With such a model we set a reference base for the design of data-oriented peer-to-peer systems which are characterized by non-uniform distribution of keys as well as skewed query or access patterns. Based on this theoretical model we introduce Oscar, an overlay which uses a novel scalable network sampling technique for network construction, for which we provide a rigorous theoretical analysis. The simulations of our system validate the developed theory and evaluate Oscar's performance under typical conditions encountered in real-life large-scale networked systems, including participant heterogeneity, faults, as well as skewed and dynamic load-distributions. Furthermore, we show how by utilizing Small-World properties it is possible to reduce the maintenance cost of most structured overlays by discarding a core network connectivity element – the ring invariant. We argue that reliance on the ring structure is a serious impediment for real life deployment and scalability of structured overlays. We propose an overlay called Fuzzynet, which does not rely on the ring invariant, yet has all the functionalities of structured overlays. Fuzzynet takes the idea of lazy overlay maintenance further by eliminating the need for any explicit connectivity and data maintenance operations, relying merely on the actions performed when new Fuzzynet peers join the network. We show that with a sufficient amount of neighbors, even under high churn, data can be retrieved in Fuzzynet with high probability. Finally, we show how peer-to-peer systems based on the Small-World design and with the capability of supporting non-uniform key distributions can be successfully employed for large-scale data dissemination tasks. We introduce Gravity, a publish/subscribe system capable of building efficient dissemination structures, inducing only minimal dissemination relay overhead. This is achieved through Gravity's property to permit non-uniform peer key distributions which allows the subscribers to be clustered close to each other in the key space where data dissemination is cheap. An extensive experimental study confirms the effectiveness of our system under realistic subscription patterns and shows that Gravity surpasses existing approaches in efficiency by a large margin. With the peer-to-peer systems presented in this thesis we fill an important gap in the family of structured overlays, bringing into life practical systems, which can play a crucial role in enabling data-oriented applications distributed over wide-area networks

    Economic-based Distributed Resource Management and Scheduling for Grid Computing

    Full text link
    Computational Grids, emerging as an infrastructure for next generation computing, enable the sharing, selection, and aggregation of geographically distributed resources for solving large-scale problems in science, engineering, and commerce. As the resources in the Grid are heterogeneous and geographically distributed with varying availability and a variety of usage and cost policies for diverse users at different times and, priorities as well as goals that vary with time. The management of resources and application scheduling in such a large and distributed environment is a complex task. This thesis proposes a distributed computational economy as an effective metaphor for the management of resources and application scheduling. It proposes an architectural framework that supports resource trading and quality of services based scheduling. It enables the regulation of supply and demand for resources and provides an incentive for resource owners for participating in the Grid and motives the users to trade-off between the deadline, budget, and the required level of quality of service. The thesis demonstrates the capability of economic-based systems for peer-to-peer distributed computing by developing users' quality-of-service requirements driven scheduling strategies and algorithms. It demonstrates their effectiveness by performing scheduling experiments on the World-Wide Grid for solving parameter sweep applications
    corecore