نتایج جستجو برای: strongly blended dually quasi

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

2002
WILDERICH TUSCHMANN

We investigate questions in quantum information geometry which concern the existence and non-existence of dual and dually flat structures on stratified sets of density operators on finite-dimensional Hilbert spaces. We show that the set of density operators of a given rank admits dually flat connections for which one connection is complete if and only if this rank is maximal. We prove moreover ...

2017
Xingxin Zhan Zhixia Zhang Fang Sun Qian Liu Weijun Peng Heng Zhang Weirong Yan

BACKGROUND Primary health care workers (PHCWs) are a major force in delivering basic public health services (BPHS) in rural China. It is necessary to take effective training approaches to improve PHCWs' competency on BPHS. Both electronic learning (e-learning) and blended learning have been widely used in the health workers' education. However, there is limited evidence on the effects of blende...

1997
Andreas Brandstädt Victor Chepoi Feodor F. Dragan

In this paper we show that, for each chordal graph G, there is a tree T such that T is a spanning tree of the square G2 of G and, for every two vertices, the distance between them in T is not larger than the distance in G plus 2. Moreover, we prove that, if G is a strongly chordal graph or even a dually chordal graph, then there exists a spanning tree T of G that is an additive 3-spanner as wel...

Journal: :Oper. Res. Lett. 2016
Tamás Solymosi Balázs Sziklai

We provide a new modus operandi for the computation of the nucleolus in cooperative games with transferable utility. Using the concept of dual game we extend the theory of characterization sets. Dually essential and if the game is monotonic dually saturated coalitions determine both the core and the nucleolus whenever the core is non-empty. We show how these two sets are related to the existing...

Journal: :CoRR 2012
Arne Leitert

A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T . This paper investigates the Colourability problem on dually chordal graphs. It will show that it is NP-complete in case of four colours and solvable in linear time with a simple algorithm in case of three colours. In addition, it will be shown that a dually chordal graph is ...

Journal: :European Journal of Combinatorics 2015

Journal: :Pure Mathematics 2013

Journal: :Nonlinear Analysis: Theory, Methods & Applications 2014

2012
Dale P. Bentz Chiara F. Ferraris Michael A. Galler Andrew S. Hansen John M. Guynn

The rheological properties of blended cement-based materials depend strongly on mixture proportions and the characteristics of the components. In this study, design of experiments is used to investigate the influence of three variables (cement particle size distribution (PSD), fly ash PSD, and ratio of fly ash to cement) at each of four levels on the yield stress and viscosity of blended pastes...

2015
Vincenzo Del Fatto Gabriella Dodero Roberta Lena

The traditional approach of teaching Databases requires a great effort on the initial aspects of modeling and design that can negatively affect student’s motivation. This consideration led us to propose a method able to motivate students. The paper presents an innovative method of teaching a Database course, as well as the results of its experience in an Italian high school. This method is base...

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

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