نتایج جستجو برای: friendly labeling

تعداد نتایج: 100296  

Journal: :Data Knowl. Eng. 2008
Christos Bouras Vassilis Poulopoulos Vassilis Tsogkas

In this manuscript we present the summarization and categorization subsystems of a complete mechanism that begins with web-page fetching and concludes with representation of the collected data to the end users through a personalized portal. The system intends to collect articles from major news portals and, following an algorithmic procedure, to create a more user friendly and personalized “vie...

2018
Koen C. Oost Lisa van Voorthuijsen Arianna Fumagalli Rik G.H. Lindeboom Joep Sprangers Manja Omerzu Maria J. Rodriguez-Colman Maria C. Heinz Ingrid Verlaan-Klink Madelon M. Maurice Boudewijn M.T. Burgering Jacco van Rheenen Michiel Vermeulen Hugo J.G. Snippert

Organoid technology provides the possibility of culturing patient-derived colon tissue and colorectal cancers (CRCs) while maintaining all functional and phenotypic characteristics. Labeling stem cells, especially in normal and benign tumor organoids of human colon, is challenging and therefore limits maximal exploitation of organoid libraries for human stem cell research. Here, we developed ST...

2012
Hongjuan Tian

The research of Boolean index sets of graphs is one of the most important graph theories in the graph theory . Boolean index sets of graphs are to use the vertex sets and the edge sets of graphs to study the characteristics of various graphs and their inherent characteristics through corresponding the mapping function to 2 Z . It’s theory can be applied to information engineering, communication...

Ali Gholamrezanezhad, Ardeshir Ghavamzadeh Davood Beiki, Jalil Majd Ardekani Kamran Alimoghadam Kianoush Ansari Gilani Maryam Bashtar Mehdi Mohammadnezhad Mohammad Bagheri Mohsen Saghari Reza Malekzadeh Sahar Mirpour,

  Introduction: The field of stem cell biology and regenerative medicine is rapidly moving toward translation to clinical practice. Stem cell therapy seems to be a new treatment option for some diseases. So, tracking the distribution of stem cells is crucial to their therapeutic use. Based on this fact we labeled human mesenchymal stem cells (MSCs) with 111...

Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...

2016
Kai Wen Teng Yuji Ishitsuka Pin Ren Yeoan Youn Xiang Deng Pinghua Ge Sang Hak Lee Andrew S Belmont Paul R Selvin

Site-specific fluorescent labeling of proteins inside live mammalian cells has been achieved by employing Streptolysin O, a bacterial enzyme which forms temporary pores in the membrane and allows delivery of virtually any fluorescent probes, ranging from labeled IgG's to small ligands, with high efficiency (>85% of cells). The whole process, including recovery, takes 30 min, and the cell is rea...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شیراز - دانشکده علوم 1391

in this thesis, we exploit a simple and suitable method for immobilization of copper(ii) complex of 4?-phenyl-terpyridine on activated multi-walled carbon nanotubes [amwcnts-o-cu(ii)-phtpy]. this nanostructure was characterized by various physico-chemical techniques. to ensure the efficiency and fidelity of copper species, the implementation of three-component strategies in click-chemistry all...

2013
Matthew J. Kotchen

Interest in decentralized approaches to environmental management has grown significantly in recent years. Along with the standard instruments of environmental policy—quantity, price, and technology regulations—a growing number of voluntaryand information-based approaches (VIBAs) to environmental management have emerged. These include more decentralized policies, programs, and market trends, suc...

Journal: :Vestnik of Saint Petersburg University. Management 2018

2006

A friendly sequence is one in which successive terms differ by one. Since a friendly sequence may be a repeat on which a longer sequence is based, the first and last terms must be friendly so that repeats are friendly. Friendly sequences often make good candidates for threading and treadling sequences. And since they have alternating parity, they are applicable to weaves that have this requirem...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید