نتایج جستجو برای: ii algorithm
تعداد نتایج: 1312542 فیلتر نتایج به سال:
in this study the performance and emissions characteristics of a heavy-duty, direct injection, compression ignition (ci) engine which is specialized in agriculture, have been investigated experimentally. for this aim, the influence of injection timing, load, engine speed on power, brake specific fuel consumption (bsfc), peak pressure (pp), nitrogen oxides (nox), carbon dioxide (co2), carbon mon...
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
many real water resources optimization problems involve conflicting objectives. in this study, multiobjective genetic algorithm nsga-ii, has been developed for optimization the conjunctive use of surface water and groundwater resources and optimal management of supply and demand of agricultural water. here, optimal allocation of land and water resources to the dominant products in najaf abad pl...
چکیده کاتالیست های ناهمگن (1) (silica gel)-o2(eto)si-l1-mn(hl2) ، (silica gel)-[o2(meo) ni-h2l3(h2o)] (3)، (silica gel)-[o2(meo) cu-l4(h2o)2] (4) باکارایی و گزینش پذیری بالا به ترتیب از طریق تثبیت کمپلکس های منگنز، مس و نیکل روی بستر های معدنی سنتز شدند. کاتالیست دستوار(2) sio2-[mn3(µ-d-(?)-tart)2(ohch3)6(ch3co2)] از طریق حلال کافت سل-ژل و تراکم چندتایی باز شیف در حضور d- (-) تارتاریک اسید در...
The Traffic Alert and Collision Avoidance System (TCAS) is a family of airborne systems designed to reduce the risk of mid-air collisions between aircraft. TCAS II, the current generation of TCAS devices, provides resolution advisories that direct pilots to maintain or increase vertical separation when aircraft distance and time parameters are beyond designed system thresholds. This paper prese...
In [14], Petit et al. shows that under the algebraic geometrical assumption named ”First Fall degree Assumption”, the complexity of ECDLP over binary extension field F2n is in O(exp(n)) where limn→∞ o(1) = 0 and there are many generalizations and improvements for the complexity of ECDLP under this assumption [10], [11], [5], [16]. In [13], the author proposes the bit coincidence mining algorith...
An increasingly large number of digital binary images have been used in everyday life. Handwritten signatures captured by electronic signing pads are digitally stored and are being used as the records for credit card payment by many department stores in the U.S. and for parcel delivery by major courier services such as the United Parcel Service (UPS). Word processing software like Microsoft Wor...
The QR algorithm is still one of the most important methods for computing eigenvalues and eigenvectors of matrices. Most discussions of the QR algorithm begin with a very basic version and move by steps toward the versions of the algorithm that are actually used. This paper outlines a pedagogical path that leads directly to the implicit multishift QR algorithms that are used in practice, bypass...
In Ptolemy II, the widths of the relations between actors have an important role in specifying the semantics of a model. In some situations, however, explicit relation widths break the modularity of a model. In these cases, we would like to infer the widths of relations from the widths of neighboring relations. There is an existing implementation in Ptolemy, but it has some severe limitations. ...
The density-based clustering algorithm presented is different from the classical Density-Based Spatial Clustering of Applications with Noise (DBSCAN) (Ester et al., 1996), and has the following advantages: first, Greedy algorithm substitutes for R(*)-tree (Bechmann et al., 1990) in DBSCAN to index the clustering space so that the clustering time cost is decreased to great extent and I/O memory ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید