نتایج جستجو برای: 2005 hence

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

Journal: :J. Comb. Theory, Ser. B 2005
Tibor Jordán

We prove that every 6k-connected graph contains k edge-disjoint rigid (and hence 2-connected) spanning subgraphs. By using this result we can settle special cases of two conjectures, due to Kriesell and Thomassen, respectively: we show that every 12-connected graph G has a spanning tree T for which G− E(T ) is 2-connected, and that every 18-connected graph has a 2-connected orientation. © 2005 ...

2012
Kanat Camlibel Ilker Ustoglu

One of the classical problems of nonlinear systems and control theory is feedback linearization. Its obvious motivation is that one can utilize linear control theory if the nonlinear system at hand is linearizable by feedback. This problem is well-understood for the smooth nonlinear systems. In the present paper, we investigate feedback linearizability of a class of piecewise linear, and hence ...

Journal: :Journal of Endocrinology, Metabolism and Diabetes of South Africa 2005

2005
M. K. Çamlıbel

One of the classical problems of nonlinear systems and control theory is feedback linearization. Its obvious motivation is that one can utilize linear control theory if the nonlinear system at hand is linearizable by feedback. This problem is well-understood for the smooth nonlinear systems. In the present paper, we investigate feedback linearizability of a class of piecewise linear, and hence ...

2005
Arno J. Knobbe Eric K. Y. Ho Rainer Malik

In this paper, we provide some preliminary result for the ILP Challenge 2005 concerning a genetic database of information related to the function of a range of yeast genes. The yeast database consists of multiple tables, and is hence a multi-relational problem. We demonstrate how the MRDM packages Safarii (mining) and ProSafarii (pre-processing) can be used to mine this data. We provide biologi...

1995

and p j on one hand and on p i+1 and p j+1 on the other hand. Because all paths are pairwise disjoint, these winning strategies can be be combined to winning strategies on the two graphs consisting of p i ; (v i ; v i+1); p i+1 and p i ; (v i ; v j+1); p j+1 and on the two graphs consisting of p j ; (v j ; v j+1); p j+1 and p j ; (v j ; v i+1); p i+1. Let G 0 be deened as in (b) above, by delet...

2015
Juliane Liepe Hermann-Georg Holzhütter Elena Bellavista Peter M. Kloetzel P. H. Stumpf Michele Mishto

2014
Raya Muttarak Wolfgang Lutz

The collection of articles in this Special Feature is part of a larger project on “Forecasting Societies’ Adaptive Capacity to Climate Change” (an Advanced Grant of the European Research Council to Wolfgang Lutz). In investigating how global change will affect population vulnerability to climate variability and extremes, the project aims to help develop strategies that enable societies to bette...

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

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