Results 51 to 60 of about 1,229 (303)

“Correspondence” (dang 當) and “Cultivating Perfectness” (Yang Zheng 養正): On the Concept of Perfectness (zheng 正) in the Yijing

open access: yesReligions
“Properness, correctness and uprightness” (zheng 正) refers to a common and significant concept in Chinese philosophy. In Chinese philosophical discourse, zheng embodies moral ideals.
Solsar Kong
doaj   +1 more source

Some Notes on Relative Commutators

open access: yesInPrime, 2020
Let G be a group and α ϵ Aut(G).  An α-commutator of elements x, y ϵ G is defined as [x, y]α = x-1y-1xyα. In 2015, Barzegar et al. introduced an α-commutator of elements of G and defined a new generalization of nilpotent groups by using the definition ...
Masoumeh Ganjali, Ahmad Erfanian
doaj   +1 more source

المتطلبات التربوية اللازمة لتحقيق بيئة جامعية نموذجية على ضوء مدخل الإرجونوميکس (الهندسة البشرية) [PDF]

open access: yesMaǧallaẗ Kulliyyaẗ Al-Tarbiyyẗ Ǧamiʿaẗ Banhā, 2019
استهدف البحث وضع قائمة مقترحة بالمتطلبات التربوية اللازمة لتحقيق بيئة جامعية نموذجية على ضوء مدخل الإرجونوميکس، مستخدما المنهج الوصفي التحليلي وذلک من خلال الدراسة النظرية التحليلية للمدخل وتوظيفه في المجال التربوي بإسهام عناصره وأبعاده وتطبيقاته في ...
محمد محمد أحمد عبد الخالق
doaj   +1 more source

Circulating microRNA signatures of cachexia and cancer in Canis familiaris as a comparative oncology model for human disease

open access: yesMolecular Oncology, EarlyView.
Circulating microRNAs as biomarkers of cachexia and sex‐specific cancer in senior dogs. In 25 client‐owned dogs, four circulating miRNAs (miR‐15a, miR‐15b, miR‐16, miR‐140) were downregulated in cachexia, with miR‐16 the strongest individual biomarker (AUC = 0.899).
Soon‐Seok Park   +6 more
wiley   +1 more source

Small models of convex fragments of definable subsets

open access: yesҚарағанды университетінің хабаршысы. Математика сериясы, 2020
This article discusses the problems of that part of Model Theory that studies the properties of countable models of inductive theories with additional properties, or, in other words, Jonsson theories.
A.R. Yeshkeyev, N.V. Popova
doaj   +1 more source

Perfect Mixtures of Perfect Measures

open access: yesThe Annals of Probability, 1979
It is shown that all the possible cases can arise in the mixture problem with respect to perfectness of probability measures. A characterization of perfectness is obtained through properties of a countably generated sub-$\sigma$-algebra given which there is a regular conditional probability.
openaire   +2 more sources

Perfecting the Nearly Perfect [PDF]

open access: yesPure and Applied Mathematics Quarterly, 2008
We introduce a natural variant of the notion of nearly perfect complex. We show that this variant gives rise to canonical perfect complexes and prove several useful properties of this construction (including additivity of the associated Euler characteristics oil suitable exact triangles).
openaire   +1 more source

Strong and weak Perfect Digraph Theorems for perfect, \alpha-perfect and strictly perfect digraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2023
Summary: Perfect digraphs have been introduced in [\textit{S. D. Andres} and \textit{W. Hochstättler}, J. Graph Theory 79, No. 1, 21--29 (2015; Zbl 1312.05059)] as those digraphs where, for any induced subdigraph, the dichromatic number and the symmetric clique number are equal.
openaire   +2 more sources

Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies

open access: yesFEBS Open Bio, EarlyView.
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli   +8 more
wiley   +1 more source

Clique-perfectness and balancedness of some graph classes [PDF]

open access: yes, 2014
A graph is clique-perfect if the maximum size of a clique-independent set (a set of pairwise disjoint maximal cliques) and the minimum size of a clique-transversal set (a set of vertices meeting every maximal clique) coincide for each induced subgraph. A
Safe, Martin Dario   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy