Results 41 to 50 of about 217,204 (287)
Intelligent and connected vehicles are believed to be the future solution to traffic management, especially in highly challenging areas such as intersections.
Lv Dongxin+4 more
doaj +1 more source
Multiple-Solution Tasks in Pre-Service Teachers Course on Combinatorics
In the paper, we present a study devoted to the utilization of multiple-solution tasks (MSTs) in combinatorics as a part of a pre-service teachers course on didactics of mathematics from the view of the mathematics teachers’ specialized knowledge (MTSK ...
Ingrid Semanišinová
doaj +1 more source
Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems [PDF]
Combinatorial algorithms such as those that arise in graph analysis, modeling of discrete systems, bioinformatics, and chemistry, are often hard to parallelize. The Combinatorial BLAS library implements key computational primitives for rapid development of combinatorial algorithms in distributed-memory systems.
arxiv
Bone‐wise rigid registration of femur, tibia, and fibula for the tracking of temporal changes
Abstract Background Multiple myeloma (MM) induces temporal alterations in bone structure, such as osteolytic bone lesions, which are challenging to identify through manual image interpretation. The large variation in radiologists' assessments, even at expert centers, further complicates diagnosis.
Arttu Ruohola+5 more
wiley +1 more source
On Super Mean Labeling for Total Graph of Path and Cycle
Let G(V,E) be a graph with the vertex set V and the edge set E, respectively. By a graph G=(V,E) we mean a finite undirected graph with neither loops nor multiple edges. The number of vertices of G is called order of G and it is denoted by p. Let G be a (
Nur Inayah+3 more
doaj +1 more source
Total vertex irregularity strength for trees with many vertices of degree two
For a simple graph G = (V,E), a mapping φ : V ∪ E → {1,2,...,k} is defined as a vertex irregular total k-labeling of G if for every two different vertices x and y, wt(x) ≠ wt(y), where wt(x) = φ(x)+ Σxy∈E(G) φ(xy).
Rinovia Simanjuntak+2 more
doaj +1 more source
A Note on the Difference of Powers and Falling Powers
Combinatorial sums and binomial identities have appeared in many branches of mathematics, physics, and engineering. They can be established by many techniques, from generating functions to special series.
Taoufik Sabar
doaj +1 more source
Abstract Purpose This study evaluates the technical feasibility of adapting a surface monitoring system, designed for conventional four‐dimensional computed tomography (4DCT), to an intelligent, breathing‐adapted 4DCT and examines its potential to expand the currently limited range of supported surrogate systems.
Niklas Lackner+4 more
wiley +1 more source
The set of flexible nondegenerate polyhedra of a prescribed combinatorial structure is not always algebraic [PDF]
We construct some example of a closed nondegenerate nonflexible polyhedron $P$ in Euclidean 3-space that is the limit of a sequence of nondegenerate flexible polyhedra each of which is combinatorially equivalent to $P$. This implies that the set of flexible nondegenerate polyhedra combinatorially equivalent to $P$ is not algebraic.
arxiv +1 more source
Abstract Purpose This study evaluates the dosimetric and geometric precision of a virtual cone technique using CBCT‐based polymer gel dosimetry, enabling radiation delivery, and imaging readout within an identical spatial coordinate system. Methods We created a C# script for a virtual cone technique that generates a treatment plan with 10 gantry arcs ...
Tenzin Kunkyab+6 more
wiley +1 more source