نتایج جستجو برای: node polynomials

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

H. Izadan and S. A. Hosseini Ravandi,

In this study, a relationship between scanner response (RGB) and CIE tristimulus values (XYZ) is established by regression technique with different polynomials for colored polyester fabrics. The results showed that the transformation process is material dependent and higher order polynomials will fit the experimental data better than lower polynomials. The results also showed that the way the c...

2012
Sanaa Taha Sandra Céspedes Umaña Xuemin Shen

In this paper, we propose EMA, a novel scheme that guarantees the authenticity of a mobile node (MN) and a relay node (RN) in a multi-hop-enabled Proxy Mobile IP (PMIP) network. EMA works in conjunction with a proposed scheme for key establishment, based on symmetric polynomials, to generate a shared secret key between MN and RN. This scheme achieves lower revocation overhead than that achieved...

1999
HYUNG-SEOK OH

The superconvergent patch recovery (SPR) with bilinear interpolation functions usually gives good values of recovered stresses in an element patch. However, when 4-node quadrilateral elements meeting at a node are rigidly rotated with the essential and natural boundary conditions unchanged, the recovered stresses obtained by the SPR change and depend upon the local rotation of the patch. This c...

Journal: :iranian journal of fuzzy systems 2014
s. s. behzadi t. allahviranloo s. abbasbandy

in this paper we intend to offer new numerical methods to solve the second-order fuzzy abel-volterraintegro-differential equations under the generalized $h$-differentiability. the existence and uniqueness of thesolution and convergence of the proposed methods are proved in details and the efficiency of the methods is illustrated through a numerical example.

2010
Milos Zlámal MILOS ZLAMAL

We investigate the nonstationary equations of the semiconductor device theory consisting of a Poisson equation for the electric potential ¡p ai,d of two highly nonlinear continuity equations for carrier densities « and p. We use simplicial elements with linear polynomials and four-node two-dimensional and eight-node three-dimensional isoparametric elements. There are constructed finite element ...

2006
Richard W. Kenyon David B. Wilson

Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of the different possible node connections in a grove. These probabilities only depend on boundary measurements of the graph and not on the actual graph struct...

Journal: :journal of optimization in industrial engineering 0
hossein barghi jond young researchers and elite club, ahar branch, islamic azad university, ahar, iran vasif v. nabiyev department of computer engineering, karadeniz technical university, trabzon, turkey rifat benveniste department of electrical and electronic engineering, avrasya university, trabzon, turkey

the trajectory planning, which is known as a movement from starting to end point by satisfying the constraints along the path is an essential part of robot motion planning. a common way to create trajectories is to deal with polynomials which have independent coefficients. this paper presents a trajectory formulation as well as a procedure to arrange the suitable trajectories for applications. ...

Hossein Jafari, Nematollah Kadkhoda R.M. Ganji

In this work, we consider variable order difusion and wave equations. The derivative is describedin the Caputo sence of variable order. We use the Genocchi polynomials as basic functions andobtain operational matrices via these polynomials. These matrices and collocation method help usto convert variable order diusion and wave equations to an algebraic system. Some examples aregiven to show the...

Journal: :international journal of nanoscience and nanotechnology 2010
mircea v. diudea katalin nagy monica l. pop f. gholami-nezhaad a. r. ashrafi

design of crystal-like lattices can be achieved by using some net operations. hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. the networks herein presented are related to the dyck graph and described in terms of omega polynomial and piv polynomials.

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

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