Results 81 to 90 of about 793,130 (202)
Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays
ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the factors, and they are strength‐two orthogonal arrays exactly when the multiplicities satisfy three linear constraints ...
Ruwan C. Karunanayaka
wiley +1 more source
Characterizing language identification by standardizing operations
Notions from formal language learning theory are characterized in terms of standardizing operations on classes of recursively enumerable languages. Algorithmic identification in the limit of grammars from text presentation of recursively enumerable ...
Sanjay Jain +3 more
core +1 more source
Graduate Family Therapy Training for First Nations Practitioners: Transformations of Self
ABSTRACT Objective In light of limited teaching resources and the essential need for Indigenous‐focused learning material, this study sought to contribute to the development of culturally appropriate support for First Nations students training as family therapists.
Felicity L. Painter +4 more
wiley +1 more source
Abstract Background Identifying interventions for developing language skills in autistic people is a top research priority. To develop effective language interventions, it is essential to understand whether community members feel they are important, acceptable, and meaningful.
Audrey Linden +9 more
wiley +1 more source
The Delta Operation: From Strings to Trees to Strings
The delta of a language L consists of the yields of trees of which all paths are in L. The context-free languages are the deltas of the regular languages. The indexed languages are the deltas of the deterministic context-free languages.
Joost Engelfriet
core +1 more source
The Strong Nash‐Williams Orientation Theorem for Rayless Graphs
ABSTRACT In 1960, Nash‐Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of arc‐disjoint directed paths between any two vertices is at least half the number of undirected edge‐disjoint paths between them (rounded down).
Max Pitz, Jacob Stegemann
wiley +1 more source
ABSTRACT Background MRI‐derived nodal features may improve prognostication beyond TNM staging, but distant‐metastasis risk models remain limited. Purpose To develop and internally validate an MRI model for distant metastasis prediction in locoregionally advanced nasopharyngeal carcinoma (LA‐NPC). Study Type Retrospective.
Jing Wang +10 more
wiley +1 more source
Very Special Languages and Representations of Recursively Enumerable Languages Via Computation Histories ; CU-CS-177-80 [PDF]
A method of encoding the computation histories of a wide class of machines is introduced and used to derive several representation theorems for the class of recursively enumerable languages.
Zeiger, Paul, Haussler, David
core
ABSTRACT Subgroups are dynamic entities evolving constantly in response to changing contexts and time. Although scholars from both the attribute and the network views have acknowledged that subgroups are inherently complex and fluid, research in these traditions has remained bifurcated, with limited efforts to integrate the two perspectives to more ...
Jinhee Moon +3 more
wiley +1 more source
An Interdisciplinary Review of the Gaslighting Literature and Future Research Agenda
ABSTRACT Gaslighting is increasingly discussed in organizational contexts, yet its meaning, boundaries, and process remain unclear within management and organizational scholarship. Although research on gaslighting has expanded across multiple disciplines, existing work is conceptually fragmented and difficult to integrate, limiting cumulative theory ...
Paula A. Kincaid, Samantha C. O. Stalion
wiley +1 more source

