نتایج جستجو برای: hornstein m d

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

Journal: :مهندسی عمران شریف 0
علیرضا حاجیانی بوشهریان گروه مهندسی عمران، دانشگاه آزاد اسلامی، واحد شیراز مهدی ویس کرمی بخش مهندس راه، ساختمان و محیط زیست، دانشگاه شیراز علیرضا وثوقی بخش مهندسی را، ساختمان و محیط زیست، دانشگاه شیراز مقداد حمیدزاده گروه مهندسی عمران، دانشگاه گیلان

s i n c e t h e l a t e 1960s, s e v e r a l c o n s t i t u t i v e m o d e l s h a v e b e e n d e v e l o p e d f o r s a n d s d e s c r i b i n g t h e i r s t r e s s-s t r a i n e h a v i o r. m o s t o f t h e s e m o d e l s w e r e e s t a b l i s h e d b a s e d o n a m e a s u r e o f t h e p l a s t i c w o r k a n d s o m e y i e l d c r i t e r i a, a m o n g t h e m b e i n g t ...

1992
Bonnie J. Dorr

This paper discusses how a two-level knowledge representation model for machine translation integrates aspectual information with lexical-semantic information by means of parameterization. The integration of aspect with lexical-semantics is especially critical in machine translation because of the lexical selection and aspectual realization processes that operate during the production of the ta...

In the present paper, we give a new approach to Caristi's fixed pointtheorem on non-Archimedean fuzzy metric spaces. For this we define anordinary metric $d$ using the non-Archimedean fuzzy metric $M$ on a nonemptyset $X$ and we establish some relationship between $(X,d)$ and $(X,M,ast )$%. Hence, we prove our result by considering the original Caristi's fixedpoint theorem.

The aromatic and dark-colored spearmint essential oil wastewater (SEOW) generally contains a large amount of organic matter, including chemical oxygen demand (COD), phenolic compounds, and inorganic contents. In this study, the pollutant removal performance and biogas production rate of an up-flow anaerobic sludge blanket (UASB) reactor used for the treatment of SEOW were investigated. During t...

‎The distinguishing number (resp. index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$‎ ‎such that $G$ has an vertex labeling (resp. edge labeling) with $d$ labels that is preserved only by a trivial‎ ‎automorphism‎. ‎For any $n in mathbb{N}$‎, ‎the $n$-subdivision of $G$ is a simple graph $G^{frac{1}{n}}$ which is constructed by replacing each edge of $G$ with a path of length $n$...

Journal: :Proceedings of the American Mathematical Society 1988

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

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