Spelling suggestions: "subject:"[een] RESOURCE DISCOVERY"" "subject:"[enn] RESOURCE DISCOVERY""
11 |
Internet FishLaMacchia, Brian A. 01 August 1996 (has links)
I have invented "Internet Fish," a novel class of resource-discovery tools designed to help users extract useful information from the Internet. Internet Fish (IFish) are semi-autonomous, persistent information brokers; users deploy individual IFish to gather and refine information related to a particular topic. An IFish will initiate research, continue to discover new sources of information, and keep tabs on new developments in that topic. As part of the information-gathering process the user interacts with his IFish to find out what it has learned, answer questions it has posed, and make suggestions for guidance. Internet Fish differ from other Internet resource discovery systems in that they are persistent, personal and dynamic. As part of the information-gathering process IFish conduct extended, long-term conversations with users as they explore. They incorporate deep structural knowledge of the organization and services of the net, and are also capable of on-the-fly reconfiguration, modification and expansion. Human users may dynamically change the IFish in response to changes in the environment, or IFish may initiate such changes itself. IFish maintain internal state, including models of its own structure, behavior, information environment and its user; these models permit an IFish to perform meta-level reasoning about its own structure. To facilitate rapid assembly of particular IFish I have created the Internet Fish Construction Kit. This system provides enabling technology for the entire class of Internet Fish tools; it facilitates both creation of new IFish as well as additions of new capabilities to existing ones. The Construction Kit includes a collection of encapsulated heuristic knowledge modules that may be combined in mix-and-match fashion to create a particular IFish; interfaces to new services written with the Construction Kit may be immediately added to "live" IFish. Using the Construction Kit I have created a demonstration IFish specialized for finding World-Wide Web documents related to a given group of documents. This "Finder" IFish includes heuristics that describe how to interact with the Web in general, explain how to take advantage of various public indexes and classification schemes, and provide a method for discovering similarity relationships among documents.
|
12 |
Framework para construção de aplicações adaptativas em nuvem multimídiaMartins, Rodrigo Ferreira 10 September 2015 (has links)
Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-06-07T14:54:57Z
No. of bitstreams: 1
rodrigoferreiramartins.pdf: 1789352 bytes, checksum: 9d2bb55856b7bf33c9dd2abbd5125259 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-06-07T14:57:16Z (GMT) No. of bitstreams: 1
rodrigoferreiramartins.pdf: 1789352 bytes, checksum: 9d2bb55856b7bf33c9dd2abbd5125259 (MD5) / Made available in DSpace on 2017-06-07T14:57:16Z (GMT). No. of bitstreams: 1
rodrigoferreiramartins.pdf: 1789352 bytes, checksum: 9d2bb55856b7bf33c9dd2abbd5125259 (MD5)
Previous issue date: 2015-09-10 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Atualmente os tradicionais computadores de mesa e laptops estão perdendo mercado para dispositivos mais pervasivos, como smartphones, tablets e wearables que em sua grande maioria têm limitações de hardware devido às restrições de tamanho, peso e duração da bateria. As aplicações mais populares nos dias de hoje envolvem multimídia e algumas vezes consomem mais recursos do que esses dispositivos são capazes de suportar,
por exemplo, realidade aumentada, jogos e o uso de computação para estender a capacidade cognitiva como reconhecimento facial e de fala, processamento de linguagem natural,aprendizagem de máquina, planejamento e tomada de decisão. Nesse contexto, mesmo a já tão popular cloud computing não serve como solução por si só, uma vez que a latência e o jitter criam uma restrição para aplicações interativas. Este trabalho propõe um framework para a construção de aplicações multimídia adaptativas que, no lado cliente, permite explorar recursos dos dispositivos alcançáveis, sejam móveis ou não, a fim de
tornar as aplicações mais imersivas. Não apenas os recursos quantitativos, mas também os qualitativos são levados em consideração para distribuir as tarefas. Quanto à nuvem, a proposta apropria-se da ideia de edge cloud computing para aumentar a Qualidade de Serviço (QoS) e permitir que regras de negócio também sejam levadas em consideração durante a distribuição das tarefas, bem como na sintonização do serviço. / Currently traditional desktop computers and laptops are losing market share to more
pervasive devices such as smartphones, tablets and wearables that usually have hardware
limitations due to restrictions on size, weight, and battery life. The most popular applications
today involve multimedia and sometimes consume more resources than these
devices are capable of supporting, for example, augmented reality, games, and the use of
computing to extend the cognitive ability as facial and speech recognition, natural language
processing, machine learning, planning and decision making. In this context, even
the widespread cloud computing does not serve as a single-handed solution, since the
latency and jitter create a restriction for interactive applications. This work proposes a
framework for building adaptive multimedia applications, which, on the client side, allows
for exploring resources from reachable devices, whether mobile or not, in order to make
applications more immersive. Not only quantitative, but also qualitative resources are
considered to distribute tasks. Regarding the cloud side, the proposal appropriates the
idea of edge cloud computing to increase Quality of Service (QoS) and allow business rules
to be also taken into account during the distribution of tasks and service tuning.
|
13 |
[en] A PROTOCOL FOR RESOURCE DISCOVERY AND SELECTION IN MOBILE AD HOC GRIDS / [pt] UM PROTOCOLO PARA DESCOBERTA E SELEÇÃO DE RECURSOS EM GRADES MÓVEIS AD HOCLUCIANA DOS SANTOS LIMA 21 December 2007 (has links)
[pt] Nos últimos anos, o uso de dispositivos móveis em grades
computacionais
tem sido alvo de crescente investigação. Entretanto, um
problema mais desafiador,
referente ao estabelecimento dinâmico de grades móveis,
baseadas
exclusivamente em redes sem fio ad hoc, ainda tem sido
pouco investigado. Uma
contribuição desta tese é a proposta de uma arquitetura de
software específica para
grades móveis, que pode ser igualmente aplicável a redes
sem fio infraestruturadas
e ad hoc. Em grades fixas, a responsabilidade de prover um
serviço
computacional é compartilhada entre dispositivos com
relativa abundância de
recursos, se comparadas a grades móveis. Nestas últimas, é
interessante que a
descoberta e a seleção de recursos para execução de
tarefas sejam tratadas
conjuntamente, de modo a promover a seleção automática dos
dispositivos com
maior disponibilidade de recursos, considerando-se os
requisitos da aplicação.
Entretanto, tais elementos têm sido tradicionalmente
tratados em separado na
literatura relacionada a grades móveis e, em grande parte
das abordagens
existentes, assume-se que a seleção de recursos seja
executada de forma manual
pelos usuários da grade móvel. Esta tese propõe, como uma
outra contribuição,
um protocolo que integra as fases de descoberta e seleção
automática de recursos
em grades móveis, permitindo que a provisão de serviços
computacionais seja
escalonada entre os dispositivos com maior disponibilidade
dos recursos
requeridos pelo serviço. Devido à característica dinâmica
dos recursos que
correspondem às requisições dos usuários em uma grade
móvel (por exemplo,
tempo de CPU livre e memória disponível), o protocolo
baseia-se unicamente no
envio, sob demanda, de requisições via broadcast. No
entanto, principalmente em
redes sem fio ad hoc de saltos múltiplos, essa estratégia
pode acarretar uma
sobrecarga nos dispositivos envolvidos, tanto na difusão
de requisições quanto no
encaminhamento de respostas. Uma terceira contribuição
desta tese é o
desenvolvimento de um mecanismo que permite reduzir a
sobrecarga, devido à
difusão de mensagens de resposta, por meio da supressão de
respostas excedentes ao longo da rede. O mecanismo, embora
implementado no contexto do protocolo
proposto nesta tese, pode ser aplicado também a outros
protocolos de descoberta
baseados no envio de requisições via broadcast. Os
resultados experimentais,
obtidos em redes de testes e em plataformas de simulação,
mostram que o
protocolo proposto provê um balanceamento de carga
eficiente entre os
dispositivos, mediante o aumento do número de requisições.
Além disso, pode-se
observar que o mecanismo de supressão de respostas é
escalável no que diz
respeito ao crescimento do número de dispositivos, em
comparação com
protocolos de descoberta baseados puramente no envio de
requisições por
broadcast em redes sem fio ad hoc. / [en] In the last few years, the use of mobile devices in
computational grids has
seen a growing interest. Nevertheless, a more challenging
issue, the dynamic
establishment of mobile grids on wireless ad hoc networks,
has been so far only
partially addressed. The first contribution of this thesis
is the proposal of a
software architecture for mobile grids that can be used
for both infrastructured and
ad hoc wireless networks. In the execution of conventional
applications in grids,
the responsibility to provide the service is shared among
the most resourceful
mobile devices. In mobile grids, it is fundamental that
resource discovery and
selection of resources are jointly handled. This calls for
a mechanism that
promotes the automatic selection of the best resource
providers amongst the
discovered nodes, taking into account the requirements of
the application.
Discovery and selection, however, have been traditionally
handled separately and
in most approaches the selection of resources and services
requires explicit
intervention by the user of the mobile grid. As a second
contribution of this thesis,
we propose a protocol that integrates the phases of
resource discovery and
automatic selection in mobile grids, allowing that
computational resource
provisioning is scheduled among the most resourceful
nodes. Due to the dynamics
of the resources needed in a mobile grid (for example,
free CPU time and
available memory), the protocol is based solely on demand-
driven broadcasts.
However, mainly in multihop ad hoc wireless networks, this
strategy can incur in
overhead at the involved devices, due to the diffusion of
requests and replies. A
third contribution of this thesis is the development of a
mechanism that allows to
reduce this overhead by means of the suppression of
redundant replies in the
network. The mechanism has been implemented in the context
of the proposal
protocol, but can be applied as well to other query-based
discovery protocols
based on broadcasts. The experimental results obtained
from executions in a
testbed and through simulations show that the proposed
protocol provides
efficient load balancing between devices with an
increasing number of requests. Moreover, it can be
observed that the mechanism for suppression of replies
scales
well with respect to an increasing number of devices when
compared to other
discovery protocols in wireless ad hoc networks that are
purely based on requests
via broadcast.
|
14 |
Efficient super-peer-based coordinated service provisionLiu, M. (Meirong) 05 April 2014 (has links)
Abstract
Peer-to-Peer (P2P) networks have been applied in many applications for sharing resources such as storage space, media files or network bandwidth. Their main benefits include decentralization, self-organization, and scalability. Moreover, P2P technologies are evolving towards hybrid systems, where P2P networks are used in those parts of a larger system to
leverage the decentralization most efficiently. The examples include cloud computing, where P2P networks are used in sharing computing resources, and Machine-to-Machine communication, where P2P networks are used for resource discovery.
In super-peer overlays, the nodes are either regular nodes or super nodes that are located higher in the node hierarchy. This type of overlay explores the heterogeneity of peers in the overlay network to enable applications to run more efficiently. Leveraging the advantage of a super-peer overlay for service provision is an important issue. This thesis contributes to the research and development of super-peer-based coordination service provision from three aspects.
Firstly, a super-peer-based coordinated service provision framework is proposed to coordinate different service groups and service peers in resource sharing, aiming to enable service groups to adapt to dynamic service demands. The proposed framework is evaluated using the following performance metrics: service response time, scalability, robustness, and communication traffic, in comparison to related work.
Secondly, an efficient algorithm for rapidly constructing a robust super-peer overlay is proposed. The algorithm introduces a super-peer candidate based method for super-peer selection and a two-hop search method for finding client peers. Performance evaluation takes into account the convergence time of building a super-peer overlay, communication overhead, scalability, robustness. A comparison to related work is also conducted.
Thirdly, the architecture of distributed resource discovery based on P2P overlay for Machine-to-Machine service provision is proposed. The architecture supports heterogeneous devices using different communication protocols in resource registration and discovery for achieving interoperability. As a part of the thesis, a functional real-world prototype is implemented and verified with a simple demonstration. Preliminary evaluation on the prototype indicates that caching can improve the response time of resource lookup dramatically. / Tiivistelmä
Vertaisverkkoja on hyödynnetty resurssien kuten tallennustilan, mediasisältöjen ja tietoliikennekapasiteetin jakamisessa. Niiden etuja perinteisiin keskitettyihin järjestelmiin verrattuna ovat hajautettu arkkitehtuuri, itseorganisoituvuus ja skaalautuvuus. Vertaisverkkoja käytetään yhä useammin järjestelmän osien toteuttamisessa, joissa hajautettujen resurssien hyödyntämisellä saavutetaan suurimmat edut. Esimerkkeinä ovat pilvilaskenta, jossa vertaisverkkoa käytetään laskentaresurssien jakamiseen, sekä laitteidenvälinen kommunikaatio, jossa vertaisverkkoja käytetään resurssien löytämiseen.
Hierarkkisissa vertaisverkoissa niihin kytkeytyneet laitteet jaotellaan laitteiden kapasiteetin mukaan tavallisiin noodeihin ja näiden yläpuolella hierarkiassa toimiviin ylinoodeihin. Ylinoodeihin perustuva vertaisverkon kuoriverkko hyödyntää yksittäisten verkon noodien eli laitteiden erilaisuutta, jotta verkko voisi toimia tehokkaammin. Tämän ominaisuuden hyödyntäminen on erityisen tärkeää palvelun tarjonnassa. Tässä työssä on tutkittu ylinoodeihin perustuvan vertaisverkon palvelun tarjontaa kolmesta näkökulmasta.
Ensimmäiseksi, työssä ehdotetaan ylinoodien koordinoimaa palveluntarjonnan toimintamallia resurssien jakamisessa. Toimintamallissa palveluryhmät ja palvelunoodit adaptoituvat dynaamisesti palvelupyyntöjen tarpeisiin. Tämän ratkaisun suorituskykyä arvioidaan palvelun vasteajan, skaalautuvuuden, robustisuuden ja tietoliikennemäärän suhteen verrattuna aiempiin ratkaisuihin.
Toiseksi, työssä esitellään tehokas algoritmi robustin ylinoodikuoriverkon nopeaan muodostamiseen. Algoritmi käyttää ylinoodiehdokasmenetelmää ja kahden hypyn hakumetodia asiakasnoodien etsimisessä. Suorituskyvyn arvioinnissa otetaan huomioon ylinoodikuoriverkon konvergoitumisaika, tietoliikenneviestinnän aiheuttama ylimääräinen kuormitus, sekä järjestelmän skaalautuvuus ja robustisuus. Esitetyn algoritmin tehokkuutta arvioidaan vertaamalla näitä suorituskykymittareita aiempiin ratkaisuihin.
Kolmanneksi, työssä esitellään hajautettu resurssihakemiston arkkitehtuuri, joka perustuu laitteiden välisen kuoriverkon palveluntarjontaan. Arkkitehtuuri tukee erilaisten laitteiden ja niiden käyttämien protokollien resurssien rekisteröintiä ja löytämistä yhteensopivuuden saavuttamiseksi. Väitöskirjatyön osana on toteutettu toimiva prototyyppi, jonka toimivuus on todennettu demonstraation avulla. Prototyypillä tehdyt mittaukset antavat perustellun syyn olettaa, että esitetyn ratkaisun mukainen välimuistin käyttö voi merkittävästi lyhentää resurssien etsimisen vasteaikaa.
|
Page generated in 0.043 seconds