Results 91 to 100 of about 3,681 (231)
A characterization of fine words over a finite alphabet
, 2006 To any infinite word t over a finite alphabet A we can associate two infinite words min (t) and max (t) such that any prefix of min (t) (resp. max (t)) is the lexicographically smallest (resp. greatest) amongst the factors of t of the same length. We say
Glen, Amy, Glen, A.
core +1 more source
Expert Systems, Volume 43, Issue 7, July 2026.ABSTRACT Fault‐tolerant monitoring and reliable node identification are essential requirements in modern hierarchical communication systems such as IoT–Fog–Cloud architectures and distributed sensing networks. The fault‐tolerant metric dimension (FTMD) provides an effective graph‐theoretic framework for resilient localization and monitoring in such ...
Ghulam Haidar +5 more
wiley +1 more source
International Transactions in Operational Research, Volume 33, Issue 4, Page 2499-2534, July 2026.Abstract This paper presents a two‐stage model for planning a renewable energy portfolio by balancing economic, social and environmental sustainability goals. The first stage addresses a multi‐objective problem where conflictive impacts generated by the energy portfolios should be optimised according to the corresponding economic, social or ...
Amelia Bilbao‐Terol +2 more
wiley +1 more source
Testing for intransitivity of preferences predicted by a lexicographic semi-order
, 2006 some people systematically violated transitivity of preference when choosing between specially constructed risky gambles. This conclusion remained controversial because his statistical analysis did not allow each participant to have a different true ...
Michael H. Birnbaum, Roman J. Gutierrez
core +1 more source
Current Protocols, Volume 6, Issue 6, June 2026.Abstract High‐throughput immunofluorescence (IF) detection has become an essential tool in drug discovery for analyzing multiple markers and providing insights into cellular pathways. While IF techniques have been established for decades, high‐content IF protocols vary among laboratories, highlighting the need for standardized and quantitative ...
Valia Khodr +2 more
wiley +1 more source
From Ordients to Optimization: Substitution Effects without Differentiability [PDF]
This paper introduces the concept of ordient for binary relations (preferences), a relative of the concept of gradients for functions (utilities). The lexicographic order, albeit not representable, has an ordient.
Karl H. Schlag, Ludovic Renou
core
Complete propagation rules for lexicographic order constraints over arbitrary domains
, 2006 We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches, the implementation is short and concise without giving up on the best ...
Thom Frühwirth
core +1 more source
Guidance or Misdirection? Unpacking the Role of Feedback in Health Preference Assessments
Health Economics, Volume 35, Issue 6, Page 910-928, June 2026.ABSTRACT This study investigated the impact of providing feedback to respondents on a dominance‐structured choice task on subsequent choice behavior in a discrete choice experiment (DCE). The DCE was conducted among 626 patients with heart failure. Respondents were given a dominance‐structured choice task in which two devices (Device A and Device B ...
Mesfin G. Genie +2 more
wiley +1 more source
The soul of the soil: Unearthing a Nation's eco‐empathy through 1200 years of Persian poetry
People and Nature, Volume 8, Issue 6, Page 1987-2002, June 2026.Abstract Cultivating a profound sense of connection with the natural world, conceptualized as eco‐empathy, is increasingly recognized as a vital precursor to effective environmental stewardship. While scientific data frame ecological crises, literary traditions offer a unique archive for tracing the history of this empathetic bond. This study positions
Isa Esfandiarpour‐Boroujeni +7 more
wiley +1 more source
Intrinsic order, lexicographic order, vector order and hamming weight
, 2012 To compare binary n-tuple probabilities with no need to compute them, we have defined a partial order relation on the set {0, 1}n of all binary n-tuples: The so-called intrinsic order relation. In this paper, some properties of the intrinsic ordering are
González, Luis
core