Results 31 to 40 of about 637,766 (337)

Exergetic, Economic and Exergo-Environmental Analysis of Bottoming Power Cycles Operating with CO2-Based Binary Mixture

open access: yesEnergies, 2020
This study focused on investigating the bottoming power cycles operating with CO2-based binary mixture, taking into account exergetic, economic and exergo-environmental impact indices.
Muhammad Haroon   +6 more
doaj   +1 more source

Determining the physical conditions of extremely young Class 0 circumbinary disk around VLA1623A

open access: yes, 2020
We present detailed analysis of high-resolution C18O (2-1), SO (88-77), CO (3-2) and DCO+ (3-2) data obtained by the Atacama Large Millimeter/sub-millimeter Array (ALMA) towards a Class 0 Keplerian circumbinary disk around VLA1623A, which represents one ...
Cheong, Pou-Ieng   +5 more
core   +1 more source

Controlled motion of Janus particles in periodically phase-separating binary fluids [PDF]

open access: yes, 2015
We numerically investigate the propelled motions of a Janus particle in a periodically phase-separating binary fluid mixture. In this study, the surface of the particle tail prefers one of the binary fluid components and the particle head is neutral in ...
Araki, Takeaki, Fukai, Shintaro
core   +2 more sources

Decomposition and optimization over cycles in binary matroids

open access: yesJournal of Combinatorial Theory, Series B, 1989
For \(k=2\) and 3, we define several k-sums of binary matroids and of polytopes arising from cycles of binary matroids. We then establish relationships between these k-sums, and use these results to give a direct proof that a certain LP-relaxation of the cycle polytope is the polytope itself if and only if M does not have certain minors.
Grötschel, Martin, Truemper, K.
openaire   +2 more sources

Finding Debt Cycles: QUBO Formulations for the Maximum Weighted Cycle Problem Solved Using Quantum Annealing

open access: yesMathematics, 2023
The problem of finding the maximum weighted cycle in a directed graph map to solve optimization problems is NP-hard, implying that approaches in classical computing are inefficient. Here, Quantum computing might be a promising alternative.
Hendrik Künnemann, Frank Phillipson
doaj   +1 more source

Particular cycles of a binary de Bruijn digraph

open access: yesEuropean Journal of Combinatorics, 2010
AbstractIn this paper we investigate an isomorphism σ between a directed de Bruijn digraph B(2,n) and its converse, which is the digraph obtained from B(2,n) by reversing the direction of all its arcs. A cycle C is said to be σ-self-converse when the cycle σ(C) coincides with its converse.
KRAMER, ALPAR VAJK, ZAGAGLIA, NORMA
openaire   +3 more sources

Analysis of influence of steam-turbine cycle basic parameters on the efficiency of triple combined-cycle plants

open access: yesИзвестия Томского политехнического университета: Инжиниринг георесурсов, 2009
The profile of the advanced triple cycle steam-gas plant has been selected. The authors have developed the mathematical model for calculating the indicators of triple cycle steam-gas plant.
N. N. Galashov, S. A. Tsibulsky
doaj   +2 more sources

Pure and Hydrocarbon Binary Mixtures as Possible Alternatives Working Fluids to the Usual Organic Rankine Cycles Biomass Conversion Systems

open access: yesEnergies, 2019
This study investigates the use of pure and hydrocarbons binary mixtures as potential alternatives working fluids in a usual biomass powered organic Rankine cycle (ORC).
Costante M. Invernizzi   +3 more
doaj   +1 more source

Duty cycle tolerant binary gratings for fabricable short period phase masks [PDF]

open access: yesJournal of the European Optical Society-Rapid Publications, 2009
Wavelength scale 1D binary gratings of rectangular corrugation profile are often used as diffractive elements acting on incident free space waves under different incidence angle, wavelength and polarization.
Gamet E., Pigeon F., Parriaux O.
doaj   +1 more source

Homomorphisms of binary Cayley graphs

open access: yes, 2015
A binary Cayley graph is a Cayley graph based on a binary group. In 1982, Payan proved that any non-bipartite binary Cayley graph must contain a generalized Mycielski graph of an odd-cycle, implying that such a graph cannot have chromatic number 3.
Beaudou, Laurent   +2 more
core   +2 more sources

Home - About - Disclaimer - Privacy