Results 11 to 20 of about 1,096,401 (237)

Bond graphs III: Bond graphs and electrical networks [PDF]

open access: yesDiscrete Applied Mathematics, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John D. Lamb   +2 more
openaire   +4 more sources

Formalisation, Abstraction and Refinement of Bond Graphs

open access: yes, 2023
Bond graphs represent the structure and functionality of mechatronic systems from a power flow perspective. Unfortunately, presentations of bond graphs are replete with ambiguity, significantly impeding understanding. A formalisation of the essentials of bond graphs is given, together with a formalisation of bond graph transformation, which can ...
Richard Banach, John W. Baugh Jr.
openaire   +4 more sources

Bond graphs I: Acausal equivalence [PDF]

open access: yesDiscrete Applied Mathematics, 1997
There are hundreds of papers about bond-graphs, describing the distribution of the power through a physical system; some of them lacks mathematical precision (or contain plainly incorrect results as well). The authors start a mathematically rigorous study.
John D. Lamb   +2 more
openaire   +3 more sources

Bicausal Bond Graphs

open access: yes, 1995
Conventional bond graph theory is predicated on the notion that a bond\ud has a single causal stroke: an effort imposed at one end implies a flow\ud imposed at the other. This notion is implied by components having a\ud known constitutive relationship.\ud \ud This paper discusses bond graphs with two causal strokes - Bicausal\ud bond-graphs. These can,
Gawthrop, P.J.
core   +9 more sources

The Noncrossing Bond Poset of a Graph [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2020
The partition lattice and noncrossing partition lattice are well studied objects in combinatorics. Given a graph $G$ on vertex set $\{1,2,\dots, n\}$, its bond lattice, $L_G$, is the subposet of the partition lattice formed by restricting to the partitions whose blocks induce connected subgraphs of $G$.
C. Matthew Farmer   +2 more
openaire   +4 more sources

Experimental and bond graph based sensitivity calculations for micro-scale robust engineering design [PDF]

open access: yes, 2005
Copyright @ 2005 IEEEBond graph modeling and sensitivity analysis are used to provide a platform for the robust design of a small mechatronic device, a behind-the-ear (BTE) hearing aid.
Wynn, HP   +5 more
core   +6 more sources

Bond graphs in model matching control [PDF]

open access: yes, 2006
Bond graphs are primarily used in the network modeling of lumped parameter physical systems, but controller design with this graphical technique is relatively unexplored.
Ballance, D.J., Vink, D., Gawthrop, P.J.
core   +1 more source

Bond graph analysis in robust engineering design [PDF]

open access: yes, 2000
Within engineering design, optimization often involves building models of working systems to improve design objectives such as performance, reliability and cost.
GABBRIELLI R.   +22 more
core   +1 more source

Stars and bonds in crossing‐critical graphs [PDF]

open access: yesJournal of Graph Theory, 2008
AbstractThe structure of previous known infinite families of crossing‐critical graphs had led to the conjecture that crossing‐critical graphs have bounded bandwidth. If true, this would imply that crossing‐critical graphs have bounded degree, that is, that they cannot contain subdivisions of K1, n for arbitrarily large n.
Petr Hlinený, Gelasio Salazar
openaire   +3 more sources

Teaching @ Bond

open access: yes, 2011
Teaching at Bond has been written specifically for teachers at Bond University. It contains usefule information to induct teachers into their teaching role at Bond University, provide affirmation teaching strategies as a Bond teacher, and help enhance ...
Kinash, Shelley
core   +4 more sources

Home - About - Disclaimer - Privacy