Results 61 to 70 of about 786,749 (367)

Planar‐Structure Perovskite Solar Cells with Efficiency beyond 21%

open access: yesAdvances in Materials, 2017
Low temperature solution processed planar‐structure perovskite solar cells gain great attention recently, while their power conversions are still lower than that of high temperature mesoporous counterpart.
Qi Jiang   +9 more
semanticscholar   +1 more source

Planarity of Streamed Graphs [PDF]

open access: yesTheoretical Computer Science, 2015
In this paper we introduce a notion of planarity for graphs that are presented in a streaming fashion. A $\textit{streamed graph}$ is a stream of edges $e_1,e_2,...,e_m$ on a vertex set $V$. A streamed graph is $ $-$\textit{stream planar}$ with respect to a positive integer window size $ $ if there exists a sequence of planar topological drawings ...
Da Lozzo G., Rutter I.
openaire   +5 more sources

Contactless object manipulation using multiple air jets on planar surface (Experimental case studies for small control range with continuous air jets)

open access: yesNihon Kikai Gakkai ronbunshu, 2014
We propose a technology for manipulating the position and attitude of an object on a planar surface in a contactless manner. This technology involves multiple ejectors that stream jets of compressed air onto an object from various directions.
Tsubasa MATSUSHITA   +8 more
doaj   +1 more source

Untangling a Planar Graph [PDF]

open access: yesDiscrete & Computational Geometry, 2009
A straight-line drawing $ $ of a planar graph $G$ need not be plane, but can be made so by \emph{untangling} it, that is, by moving some of the vertices of $G$. Let shift$(G, )$ denote the minimum number of vertices that need to be moved to untangle $ $. We show that shift$(G, )$ is NP-hard to compute and to approximate. Our hardness results extend
Xavier Goaoc   +5 more
openaire   +5 more sources

A typical graph structure of a ring [PDF]

open access: yesTransactions on Combinatorics, 2015
The zero-divisor graph of a commutative ring R with respect to nilpotent elements is a simple undirected graph $Gamma_N^*(R)$ with vertex set Z_N(R)*, and two vertices x and y are adjacent if and only if xy is nilpotent and xy is nonzero, where Z_N(R)={x
R. Kala , S. Kavitha
doaj  

Under-Coupling Whispering Gallery Mode Resonator Applied to Resonant Micro-Optic Gyroscope

open access: yesSensors, 2017
As an important sensing element, the whispering gallery mode resonator (WGMR) parameters seriously affect the resonant micro-optic gyroscope (RMOG) performance.
Kun Qian   +7 more
doaj   +1 more source

A note on comaximal ideal graph of commutative rings

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
Let be a commutative ring with identity. The comaximal ideal graph of is a simple graph with its vertices are the proper ideals of R which are not contained in the Jacobson radical of , and two vertices and are adjacent if and only if .
S. Kavitha, R. Kala
doaj   +1 more source

Contactless object manipulation using multiple air jets on planar surface (Experimental case studies of control method for the multiple objects using four air jets nozzles)

open access: yesNihon Kikai Gakkai ronbunshu, 2016
We present a method for contactless manipulation of multiple small objects in a plane using multiple air jets. When the objects are initially clustered as a group, the group's center of gravity is used as a representative point and the entire group ...
Tsubasa MATSUSHITA   +4 more
doaj   +1 more source

On Another Class of Strongly Perfect Graphs

open access: yesMathematics, 2022
For a commutative ring R with unity, the associate ring graph, denoted by AG(R), is a simple graph with vertices as nonzero elements of R and two distinct vertices are adjacent if they are associates.
Neha Kansal   +3 more
doaj   +1 more source

Planar S-systems: Permanence [PDF]

open access: yesJournal of Differential Equations, 266(6):3787-3817, 2019, 2018
We characterize permanence of planar S-systems. Further, we construct a planar S-system with three limit cycles.
arxiv   +1 more source

Home - About - Disclaimer - Privacy