War in the Young Russians Language Consciousness: An Associative Experiment

The article is focused on the analysis of the stimulus The Great Patriotic War based on the data of both directed and free associative experiments, held among the young Russians aged 18-23, the students of the Philological faculty of RUDN University. The aim of this research is to study the ordinary language consciousness of common speakers of the Russian linguoculture through the prism of their attitude to the Great Patriotic War as a cultural phenomenon. The scientific novelty of the work lies in the fact that the experimental data allow us conclude about the mediated perception of the Great Patriotic War by young Russians, who have knowledge about the war from secondary sources: fiction and documentary films, history and literature textbooks. On the material of these associative experiments, the experimental associative fields are formed, which could potentially become a part of the associative dictionary of the contemporary Russian younger generation. In the course of the study, semantic crossings are revealed between the lexical units of the formed associative fields and the data from Russian associative dictionaries. A comparative analysis of the data from RAD and the two experiments is conducted, demonstrating minimal matching of reactions (12.5%) in the RAD and the experiments, with a higher percentage of matching reactions in the directed and free experiments (56.6%). The reactions to the stimulus Great Patriotic War obtained as a result of the experiment are semantically grouped, and their further interpretation represents a fragment of the young Russian's language consciousness regarding the events of the Great Patriotic War. Thus, semantic analysis allows us to distribute the received reactions into several semantic groups: evaluation of the events of the past; WWII as part of family history; WWII as the distant past; WWII as a reason for pride; WWII as a joint social phenomenon in the cultural context; the events and realities of that war.

A higher-multipole gravitational waveform model for an eccentric binary black holes based on the effective-one-body-numerical-relativity formalism

We have previously constructed a waveform model, SEOBNRE, for spinning binary black hole moving along eccentric orbit based on effective-one-body (EOB) formalism. In the current paper, we update SEOBNRE waveform model in the following three respects. Firstly, we update the EOB dynamics from SEOBNRv1 to SEOBNRv4. Secondly we properly treat the Schott term which has been ignored in previous SEOBNRE. Thirdly, we construct a new factorized waveform including (l,|m|)=(2,2),(2,1),(3,3),(4,4) modes based on effective-one-body (EOB) formalism, which is valid for spinning binary black holes (BBH) in general equatorial orbit. Following our previous SEOBNRE waveform model, we call our new waveform model SEOBNREHM. The (l,|m|)=(2,2) mode waveform of SEOBNREHM can fit the original SEOBNRv4 waveform very well in the case of a quasi-circular orbit. We have validated SEOBNREHM waveform model through comparing the waveform against the Simulating eXtreme Spacetimes (SXS) catalog. The comparison is done for BBH with total mass in (20,200)M_sun using Advanced LIGO designed sensitivity. For the quasi-circular cases we have compared our (2,2) mode waveforms to the 281 numerical relativity (NR) simulations of BBH along quasi-circular orbits. All of the matching factors are bigger than 98\%. For the elliptical cases, 24 numerical relativity simulations of BBH along an elliptic orbit are used. For each elliptical BBH system, we compare our modeled gravitational polarizations against the NR results for different combinations of the inclination angle, the initial orbit phase and the source localization in the sky. We use the minimal matching factor respect to the inclination angle, the initial orbit phase and the source localization to quantify the performance of the higher modes waveform. We found that after introducing the higher modes, the minimum of the minimal matching factor among the 24 tested elliptical BBHs increases from 90\% to 98\%. Our SEOBNREHM waveform model can match all tested 305 SXS waveforms better than 98\% including highly spinning ($\chi=0.99$) BBH, highly eccentric ($e\approx0.6$ at reference frequency $Mf_0=0.002$) BBH and large mass ratio ($q=10$) BBH.

Robust minimal matching rules for quasicrystals

A unified framework is proposed for dealing with matching rules of quasiperiodic patterns, relevant for both tiling models and real-world quasicrystals. The approach is intended for extraction and validation of a minimal set of matching rules, directly from the phased diffraction data. The construction yields precise values for the spatial density of distinct atomic positions and tolerates the presence of defects in a robust way.

KELAS RAMSEY MINIMAL UNTUK PASANGAN GRAF MATCHING DAN DUA GRAF LENGKAP

Misalkan diberikan graf G dan H sebarang. Notasi F → (G, H) menyatakan bahwa terdapat sebarang pewarnaan merah-biru terhadap sisi-sisi graf F mengakibatkan F memuat subgraf merah graf G atau subgraf biru graf H. Kemudian, notasi F∗ 9 (G, H) menyatakan bahwa terdapat pewarnaan merah-biru terhadap sisi-sisi di graf F∗ 9 (G, H) sehingga F∗ tidak memuat graf G merah dan graf H biru. Graf F dikatakan sebagai graf Ramsey (G, H)-minimal jika (1) F → (G, H), dan (2) ∀e ∈ F, F∗ = F r{e}, F∗ 9 (G, H). Pada penelitian ini akan dicari graf yang termasuk dalam kelas Ramsey minimal R(mK2, 2Kn), untuk beberapa nilai n ≥ 3 dan m ≥ 2.Kata Kunci: Graf lengkap, Graf Ramsey Minimal, Matching

Metrics for Multiset-Theoretic Subgraphs

We show how to define a plethora of metrics for graphs—either full graphs or subgraphs. The method mainly utilizes the minimal matching between any two multisets of positive real numbers by comparing the multiple edges with respect to their corresponding vertices. In the end of this article, we also demonstrate how to implement these defined metrics with the help of adjacency matrices. These metrics are easy to be manipulated in real applications and could be amended according to different situations. By our metrics, one should be able to compare the distances between graphs, trees, and networks, in particular those with fuzzy properties.

A Metric for Finite Power Multisets of Positive Real Numbers Based on Minimal Matching

In this article, we show how to define a metric on the finite power multisets of positive real numbers. The metric, based on the minimal matching, consists of two parts: the matched part and the mismatched part. We also give some concrete applications and examples to demonstrate the validity of this metric.