نتایج جستجو برای: strongly blended dually quasi
تعداد نتایج: 313972 فیلتر نتایج به سال:
The hole transport properties of poly(2-methoxy, 5-(2'-ethyl-hexoxy)-p-phenylene vinylene) (MEH-PPV) blended with acid oxidized multiwall carbon nanotubes (COOH-MWCNTs) were investigated in a diode configuration using the time-of-flight (TOF) photocurrent method. While the room temperature hole mobility in pure MEH-PPV films was non-dispersive with positive field dependent mobility, MEH-PPV:COO...
This paper explores the role of Blending Theory, as a framework, to aid in design decisions while deploying mobile experiences for heritage storytelling. Blending Theory provides a structured way of thinking about how digital and physical spaces can be brought together to create new experiences in blended spaces. In this paper we describe the development of an app that aims to enhance the visit...
In this paper, a combination of algebraic and topological methods are applied to obtain new structural results on harmonic rings. Especially, it is shown that if Gelfand ring A modulo its Jacobson radical zero dimensional ring, then clean ring. It also proved that, for given A, the retraction map $${\text {Spec}}(A)\rightarrow {\text {Max}}(A)$$ flat continuous only Dually, mp-ring {Min}}(A)$$...
The dually flat structure introduced by Amari–Nagaoka is highlighted in information geometry and related fields. In practical applications, however, the underlying pseudo-Riemannian metric may often be degenerate, such an excellent geometric rarely defined on entire space. To fix this trouble, present paper, we propose a novel generalization of for certain class singular models from viewpoint L...
Dually flat manifolds constitute fundamental mathematical objects of information geometry. This note establishes some facts on the global properties and topology of dually flat manifolds which, in particular, provide answers to questions and problems in global information geometry posed by Amari and Amari-Nagaoka.
A vertex with neighbours of degrees d1 ≥ · · · ≥ dr has vertex type (d1, . . . , dr). A graph is vertex-oblique if each vertex has a distinct vertex-type. While no graph can have distinct degrees, Schreyer, Walther and Mel’nikov [Vertex oblique graphs, same proceedings] have constructed infinite classes of super vertex-oblique graphs, where the degree-types of G are distinct even from the degre...
Let G = (V, E) be an undirected graph and r be a vertex weight function with positive integer values. A subset (clique) D ~_ V is an r-dominat ing set (clique) in G ifffor every vertex v e V there is a vertex u e D with dist(u, v) <~ r(v). This paper contains the following results: (i) We give a simple necessary and sufficient condition for the existence of r-dominating cliques in the case of H...
Lately the previous confidence in e-learning has declined. An OECD report from 2005 states that elearning has been an administrative success, but not as far as learning itself is concerned. In 2003 Commissionaire Reding gave a speech, in which she strongly promoted blended learning as the way forward towards a learner-centric approach to learning with a more or less hidden criticism toward e-le...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید