Accessus ad altare et recessus, seu, preces ante et post celebrationem missae.

UANL

Institutiones philosophicae ad normam doctrinae Aristotelis et S. Thomae Aquinatis studiosae iuventuti

UANL

Institutionum elementarium philosophiae ad usum studiosae juventutis : complectens physicam generalem

Contenido: v. 1. Historiam philosophiae el elementa matheseos -- v. 2. Logicam ac metaphysicam -- v. 3. Physicam generalem -- v. 4. Physican particularem.

Brevis Expositio ad quatuor Petri Lombardi, Parisiensis episcopi et Sententiarum magistri libros

UANL

Institutiones theologicae ad usum seminariorum

Contenido: v. 1. De vera religione. De vera ecclesia. -- v. 2. De fide. De Trinitate. De incarnatione. De gratia. De sacramentis in genere. De baptismo. De confirmatione -- v. 3. De eucharistia. De poenitentia. De extrema-unctione -- v. 4. De ordine. De m

Resolutiones seu decreta authentica sacrae congregationis indulgentiis sacrisque reliquiis: praepositae ab anno 1668 ad annum 1861

Appendix seu altera collectio quamplurimorum summariorum indulgentiarum... (243 p.)

Tractatus de perfectione voluntatis testamento reqvisita, et de testamento perfecto ratione volvntatis, et imperfecto ratione solemnitatis, coepto, et non completo ob impedimentum testatori superveniens. Ad Iavoleni responsum in lege Si quis cvm testament

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

RSE, Développement durable et gouvernance d’entreprise Un jeu d’acteurs et de structures... ad hominem ou ad libitum du marché ?

Prenant l’illustration des États-Unis, la responsabilité sociale des entreprises et le développement durable intègrent progressivement le droit des sociétés. Si ce mouvement s’inscrit dans le sens de l’histoire, il a pris depuis quelques temps une intensité particulière. D’une part, la gouvernance d’entreprise montre des signes de remise en question du dogme de la primauté des actionnaires comme en témoigne la jurisprudence rendue à propos des devoirs des administrateurs et des dirigeants. D’autre part, les structures sociétaires récemment mises en place dans plusieurs État américains (Benefit Corporation et Flexible Purpose Corporation) constitue une étape fondamentale pour une contribution de nature différente du monde économique à la société lato sensu. Néanmoins, les conséquences de ces mutations demeurent à l’heure actuelle difficiles à évaluer tant elles font face à des obstacles dont le droit américain des sociétés est lui-même porteur.

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.

Energy Efficient Cache Discovery in Wireless Mobile Ad oc Networks

Data 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 traf c 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 power usage, caching overhead and delay by reducing the number of control messages flooded into the network .A cache discovery process based on position cordinates of neighboring nodes is developed for this .The stimulstion results gives a promising result based on the metrics of the studies.