نتایج جستجو برای: الگوریتم p s o

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

Journal: :nephro-urology monthly 0
maryam sarbishegi cellular and molecular research center, zahedan university of medical sciences, zahedan, ir iran; department of anatomy, school of medicine, zahedan university of medical sciences, zahedan, ir iran; department of anatomy, school of medicine, zahedan university of medical sciences, zahedan, ir iran. tel: +98-3329571519, fax: +98-33291124 ozra khajavi department of anatomy, school of medicine, zahedan university of medical sciences, zahedan, ir iran mohammad reza arab cellular and molecular research center, zahedan university of medical sciences, zahedan, ir iran; department of anatomy, school of medicine, zahedan university of medical sciences, zahedan, ir iran

background phytotherapy is a popular treatment option in cases of benign prostatic hyperplasia (bph), with many different herbal products being used for the treatment of this condition. withania coagulans (wc) is an herbal medicine that has shown anti-tumoral, anti-inflammatory, and antioxidant effects. objectives this study examined the effect of withania coagulans extract (wce) on prostatic c...

Journal: :journal of biotechnology and health sciences 0
farzad katiraee department of pathobiology, faculty of veterinary medicine, university of tabriz, tabriz, ir iran razzagh mahmoudi department of food hygiene and aquatics, faculty of veterinary medicine, university of tabriz, tabriz, ir iran; department of food hygiene and aquatics, faculty of veterinary medicine, university of tabriz, tabriz, ir iran. tel: +98-9127868571, fax: +98-4136378743 keyvan tahapour department of pathobiology, faculty of veterinary medicine, university of tabriz, tabriz, ir iran gholamreza hamidian department of basic siences, faculty of veterinary medicine, university of tabriz, tabriz, ir iran seyed jamal emami department of pathobiology, faculty of veterinary medicine, university of tabriz, tabriz, ir iran

conclusions potent antifungal activity, make this plant an effective replacement treatment for fungal infections or fungal strains that are resistance to synthetic antifungals. results thirty-two components were identified in vitex agnus-castus eo. the main compound was alpha-pinene (19.48%). the total phenolic content of eo was determined as 82.26 ± 5.94 mg gallic acid equivalent (gae)/g eo. t...

Journal: :iranian journal of catalysis 2013
razieh fazaeli hamid aliyan somaieh parishani foroushani zahra mohagheghian zahra heidari

surface of mesostructured silica, kit-6, was modified by grafting 3-aminopropyl-triethoxysilane (aptes) to have the positive charge, and thus, to provide sites for the immobilization of h3pw12o40 (pw12).  this modified-nanosized mesoporous silica (pw12-aptes@ kit-6) was characterized by ftir, xrd, bet and tem. the oxidation of sulfides occurs effectively and selectively with h2o2 as the oxidant...

2011
SILVIA FERNÁNDEZ-MERCHANT ROGELIO VALDEZ

To be considered for publication, solutions should be received by September 1, 2011. 1866. Proposed by Sadi Abu-Saymeh and Mowaffaq Hajja, Mathematics Department, Yarmouk University, Irbid, Jordan. Let ABC be a triangle, and L and M points on AB and AC, respectively, such that AL = AM. Let P be the intersection of BM and CL. Prove that PB = PC if and only if AB = AC. 1867. Proposed by Ángel Pla...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد یزد - دانشکده برق 1393

طراحی الگوریتم های mppt به علت داشتن مشخصه غیر خطی جریان - ولتاژ با یک نقطه واحد تولید که توان در آن بیشینه است، ضروری می نماید. الگوریتم های بسیاری برای حداکثر کردن توان در یک سیستم pv وجود دارد که می تواند از یک رابطه ولتاژ ساده تا نمونه برداری چندگانه برای تحلیل های پیچیده تر استفاده شود. اما هریک از این الگوریتم ها معایبی دارند که از جمله می توان به ردیابی نادرست هنگام تغییرات شدید خورشیدی،...

Journal: :acta medica iranica 0
gh. rahbari

the most conveni ent me thod f or d e t ermining bone dose duri ng ext ra-oral . radi ogr aphy is ph o togr aph~c r adiation desimetry.this met hod was used bec ause, it is cheap,srnall l i ghtweight a nd adequately sens itive a nd i t a l s o prov i des a p e rmanent r ecor ds ( l o}. i t i s evident f r om thi s r eport tha t a r e l a tionsh i p e xist s between the bone and s k i n dose , a...

Journal: :medical journal of islamic republic of iran 0
nader pestechian department of parasitology and mycology, school of medicine, isfahan university of medical sciences, isfahan, iran.سازمان اصلی تایید شده: دانشگاه علوم پزشکی اصفهان (isfahan university of medical sciences) hosein khanahmad shahreza department of genetics, school of medicine, isfahan university of medical sciences, isfahan, iran.سازمان اصلی تایید شده: دانشگاه علوم پزشکی اصفهان (isfahan university of medical sciences) roghiyeh faridnia department of parasitology and mycology, school of medicine, mazandaran university of medical sciences, mazandaran, iran.سازمان اصلی تایید شده: دانشگاه علوم پزشکی مازندران (mazandaran university of medical sciences) hamed kalani department of parasitology and mycology, school of medicine, isfahan university of medical sciences, isfahan, iran.سازمان اصلی تایید شده: دانشگاه علوم پزشکی اصفهان (isfahan university of medical sciences)

background: this study was designed to evaluate whether or not t. gondii and its derivatives can change the gene expression level of il-10 in murine leukocytes in vivo.   methods: fifty balb/c mice were divided into 5 groups, four of which received the excretory/secretory product (esp) from cell culture medium, the esp from cell free medium, the toxoplasma lysate product (tlp) and the active ta...

2017
Daniel Lokshtanov Amer E. Mouawad Saket Saurabh Meirav Zehavi

The Cycle Packing problem asks whether a given undirected graph G = (V,E) contains k vertex-disjoint cycles. Since the publication of the classic Erdős-Pósa theorem in 1965, this problem received significant scientific attention in the fields of Graph Theory and Algorithm Design. In particular, this problem is one of the first problems studied in the framework of Parameterized Complexity. The n...

2014
Nicolas Bousquet St'ephan Thomass'e

Let G = (V,E) be a graph. A k-neighborhood in G is a set of vertices consisting of all the vertices at distance at most k from some vertex of G. The hypergraph on vertex set V which edge set consists of all the k-neighborhoods of G for all k is the neighborhood hypergraph of G. Our goal in this paper is to investigate the complexity of a graph in terms of its neighborhoods. Precisely, we define...

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

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