Results 1 to 10 of about 64,049 (81)

Breast Reconstruction Morphology Evaluation Tool: Vibe Coding Empowers Clinicians as Creators [PDF]

open access: yesPlastic and Reconstructive Surgery, Global Open
Summary:. Breast reconstruction aims to restore symmetry and improve quality of life; However, although several morphological assessment methods exist, their need for specialized software, cost, and lengthy processing time reduces their practicality in ...
Yuki Otsuki, MD, PhD   +1 more
doaj   +2 more sources

Developing the Swiss mid-infrared soil spectral library for local estimation and monitoring [PDF]

open access: yesSOIL, 2021
Information on soils' composition and physical, chemical and biological properties is paramount to elucidate agroecosystem functioning in space and over time.
P. Baumann   +10 more
doaj   +1 more source

On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6ps

open access: yesIEEE Access, 2020
Let $p$ be an odd prime, $s$ , $m$ be positive integers such that $p^{m}\equiv 2 \pmod 3$ . In this paper, using the relationship about Hamming distances between simple-root cyclic codes and repeated-root cyclic codes, the Hamming distance of all ...
Hai Q. Dinh   +2 more
doaj   +1 more source

Logistic model outperforms allometric regression to estimate biomass of xerophytic shrubs

open access: yesEcological Indicators, 2021
Allometric model has been applied worldwide to estimate vegetation biomass for decades. However, this model fails to restrict the accelerating increase of biomass as body size grows. That contradicts to the size-related resource limits and intra-specific
Jiemin Ma   +5 more
doaj   +1 more source

On the Hamming Distances of Constacyclic Codes of Length 5pS

open access: yesIEEE Access, 2020
Let $p$ be a prime, $s$ , $m$ be positive integers, and $\lambda $ be a nonzero element of the finite field $\mathbb {F}_{p^{m}}$ . In this paper, the algebraic structures of constacyclic codes of length $5~p^{s}~(p\neq 5)$ are obtained, which ...
Hai Q. Dinh   +2 more
doaj   +1 more source

Explicit Representation and Enumeration of Repeated-Root (δ + αu²)-Constacyclic Codes Over F₂m[u]/‹u2λ›

open access: yesIEEE Access, 2020
Let F2(m) be a finite field of 2m elements, λ and k be integers satisfying λ, k ≥ 2 and denote R = F2(m)[u]/(u2λ). Let δ, α ∈ F2(m)×.
Yuan Cao   +4 more
doaj   +1 more source

Repeated-Root Constacyclic Codes Over the Chain Ring Fpm[u]/⟨u3⟩

open access: yesIEEE Access, 2020
Let Z = Fpm[u]/(u3) be the finite commutative chain ring, where p is a prime, m is a positive integer and Fpm is the finite field with pm elements. In this paper, we determine all repeated-root constacyclic codes of arbitrary lengths over Z and their ...
Tania Sidana, Anuradha Sharma
doaj   +1 more source

Uncertainty analysis in the simulation of effective seepage flow through earth dams with the Monte Carlo algorithm and machine learning [PDF]

open access: yesمدل‌سازی و مدیریت آب و خاک
IntroductionThe cost of building dams is very high and their failure can be hazardous. On the other hand, they are vital for every country as freshwater storage.
Farhoud Kalateh, Milad Kheiry
doaj   +1 more source

Computable Derivative-Twisted Intersection Dimensions of Repeated-Root Cyclic Codes via Lucas-Refined Truncation

open access: yesMathematics
The Hasse derivative image of a repeated-root cyclic code is typically non-cyclic. This prevents a direct ideal-theoretic calculation of derivative-twisted intersections and first leads to cyclic containers and two-sided bounds.
Ampol Duangpan   +2 more
doaj   +1 more source

Trigger, Not Root Cause: Re-Examining GitHub’s 2024 to 2026 Availability Decline Under Artificial Intelligence-Driven Load

open access: yesFuture Internet
Over two years, the code-hosting platform GitHub suffered a sustained decline in availability that became acute by mid-2026. A widely repeated explanation blames artificial intelligence, in particular AI coding assistants and autonomous agents acting on ...
Vlad-Ștefan Dieaconu   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy