Results 11 to 20 of about 10,229,767 (397)

Pseudo-distance-regularized graphs are distance-regular or distance-biregular

open access: yesLinear Algebra and its Applications, 2012
The concept of pseudo-distance-regularity around a vertex of a graph is a natural generalization, for non-regular graphs, of the standard distance-regularity around a vertex. In this note, we prove that a pseudo-distance-regular graph around each of its vertices is either distance-regular or distance-biregular.
Fiol, M. A.
openaire   +4 more sources

Modeling of Personalized E-Learning Environment Based on Intelligent Agents [PDF]

open access: yesInterdisciplinary Journal of Virtual Learning in Medical Sciences, 2017
Background: The present study aimed at investigating the designing dimensions of personalized e-learning environment scale based on intelligent agents and presentation of an integrated model from 11 intelligent agents.
Bahman Saeidi Pour   +3 more
doaj   +1 more source

Writing Administrative Textual Genres in Scholarly and Professional Contexts in Spain

open access: yesIkala: Revista de Lenguaje y Cultura, 2023
Textual genres in the field of Administration can be difficult to write for both university students and public administration employees, since they call for specific linguistic characteristics, which vary according to the genre and the recipient.
Sara Pistola, Iria da Cunha
doaj   +1 more source

MEGA5: molecular evolutionary genetics analysis using maximum likelihood, evolutionary distance, and maximum parsimony methods.

open access: yesMolecular biology and evolution, 2011
Comparative analysis of molecular sequence data is essential for reconstructing the evolutionary histories of species and inferring the nature and extent of selective forces shaping the evolution of genes and species.
K. Tamura   +5 more
semanticscholar   +1 more source

On the center of distances [PDF]

open access: yesEuropean Journal of Mathematics, 2017
In this paper we introduce the notion of the center of distances of a metric space, which is required for a generalization of the theorem by J. von Neumann about permutations of two sequences with the same set of cluster points in a compact metric space.
Wojciech Bielas   +4 more
openaire   +6 more sources

Ad hoc On-Demand Distance Vector (AODV) Routing

open access: yesRequest for Comments, 2003
The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines ...
C. Perkins   +2 more
semanticscholar   +1 more source

Distance-regular graphs [PDF]

open access: yes, 2016
This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the ...
Koolen, Jack H.   +2 more
core   +8 more sources

Distance Learning [PDF]

open access: yes, 2017
Distance learning is the thing without which it is impossible to learn in the future. System of distance learning has to have modern studying materials and interesting resources, where student can interact with everything which is there.
Koval, V.S.   +2 more
core   +1 more source

Best Practices in Synchronous Conferencing Moderation

open access: yesInternational Review of Research in Open and Distributed Learning, 2006
Practical guidelines are offered for the use of online synchronous conferencing software by session administrators and moderators. The configuration of the software prior to conferencing sessions is discussed, and the planning and implementation of ...
Lynn Anderson   +7 more
doaj   +1 more source

Distance-regularised graphs are distance-regular or distance-biregular

open access: yesJournal of Combinatorial Theory, Series B, 1987
AbstractOne problem with the theory of distance-regular graphs is that it does not apply directly to the graphs of generalised polygons. In this paper we overcome this difficulty by introducing the class of distance-regularised graphs, a natural common generalisation.
Godsil, C., Shawe-Taylor, J.
openaire   +4 more sources

Home - About - Disclaimer - Privacy