نتایج جستجو برای: bond graphs

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

Journal: :Des. Codes Cryptography 2012
Hyonju Yu

In this paper, we give infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [−1− √ 2,−2) and also infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [α1,−1− √ 2) where α1 is the smallest root(≈ −2.4812) of the polynomial x3 + 2x2 − 2x − 2. From these results, we ...

2017
Sapna Mehta

iv Acknowledgements v List of Tables vii List of Graphs vii

2009
Chaoyan Wang

................................................................................................................................................. 3 Acknowledgements................................................................................................................................ 6 List of Tables...........................................................................................

پایان نامه :0 1380

این مطالعه در نظر دارد تا استحکام برشی 4 نوع سیستم چسبنده عاجی موجود در بازار را مقایسه کند. چهار نوع چسب عاجی شامل: 1-‏‎cleafil-se bond(kuraray)‎‏ 2-‏‎etch&prime 3.0‎‏3-‏‎excite single component(vivadent)‎‏ 4-‏‎single bond(3m)‎‏ است.

Journal: :Simulation 2008
Pieter J. L. Cuijpers Jan F. Broenink Pieter J. Mosterman

Models of physical systems have to be based on physical principles such as conservation of energy and continuity of power. These principles are inherently enforced by the bond graph modeling formalism. Often, however, physical components may be best modeled as piecewise continuous with discrete mode changes, which leads to a violation of continuity principles. To support such hybrid models, bon...

Journal: :iranian journal of mathematical chemistry 2015
g. h. shirdel n. kahkeshani

the purpose of the matching interdiction problem in a weighted graph is to findtwo vertices such that the weight of the maximum matching in the graph withoutthese vertices is minimized. an approximate solution for this problem has beenpresented. in this paper, we consider dendrimers as graphs such that the weightsof edges are the bond lengths. we obtain the maximum matching in some types ofdend...

2006
Jorge Luis Baliño

In this paper a Bond Graph methodology described in a previous contribution is used to model incompressible one-dimensional duct flows with rigid walls. Since the volumetric flow is independent of position, the balance equations can be simplified. The volumetric flow and a nodal vector of entropy are defined as Bond Graph state variables. The state equations and the coupling with the inertial a...

Journal: :International Journal of Hydrogen Energy 2017

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

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