[Leyes etc]

Hay un ejemplar encuadernado con: La Real Compañia formada por S.M. para llevar a efecto el canal de navegación y riego del reyno de Murcia, las... experiencias de que informa D. Domingo Aguirre... le han confirmado en los abusos y fraudes que hacen muchos... (XVIII/4279).

Olétrip : planificación dinámica de planes de ocio

En la actualidad, como consecuencia de los avances tecnológicos, hay una gran cantidad de sistemas de recomendación que proporcionan demasiada sobreinformación, y, sobre todo, los dedicados al sector turístico y de ocio, que cada vez están más en auge, y las personas recurren cada vez más a ellos para organizar planes, individuales o grupales. Sin embargo, sólo muestran información estática y no acorde con las preferencias de usuario, además de no poder ofrecer recomendaciones para grupos. Olétrip surge como un sistema que permite la elaboración de planes de ocio individuales y/o grupales en la comunidad autónoma de Andalucía (España), basados en preferencias de usuario, y retroalimentación de todos los participantes en él. Llegando a conseguir el plan idóneo para todos. Olétrip se ha diseñado e implementado mediante una serie de servicios REST, donde se recabarán datos de preferencias de viaje de los usuarios, retroalimentación de las diferentes actividades, etc., y así conseguir recomendar el plan deseado por el usuario. Para probar el uso de estos servicios, se ha diseñado una interfaz web, independiente del sistema, implementada con tecnologías idóneas para tal fin, HTML y JavaScript, así como una evaluación con usuarios, para poder conocer el grado de usabilidad de la web, y los servicios que ofrece. Además, se han explorado, analizado, y diseñado algoritmos que han permitido ofrecer una ruta final idónea. Por lo tanto, se describirá como se ha llevado a cabo el proceso de elaboración del sistema, así como la implementación de los algoritmos, los resultados y conclusiones obtenidas tras todo el desarrollo.

A Novel Approach to Intraoral Mandibular Nerve Anesthesia: Changing Reference Planes in the Gow-Gates Block Technique

Purpose: The Gow-Gates technique is said to have several advantages over traditional techniques to achieve mandibular nerve anesthesia; however, its routine use is quite limited, mainly due to complications during visual alignment of reference landmarks. The purpose of this study was to verify the validity and accuracy of a new method to reach the injection site. Material and Methods: Fifteen magnetic resonance images were captured. Distances from the ideal injection point in the condylar neck (puncture ideal) to the injection points located in the a and 0 plane intersection (Puncture Gow-Gates and puncture modified) were measured and compared. Results: Positive and significant (P <= .003) Pearson correlations between landmarks and injection points confirmed the validity of the modified technique. Paired t test showed that the segment line puncture ideal-puncture modified, 5.17 mm, was 3 times shorter (P < .001) than the segment line puncture ideal-puncture Gow-Gates, 17.91 mm. As calculated by linear regression, establishing the injection point of the modified technique depended only on the anteroposterior and lateromedial condyle positions. Conclusions: The modified technique proved to be valid and precise and has a determined and an effective injection site. (C) 2009 American Association of Oral and Maxillofacial Surgeons J Oral Maxillofac Surg 67:2609-2616, 2009

Partitioning sets of triples into small planes

We study partitions of the set of all ((v)(3)) triples chosen from a v-set into pairwise disjoint planes with three points per line. Our partitions may contain copies of PG(2, 2) only (Fano partitions) or copies of AG(2, 3) only (affine partitions) or copies of some planes of each type (mixed partitions). We find necessary conditions for Fano or affine partitions to exist. Such partitions are already known in several cases: Fano partitions for v = 8 and affine partitions for v = 9 or 10. We construct such partitions for several sporadic orders, namely, Fano partitions for v = 14, 16, 22, 23, 28, and an affine partition for v = 18. Using these as starter partitions, we prove that Fano partitions exist for v = 7(n) + 1, 13(n) + 1, 27(n) + 1, and affine partitions for v = 8(n) + 1, 9(n) + 1, 17(n) + 1. In particular, both Fano and affine partitions exist for v = 3(6n) + 1. Using properties of 3-wise balanced designs, we extend these results to show that affine partitions also exist for v = 3(2n). Similarly, mixed partitions are shown to exist for v = 8(n), 9(n), 11(n) + 1.

Tilted boxes on inclined planes

We propose the study of a box placed on an inclined plane, with an initial tilt with respect to the plane. This is a paradigmatic example of the role played by friction as a link between translational and rotational motion. This example has two advantages over the usual example of a sphere (or cylinder) rolling down an inclined plane. First, it provides a good model for a much greater variety of "real-life" situations. Second, it exhibits a much richer structure in parameter space, even when the box starts from rest. (C) 2000 American Association of Physics Teachers.

Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes

Consider scheduling of real-time tasks on a multiprocessor where migration is forbidden. Specifically, consider the problem of determining a task-to-processor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct types of processors. For this problem, we propose a new algorithm, LPC (task assignment based on solving a Linear Program with Cutting planes). The algorithm offers the following guarantee: for a given task set and a platform, if there exists a feasible task-to-processor assignment, then LPC succeeds in finding such a feasible task-to-processor assignment as well but on a platform in which each processor is 1.5 × faster and has three additional processors. For systems with a large number of processors, LPC has a better approximation ratio than state-of-the-art algorithms. To the best of our knowledge, this is the first work that develops a provably good real-time task assignment algorithm using cutting planes.

Análise/interpretação de textos/imagens/redes sociais, etc.: Através das redes sociológicas tricotómicas

Teoria do Método das Redes Sociológicas Tricotómicas; Exemplos de Método das Redes Sociológicas Tricotómicas: Análise com Esquemas Tricotómicos de Proposições Sociológicas (ETPS); Análise com Esquemas Tricotómicos de Silogismos Sociológicos (ETSS); Silogismo Sociológico (etapas em rede); Proposição Sociológica na forma de Texto Reticular; Silogismo Sociológico na forma de Texto Reticular.

Index filicum,sive, Enumeratio omnium generum specierumque filicum et Hydropteridum ab anno 1753 ad finem anni 1905 descriptorium : adjectis synonymis principalibus, area geographica, etc. /Carl Christensen.

Fascicles 1-12, 1753-1906

Index filicum,sive, Enumeratio omnium generum specierumque filicum et Hydropteridum ab anno 1753 ad finem anni 1905 descriptorium : adjectis synonymis principalibus, area geographica, etc. /Carl Christensen.

Suppl. 1906-12

Index filicum,sive, Enumeratio omnium generum specierumque filicum et Hydropteridum ab anno 1753 ad finem anni 1905 descriptorium : adjectis synonymis principalibus, area geographica, etc. /Carl Christensen.

Suppl. prelim. 1913-17

Index filicum,sive, Enumeratio omnium generum specierumque filicum et Hydropteridum ab anno 1753 ad finem anni 1905 descriptorium : adjectis synonymis principalibus, area geographica, etc. /Carl Christensen.

Suppl. 3 1917-33