Results 101 to 110 of about 184,015 (290)

3D Nanorod‐Shaped Binder‐Free Ni1−xFexCo2O4 Anodes Demonstrate High Performance and Stable Operation Under Accelerated Stress Tests in Anion Exchange Membrane Water Electrolysis

open access: yesAdvanced Materials Interfaces, EarlyView.
3D shaping of Ni1‐xFexCo2O4 spinel electrocatalyst to form high aspect ratio nanorods, made of 25 nm grain size particles and directly grown on Nickel felt, is proposed to improve the performance of industrial catalysts based on group‐VIII transition‐metal oxides.
Ataollah Niyati, Ombretta Paladino
wiley   +1 more source

Vertex-ordering and arc-partitioning problems

open access: yesCoRR
We study vertex-ordering problems in loop-free digraphs subject to constraints on the left-going arcs, focusing on existence conditions and computational complexity. As an intriguing special case, we explore vertex-specific lower and upper bounds on the left-outdegrees and right-indegrees. We show, for example, that deciding whether the left-going arcs
Nóra A. Borsik, Péter Madarasi
openaire   +2 more sources

Defect‐Engineered ZnO Nanowire Arrays for Flexible Room‐Temperature Hydrogen Sensors

open access: yesAdvanced Materials Technologies, EarlyView.
Fabrication process of patterned ZnO nucleation sites on a flexible polyimide (PI) substrate. Top/tilted‐view SEM images of ordered ZnO nanoflower arrays confined within patterned circular regions. AFM topography map with height data revealing a disk‐array structure, where the patterned regions (marked by a red dot circle) are elevated by ∼2 µm ...
Jun‐Ting Wang   +7 more
wiley   +1 more source

Conditional resolvability in graphs: a survey

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2004
For an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k-vector cW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), where d(x,y) represents the distance between the vertices x and y.
Varaporn Saenpholphat, Ping Zhang
doaj   +1 more source

Standard Framework for Comparison of Graph Partitioning Techniques

open access: yesJISR on Computing, 2015
Graph Partitioning is used to distribute graph partitions across nodes for processing. It is very important in the pre-processing step for distributed graph processing.
Mudasser Iqbal, Saif-ur-Rahman
doaj   +1 more source

On Subgraphs Induced by Transversals in Vertex-Partitions of Graphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2006
For a fixed graph $H$ on $k$ vertices, we investigate the graphs, $G$, such that for any partition of the vertices of $G$ into $k$ color classes, there is a transversal of that partition inducing $H$. For every integer $k\geq 1$, we find a family ${\cal F}$ of at most six graphs on $k$ vertices such that the following holds.
openaire   +2 more sources

Toward Perception‐Native Electronic Skin: Bio‐Inspired In‐/Near‐Sensor and Neuromorphic Computing for Humanoid Robots

open access: yesAdvanced Materials Technologies, EarlyView.
Dense tactile streams from across the humanoid body converge on collide in a central wiring and data bottleneck. By relocating computation closer to and then into the skin itself, near‐ and in‐sensor architectures, together with neuromorphic computing, chart a path toward perception‐native electronic skin, in which the conversion of stimulus into ...
Mijin Kim   +6 more
wiley   +1 more source

Vertex partition problems in digraphs

open access: yesAnais do III Encontro de Teoria da Computação (ETC 2018), 2018
Let D be a digraph and k be a positive integer. Linial (1981) conjec tured that the k-norm of a k-minimum path partition of a digraph D is at most max{ΣC∈C |C| : C is a partial k-coloring of D}. Berge (1982) conjectured that every k-minimum path partition contains a partial k-coloring orthogonal to it.
M. Sambinelli   +3 more
openaire   +2 more sources

On vertex partitions and some minor-monotone graph parameters

open access: yes, 2010
International audienceWe study vertex partitions of graphs according to some minor-monotone graph parameters. Ding et al. [J Combin Theory Ser B 79(2) (2000), 221-246] proved that some minor-monotone parameters ρ are such that, any graph G with ρ(G)⩾2 ...
Gonçalves, Daniel, D. Gonçalves
core   +1 more source

3D‐Printing Aided Rapid Prototyping of Pretensioned Tensegrity Structures for Robotic Applications

open access: yesAdvanced Robotics Research, EarlyView.
Printing, injection molding, and assembly (PMA) is a method for rapid prototyping mesoscale, topologically complex, and tensioned tensegrity structures. In combination with PMA method, two mold design strategies: modular mold and compact channel layout, enable efficiency and scalability for tensegrity fabrication.
Yi Sun   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy