Results 31 to 40 of about 4,530 (127)

Iterated identities and iterational depth of groups

open access: yesJournal of Modern Dynamics, 2015
Given word on $n$ letters, we study groups which satisfiy "iterated identity" $w$, meaning that for all $x_1, \dots, x_n$ there exists $m$ such that $m$-the iteration of $w$ of Engel type, applied to $x_1, \dots, x_n$, is equal to the identity. We define bounded groups and groups which are fractal with respect to identities.
openaire   +3 more sources

Fast and Invertible Simplicial Approximation of Magnetic‐Following Interpolation for Visualizing Fusion Plasma Simulation Data

open access: yesComputer Graphics Forum, EarlyView.
Abstract We introduce a fast and invertible approximation for fusion plasma simulation data represented as 2D planar meshes with connectivities approximating magnetic field lines along the toroidal dimension in deformed 3D toroidal spaces. Scientific variables (e.g., density and temperature) in these fusion data are interpolated following a complex ...
Congrong Ren   +6 more
wiley   +1 more source

Districting in last‐mile delivery with stochastic customers

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract Due to the peculiarities of city streets, last‐mile logistics is typically organized using territory‐based routing approaches, which divide the city into a set of districts and assign drivers to deliver in one or more of them. This allows drivers to develop a deep understanding of the characteristics of each district, and clients benefit from ...
Maria Elena Bruni   +3 more
wiley   +1 more source

Iterating Octagons [PDF]

open access: yes, 2009
In this paper we prove that the transitive closure of a non-deterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct consequence of this fact is that the reachability problem is decidable for flat counter automata with octagonal transition relations. This result improves the previous results of Comon
Bozga, Marius   +2 more
openaire   +4 more sources

A novel dual‐decomposition method for non‐convex two‐stage stochastic mixed‐integer quadratically constrained quadratic problems

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley   +1 more source

Quantifying phase magnitudes of open‐source focused‐probe 4D‐STEM ptychography reconstructions

open access: yesJournal of Microscopy, EarlyView.
Abstract Accurate computational ptychographic phase reconstructions are enabled by fast direct‐electron cameras with high dynamic ranges used for four‐dimensional scanning transmission electron microscopy (4D‐STEM). The availability of open software packages is making such analyses widely accessible, and especially when implemented in Python, easy to ...
Toma Susi
wiley   +1 more source

Fixing disconnects: Exploring the emergence of principled adaptations in a competency‐based curriculum

open access: yesMedical Education, Volume 59, Issue 4, Page 428-438, April 2025.
Abstract Purpose Competency‐based medical education (CBME) promises to improve medical education through curricular reforms to support learner development. This intention may be at risk in the case of a Canadian approach to CBME called Competence by Design (CBD), since there have been negative impacts on residents. According to Joseph Schwab, teachers,
Mary C. Ott   +3 more
wiley   +1 more source

Iterative Bayes

open access: yesIntelligent Data Analysis, 2000
AbstractNaive Bayes is a well-known and studied algorithm both in statistics and machine learning. Bayesian learning algorithms represent each concept with a single probabilistic summary. In this paper we present an iterative approach to naive Bayes. The Iterative Bayes begins with the distribution tables built by the naive Bayes.
openaire   +2 more sources

Iterative Algebras

open access: yesAlgebras and Representation Theory, 2015
Given a finitely generated free monoid $X$ and a morphism $ : X\to X$, we show that one can construct an algebra, which we call an iterative algebra, in a natural way. We show that many ring theoretic properties of iterative algebras can be easily characterized in terms of linear algebra and combinatorial data from the morphism and that, moreover, it ...
Bell, Jason P., Madill, Blake W.
openaire   +2 more sources

(Mis)Alignment in resident and advisor co‐regulated learning in competency‐based training

open access: yesMedical Education, Volume 59, Issue 5, Page 519-530, May 2025.
Abstract Background/Objective In implementing competence‐based medical education (CBME), some Canadian residency programmes recruit clinicians to function as Academic Advisors (AAs). AAs are expected to help monitor residents' progress, coach them longitudinally, and serve as sources of co‐regulated learning (Co‐RL) to support their developing self ...
Leora Branfield Day   +7 more
wiley   +1 more source

Home - About - Disclaimer - Privacy