نتایج جستجو برای: kotera equa
تعداد نتایج: 337 فیلتر نتایج به سال:
The main purpose of this research is to propose a new methodology observe class time-fractional generalized fifth-order Korteweg–de Vries equations. Laplace transform along with homotopy perturbation algorithm utilized for the solution and analysis in current study. This extended technique provides improved convergent series solutions through symbolic computation. proposed applied Sawada–Kotera...
This paper describes a new solution method applied to the problem initializing DAEs using the Modelica lan-guage. Modelica is primarily an object-oriented equa-tion-based modeling language that allows specification of mathematical models of complex natural or man-made systems. Major features of Modelica are the mul-tidomain modeling capability and the reusability of model components correspondi...
In this paper we will present a numerical method for computing incompressible free surface ows in irregular ge ometries in three dimensions The approach we are taking is based on three ideas The rst is the second order ac curate projection method of Bell Colella and Glaz Bell et al for computing nite di erence approximations to the incompressible ow equations on rectangular grids The second is ...
A bstract. A procedure for the isolation of submitochondrial particles in quan-tity from etiolated Mung bean (Phaseolus aureus) seedlings is described. Using a combination of acetone extraction and 2 systems of thin layer chromatography ubiqu none has been isolated. The isolated u'biquinone migrates coincident with authentic ubiquinone-10 in reversed phase thin layer partition chromatography, g...
We apply active exemplar selection Plutowski White to predicting a chaotic time series Given a xed set of ex amples the method chooses a concise subset for training Fitting these exemplars results in the entire set being t as well as de sired The algorithm incorporates a method for regulating network complexity automatically adding exemplars and hidden units as needed Fitting examples generated...
The resolution (and paramodulation) inference systems are theorem proving procedures for rst-order logic (with equality), but they can run exponentially long for subclasses which have polynomial time decision procedures, as in the case of SLD resolution and the Knuth-Bendix completion procedure, both in the ground case. Specialized methods run in polynomial time, but have not been extended to t...
Discriminant feature spaces are attractive way to improve the word error rate performance of the speech recognition systems. Heteroscedastic discriminant analysis (HDA) is a generalized method for the feature space transformation that does not impose the equa l w i th in c l a s s cova r i ance assumptions required by the standard linear discriminant analysis (LDA). It will be shown that the co...
We thank the discussants for their varied and thought provoking responses although their number and variety makes a short response difficult. One of our goals, amply fulfilled, was to have extensive discussion of the many questions we raised but did not try to answer. In particular, Fan, Klaassen, and McNeney and Wellner all addressed questions A and B which we respond to further below. Another...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید