Results 121 to 130 of about 848,049 (294)

Multi-Targets Tracking Based On Bipartite Graph Matching

open access: yesCybernetics and Information Technologies, 2014
Multi-target tracking is a challenge due to the variable number of targets and the frequent interaction between targets in complex dynamic environments. This paper presents a multi-target tracking algorithm based on bipartite graph matching.
Zhong Jinqin   +4 more
doaj   +1 more source

A note on Hamiltonian split graphs

open access: yesJournal of Combinatorial Theory, Series B, 1980
AbstractA necessary condition for the existence of a Hamiltonian cycle in split graphs is proved.
Rainer E. Burkard, Peter L. Hammer
openaire   +2 more sources

Blending With Insulating Polymers Enables Stable Anti‐Ambipolar Characteristics in n‐Type Organic Mixed‐Conductors for Heterogeneous Spiking Neurons

open access: yesAdvanced Materials, EarlyView.
A polymer blend of n‐type OMIEC P(gNDI‐gT2) with insulating PMMA yields mechanically stabilized, anti‐ambipolar organic electrochemical transistors (OECTs) with tunable ionic‐electronic transport. This blending allows low‐power, fast‐spiking heterogeneous Hodgkin–Huxley neurons, enabling biomimetic frequency deconvolution and reservoir computing, which
Zachary Laswick   +12 more
wiley   +1 more source

Domain decomposition of finite element models using dijkstra’s algorithm

open access: yesСистемный анализ и прикладная информатика
The paper proposes an algorithm for decomposing regions of a finite element model (FEM) for the integration of unified cellular structures in the design of lightweight parts.
I. V. Ogorodnik, Yu. V. Polozkov
doaj   +1 more source

Approximate edge splitting

open access: yes, 1999
We show that, in any undirected graph, splitting off can be performed while preserving all cuts of value at most 4/3 times the minimum value, and this is best possible.
Goemans, Michel X.
core  

Photocatalytic Water Splitting on the Lunar Surface: Prospects for In Situ Resource Utilization

open access: yesAdvanced Materials Interfaces, EarlyView.
Water has been found in craters on the moon nearby locations which are illuminated >80% of the time. Photocatalysis uses energy from sunlight to drive chemical reactions such as water splitting to produce oxygen and hydrogen. It is a scalable technology that requires lighter equipment and utilizes resources available on the moon. ABSTRACT The discovery
Ranjani Kalyan   +6 more
wiley   +1 more source

Splitting cubic circle graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition. We also deduce that up to isomorphism, K_4 and K_{3,3} are the only 3-connected, 3-regular circle graphs.
openaire   +4 more sources

Defect‐Driven Charge Separation in Ba‐Doped SrTiO3: Correlating Photoelectrochemical Performance With Dye‐Selective Photocatalysis

open access: yesAdvanced Materials Interfaces, EarlyView.
Ba‐doped SrTiO3 perovskites establish a direct correlation between photoelectrochemical activity and photocatalytic performance. Optimized Ba0.5Sr0.5TiO3 exhibits enhanced charge separation, photocurrent generation, and visible‐light‐driven dye degradation through defect‐induced oxygen vacancies and lattice distortion.
Sagar A. Nikam   +6 more
wiley   +1 more source

2D Hierarchical Black Phosphorus‐Mn2O3 Heterostructured Composites for High‐Performance Flexible Supercapacitors

open access: yesAdvanced Materials Interfaces, EarlyView.
A sonochemical strategy constructs an ex situ 2D hierarchical black phosphorus–Mn2O3 heterostructure, enabling intimate interfacial coupling, enhanced charge transport, and improved electrochemical stability. The optimized BPM‐37.5% electrode delivers 466 F g−1 with 84% retention after 8000 cycles, while the flexible device exhibits high areal energy ...
Sowmiya Selvaraj   +1 more
wiley   +1 more source

Spectral Complexity of Directed Graphs and Application to Structural Decomposition

open access: yesComplexity, 2019
We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and nonrecurrent parts.
Igor Mezić   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy