Results 41 to 50 of about 55,995 (279)

Experimental Evaluation of 100Cr6 Steel Microindented Surfaces Under Lubricated Nonconformal Point Contacts

open access: yesAdvanced Engineering Materials, EarlyView.
The tribological behavior of 100Cr6 steel spheres textured via Vickers microindentation is evaluated under lubricated sliding by varying both dimple size and density. Fine and dense textures significantly reduce friction across all lubrication regimes, while large dimples increase it.
Farideh Davoodi   +3 more
wiley   +1 more source

Window-based Streaming Graph Partitioning Algorithm

open access: yes, 2019
In the recent years, the scale of graph datasets has increased to such a degree that a single machine is not capable of efficiently processing large graphs.
Abdolrashidi A.   +5 more
core   +1 more source

EBSD Study of Creep‐Induced Lattice Misorientation in MgO‐Particle‐Reinforced Austenitic Steel Composites

open access: yesAdvanced Engineering Materials, EarlyView.
Creep experiments at 900°C on coarse‐grained steel‐ceramic composites containing recycled magnesia reveal that higher ceramic volume fractions significantly enhance the creep resistance. Detailed EBSD investigations identify subgrain formation in the steel matrix as the dominant deformation mechanism.
Moritz Müller   +6 more
wiley   +1 more source

Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions

open access: yesTheory and Applications of Graphs
Given a finite, simple graph G, the k-component order connectivity (resp. edge connectivity) of G is the minimum number of vertices (resp. edges) whose removal results in a subgraph in which every component has an order of at most k − 1.
Michael R. Yatauro
doaj   +1 more source

Cauchy formula and the character ring

open access: yesEuropean Physical Journal C: Particles and Fields, 2019
Cauchy summation formula plays a central role in application of character calculus to many problems, from AGT-implied Nekrasov decomposition of conformal blocks to topological-vertex decompositions of link invariants.
A. Morozov
doaj   +1 more source

Some Observations on the Smallest Adjacency Eigenvalue of a Graph

open access: yesDiscussiones Mathematicae Graph Theory, 2020
In this paper, we discuss various connections between the smallest eigenvalue of the adjacency matrix of a graph and its structure. There are several techniques for obtaining upper bounds on the smallest eigenvalue, and some of them are based on Rayleigh
Cioabă Sebastian M.   +2 more
doaj   +1 more source

Effect of Laser Deoxidation on Adhesive‐Bonded Aluminum in an Oxygen‐Free Atmosphere

open access: yesAdvanced Engineering Materials, EarlyView.
This study investigates laser ablation of aluminum under oxygen‐free conditions. The goal is to produce oxide‐free substrates that enable improved adhesive bonding with epoxy. Optimized laser parameters (90% overlap, 300 µJ) combined with oxide‐free substrates result in the highest tensile strength of the adhesive bond.
Sandra Gerland   +5 more
wiley   +1 more source

UC and BUC plane partitions

open access: yesEuropean Physical Journal C: Particles and Fields
This paper is concerned with the investigation of UC and BUC plane partitions based upon the fermion calculus approach. We construct generalized the vertex operators in terms of free charged fermions and neutral fermions and present the interlacing ...
Shengyu Zhang, Zhaowen Yan
doaj   +1 more source

On Partitioning the Edges of 1-Plane Graphs

open access: yes, 2016
A 1-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A 1-plane graph is optimal if it has maximum edge density.
Lenhart, William J.   +2 more
core   +1 more source

Boosting Vertex-Cut Partitioning for Streaming Graphs

open access: yes2016 IEEE International Congress on Big Data (BigData Congress), 2016
While the algorithms for streaming graph partitioning are proved promising, they fall short of creating timely partitions when applied on large graphs. For example, it takes 415 seconds for a state-of-the-art partitioner to work on a social network graph with 117 millions edges.
Peiro Sajjad, Hooman   +4 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy