Buscar
Mostrando ítems 1-10 de 510
Proposta de matriz de maturidade para o desenvolvimento de novos produtos sob a perspectiva da economia circular
(Universidade Estadual Paulista (Unesp), 2021-09-17)
Nos últimos anos, vários trabalhos têm sugerido a abordagem da economia circular (EC) como alternativa ao modelo linear tradicional, o qual é baseado em extrair – fabricar – usar – descartar. Para a sua adoção, torna-se ...
Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs
(Society for Industrial and Applied Mathematics, 2021-04-12)
In 1969, Tucker characterized proper circular-arc graphs as those graphs whose augmented adjacency matrices have the circularly compatible ones property. Moreover, he also found a polynomial-time algorithm for deciding ...
Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
(Elsevier Science, 2014-02)
Circular-arc graphs are the intersection graphs of open arcs on a circle. Circle graphs are the intersection graphs of chords on a circle. These graph classes have been the subject of much study for many years and numerous ...
Isomorphism of graph classes related to the circular-ones property
(Discrete Mathematics and Theoretical Computer Science, 2013-03)
We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. Our algorithm is similar to the isomorphism algorithm for interval graphs of Lueker and Booth, ...
Carrier Frequency Offset Compensation for OFDMA Systems Using Circular Banded Matrices
(Planta Piloto de Ingeniería Química, 2013-07)
Orthogonal frequency division multiple access (OFDMA) is a multiuser communication technique that allocates to each user a set of orthogonal carriers. In the presence of carrier frequency offset (CFO) the orthogonality ...
On dominating set polyhedra of circular interval graphs
(Elsevier Science, 2021-04)
Clique-node and closed neighborhood matrices of circular interval graphs are circular matrices. The stable set polytope and the dominating set polytope on these graphs are therefore closely related to the set packing ...
Balancedness of subclasses of circular-arc graphs
(Discrete Mathematics and Theoretical Computer Science, 2014-03)
A graph is balanced if its clique-vertex incidence matrix contains no square submatrix of odd order with exactly two ones per row and per column. There is a characterization of balanced graphs by forbidden induced subgraphs, ...
Mueller matrix spectroscopic ellipsometry study of chiral nanocrystalline cellulose films
(2018-02-01)
Chiral nanocrystalline cellulose (NCC) free-standing films were prepared through slow evaporation of aqueous suspensions of cellulose nanocrystals in a nematic chiral liquid crystal phase. Mueller matrix (MM) spectroscopic ...
Analysis of a Reconfigurable Bandpass Circular Patch Filter
(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2010)
This paper presents an analysis of a reconfigurable patch filter based on a triple-mode circular patch resonator with four radial slots. The analysis has been carried out thanks to the development of a new theoretical ...
Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property
(John Wiley & Sons Inc, 2020-02-20)
A graph is concave-round if its vertices can be circularly enumerated so that the closed neighborhood of each vertex is an interval in the enumeration. In this study, we give a minimal forbidden induced subgraph characterization ...