Novel characterization of proteomics maps by sequential neighborhoods of protein spots

We consider a characterization of proteomics maps based on an alternative kind of neighborhood graphs for the protein spots on 2-D gel. The novel approach considers for every protein spot only the nearest neighborhood consisting of protein spots of higher abundance. The approach has the simplicity and advantages of the recently introduced characterization of proteome maps based on considering the nearest neighborhoods of protein spots, but it also has important additional desirable computational features. The characterization of the nearest neighborhood graphs of 2-D gel proteomics maps is sensitive to the number of spots considered and may lead to changes in the degree of similarity of different maps when the number of points has been changed, thus imposing restrictions on the protocol used for comparison of maps. The novel approach presented in this work is less sensitive to the number of points used in the analysis because graphs are constructed in a stepwise process in which the role of more distant neighbors has been diminished by linking a new spot to the nearest spot that has been already part of the neighborhood graph. In this way a graph with N + 1 spots is obtained from the graph on N spots by adding a single new link, while in the case of the nearest neighborhood graphs adding a new spot introduces novel neighborhoods and generally results in a graph that may differ significantly from the neighborhood graph on N points.     

Numerical analysis of dual variable of conductivity in bioconvection flow of Carreau–Yasuda nanofluid containing gyrotactic motile microorganisms over a porous medium

Journal of Thermal Analysis and Calorimetry - The increasing need of the modern era of technology for better ways to increase the heat transfer performance of thermal systems has made nanoliquids...     

In situ forming PLGA implant for 90 days controlled release of leuprolide acetate for treatment of prostate cancer

In prostate cancer, hormone therapy via leuprolide acetate drug (LUP) is used to lower the level of testosterone down to castration level to effectively control the development of prostate cancer. The objective of this study was to evaluate the effective parameters in degradation and controlled release of an injectable in situ formed polymeric implant, loaded with leuprolide acetate, in order to achieve an optimum formulation for sustained drug release for 90 days with minimum burst release. The main problem associating with such implants is their high burst release. Designing an injectable implant with sustained and minimum burst release has thus become an attractive challenge in drug delivery field. Effects of type of poly(lactic‐co‐glycolic acid) 75:25 copolymers (RG752, RG756) and addition of nano‐hydroxyapatite (HA) particles on degradation rates of the implants and release profiles were examined in vitro and in vivo in a rabbit animal model. Results showed that implants containing polymers with higher molecular weights had significantly lower weight loss and molecular weight reduction. Adding nanoparticles of hydroxyapatite into poly(lactic‐co‐glycolic acid) implants caused further reduction in degradation rates, leading to a more sustained drug release in vivo, with reduced burst release. Different conventional kinetic models were applied to drug release and degradation data. The degradation data fit well to the first‐order degradation model. Higuchi model was the best kinetic release model fitted to the experimental in vitro release data. This study led to an optimum formulation (RG756:RG752 3:1 + 5% HA) with sustained leuprolide release and testosterone suppression over a 90‐day period with significant decrease of burst release phase (50%, p < 0.001) compared with the conventional Eligard formulation. The histopathology test showed that the formulated implant had no effects of toxicity or tissue necrosis in organs of the animal model. Copyright © 2017 John Wiley & Sons, Ltd.     

Neighbouring group participation in formation of condensed azines. Formation of pyrazolo(3,4-b)pyrazines,isoxazolo(4,5-b)pyrazines and isothiazolo(5,4-b)pyridine

Pyrazine- and pyridinecarboxamidoximes with an amino, potentially tautomeric hydroxy or mercapto group inortho position could be transformed in the appropriate condensed azines. In this manner, representatives of pyrazolo(3,4-b)pyrazine, isoxazolo(4,5-b)pyrazine and isothiazolo(5,4-b)pyridine ring system were synthesized and some transformations investigated.Presented in part at the 8th International Congress of Heterocyclic Chemistry, Graz, 1981.     

Probability measures in -algebras in Hilbert spaces with conjugation

Let be a real -algebra of -real bounded operators containing no central summand of type in a complex Hilbert space with conjugation . Denote by the quantum logic of all -orthogonal projections in the von Neumann algebra . Let be a probability measure. It is shown that contains a finite central summand and there exists a normal finite trace on such that , .

     

Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm

This paper proposes a hybrid self-adaptive evolutionary algorithm for graph coloring that is hybridized with the following novel elements: heuristic genotype-phenotype mapping, a swap local search heuristic, and a neutral survivor selection operator. This algorithm was compared with the evolutionary algorithm with the SAW method of Eiben et al., the Tabucol algorithm of Hertz and de Werra, and the hybrid evolutionary algorithm of Galinier and Hao. The performance of these algorithms were tested on a test suite consisting of randomly generated 3-colorable graphs of various structural features, such as graph size, type, edge density, and variability in sizes of color classes. Furthermore, the test graphs were generated including the phase transition where the graphs are hard to color. The purpose of the extensive experimental work was threefold: to investigate the behavior of the tested algorithms in the phase transition, to identify what impact hybridization with the DSatur traditional heuristic has on the evolutionary algorithm, and to show how graph structural features influence the performance of the graph-coloring algorithms. The results indicate that the performance of the hybrid self-adaptive evolutionary algorithm is comparable with, or better than, the performance of the hybrid evolutionary algorithm which is one of the best graph-coloring algorithms today. Moreover, the fact that all the considered algorithms performed poorly on flat graphs confirms that graphs of this type are really the hardest to color.