Results 51 to 60 of about 3,398,533 (269)
A Discrete Time Queueing Approach to Model and Evaluate Slotted Ring Network Buffer using Matrix Geometric Method [PDF]
Assorted analytical methods have been proposed for evaluating the performance of a slotted ring network. This paper proposes MGM (Matrix Geometric Method) to analyze the station buffer of a slotted ring for DT (Discrete-Time) queueing. The slotted ring
Syed Asif Ali Shah +2 more
doaj
The damage of water-supply pipelines under fault rupture primarily concentrates at the pipe joints, which are the weakest structural links of the pipelines. Based on the traditional bell-socket joint of water supply pipelines, the rubber gasket and metal
ZHONG Zilan , ZHAO Xin , ZHANG Yabo , MIAO Huiquan , ZHANG Bu
doaj +1 more source
Characterizing finite Boolean rings by using finite chains of subrings
Let R be a nonzero associative ring with identity. It is proved that R is a finite Boolean ring if (and only if) 1 is the only unit of R and there exists a finite maximal chain C each of whose n steps is a proper unital ring extension, R0:=F2 ⊂ ... ⊂ Rn=R, going from F2 to R.
Noomen Jarboui, David Dobbs
openaire +1 more source
Low‐temperature imidization of PEG‐modified polyimide enables fully screen‐printed, roll‐to‐roll fabrication of flexible electrodes on PET substrates, delivering robust mechanical durability and reliable ECG/EMG signal performance for wearable electronics.
Akib Abdullah Khan, Jong‐Hoon Kim
wiley +1 more source
Low‐voltage FIB‐SEM tomography combined with a image preprocessing pipeline improves phase contrast and enables reliable machine‐learning segmentation of conductive networks in lithium‐ion battery electrodes. Structural descriptors are extracted from segmented images, done semimanually and automated, and compared.
Lisa Beran +6 more
wiley +1 more source
Constacyclic Codes over Finite Chain Rings of Characteristic p
Let R be a finite commutative chain ring of characteristic p with invariants p,r, and k. In this paper, we study λ-constacyclic codes of an arbitrary length N over R, where λ is a unit of R.
Sami Alabiad, Yousef Alkhamees
doaj +1 more source
Some constacyclic codes over finite chain rings
For $λ$ an $n$-th power of a unit in a finite chain ring we prove that $λ$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes. We also study the $α+p β$-constacyclic codes of length $p^s$ over the Galois ring $GR(p^e,r)$.
Aicha Batoul +2 more
openaire +6 more sources
Digitalizing electroplating requires both domain knowledge and interoperability. This work introduces PlatOn, a domain ontology for trivalent chromium plating and coating characterization, and a hybrid pipeline that aligns it to a mid‐level reference ontology by combining eight similarity metrics with language model reasoning. Expert‐validated mappings
Janik Harter +10 more
wiley +1 more source
On Symbol-Triple Distance of a Class of Constacyclic Codes of Length 3
Let $p\not =3$ be any prime. In this paper, we completely determine symbol-triple distance of all $\gamma $ -constacyclic codes of length $3p^{s}$ over the finite commutative chain ring ${\mathcal{ R}}=\mathbb F_{p^{m}}+u\mathbb F_{p^{m}}$ , where
Hai Q. Dinh +3 more
doaj +1 more source
The OntOMat ontology establishes a structured framework for polymer matrix fiber reinforced composite materials, integrating manufacturing processes, characterization methods, and multiscale design through the VDI/VDE 3682 formalized process description standard.
Nicolas Christ +19 more
wiley +1 more source

