نتایج جستجو برای: represents the error term
تعداد نتایج: 16166519 فیلتر نتایج به سال:
this is xetex, version 3.1415926-2.2-0.9995.1 (miktex 2.8) (preloaded format=xelatex 2012.4.3) 11 nov 2012 22:12 entering extended mode **template_2.tex ("c:userszahradesktopxepersian file - copy emplate_2.tex" latex2e <2009/09/24> babel and hyphenation patterns for english, dumylang, nohyphenation, ge rman, ngerman, german-x-2009-06-19, ngerman-x-2009-06-19, french, loaded. ("c:...
عنوان:بازتاب دفاع مقدس در شعر سه بانوی شاعر(طاهره صفارزاده، سپیده کاشانی، سیمین دخت وحیدی) نام ونام خانوادگی:شیرین علیپور پیروزیان رشته تحصیلی:زبان وادبیات فارسی نام استاد راهنما :دکتر مهین پناهی نام استاد مشاور : دکتر مهدی نیک منش زمان دفاع:14/ 7/1388 چکیده موضوع این پژوهش چگونگی بازتاب دفاع مقدس در اشعار سه بانوی شاعر " طاهره صفّارزاده" ، "سپیده کاشانی" و" سیمین دخت وحیدی " است ....
in this paper, the problem of decentralized model reference adaptive control (mrac) for a class of large scale systems with time varying delay in interconnected term and input and state delays is studied. to compensate the effect of input delay indirectly, a smith predictor built on. to handle the effects of the time delays in input, the adaptive controller part includes two auxiliary dynamic f...
Steer-by-wire is the electrical steering systems on vehicles that are expected with the development of an optimal control system can improve the dynamic performance of the vehicle. This paper aims to optimize the control systems, namely Fuzzy Logic Control (FLC) and the Proportional, Integral and Derivative (PID) control on the vehicle steering system using Imperialist Competitive Algorithm (IC...
Semidiscrete finite element approximation of a hyperbolic type integro-differential equation is studied. The model problem is treated as the wave equation which is perturbed with a memory term. Stability estimates are obtained for a slightly more general problem. These, based on energy method, are used to prove optimal order a priori error estimates.
languages usually involves proving a decomposition theorem. Not only is such a proof tedious, un-inspiring, and error-prone, but also it is usually attempted many times during the design of a theory. With an eye towards automation, we develop an algorithm for checking the statement of the decomposition theorem. Our algorithm is expressed as a sound and complete term rewriting system with respec...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید