Results 101 to 110 of about 87,870 (251)

The distinctive incorporation of sociological neoinstitutionalism into Japanese sociology and its theoretical insights for the discipline

open access: yesJapanese Journal of Sociology, Volume 34, Issue 1, Page 206-223, March 2025.
Abstract Although sociological neoinstitutionalist thought has made indelible imprints across the social sciences in Japan, its incorporation into Japanese sociology at large has been relatively limited, and its broader applications to analyses of global social phenomena using World Society Theory are even less prominent.
Ralph I. Hosoki
wiley   +1 more source

On Spatial Point Processes With Composition‐Valued Marks

open access: yesInternational Statistical Review, EarlyView.
Summary Methods for marked spatial point processes with scalar marks have seen extensive development in recent years. While the impressive progress in data collection and storage capacities has yielded an immense increase in spatial point process data with highly challenging non‐scalar marks, methods for their analysis are not equally well developed ...
Matthias Eckardt   +2 more
wiley   +1 more source

Size of the memory for storage of ordered rooted graph

open access: yesТруды Института системного программирования РАН, 2018
The paper considers boundaries of memory necessary and sufficient for storage of undirected ordered rooted connected graphs, both numbered and unnumbered. The introduction contains the basic definitions and the problem statement. A graph is rooted if one
I. B. Burdonov, A. S. Kossatchev
doaj   +1 more source

Sifat-sifat Isomorfisma Graf Fuzzy Pada Graf Fuzzy Kuat [PDF]

open access: yes, 2012
Fuzzy graph is a graph consists pairs of vertex and edge that have degree of membership containing closed interval of real number [0,1] on each edge and vertex. A fuzzy graph is said to be a strong fuzzy graph if degree of membership edge with the same
Handayani, A. (Anik)   +1 more
core  

Quantum isomorphism of 2-graphs

open access: yesInternational Journal of Mathematics
We formulate a notion of the quantum automorphism group of a [Formula: see text]-graph. After some preliminary computations, we define quantum isomorphism between a pair of [Formula: see text]-graphs. We produce a “nontrivial” example of a pair of [Formula: see text]-graphs that are not quantum isomorphic to each other.
Soumalya Joardar   +2 more
openaire   +2 more sources

Structure and Computation

open access: yesNoûs, EarlyView.
ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure.
Balthasar Grabmayr
wiley   +1 more source

Supplementing, restructuring, resisting: Maps of Underground space in poetry, embodied performativity, and the “misrepresentationalism” of Harry Beck's Tube diagram

open access: yesOrbis Litterarum, EarlyView.
Abstract This article considers mental and poetic “maps” of London in their respective relationships to Harry Beck's famous 1930s “circuit‐diagram” map of the underground railway system. This iconic image distorts and radically stylizes London geography; thus, it functions as a tool for planning individual travel itineraries but leads to a ...
Craig Melhoff
wiley   +1 more source

How do physiological networks respond to normobaric hypoxia and isometric exercise?

open access: yesExperimental Physiology, EarlyView.
Abstract The dynamics of physiological systems are impacted by both exercise and hypoxia. Network models can be used to map the interactions between various physiological components in environmental physiology and exercise using the concepts of information theory.
Danilo Bondi   +6 more
wiley   +1 more source

Finding minimal vertex extensions of a colored undirected graph

open access: yesИзвестия высших учебных заведений. Поволжский регион: Физико-математические науки, 2022
Background. The research considers the results of the finding minimal vertex extensions of the colored undirected graphs. This topic relates to the modelling of the completely fault tolerant technical systems with the different typed objects in the ...
M.B. Abrosimov, P.V. Razumovsky
doaj   +1 more source

Home - About - Disclaimer - Privacy