In vivo evaluation of a mucoadhesive polymeric caplet for intravaginal anti-HIV-1 delivery and development of a molecular mechanistic model for thermochemical characterization

Context and objective: The aim of this study was to develop, characterize and evaluate a mucoadhesive caplet resulting from a polymeric blend (polymeric caplet) for intravaginal anti-HIV-1 delivery.

Materials and methods: Poly(lactic-co-glycolic) acid, ethylcellulose, poly(vinylalcohol), polyacrylic acid and modified polyamide 6, 10 polymers were blended and compressed to a caplet-shaped device, with and without two model drugs 3′-azido-3′-deoxythymidine (AZT) and polystyrene sulfonate (PSS). Thermal analysis, infrared spectroscopy and microscopic analysis were carried out on the caplets employing temperature-modulated DSC (TMDSC), Fourier transform infra-red (FTIR) spectrometer and scanning electron microscope, respectively. In vitro and in vivo drug release analyses as well as the histopathological toxicity studies were carried out on the drug-loaded caplets. Furthermore, molecular mechanics (MM) simulations were carried out on the drug-loaded caplets to corroborate the experimental findings.

Results and discussion: There was a big deviation between the T_g of the polymeric caplet from the T_g's of the constituent polymers indicating a strong interaction between constituent polymers. FTIR spectroscopy confirmed the presence of specific ionic and non-ionic interactions within the caplet. A controlled near zero-order drug release was obtained for AZT (20 d) and PSS (28 d). In vivo results, i.e. the drug concentration in plasma ranged between 0.012–0.332?mg/mL and 0.009–0.256?mg/mL for AZT and PSS over 1–28 d.

Conclusion: The obtained results, which were corroborated by MM simulations, attested that the developed system has the potential for effective delivery of anti-HIV-agents.     

Microwave-Assisted Synthesis of Fine Particle Oxides Employing Wet Redox Mixtures

Interaction of electromagnetic radiation with a physical mixture of metal nitrates and amides/hydrazides is observed to initiate high-temperature reactions, useful for realizing several high-temperature ceramic materials. A judicious choice of such redox mixtures undergoes exothermic reactions when they couple with microwave radiation. The coupling of electromagnetic radiation with metal salts and amides/hydrazides depends on the dielectric properties of the individual components in the reaction mixture. The approach has been used to prepare γ-Fe₂O₃, Fe₃O₄, MgCr₂O₄, α-CaCr₂O₄, and La_0.7Ba_0.3MnO₃.     

On the network effect in Web 2.0 applications

In recent years, the proliferation of the world wide web has lead to an increase in a number of applications such as search, social networks and auctions, whose success depends critically upon the number of users of that service. Two examples of such applications are internet auctions and social networks. One of the characteristics of online auctions is that a successful implementation requires a high volume of buyers and sellers at its website. Consequently, auction sites which have a high volume of traffic have an advantage over those in which the volume is limited. This results in even greater polarization of buyers and sellers towards a particular site. The same is true for social networks in which greater use of a given social network increases the use from other participants on the network. This is often referred to as the “network effect” in a variety of interaction-centric applications in networks. While this effect has qualitatively been known to increase the value of the overall network, its effect has never been modeled or studied rigorously. In this paper, we construct a Markov model to analyze the network effect in the case of two important classes of web applications. These correspond to auctions and social networks. We show that the network effect is very powerful and can result in a situation in which an auction or a social networking site can quickly overwhelm its competing sites. Thus, the results of this paper show the tremendous power of the network effect for Web 2.0 applications.     

Complementarity determining region residues aspartic acid at H55, serine at H95 and tyrosines at H97 and L96 play important roles in the B72.3 antibody-TAG72 antigen interaction

Structural analysis derived from the crystallographic studyof the chimeric B72.3 antibody illustrated some major atomicinteractions between complementarity determining region (CDR)residues. For example, hydrogen bonds are formed between H35/H95,L50/H97, H53/H55 and H96/L96 respectively. These CDR residuesmay play important roles in the B72.3–TAG72 (antibody-antigen)interaction either by direct interaction with the TAG72 antigenor by maintaining a CDR loop conformation through atomic interactionsbetween CDR residues. In order to confirm these assumptions,we altered these CDR residues by site-directed mutagenesis anddetermined binding affinities of these mutant chimeric antibodiesfor the TAG72 antigen in a solid-phase radioimmunoassay. Wefound that H55, H95, H97 and L96 are important CDR residuesfor the B72.3–TAG72 interaction. Single amino acid substitutionsof aspartic acid and serine by alanine at H55 of CDR2 and atH95 of CDR3 respectively and of tyrosine by phenylalanine atH97 and L96 of CDR3, significantly reduced the binding affinityfor the TAG72 antigen by 20-, 8-, 16- and 45-fold respectively.Therefore, this study reveals some of the requirements for maintainingthe integrity of the B72.3 antibody combining sites.     

CONTOUR: an efficient algorithm for discovering discriminating subsequences

In recent years we have witnessed several applications of frequent sequence mining, such as feature selection for protein sequence classification and mining block correlations in storage systems. In typical applications such as clustering, it is not the complete set but only a subset of discriminating frequent subsequences which is of interest. One approach to discovering the subset of useful frequent subsequences is to apply any existing frequent sequence mining algorithm to find the complete set of frequent subsequences. Then, a subset of interesting subsequences can be further identified. Unfortunately, it is very time consuming to mine the complete set of frequent subsequences for large sequence databases. In this paper, we propose a new algorithm, CONTOUR, which efficiently mines a subset of high-quality subsequences directly in order to cluster the input sequences. We mainly focus on how to design some effective search space pruning methods to accelerate the mining process and discuss how to construct an accurate clustering algorithm based on the result of CONTOUR. We conducted an extensive performance study to evaluate the efficiency and scalability of CONTOUR, and the accuracy of the frequent subsequence-based clustering algorithm.     

Effects of Hall current and two temperatures in transversely isotropic magnetothermoelastic with and without energy dissipation due to ramp-type heat

The present article is concerned with the investigation of disturbances in a homogeneous transversely isotropic thermoelastic rotating medium with two temperatures, in the presence of the combined effects of Hall currents and magnetic field. The formulation is applied to the thermoelasticity theories developed by Green-Naghdi theories of type-II and type-III. Laplace and Fourier transform techniques are applied to solve the problem. The analytical expressions of displacements, stress components, temperature change, and current density components are obtained in the transformed domain. A numerical inversion technique has been applied to obtain the results in the physical domain. Numerical simulated results are depicted graphically to show the effect of Hall current and two temperatures on resulting quantities. Some special cases are also deduced from the present investigation.     

Use of distributed data sources in facility location

Facility location decisions are usually determined by cost and coverage related factors although empirical studies show that such factors as infrastructure, labor conditions and competition also play an important role in practice. The objective of this paper is to develop a multi-objective facility location model accounting for a wide range of factors affecting decision-making. The proposed model selects potential facilities from a set of pre-defined alternative locations according to the number of customers, the number of competitors and real-estate cost criteria. However, that requires large amount of both spatial and non-spatial input data, which could be acquired from distributed data sources over the Internet. Therefore, a computational approach for processing input data and representation of modeling results is elaborated. It is capable of accessing and processing data from heterogeneous spatial and non-spatial data sources. Application of the elaborated data gathering approach and facility location model is demonstrated using an example of fast food restaurants location problem.     

Exploring context and content links in social media: a latent space method

Social media networks contain both content and context-specific information. Most existing methods work with either of the two for the purpose of multimedia mining and retrieval. In reality, both content and context information are rich sources of information for mining, and the full power of mining and processing algorithms can be realized only with the use of a combination of the two. This paper proposes a new algorithm which mines both context and content links in social media networks to discover the underlying latent semantic space. This mapping of the multimedia objects into latent feature vectors enables the use of any off-the-shelf multimedia retrieval algorithms. Compared to the state-of-the-art latent methods in multimedia analysis, this algorithm effectively solves the problem of sparse context links by mining the geometric structure underlying the content links between multimedia objects. Specifically for multimedia annotation, we show that an effective algorithm can be developed to directly construct annotation models by simultaneously leveraging both context and content information based on latent structure between correlated semantic concepts. We conduct experiments on the Flickr data set, which contains user tags linked with images. We illustrate the advantages of our approach over the state-of-the-art multimedia retrieval techniques.     

DSP-based voice activity detection and background noise reduction

These days’ speech processing devices like voice-controlled devices, radio, and cell phones have gained more popularity in the area of military, audio forensics, speech recognition, education and health sectors. In the real world, speech signal during communication always contains background noise. The main task of speech related applications is voice activity detection (VAD) which include speech communication, speech recognition, and speech coding. Noise-reduction schemes for speech communication may increase the quality of speech and improve working efficiency in military aviation. Most of the developed algorithms can improve the quality of speech but unable to remove the background noise from the speech. This study provides researchers with a summary of the challenges in speech communication with background noise and provides research directions in the area of military personnel and workforces who work in noisy environments. Results of the study reveal that the DSP-based voice activity detection and background noise reduction algorithm reduced the spurious values of the speech signal.     

Distributed algorithms for barrier coverage using relocatable sensors

We study the barrier coverage problem using relocatable sensor nodes. We assume each sensor can sense an intruder or event inside its sensing range. Sensors are initially located at arbitrary positions on the barrier and can move along the barrier. The goal is to find final positions for sensors so that the entire barrier is covered. In recent years, the problem has been studied extensively in the centralized setting. In this paper, we study a barrier coverage problem in the distributed and discrete setting. We assume that we have n identical sensors located at grid positions on the barrier, and that each sensor repeatedly executes a Look-Compute-Move cycle: based on what it sees in its vicinity, it makes a decision on where to move, and moves to its next position. We make two strong but realistic restrictions on the capabilities of sensors: they have a constant visibility range and can move only a constant distance in every cycle. In this model, we give the first two distributed algorithms that achieve barrier coverage for a line segment barrier when there are enough nodes in the network to cover the entire barrier. Our algorithms are synchronous, and local in the sense that sensors make their decisions independently based only on what they see within their constant visibility range. One of our algorithms is oblivious whereas the other uses two bits of memory at each sensor to store the type of move made in the previous step. We show that our oblivious algorithm terminates within \(\varTheta (n^2)\) steps with the barrier fully covered, while the constant-memory algorithm is shown to take \(\varTheta (n)\) steps to terminate in the worst case. Since any algorithm in which a sensor can only move a constant distance in one step requires \(\varOmega (n)\) steps on some inputs, our second algorithm is asymptotically optimal.