Results 91 to 100 of about 694,974 (290)
Stability of Iterative Decoding of Multi-Edge Type Doubly-Generalized LDPC Codes Over the BEC
Using the EXIT chart approach, a necessary and sufficient condition is developed for the local stability of iterative decoding of multi-edge type (MET) doubly-generalized low-density parity-check (D-GLDPC) code ensembles.
Chiani, Marco +3 more
core +1 more source
The results demonstrate a simulation‐driven workflow that applies LSB topology optimization with additive manufacturing constraints to mission‐specific load cases, integrating European Cooperation for Space Standardization compliant verification and manufacturability to develop structurally efficient rover suspension components.
Stelios K. Georgantzinos +11 more
wiley +1 more source
In cases of distal radius fractures, the fixation of the volar lunate facet fragment is crucial for preventing volar subluxation of the carpal bones. This study aims to clarify the sex differences in the volar morphology of the lunate facet of the distal
Yusuke Eda +5 more
doaj +1 more source
The lack of information about the features of processes of the surface wave's transformation into volume waves and its scattering in metal objects with ledge, slots, grooves and the others is one of the obstacles to improve of the acoustical testing ...
A. R. Baev +4 more
doaj +1 more source
High‐temperature interactions between low‐sulfur Al‐killed Mn–B steel and MgO–C refractories (0 and 50 wt% recyclates) are studied via finger immersion tests (1600 °C). Surface‐active elements influence infiltration. MgO/CaS layer forms, along with spinel and calcium silicate.
Matheus Roberto Bellé +5 more
wiley +1 more source
This paper numerically investigates the effects of airfoil leading edge radius on the aerodynamic characteristics of H-rotor Darrieus vertical axis wind turbine (VAWT).
Chenguang Song +4 more
doaj +1 more source
l-connectivity, l-edge-connectivity and spectral radius of graphs
Let G be a connected graph. The toughness of G is defined as t(G)=min{\frac{|S|}{c(G-S)}}, in which the minimum is taken over all proper subsets S\subset V(G) such that c(G-S)\geq 2 where c(G-S) denotes the number of components of G-S. Confirming a conjecture of Brouwer, Gu [SIAM J. Discrete Math.
Fan, Dandan, Gu, Xiaofeng, Lin, Huiqiu
openaire +3 more sources
Bimetallic (NiFe) and trimetallic (NiFeCr) nanoalloys (NAs) are synthesized using corresponding oxide mixtures using microwave hydrogen plasma within a few milliseconds. The process simultaneously 1) reduces metal oxides to metals; 2) downsizes the particles from micrometers to nanometers; and 3) blends the metals to form NAs.
Sachin Kumar +5 more
wiley +1 more source
Side Flow Effect on Surface Generation in Nano Cutting
The side flow of material in nano cutting is one of the most important factors that deteriorate the machined surface quality. The effects of the crystallographic orientation, feed, and the cutting tool geometry, including tool edge radius, rake angle and
Feifei Xu, Fengzhou Fang, Xiaodong Zhang
doaj +1 more source
Some spectral sufficient conditions for a graph being pancyclic
Let $G(V,E)$ be a simple connected graph of order $n$. A graph of order $n$ is called pancyclic if it contains all the cycles $C_k$ for $k\in \{3,4,\cdot\cdot\cdot,n\}$. In this paper, some new spectral sufficient conditions for the graph to be pancyclic
Huan Xu +5 more
doaj +1 more source

