Análisis de productos herbales por CCF como parte del proceso de control de calidad

Tesis (Maestría en Ciencias con Especialidad en Química Biomédica) UANL

X-Ray crystal structure of [Cu2OH(O2CCF 3)3(quinoline)2]2, a tetranuclear basic copper(II) carboxylate adduct with significant metal-metal interaction

The basic copper(II) carboxylate adduct, [Cu2-OH(O 2CCF3)3(quinoline)2]2, has been shown by an X-ray structural analysis to have a novel tetranuclear structure; magnetic susceptibility data show that substantial Cu-Cu interaction is present in this compound.

Charity law in Fiji

Very little has been written on charitable laws in Fiji to date. Most of the organisations in Fiji seek incorporation under the pre-independence legislation dealing with charities, the Charitable Trusts Act (Cap 67). This Act is the basis of this paper. The key provisions of the Act are discussed in this paper. Recently serious questions have been raised on the status of charitable bodies with the de-registration of one of the registered charities (the Citizens’ Constitutional Forum (CCF)) for political activity. This paper also provides an insight into the CCF ‘saga’, which goes to the ‘heart’ of the Act and examines the serious questions that are raised in interpreting the provisions in the Act. In the concluding part, various issues of reform in the charity sphere are also proposed.

The relationship between forward head posture and cervical muscle performance in healthy individuals

Background Forward head postures (FHP) are proposed to adversely load cervical spine structures. Neck muscles provide support for the neck, and thus an imbalance in neck muscle performance could potentially contribute to the development of FHP. Previous studies have not considered the interaction of multiple muscle groups with regard to postural orientation. Given the interdependence of muscles along the cervical spine for optimal orientation and physical support of the vertebral column, the performance of a single muscle group may not accurately reflect the coordinated ability of the muscles to maintain a neutral neck posture. Purpose The purpose of this study was to investigate the relationship between FHP and the balance between the cervical extensor and flexor muscle groups in healthy individuals. We hypothesised that the magnitude of FHP would be associated with the strength and endurance performance ratios between the cervical extensor and flexor muscle groups. Methods Twenty male and 24 female volunteers were photographed in the sagittal plane wearing surface markers. The FHP of each participant was measured via the tragus-sternum marker distance over two conditions: (1)in relaxed standing and (2)during a sustained sitting task. Maximal strength (Nm) and endurance (s) performance of the extensor and flexor muscle groups were recorded at the upper (craniocervical flexion/extension (CCF/CCE)) and lower (cervicothoracic flexion/extension (CTF/CTE)) cervical regions. Muscle performance measures were expressed as extension:flexion ratios and their relation to FHP evaluated. A stepwise multiple regression analysis using backward elimination was utilised to examine the relationship between the postural measures and the muscle performance ratio measures. Separate models were used for the two different postural conditions (standing, sustained sitting). Gender was included as a constant correction factor in all regression models. Where gender was a significant variable in the model, analyses were repeated separately for males and females. Results Greater FHP in standing was significantly associated with reduced proportional CTE to CCF strength in females (R2 = 0.21, P = 0.03) and greater proportional CTE to CTF strength in males (R2 = 0.23, P = 0.03). A greater drift into FHP during sustained sitting was associated with a relative reduction in CCE endurance proportional to CTF endurance in females only (R2 = 0.27, P = 0.017). Conclusion(s) This initial study indicates that the balance in performance between the cervical flexor and extensor muscle groups may impact FHP in healthy individuals. However, the findings were inconsistent across different muscle performance ratios and gender. Larger scale studies are therefore now needed to further clarify the relationship between FHP and muscle performance. Implications The findings suggest that relative performance of the various cervical muscle groups needs to be accounted for when considering postural correction strategies in the clinical setting, as is often recommended.

Dependence of ``critical cloud fraction' on aerosol composition

Recent studies, over regions influenced by biomass burning aerosol, have shown that it is possible to define a critical cloud fraction' (CCF) at which the aerosol direct radiative forcing switch from a cooling to a warming effect. Using 4 years of multi-satellite data analysis, we show that CCF varies with aerosol composition and changed from 0.28 to 0.13 from postmonsoon to winter as a result of shift from less absorbing to moderately absorbing aerosol. Our results indicate that we can estimate aerosol absorption from space using independently measured top of the atmosphere (TOA) fluxes Cloud Aerosol Lidar with Orthogonal Polarization-Moderate resolution Imaging Spectroradiometer-Clouds and the Earth's Radiant Energy System (CALIPSO-MODIS-CERES)] combined algorithms for example.

Estimación de la capacidad de carga turística de la Reserva Natural Volcán Mombacho, Granada, Nicaragua

Este estudio identifica los principales factores que inciden en la determinación de la CCT de los senderos El Cráter, El Puma y El Cafetal de la Reserva Natural Volcán Mombacho. La Capacidad de carga turística se consideró tal y como propone Cifuentes en su metodología, en tres niveles: Capacidad de Carga Física (CCF), Capacidad de Carga Real (CCR) y Capacidad de Carga Efectiva (CCE) (Cifuentes, M. 1999). Se estimó la Capacidad de Manejo (CM) de la RNVM, en 74.24%, obteniendo en el sendero El Cráter una CCE de 442 visitas/día, en el sendero El Puma de 93 visitas/día, y en el sendero El Cafetal de 753 visitas/día. Si se lograse un incremento de la CM en un 80%; el sendero El Cráter in crementaría su CCE a 476 visitas/día; el sendero El Puma a 101 visitas/día; y el sendero El Cafetal a 811 visitas/día. Este escenario está calculado para visitantes con propósitos eco turísticos. Debido a que las visitas de estudiantes de colegio, muestran un comportamiento diferente, se realizó el cálculo considerando dichos elementos en los factores de corrección para los Sendero El Cráter y El Cafetal (El Puma no es frecuentado por estudiantes de colegio). La CCE para estudiantes en el sendero El Cráter fue de 236 visitas/día, con una CM del 74.24%, y para un escenario del 80% de CM se calcula en 255 visitas/día; para el sendero El Cafetal se calculó en 403 visitas/día a un 74.24% de CM y 434 visitas/día a una CM del 80%. Las visitas máximas reportadas para el año 2003 fueron en los meses de Enero y Junio, con 298 y 305 visitas/día; en el año 2002 se reportan los meses de Marzo y Mayo con 366 y 298 visitas/día; la visitación al Sendero El Cráter no excede aún la CCE calculada, no así si los visitantes fueran estudian tes de colegio. Si la tendencia de la visitación continua incrementándose con los años, se requerirá que la administración de la RNVM restringa el número de visitas en los períodos picos de las mismas.

Safe Compositional Network Sketches: NetSketch Tool Implementation

Numerous problems exist that can be modeled as traffic through a network in which constraints exist to regulate flow. Vehicular road travel, computer networks, and cloud based resource distribution, among others all have natural representations in this manner. As these networks grow in size and/or complexity, analysis and certification of the safety invariants becomes increasingly costly. The NetSketch formalism introduces a lightweight verification framework that allows for greater scalability than traditional analysis methods. The NetSketch tool was developed to provide the power of this formalism in an easy to use and intuitive user interface.

Entropy Loss is Maximal for Uniform Inputs

A secure sketch (defined by Dodis et al.) is an algorithm that on an input w produces an output s such that w can be reconstructed given its noisy version w' and s. Security is defined in terms of two parameters m and m˜ : if w comes from a distribution of entropy m, then a secure sketch guarantees that the distribution of w conditioned on s has entropy m˜ , where λ = m−m˜ is called the entropy loss. In this note we show that the entropy loss of any secure sketch (or, more generally, any randomized algorithm) on any distribution is no more than it is on the uniform distribution.

Universal Quantum Circuits

We define and construct efficient depth universal and almost size universal quantum circuits. Such circuits can be viewed as general purpose simulators for central classes of quantum circuits and can be used to capture the computational power of the circuit class being simulated. For depth we construct universal circuits whose depth is the same order as the circuits being simulated. For size, there is a log factor blow-up in the universal circuits constructed here. We prove that this construction is nearly optimal. Our results apply to a number of well-studied quantum circuit classes.

Supporting Predicate Routing in DTN over MANET

We consider a Delay Tolerant Network (DTN) whose users (nodes) are connected by an underlying Mobile Ad hoc Network (MANET) substrate. Users can declaratively express high-level policy constraints on how "content" should be routed. For example, content may be diverted through an intermediary DTN node for the purposes of preprocessing, authentication, etc. To support such capability, we implement Predicate Routing [7] where high-level constraints of DTN nodes are mapped into low-level routing predicates at the MANET level. Our testbed uses a Linux system architecture and leverages User Mode Linux [2] to emulate every node running a DTN Reference Implementation code [5]. In our initial prototype, we use the On Demand Distance Vector (AODV) MANET routing protocol. We use the network simulator ns-2 (ns-emulation version) to simulate the mobility and wireless connectivity of both DTN and MANET nodes. We show preliminary throughput results showing the efficient and correct operation of propagating routing predicates, and as a side effect, the performance benefit of content re-routing that dynamically (on-demand) breaks the underlying end-to-end TCP connection into shorter-length TCP connections.

"Networking is IPC": A Guiding Principle to a Better Internet

This position paper outlines a new network architecture, i.e., a style of construction that identifies the objects and how they relate. We do not specify particular protocol implementations or specific interfaces and policies. After all, it should be possible to change protocols in an architecture without changing the architecture. Rather we outline the repeating patterns and structures, and how the proposed model would cope with the challenges faced by today's Internet (and that of the future). Our new architecture is based on the following principle: Application processes communicate via a distributed inter-process communication (IPC) facility. The application processes that make up this facility provide a protocol that implements an IPC mechanism, and a protocol for managing distributed IPC (routing, security and other management tasks). Existing implementation strategies, algorithms, and protocols can be cast and used within our proposed new structure.

Foundational Theory for Understanding Policy Routing Dynamics

In this paper we introduce a theory of policy routing dynamics based on fundamental axioms of routing update mechanisms. We develop a dynamic policy routing model (DPR) that extends the static formalism of the stable paths problem (introduced by Griffin et al.) with discrete synchronous time. DPR captures the propagation of path changes in any dynamic network irrespective of its time-varying topology. We introduce several novel structures such as causation chains, dispute fences and policy digraphs that model different aspects of routing dynamics and provide insight into how these dynamics manifest in a network. We exercise the practicality of the theoretical foundation provided by DPR with two fundamental problems: routing dynamics minimization and policy conflict detection. The dynamics minimization problem utilizes policy digraphs, that capture the dependencies in routing policies irrespective of underlying topology dynamics, to solve a graph optimization problem. This optimization problem explicitly minimizes the number of routing update messages in a dynamic network by optimally changing the path preferences of a minimal subset of nodes. The conflict detection problem, on the other hand, utilizes a theoretical result of DPR where the root cause of a causation cycle (i.e., cycle of routing update messages) can be precisely inferred as either a transient route flap or a dispute wheel (i.e., policy conflict). Using this result we develop SafetyPulse, a token-based distributed algorithm to detect policy conflicts in a dynamic network. SafetyPulse is privacy preserving, computationally efficient, and provably correct.

Collocation Games and Their Application to Distributed Resource Management

We introduce Collocation Games as the basis of a general framework for modeling, analyzing, and facilitating the interactions between the various stakeholders in distributed systems in general, and in cloud computing environments in particular. Cloud computing enables fixed-capacity (processing, communication, and storage) resources to be offered by infrastructure providers as commodities for sale at a fixed cost in an open marketplace to independent, rational parties (players) interested in setting up their own applications over the Internet. Virtualization technologies enable the partitioning of such fixed-capacity resources so as to allow each player to dynamically acquire appropriate fractions of the resources for unencumbered use. In such a paradigm, the resource management problem reduces to that of partitioning the entire set of applications (players) into subsets, each of which is assigned to fixed-capacity cloud resources. If the infrastructure and the various applications are under a single administrative domain, this partitioning reduces to an optimization problem whose objective is to minimize the overall deployment cost. In a marketplace, in which the infrastructure provider is interested in maximizing its own profit, and in which each player is interested in minimizing its own cost, it should be evident that a global optimization is precisely the wrong framework. Rather, in this paper we use a game-theoretic framework in which the assignment of players to fixed-capacity resources is the outcome of a strategic "Collocation Game". Although we show that determining the existence of an equilibrium for collocation games in general is NP-hard, we present a number of simplified, practically-motivated variants of the collocation game for which we establish convergence to a Nash Equilibrium, and for which we derive convergence and price of anarchy bounds. In addition to these analytical results, we present an experimental evaluation of implementations of some of these variants for cloud infrastructures consisting of a collection of multidimensional resources of homogeneous or heterogeneous capacities. Experimental results using trace-driven simulations and synthetically generated datasets corroborate our analytical results and also illustrate how collocation games offer a feasible distributed resource management alternative for autonomic/self-organizing systems, in which the adoption of a global optimization approach (centralized or distributed) would be neither practical nor justifiable.

Seed Scheduling for Peer-to-Peer Networks

The initial phase in a content distribution (file sharing) scenario is a delicate phase due to the lack of global knowledge and the dynamics of the overlay. An unwise distribution of the pieces in this phase can cause delays in reaching steady state, thus increasing file download times. We devise a scheduling algorithm at the seed (source peer with full content), based on a proportional fair approach, and we implement it on a real file sharing client [1]. In dynamic overlays, our solution improves up to 25% the average downloading time of a standard protocol ala BitTorrent.

PreDA: Predicate Routing for DTN Architectures over MANET

We consider a Delay Tolerant Network (DTN) whose users (nodes) are connected by an underlying Mobile Ad hoc Network (MANET) substrate. Users can declaratively express high-level policy constraints on how “content” should be routed. For example, content can be directed through an intermediary DTN node for the purposes of preprocessing, authentication, etc., or content from a malicious MANET node can be dropped. To support such content routing at the DTN level, we implement Predicate Routing [1] where high-level constraints of DTN nodes are mapped into low-level routing predicates within the MANET nodes. Our testbed [2] uses a Linux system architecture with User Mode Linux [3] to emulate every DTN node with a DTN Reference Implementation code [4]. In our initial architecture prototype, we use the On Demand Distance Vector (AODV) routing protocol at the MANET level. We use the network simulator ns-2 (ns-emulation version) to simulate the wireless connectivity of both DTN and MANET nodes. Preliminary results show the efficient and correct operation of propagating routing predicates. For the application of content re-routing through an intermediary, as a side effect, results demonstrate the performance benefit of content re-routing that dynamically (on-demand) breaks the underlying end-to-end TCP connections into shorter-length TCP connections.