Size-fitting of Intravaginal Rings for Macaques and in vitro Release Kinetics of Zinc Finger Inhibitors

Background: Small molecule inhibitors of the zinc finger domain (ZFI) in the nucleocapsid protein (NCp7) of HIV-1 are potent inhibitors of HIV and SIV
replication and may have utility as topical products to prevent infection. Furthermore, intravaginal rings (IVRs) were developed as coitally-independent,
sustained release devices which could be used for administration of HIV microbicides. The aims of these studies were to demonstrate that IVRs sized for
macaques are practical and compatible with the current generation of thioester-based NCp7 inhibitors.

Methods: Non-medicated silicone elastomer vaginal rings of various sizes thought to be applicable for macaques were prepared and tested for vaginal fit in Pigtailed and Chinese Rhesus macaques. Macaques were monitored for 8 weeks for mucosal disruption by colposcopy and proinflammatory cytokine markers in cervical vaginal lavages (CVL) using Luminex bead-based technology. Three different ZFIs (compounds 52, 89 and 122, each derived from an N-substituted S-acyl-2-mercaptobenzamide thioester scaffold) were loaded at 50 mg into an optimal matrix-type ring design. In vitro continuous release studies were then conducted over 28 days and analyzed by HPLC. Rate of release was determined by linear regression analysis.

Results: Qualitative evaluation at the time of ring insertion suggested that the 25 mm ring provided optimal fit in both macaque species. All rings remained in
place during the study period (2 to 4 weeks), and the animals did not attempt to remove the rings. No tissue irritation was observed, and no signs of physical
discomfort were noted. Also, no significant induction of cervicovaginal proinflammatory markers was observed during the 8-week period during and following ring insertion. One Pigtailed macaque showed elevated IL-8 levels in the CVL during the period when the ring was in place; however, these levels were comparable to those observed in two control macaques. In vitro release of the ZFIs peaked at day 1 and then continually declined to near steady-state rates between 20-30 mcg/day. The percent release after 14 days was 2.9, 2.0 and 0.9 for ZFI 89, 52 and 122, respectively.

Conclusions: IVRs of 25mm diameter, determined to be the optimal size for macaques, were well tolerated and did not induce inflammation. Release of all ZFI compounds followed t 0.5 kinetics. These findings suggest that efficacy testing in primate models is warranted to fully evaluate the potential to prevent
transmission.

Finite domination and Novikov rings: Laurent polynomial rings in two variables

Let C be a bounded cochain complex of finitely generatedfree modules over the Laurent polynomial ring L = R[x, x−1, y, y−1].The complex C is called R-finitely dominated if it is homotopy equivalentover R to a bounded complex of finitely generated projective Rmodules.Our main result characterises R-finitely dominated complexesin terms of Novikov cohomology: C is R-finitely dominated if andonly if eight complexes derived from C are acyclic; these complexes areC ⊗L R[[x, y]][(xy)−1] and C ⊗L R[x, x−1][[y]][y−1], and their variants obtainedby swapping x and y, and replacing either indeterminate by its inverse.

Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

Polar codes are one of the most recent advancements in coding theory and they have attracted significant interest. While they are provably capacity achieving over various channels, they have seen limited practical applications. Unfortunately, the successive nature of successive cancellation based decoders hinders fine-grained adaptation of the decoding complexity to design constraints and operating conditions. In this paper, we propose a systematic method for enabling complexity-performance trade-offs by constructing polar codes based on an optimization problem which minimizes the complexity under a suitably defined mutual information based performance constraint. Moreover, a low-complexity greedy algorithm is proposed in order to solve the optimization problem efficiently for very large code lengths.

Finite domination and Novikov rings. Laurent polynomial rings in several variables

We present a homological characterisation of those chain complexes of modules over a Laurent polynomial ring in several indeterminates which are finitely dominated over the ground ring (that is, are a retract up to homotopy of a bounded complex of finitely generated free modules). The main tools, which we develop in the paper, are a non-standard totalisation construction for multi-complexes based on truncated products, and a high-dimensional mapping torus construction employing a theory of cubical diagrams that commute up to specified coherent homotopies.

Bounds on edit metric codes with combinatorial DNA constraints

The design of a large and reliable DNA codeword library is a key problem in DNA based computing. DNA codes, namely sets of fixed length edit metric codewords over the alphabet {A, C, G, T}, satisfy certain combinatorial constraints with respect to biological and chemical restrictions of DNA strands. The primary constraints that we consider are the reverse--complement constraint and the fixed GC--content constraint, as well as the basic edit distance constraint between codewords. We focus on exploring the theory underlying DNA codes and discuss several approaches to searching for optimal DNA codes. We use Conway's lexicode algorithm and an exhaustive search algorithm to produce provably optimal DNA codes for codes with small parameter values. And a genetic algorithm is proposed to search for some sub--optimal DNA codes with relatively large parameter values, where we can consider their sizes as reasonable lower bounds of DNA codes. Furthermore, we provide tables of bounds on sizes of DNA codes with length from 1 to 9 and minimum distance from 1 to 9.

Construction of I-Deletion-Correcting Ternary Codes

Finding large deletion correcting codes is an important issue in coding theory. Many researchers have studied this topic over the years. Varshamov and Tenegolts constructed the Varshamov-Tenengolts codes (VT codes) and Levenshtein showed the Varshamov-Tenengolts codes are perfect binary one-deletion correcting codes in 1992. Tenegolts constructed T codes to handle the non-binary cases. However the T codes are neither optimal nor perfect, which means some progress can be established. Latterly, Bours showed that perfect deletion-correcting codes have a close relationship with design theory. By this approach, Wang and Yin constructed perfect 5-deletion correcting codes of length 7 for large alphabet size. For our research, we focus on how to extend or combinatorially construct large codes with longer length, few deletions and small but non-binary alphabet especially ternary. After a brief study, we discovered some properties of T codes and produced some large codes by 3 different ways of extending some existing good codes.

Algebraic Geometric Codes and their relation to Cryptography using Elliptic Curves

Communication is the process of transmitting data across channel. Whenever data is transmitted across a channel, errors are likely to occur. Coding theory is a stream of science that deals with finding efficient ways to encode and decode data, so that any likely errors can be detected and corrected. There are many methods to achieve coding and decoding. One among them is Algebraic Geometric Codes that can be constructed from curves. Cryptography is the science ol‘ security of transmitting messages from a sender to a receiver. The objective is to encrypt message in such a way that an eavesdropper would not be able to read it. A eryptosystem is a set of algorithms for encrypting and decrypting for the purpose of the process of encryption and decryption. Public key eryptosystem such as RSA and DSS are traditionally being prel‘en‘ec| for the purpose of secure communication through the channel. llowever Elliptic Curve eryptosystem have become a viable altemative since they provide greater security and also because of their usage of key of smaller length compared to other existing crypto systems. Elliptic curve cryptography is based on group of points on an elliptic curve over a finite field. This thesis deals with Algebraic Geometric codes and their relation to Cryptography using elliptic curves. Here Goppa codes are used and the curves used are elliptic curve over a finite field. We are relating Algebraic Geometric code to Cryptography by developing a cryptographic algorithm, which includes the process of encryption and decryption of messages. We are making use of fundamental properties of Elliptic curve cryptography for generating the algorithm and is used here to relate both.

Computing Generators of Free Modules over Orders in Group Algebras

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case that the Wedderburn decomposition E[G] \cong \oplus_xM_x is explicitly computable and each M_x is in fact a matrix ring over a field, this leads to an algorithm that either gives elements \alpha_1,...,\alpha_d \in X such that X = A\alpha_1 \oplus ... \oplusA\alpha_d or determines that no such elements exist. Let L/K be a finite Galois extension of number fields with Galois group G such that E is a subfield of K and put d = [K : E]. The algorithm can be applied to certain Galois modules that arise naturally in this situation. For example, one can take X to be O_L, the ring of algebraic integers of L, and A to be the associated order A(E[G];O_L) \subseteq E[G]. The application of the algorithm to this special situation is implemented in Magma under certain extra hypotheses when K = E = \IQ.

The influence of bottom topography on the decay of modeled Agulhas rings

The influence of a large meridional submarine ridge on the decay of Agulhas rings is investigated with a 1 and 2-layer setup of the isopycnic primitive-equation ocean model MICOM. In the single-layer case we show that the SSH decay of the ring is primarily governed by bottom friction and secondly by the radiation of Rossby waves. When a topographic ridge is present, the effect of the ridge on SSH decay and loss of tracer from the ring is negligible. However, the barotropic ring cannot pass the ridge due to energy and vorticity constraints. In the case of a two-layer ring the initial SSH decay is governed by a mixed barotropic–baroclinic instability of the ring. Again, radiation of barotropic Rossby waves is present. When the ring passes the topographic ridge, it shows a small but significant stagnation of SSH decay, agreeing with satellite altimetry observations. This is found to be due to a reduction of the growth rate of the m = 2 instability, to conversions of kinetic energy to the upper layer, and to a decrease in Rossby-wave radiation. The energy transfer is related to the fact that coherent structures in the lower layer cannot pass the steep ridge due to energy constraints. Furthermore, the loss of tracer from the ring through filamentation is less than for a ring moving over a flat bottom, related to a decrease in propagation speed of the ring. We conclude that ridges like the Walvis Ridge tend to stabilize a multi-layer ring and reduce its decay.

A reconstructed Siberian High index since A. D. 1599 from Eurasian and North American tree rings

The long-term variability of the Siberian High, the dominant Northern Hemisphere anticyclone during winter, is largely unknown. To investigate how this feature varied prior to the instrumental record, we present a reconstruction of a Dec-Feb Siberian High (SH) index based on Eurasian and North American tree rings. Spanning 1599-1980, it provides information on SH variability over the past four centuries. A decline in the instrumental SH index since the late 1970s, related to Eurasian warming, is the most striking feature over the past four hundred years. It is associated with a highly significant (p < 0.0001) step change in 1989. Significant similar to 3-4 yr spectral peaks in the reconstruction fall within the range of variability of the East Asian winter monsoon (which has also declined recently) and lend further support to proposed relationships between these largescale features of the climate system.

Evaluating the annual nature of juvenile rings in Bolivian tropical rainforest trees

Knowledge on juvenile tree growth is crucial to understand how trees reach the canopy in tropical forests. However, long-term data on juvenile tree growth are usually unavailable. Annual tree rings provide growth information for the entire life of trees and their analysis has become more popular in tropical forest regions over the past decades. Nonetheless, tree ring studies mainly deal with adult rings as the annual character of juvenile rings has been questioned. We evaluated whether juvenile tree rings can be used for three Bolivian rainforest species. First, we characterized the rings of juvenile and adult trees anatomically. We then evaluated the annual nature of tree rings by a combination of three indirect methods: evaluation of synchronous growth patterns in the tree- ring series, (14)C bomb peak dating and correlations with rainfall. Our results indicate that rings of juvenile and adult trees are defined by similar ring-boundary elements. We built juvenile tree-ring chronologies and verified the ring age of several samples using (14)C bomb peak dating. We found that ring width was correlated with rainfall in all species, but in different ways. In all, the chronology, rainfall correlations and (14)C dating suggest that rings in our study species are formed annually.

A game theoretical approach to the evolution of structured communication codes

Structured meaning-signal mappings, i.e., mappings that preserve neighborhood relationships by associating similar signals with similar meanings, are advantageous in an environment where signals are corrupted by noise and sub-optimal meaning inferences are rewarded as well. The evolution of these mappings, however, cannot be explained within a traditional language evolutionary game scenario in which individuals meet randomly because the evolutionary dynamics is trapped in local maxima that do not reflect the structure of the meaning and signal spaces. Here we use a simple game theoretical model to show analytically that when individuals adopting the same communication code meet more frequently than individuals using different codes-a result of the spatial organization of the population-then advantageous linguistic innovations can spread and take over the population. In addition, we report results of simulations in which an individual can communicate only with its K nearest neighbors and show that the probability that the lineage of a mutant that uses a more efficient communication code becomes fixed decreases exponentially with increasing K. These findings support the mother tongue hypothesis that human language evolved as a communication system used among kin, especially between mothers and offspring.

A NOTE ON FREE GROUPS IN THE RING OF FRACTIONS OF SKEW POLYNOMIAL RINGS

Let L be a function field over the rationals and let D denote the skew field of fractions of L[t; sigma], the skew polynomial ring in t, over L, with automorphism sigma. We prove that the multiplicative group D(x) of D contains a free noncyclic subgroup.

On spectra of abelian group rings

In this paper we study the spectrum of integral group rings of finitely generated abelian groups G from the scheme-theoretic viewpoint. We prove that the (closed) singular points of Spec Z[G], the (closed) intersection points of the irreducible components of Spec Z[G] and the (closed) points over the prime divisors of vertical bar t(G)vertical bar coincide. We also determine the formal completion of Spec Z[G] at a singular point.

INVOLUTIONS AND FREE PAIRS OF BASS CYCLIC UNITS IN INTEGRAL GROUP RINGS

Let ZG be the integral group ring of the finite nonabelian group G over the ring of integers Z, and let * be an involution of ZG that extends one of G. If x and y are elements of G, we investigate when pairs of the form (u(k,m)(x*), u(k,m)(x*)) or (u(k,m)(x), u(k,m)(y)), formed respectively by Bass cyclic and *-symmetric Bass cyclic units, generate a free noncyclic subgroup of the unit group of ZG.