نتایج جستجو برای: super and sub additive transformation

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

پایان نامه :دانشگاه تربیت معلم - تهران - دانشکده ادبیات و زبانهای خارجی 1390

the frame semantic theory is a nascent approach in the area of translation studies which goes beyond the linguistic barriers and helps us to incorporate cognitive and cultural factors to the study of translation. based on rojos analytical model (2002b), which centered in the frames or knowledge structures activated in the text, the present research explores the various translation problems that...

Journal: :بوم شناسی کشاورزی 0
سارا سنجانی سید محمد باقر حسینی محمدرضا چائی چی شهرام رضوان بیدختی

to evaluate the yield and yield components in additive intercropping system of grain sorghum (sorghum bicolor l.) and cowpea (vigna unguiculata l.) under limited irrigation condition, an experiment was conducted in research farm of college of agriculture, university of tehran, during spring 2006. the experimental treatments were arranged in split plots based on a complete randomized block desig...

2012
V. K. Ananthashayana

Crucial information barely visible to the human eye is often embedded in a series of low resolution images taken of the same scene. Super resolution reconstruction is the process of combining several low resolution images into a single higher resolution image. The ideal algorithm should be fast, and should add sharpness and details, both at edges and in regions without adding artifacts. In this...

The roles of the several parameters that influences railway track deterioration most, are examined in this research with a view to make railway track maintenance more effective and cost efficient. The results presented are based on a comprehensive study of railway track degradation on super structure, sub-structure and geometrical aspects. The changes in TQI (Track Quality Index), the track set...

S. Ziari

Jahanshahloo et al. (Appl Math Comput 153:215–224, 2004) propose a method for ranking extremely efficient decision making units (DMUs) in data envelopment analysis (DEA) using super-efficiency technique and l1-norm and they show that the presented method is able to eliminate the existing difficulties in some methods. This paper suggests an alternative transformation to convert the nonlinear mod...

2003
B. H. Lavenda

The pseudo-additive relation that the Tsallis entropy satisfies has nothing whatsoever to do with the super-and sub-additivity properties of the entropy. The latter properties, like concavity and convexity, are couched in geometric inequalities and cannot be reduced to equalities. Rather, the pseudo-additivity relation is a functional equation that determines the functional forms of the random ...

1998
Frank M. Candocia Jose C. Principe

We present and illustrate the use of a bottleneck system for the segmentation and super-resolution of ISAR targets. The system is shown to be comprised of three basic subsystems: a compressing transformation, a bottleneck processor, and a decompressing transformation. We describe each subsystem and discuss the processing responsible for segmentation and super-resolution within this framework. R...

Journal: :Glossa 2022

Whereas most previous studies on (super-)gang effects examined cases where two weaker constraints jointly beat another stronger constraint (Albright 2012; Shih 2017; Breiss & Albright 2022), this paper addresses gang that arise from multiple violations of a single constraint, which Jäger Rosenbach (2006) referred to as counting cumulativity. The super-additive version cumulativity is th...

2012
R. Mary Jeya Jothi

A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper we have analyzed the structure of super strongly perfect graphs in some Interconnection Networks, like Mesh, Torus, Hyper cubes and Grid Networks. Along with this investigation, we have characterized the Super Strongly ...

1998
Thierry Braconnier

The main di culty in the implementation of most standard implicit Runge-Kutta (IRK) methods applied to (sti ) ordinary di erential equations (ODE's) is to e ciently solve the nonlinear system of equations. In this article we propose the use of a preconditioner whose decomposition cost for a parallel implementation is equivalent to the cost for the implicit Euler method. The preconditioner is ba...

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

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