Melchioris Cani episcopi canariensis ex Ordine Praedicatorum, opera,in duo volumina distributa, in hoc primum editione clarius divisa, et praefatione.

UANL

Alphabetum juridicum, canonicum, civile, theoricum, practicum, morale, atque politicum . Quae in hoc opere contineantur, vocabulorum elenchus utrique volumini praefixus indicat.

UANL

Scripturae sacrae cursus completus, ex commentariis omnium perfectissimis ubique habitis, et a magna parte episcoporum necnon theologorum Europae catholicae, universim ad hoc ...

UANL

Aerarium eangelicum hoc est evangelioirum totius anni in omnes dominicas et ferias quadragesimae per singulos versus in sensu litterali, morali et anagogico elucidationes...

UANL

Aerarium divini amoris locupletissimum: hoc est discursus variiexquisiti in quibus per tractatus ordine digestos ad verbum dei fructuose et faciliter praedicandum de passione domini nostri Jesu Christi et de sacratissima eucharistia materiae morales subministrantur et ad plenum digeruntur

UANL

Novel multicast protocols in ad-hoc networks

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal

Virtual (dis) connectivities : mobile intimacy and presence for women in long distance relationships

Nous vivons dans une époque où la mobilité internationale est une pratique très courante; ainsi, de plus en plus de partenaires doivent maintenir leurs relations à distance. Le phénomène va de pair avec le développement des nouvelles technologies, qui introduisent de nouvelles formes et de pratiques pour maintenir l’intimité. Cela soulève des questions sur les pratiques de connexion (ou déconnexion) lorsque les couples sont séparés par la distance et le temps. Ce mémoire propose d’explorer comment les femmes dans des relations amoureuses à distance utilisent divers modes d’expression (visuels, textuels, oraux et tactiles) ainsi que plusieurs sens à travers de multiples technologies mobiles, qui lui permettent de reconstruire la présence et l’intimité avec l’autre. Inspiré par le new mobilities paradigm (Sheller & Urry, 2006), ainsi que les concepts de mobile intimacy (Hjorth & Lim, 2012; Elliott & Urry, 2010) et la présence imaginée (Chayko, 2002; Elliott & Urry, 2010), je propose les notions de (dé) connectivité virtuelle, le lieu virtuel, ainsi que la présence/absence technologique. Utilisant une approche méthodologique mixte, venant des données d’entrevues semi-dirigées, de l’autoethnographie, de la recherche création et de journaux de bord multimédias, certaines pratiques de contrôle et de surveillance, des formes émergentes de travail, l’immédiateté et la réciprocité émergent dans une époque d’interconnectivité.

Cooperative caching techniques for mobile ad hoc networks

Data caching can remarkably improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. The cache placement problem minimizes total data access cost in ad hoc networks with multiple data items. The ad hoc networks are multi hop networks without a central base station and are resource constrained in terms of channel bandwidth and battery power. By data caching the communication cost can be reduced in terms of bandwidth as well as battery energy. As the network node has limited memory the problem of cache placement is a vital issue. This paper attempts to study the existing cooperative caching techniques and their suitability in mobile ad hoc networks.

A key based cache replacement policy for cooperative caching in mobile ad hoc networks

Cooperative caching in mobile ad hoc networks aims at improving the efficiency of information access by reducing access latency and bandwidth usage. Cache replacement policy plays a vital role in improving the performance of a cache in a mobile node since it has limited memory. In this paper we propose a new key based cache replacement policy called E-LRU for cooperative caching in ad hoc networks. The proposed scheme for replacement considers the time interval between the recent references, size and consistency as key factors for replacement. Simulation study shows that the proposed replacement policy can significantly improve the cache performance in terms of cache hit ratio and query delay

A virtual backbone based approach for cooperative caching in mobile ad hoc networks

Cache look up is an integral part of cooperative caching in ad hoc networks. In this paper, we discuss a cooperative caching architecture with a distributed cache look up protocol which relies on a virtual backbone for locating and accessing data within a cooperate cache. Our proposal consists of two phases: (i) formation of a virtual backbone and (ii) the cache look up phase. The nodes in a Connected Dominating Set (CDS) form the virtual backbone. The cache look up protocol makes use of the nodes in the virtual backbone for effective data dissemination and discovery. The idea in this scheme is to reduce the number of nodes involved in cache look up process, by constructing a CDS that contains a small number of nodes, still having full coverage of the network. We evaluated the effect of various parameter settings on the performance metrics such as message overhead, cache hit ratio and average query delay. Compared to the previous schemes the proposed scheme not only reduces message overhead, but also improves the cache hit ratio and reduces the average delay

A location aided cooperative caching protocol for mobile ad hoc networks

Cooperative caching is an attractive solution for reducing bandwidth demands and network latency in mobile ad hoc networks. Deploying caches in mobile nodes can reduce the overall traffic considerably. Cache hits eliminate the need to contact the data source frequently, which avoids additional network overhead. In this paper we propose a data discovery and cache management policy for cooperative caching, which reduces the caching overhead and delay by reducing the number of control messages flooded in to the network. A cache discovery process based on location of neighboring nodes is developed for this. The cache replacement policy we propose aims at increasing the cache hit ratio. The simulation results gives a promising result based on the metrics of studies

PEER TO PEER CACHE RESOLUTION MECHANISM FOR MOBILE AD HOC NETWORKS

In this paper we investigate the problem of cache resolution in a mobile peer to peer ad hoc network. In our vision cache resolution should satisfy the following requirements: (i) it should result in low message overhead and (ii) the information should be retrieved with minimum delay. In this paper, we show that these goals can be achieved by splitting the one hop neighbours in to two sets based on the transmission range. The proposed approach reduces the number of messages flooded in to the network to find the requested data. This scheme is fully distributed and comes at very low cost in terms of cache overhead. The experimental results gives a promising result based on the metrics of studies.

Collaborative design procedures for architects and engineers

This book argues for novel strategies to integrate engineering design procedures and structural analysis data into architectural design. Algorithmic procedures that recently migrated into the architectural practice are utilized to improve the interface of both disciplines. Architectural design is predominately conducted as a negotiation process of various factors but often lacks rigor and data structures to link it to quantitative procedures. Numerical structural design on the other hand could act as a role model for handling data and robust optimization but it often lacks the complexity of architectural design. The goal of this research is to bring together robust methods from structural design and complex dependency networks from architectural design processes. The book presents three case studies of tools and methods that are developed to exemplify, analyze and evaluate a collaborative work flow.