Search

The crossing number cr(H) of a graph H is the minimum number of edge crossings over all drawings of H in the plane. Let H∗ be the connected graph of order five isomorphic to K5 ∖ e obtained by removing one edge from the complete graph K5. The main aim of the paper is to give the crossing numbers of the join products H∗ + Pn and H∗ + Cn, where Pn and Cn are the path and the cycle on n vertices, respectively. The proofs are done with the help of a suitable classification of a large number of drawings of the graph H∗ in view of the existence of a separating cycle of two possible types. [ABSTRACT FROM AUTHOR]

Copyright of Continue Education Research is the property of Harbin Normal University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Hubei Open Vocational College is the property of Journal of Hubei Open Vocational College Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Sandpile groups are a subtle graph isomorphism invariant, in the form of a finite abelian group, whose cardinality is the number of spanning trees in the graph. We study their group structure for graphs obtained by attaching a cone vertex to a tree. For example, it is shown that the number of generators of the sandpile group is at most one less than the number of leaves in the tree. For trees on a fixed number of vertices, the paths and stars are shown to provide extreme behavior, not only for the number of generators, but also for the number of spanning trees, and for Tutte polynomial evaluations that count the recurrent sandpile configurations by their numbers of chips. [ABSTRACT FROM AUTHOR]

Defined the connotation of traditional rural cultural inheritance and interpreted the significance of cultural inheritance. Summarized the positive practices of Beijing’s rural areas in recent years in inheriting agricultural culture, strengthening the protection of traditional villages, utilizing excellent traditional cultural concepts to govern villages, and promoting the development of cultural industries. Analyzed the difficulties faced by the inheritance of traditional rural culture in Beijing, mainly manifested as the gradual decline and disappearance of traditional village sunset, lack of awareness of traditional rural cultural values among farmers, the dissolution and loss of traditional rural culture caused by industrial development, and insufficient innovation in cultural inheritance. Proposed a path to reconstruct the inheritance of traditional rural culture: pay attention to the protection of village space and preserve the original nature of the countryside; enhance traditional cultural awareness and reshape the value of traditional rural culture; establish a talent inheritance mechanism to stimulate the endogenous driving force of traditional rural cultural inheritance; innovate the concept of inheritance and seek a balance between development and cultural inheritance. [ABSTRACT FROM AUTHOR]

Tea is the national beverage of China, and men of virtues serves as the model of traditional character. The encounter and fusion of tea and men of virtues give birth to man of virtues from the tea ceremony, which is regarded as a symbol of high moral standards. From the perspective of the knowledge of men of virtues, the virtues of benevolence, love and respect, the wisdom of moderation and elegance, along with the spirit of self -improvement and perseverance contribute to the profound meaning of the tea ceremony. From the practice of the tea ceremony, those who embody frugality and virtue, who remain tranquil and steadfast, and who demonstrate filial piety and patriotism, all showcase the demeanor for men of virtues. Furthermore, from the aspect of the unity of knowledge and practice, adhering to the concept of integrity and practising earnestly, crafting a harmonious state of mind for the fusion of spirit and matter, as well as sharing the essence of tea ceremony from ancient to modern times, together form the foundational path for men of virtues to cultivate the tea ceremony. [ABSTRACT FROM AUTHOR]

Let a graph G = (V, E) be a (p, q) graph. Define ρ = {p/2, p is even p - 1/2, p is odd, and M = {±1, ±2, ⋯ ± ρ} called the set of labels. Consider a mapping λ : V → by assigning different labels in M to the different elements of V when p is even and different labels in M to p -- 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there exists a labeling λ(2)+λ(v)/2 if λ(2) + λ(v) is even and λ(u)+λ(v)+1/2 if λ(u) + λ(v) is odd such that ... ≤ where ... and ... respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G with a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we discuss here the pair mean cordial labeling of union graphs like Lm, υ Ln, Pm υ Ln, Cm Ln, Wm υ υ Ln, Sm υ Ln. [ABSTRACT FROM AUTHOR]

Nowadays, China has expanded its partnerships with the participating countries in broader areas, with various cooperation platforms and projects being steadily implemented. These fruitful and productive collaborations have not only created tangible benefits for these countries, but have also contributed to promoting economic globalization, tackling global development challenges and improving global governance systems. The Guangdong-Hong Kong-Macao Greater Bay Area (GBA), as a crucial node of the Belt and Road Initiative (BRI), plays an important role in driving forward the BRI technological innovation agenda. This article explores the progresses of the GBA in BRI technological innovation practices, analyzes its advantages and challenges in this regard, and proposes pathways and measures for transforming the GBA into a leading hub of technological innovation under the BRI, for the purpose of advancing the leading role of the region in the initiative and contributing wisdom and power to technological innovation and cooperation worldwide. [ABSTRACT FROM AUTHOR]

NeutroGeometry is one of the most recent approaches to geometry. In NeutroGeometry models, the main condition is to satisfy an axiom, definition, property, operator and so on, that is neither entirely true nor entirely false. When one of these concepts is not satisfied at all it is called AntiGeometry. One of the problems that this new theory has had is the scarcity of models. Another open problem is the definition of angle and distance measurements within the framework of NeutroGeometry. This paper aims to introduce a general theory of distance measures in any NeutroGeometry. We also present an algorithm for distance measurement in real-life problems. [ABSTRACT FROM AUTHOR]

For a graph G, we define a total k-labeling ϕ as a combination of an edge labeling ϕe : E(G) → {1, 2, . . ., ke} and a vertex labeling ϕv : V (G) → {0, 2, . . ., 2kv}, where k = max {ke, 2kv}. The total k-labeling ϕ is called a vertex irregular reflexive k-labeling of G if any pair of vertices u, u' have distinct vertex weights wtϕ(u) ≠ wtϕ(u'), where wtϕ(u) = ϕ(u) + Σuu'∈E(G) ϕ(uu' ) for any vertex u ∈ V (G). The smallest value of k for which such a labeling exists is called the reflexive vertex strength of G, denoted by rvs(G). In this paper, we present a new lower bound for the reflexive vertex strength of any graph. We investigate the exact values of the reflexive vertex strength of generalized friendship graphs, corona product of two paths, and corona product of a cycle with isolated vertices by referring to the lower bound. This study discovers some interesting open problems that are worth further exploration. [ABSTRACT FROM AUTHOR]

For a set of connected graphs, a spanning subgraph H of G is called a -factor if each component of H is isomorphic to a member of . In this paper, some sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the { K 1 , j : 1 ≤ j ≤ 2 k } -factor and { P 2 , P 5 } -factor for any graph are obtained. [ABSTRACT FROM AUTHOR]

Chung et al. constructed an induced subgraph of the hypercube Qn ${Q}^{n}$ with α(Qn)+1 $\alpha ({Q}^{n})+1$ vertices and with maximum degree smaller than ⌈n⌉ $\lceil \sqrt{n}\rceil $. Subsequently, Huang proved the Sensitivity Conjecture by demonstrating that the maximum degree of such an induced subgraph of hypercube Qn ${Q}^{n}$ is at least ⌈n⌉ $\lceil \sqrt{n}\rceil $, and posed the question: Given a graph G $G$, let f(G) $f(G)$ be the minimum of the maximum degree of an induced subgraph of G $G$ on α(G)+1 $\alpha (G)+1$ vertices, what can we say about f(G) $f(G)$? In this paper, we investigate this question for Cartesian product of paths Pm ${P}_{m}$, denoted by Pmk ${P}_{m}^{k}$. We determine the exact values of f(Pmk) $f({P}_{m}^{k})$ when m=2n+1 $m=2n+1$ by showing that f(P2n+1k)=1 $f({P}_{2n+1}^{k})=1$ for n≥2 $n\ge 2$ and f(P3k)=2 $f({P}_{3}^{k})=2$, and give a nontrivial lower bound of f(Pmk) $f({P}_{m}^{k})$ when m=2n $m=2n$ by showing that f(P2nk)≥⌈2cosπn2n+1k⌉ $f({P}_{2n}^{k})\ge \lceil 2\cos \frac{\pi n}{2n+1}\sqrt{k}\rceil $. In particular, when n=1 $n=1$, we have f(Qk)=f(P2k)≥k $f({Q}^{k})=f({P}_{2}^{k})\ge \sqrt{k}$, which is Huang's result. The lower bounds of f(P3k) $f({P}_{3}^{k})$ and f(P2nk) $f({P}_{2n}^{k})$ are given by using the spectral method provided by Huang. [ABSTRACT FROM AUTHOR]

Copyright of Food Science & Technology & Economy is the property of Grain Science & Technology & Economy Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Green transformation is an unavoidable choice for resource-based cities (RBCs) that face resource depletion and environmental pollution. Existing research has focused primarily on specific RBCs, making it challenging to apply green transformation strategies universally across cities. The fuzzy set qualitative comparative analysis (fsQCA) is a combination of qualitative and quantitative analyses that can handle multiple concurrent causality problems and determine how different conditions combine into configurations and generate an outcome. Thus, to address this gap, in this study, we established a research framework for green transformation and utilized the fsQCA to examine the configurations of 113 RBCs in China. By incorporating the element of time, this study explored the dynamic evolution of solutions in 2013, 2016, and 2019. The main findings indicate that individual elements do not constitute the necessary conditions for improving the green transformation efficiency (GTE), and the systematic combination of multiple conditions is an effective path for realizing the improvement of the GTE in RBCs. Green transformation paths of RBCs exhibit the same destination through different paths. Additionally, the combination of system environment elements and system structure elements is both complementary and alternative. Differences in RBCs have led to various factor combinations and development paths, but there are some similarities in the key elements of the factor combinations at different stages. Economic environment, government support, and technological innovation are key factors that universally enhance the GTE in RBCs. These insights can assist city managers in formulating policies to drive green transformation and contribute to a better theoretical understanding of green transformation paths in RBCs. [ABSTRACT FROM AUTHOR]

Copyright of Natural Gas Industry is the property of Natural Gas Industry Journal Agency and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

An edge-coloring of a graph $ G $ with colors $ 1, \ldots, t $ is an interval $ t $-coloring if all colors are used and the colors of edges incident to each vertex of $ G $ are distinct and form an interval of integers. A graph $ G $ is interval colorable if it has an interval $ t $-coloring for some positive integer $ t $. For an interval colorable graph $ G $, the least and the greatest values of $ t $ for which $ G $ has an interval $ t $-coloring are denoted by $ w(G) $ and $ W(G) $. Let $ G $ be a graph with vertex set $ V(G) = \{u_1, \ldots, u_{m}\} $, $ m\geq2 $, and let $ h_m = (H_i)_{i\in\{1, \ldots, m\}} $ be a sequence of vertex-disjoint with $ V(H_i) = \{x_1^{(i)}, \ldots, x_{n_i}^{(i)}\} $, $ n_i\geq 1 $. The generalized lexicographic products $ G[h_m] $ of $ G $ and $ h_m $ is a simple graph with vertex set $ \cup_{i = 1}^{m}V(H_i) $, in which $ x_p^{(i)} $ is adjacent to $ x_q^{(j)} $ if and only if either $ u_i = u_j $ and $ x_p^{(i)}x_q^{(i)}\in E(H_i) $ or $ u_iu_j\in E(G) $. In this paper, we obtain several sufficient conditions for the generalized lexicographic product $ G[h_m] $ to have interval colorings. We also present some sharp bounds on $ w(G[h_m]) $ and $ W(G[h_m]) $ of $ G[h_m] $.

Objective. To show that despite the enormous efforts of M. Heidegger, he failed to find a new way of thinking. Scientific novelty. It is shown that the meeting of two different streams of historical thinking – the destructive thinking of Heidegger, who never stood on the ground of the Pre-Socratics (although he strived for this all his life), and the Pre-Socratic, which gradually lost its vitality in subsequent European culture, never took place. The different streams of thinking – the ancient Greeks and Heidegger – never crossed. The early Greeks sought to understand the nature of essence, that is, they were looking, according to Heidegger, for the first beginning of thinking (and for this they tried to use the tools of openness of thinking, but did not understand its reasons), while Heidegger, who consistently went through a long path of liberation from all the European ones known to him methods of understanding nature, on the contrary, sought to find ways to understand the true nature of human existence, that is, he looked for the second principle of thinking (but also failed to reveal its origins). It was found that European culture throughout its history has stopped between these two extreme streams of thinking – aimed, on the one hand, at the world of things (essence) and, on the other, at the inner world of man (existence), but in both of these streams there are genuine the beginnings of thinking remained unheard. The analysis shows that throughout his life, Heidegger was looking, in fact, not even for being, but for the being of thinking; more precisely, he was looking for thinking that could exist synchronously with the thought of the ancient Greeks, which allowed him, on the one hand, – to reveal the fall of European culture, and on the other hand, to try to find the motives for future thinking.In our opinion, Heidegger heard the main problem of European culture: logos does not illuminate thinking, does not carry either natural or divine light, it is only similar to a given (often artificial) logical scheme. All ancient religions spoke about this. The ancient Greeks knew this; Plato and Aristotle replaced the true divine light with a system of ideas, concepts, categories and logic. It seems that the concealment of the true light (nature and gods) is the path of the fall of European culture, about which Nietzsche, Wagner and Heidegger wrote. Thinking exists only where consciousness disintegrates in the spatio-temporal topos of its existence. And logos, as this study shows, can only exist in a split consciousness. Based on this, it is increasingly clear that we have not learned to think like the Greeks and, moreover, in our selfishness we may finally lose this opportunity. On my own behalf, I would like to add: what Heidegger failed to achieve can be clarified along the paths of contact between Western and Eastern thought.

For two graphs G and H, the Gallai–Ramsey number gr k (G : H) is defined as the minimum integer n such that any k-edge-coloring of K n must contain either a rainbow copy of G or a monochromatic copy of H. In this paper, we obtain the exact values of gr k (G : H) , where H is a path and G ∈ { K 1 , 3 , P 4 + , P 5 } is a small tree and P 4 + is the graph consisting of P 4 with one extra edge incident with an inner vertex. [ABSTRACT FROM AUTHOR]

目的 探索研究生教育“分流退出”路径，为“分流退出”制度的实施提供参考。 方法 依据首都医科大学研究生工作手册相关规定制订“分流退出”条目，采用德尔菲法开展两轮函询调查。通过计算条目均值、变异系数、满分比等指标，确定函询条目，形成“分流退出”制度条目，在此基础上，绘制“分流退出”路径图。 结果 本研究于2023年11月共进行两轮函询，函询专家共12名，问卷有效回收率均为100%，最终形成了“分流退出”管理条文，包括退出和分流两个维度，其中退出涵盖日常管理、培养过程和学位管理三方面共22项条目，分流即转科学学位，共4项条目。第1轮专家权威系数为0.892，第2轮专家权威系数为0.896，专家的权威程度较高，评价结果可靠。两轮肯德尔协调系数分别为0.264和0.306（P＜0.05），提示咨询专家意见较为一致，评价结果可信。第2轮函询问卷，各个评价条目的算术均值均＞3.50，且变异系数＜0.25，条目予以保留。满分比在80%以上的条目有10个。条目中最低平均分为3.833分，最高平均分为满分5分。 结论 本研究函询结果科学可靠，探索了研究生教育“分流退出”路径，能够为研究生教育“分流退出”制度实施提供参考，对保证制度落实、保障研究生教育质量，具有重要意义。 Abstract: Objective To explore the path of “diversion withdrawal” in graduate education and provide a reference for implementing the “diversion withdrawal” system. Methods According to the relevant regulations of the work manual of the graduate students of Capital Medical University, the items of “diversion withdrawal” were established, and the Delphi method was used to carry out two rounds of correspondence investigation. By calculating the mean value, coefficient of variation, full score ratio, and other indicators, the items were determined and the system items of “diversion withdrawal” were formed. On this basis, the path diagram of “diversion withdrawal” was drawn. Results In this study, two rounds of correspondence were conducted in November 2023, with 12 experts consulted, and the effective recovery rate of the questionnaire was 100%. Finally, the management provisions of “diversion withdrawal” were formed, including two dimensions of withdrawal and diversion, in which withdrawal covered 22 items in three aspects of daily management, training process, and degree management, while diversion, namely transfer degree, included 4 items. The expert authority coefficient of the first round was 0.892, and that of the second round was 0.896, indicating a high degree of expert authority and reliable evaluation results. The Kendall’s concordance coefficients of the two rounds were 0.264 and 0.306, respectively (P3.50, and the coefficient of variation was

We aim to predict links in fuzzy social networks, where the existing methods based on common neighbors of two nodes are not effective. These methods are local measures that only work when the shortest distance between two nodes is less than or equal to two. Our method can handle cases where the shortest distance is between three and five. We define the concepts of link strength and path strength in a network and propose an algorithm for predicting links. We illustrate our method with a numerical example in a co-authorship network and discuss application areas in biomedical.

Let G and H be two graphs, each one of them being a path, a cycle or a star. In this paper, we determine the b-chromatic number of every subdivision-vertex neighbourhood corona G ⊡ H or G ⊡ Kn, where Kn is the complete graph of order n. It is also established for those graphs Kn ⊡ G having m-degree not greater than n + 2. All the proofs are accompanied by illustrative examples.

This review systematically examines the recent research from the past decade on diverse path-planning algorithms tailored for stereotactic neurosurgery applications. Our comprehensive investigation involved a thorough search of scholarly papers from Google Scholar, PubMed, IEEE Xplore, and Scopus, utilizing stringent inclusion and exclusion criteria. The screening and selection process was meticulously conducted by a multidisciplinary team comprising three medical students, robotic experts with specialized knowledge in path-planning techniques and medical robotics, and a board-certified neurosurgeon. Each selected paper was reviewed in detail, and the findings were synthesized and reported in this review. The paper is organized around three different types of intervention tools: straight needles, steerable needles, and concentric tube robots. We provide an in-depth analysis of various path-planning algorithms applicable to both single and multi-target scenarios. Multi-target planning techniques are only discussed for straight tools as there is no published work on multi-target planning for steerable needles and concentric tube robots. Additionally, we discuss the imaging modalities employed, the critical anatomical structures considered during path planning, and the current status of research regarding its translation to clinical human studies. To the best of our knowledge and as a conclusion from this systematic review, this is the first review paper published in the last decade that reports various path-planning techniques for different types of tools for minimally invasive neurosurgical applications. Furthermore, this review outlines future trends and identifies existing technology gaps within the field. By highlighting these aspects, we aim to provide a comprehensive overview that can guide future research and development in path planning for stereotactic neurosurgery, ultimately contributing to the advancement of safer and more effective neurosurgical procedures. [ABSTRACT FROM AUTHOR]

A given graph H is called realizable by a graph G if G [ N (v) ] ≅ H for every vertex v of G. The Trahtenbrot-Zykov problem says that which graphs are realizable? We consider a problem somewhat opposite in a more general setting. Let F be a family of graphs: to characterize all graphs G such that G - N [ v ] ∈ F for every vertex v of G. Let T m be the set of all trees of size m ≥ 0 for a fixed nonnegative integer m, P = { P t : t > 0 } and S = { K 1 , t : t ≥ 0 } . We show that for a connected graph G with its complement G ¯ being connected, G - N [ v ] ∈ T m for each v ∈ V (G) if and only if one of the following holds: G - N [ v ] ≅ K 1 , m for each v ∈ V (G) , or G - N [ v ] ≅ P m + 1 for each v ∈ V (G) . Indeed, the graphs with later two properties are characterized by the same authors very recently (Graphs G in which G - N [ v ] has a prescribed property for each vertex v, Discrete Appl. Math., In press.). In addition, we characterize all graphs G such that G - N [ v ] ∈ S for each v ∈ V (G) and all graphs G such that G - N [ v ] ∈ P for each v ∈ V (G) . This solves an open problem raised by Yu and Wu (Graphs in which G - N [ v ] is a cycle for each vertex v, Discrete Math. 344 (2021) 112519). Finally, a number of conjectures are proposed for the perspective of the problem. [ABSTRACT FROM AUTHOR]

The experiment was conducted during kharif season ( June-October, 2022) at Rice Research Station, Kaul, CCSHAU, Hisar using 48 rice genotypes to evaluate the genetic variability and character association under aerobic conditions. Analysis of variance revealed that the mean sum of squares was highly significant for all the traits examined. The magnitude of phenotypic coefficient of variation exceeded the genotypic coefficient of variation for all the traits analysed in the study. High genotypic coefficient of variation and phenotypic coefficient of variation were observed for root dry weight plant-1 followed by number of grains panicle-1, grain yield plant-1, biological yield plant-1, number of effective tillers plant-1 and flag leaf length. High heritability coupled with high genetic advance as per cent of mean was observed for grain yield plant-1, number of grains panicle-1, biological yield plant-1, root fresh weight plant-1 and root dry weight plant-1 indicating the presence of additive gene action. Grain yield plant-1 showed a highly significant and positive association with biological yield plant-1, harvest index percentage, root fresh weight plant-1, number of effective tillers plant-1 and 1000 seed weight. Path analysis revealed that biological yield plant-1 and harvest index percentage showed highest positive direct effect on grain yield plant-1. Furthermore, regression analysis revealed that biological yield plant-1, harvest index percentage, numbers effective of tillers plant-1, number of grains panicle-1, plant height and head rice recovery % as important traits contributing to grain yield plant-1. Therefore, phenotypic selection could be a viable approach for genetically improving these traits to obtain promising genotypes for future rice breeding programs. [ABSTRACT FROM AUTHOR]

Copyright of Jiaoyu Kexue Wenxian is the property of Educational Science Literature (Chinese) Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Graph labeling is the allocation of integers to the vertex or edges or both subject to certain conditions. The concept of Even Sum Graphs was introduced by Chinju Krishna et al. A graph G is called an even sum graph if there is a labeling - of its vertices with distinct non - negative even integers, so that for any two distinct vertices a and b; ab is an edge of G if and only if η(a) + η(b) = η(c) for some vertex c in G. The minimum number of isolated vertices required to make the graph G, an even sum graph is called the even sum number of G and is denoted by γ(G). [ABSTRACT FROM AUTHOR]

Motion event description has received little attention in contact linguistics as compared to other branches of linguistics. To address this gap, I provide an overview of the grammatical and lexical resources for the encoding of motion events in Gulf Pidgin Arabic (GPA). 10 GPA speakers narrated the story of a boy, his dog, and his missing pet frog. The results revealed: (a) the participants used a relatively large number of path verbs and a comprehensive number of spatial particles; (b) they showed an overwhelming aversion to the description of manner in boundary-crossing and caused motion situations; and (c) they engineered coercive constructions to deal with semantically complex situations. Taken together, the linguistic evidence suggests GPA is developing into a verb-framed language type. This study adds a significant methodological and empirical weight to the existing literature and has the potential to encourage intra- and inter-disciplinary comparative work on motion event description. [ABSTRACT FROM AUTHOR]

Copyright of Continue Education Research is the property of Harbin Normal University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Chinese Journal of Stroke is the property of Chinese Journal of Stroke Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper investigates the topological and topoline numbers of some graphs and settles certain conjectures related to the topological numbers of star graphs. The topoline numbers of some stars, paths, and certain related graphs are also obtained. [ABSTRACT FROM AUTHOR]

The classical Lagrange problem for dynamical systems introduces a Lagrangian action functional defined for any dynamical process that is envisioned to take place over a fixed interval of time with its state at each time lying on an unknown, but prescribed, configuration between two given end points in an n -dimensional state space R n . It is proposed that the fundamental dynamical field equation that characterizes the dynamical process and determines the precise motion between the two given end points is the Euler–Lagrange equation related to the stationarity of the Lagrangian action functional, expressed as the integral of a particularly formulated action density over the fixed time interval, among all admissible configurations that span the two given end points. Thus stated, this variational calculus problem introduces variations of a configuration that carries a dynamical process, and emphasizes the novelty and need to express explicitly how the configuration influences the state of that process. At each time during a dynamical process the state is subjected to an extrinsic force (classically taken to be conservative) which must be transmitted to the configuration that carries the process and, by action-reaction the configuration responds with a configuration contact force on the state of equal magnitude but opposite direction. This allows the Lagrangian action functional for a dynamical process to be interpreted as the difference between the average kinetic energy of the dynamical process that is carried by that configuration and the average configurational work done by the configuration contact force on the moving state as the state traverses that configuration during the fixed time interval. The aim in the Problem of Lagrange is to extremize this difference over all admissible configurations. The implication is that given a time interval and initial and final end points in the space of all states, the dynamical process of physical interest must follow a configuration that optimizes the gap between the average expended kinetic energy and the average expended configurational work. When the optimal condition is met and the dynamical process is so restricted, the difference between these average expenditures of energy and work will be at a local maximum, a local minimum, or a saddle point known as a condition of "least action". Herein, we investigate the optimization implications of this novel interpretation of the action functional for the Problem of Lagrange for dynamical systems for a general, possibly non-conservative, state-dependent extrinsic force field. We show that only a conservative state-dependent extrinsic force field is allowable within the statement of the problem and, thus, reaffirm the predominant classical hypothesis of restricting attention to conservative extrinsic force fields. We close with a section which covers an analogous investigation of the Problem of Lagrange for nonlinear elastodynamics. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Hubei Open Vocational College is the property of Journal of Hubei Open Vocational College Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Objective. To show that despite the enormous efforts of M. Heidegger, he failed to find a new way of thinking. Scientific novelty. It is shown that the meeting of two different streams of historical thinking – the destructive thinking of Heidegger, who never stood on the ground of the Pre-Socratics (although he strived for this all his life), and the Pre-Socratic, which gradually lost its vitality in subsequent European culture, never took place. The different streams of thinking – the ancient Greeks and Heidegger – never crossed. The early Greeks sought to understand the nature of essence, that is, they were looking, according to Heidegger, for the first beginning of thinking (and for this they tried to use the tools of openness of thinking, but did not understand its reasons), while Heidegger, who consistently went through a long path of liberation from all the European ones known to him methods of understanding nature, on the contrary, sought to find ways to understand the true nature of human existence, that is, he looked for the second principle of thinking (but also failed to reveal its origins). It was found that European culture throughout its history has stopped between these two extreme streams of thinking – aimed, on the one hand, at the world of things (essence) and, on the other, at the inner world of man (existence), but in both of these streams there are genuine the beginnings of thinking remained unheard. The analysis shows that throughout his life, Heidegger was looking, in fact, not even for being, but for the being of thinking; more precisely, he was looking for thinking that could exist synchronously with the thought of the ancient Greeks, which allowed him, on the one hand, – to reveal the fall of European culture, and on the other hand, to try to find the motives for future thinking. In our opinion, Heidegger heard the main problem of European culture: logos does not illuminate thinking, does not carry either natural or divine light, it is only similar to a given (often artificial) logical scheme. All ancient religions spoke about this. The ancient Greeks knew this; Plato and Aristotle replaced the true divine light with a system of ideas, concepts, categories and logic. It seems that the concealment of the true light (nature and gods) is the path of the fall of European culture, about which Nietzsche, Wagner and Heidegger wrote. Thinking exists only where consciousness disintegrates in the spatio-temporal topos of its existence. And logos, as this study shows, can only exist in a split consciousness. Based on this, it is increasingly clear that we have not learned to think like the Greeks and, moreover, in our selfishness we may finally lose this opportunity. On my own behalf, I would like to add: what Heidegger failed to achieve can be clarified along the paths of contact between Western and Eastern thought. [ABSTRACT FROM AUTHOR]

This paper analyzes opportunities and challenges faced by college students' cultural confidence in the new media era, and explores the coping strategies, that is, using new media platforms to create efficient classrooms, optimize new media positions, and expand practical paths to cultivate cultural self-confidence. [ABSTRACT FROM AUTHOR]

For a graph H with a vertex set P(H) and an edge set Q(H), if map g : P(H) → {0, 1, 2} and its induced map g∗ : Q(H) → {0, 1, 2} defined by g∗ (xy) = √ g(x)g(y)⌉; ∀xy ∈ Q(H), satisfies the absolute difference of the number of vertices (edges) with labeled x and labeled y is at most 1( where ∀x, y ∈ {0, 1, 2}) then g is called a geometric mean 3- equitable labeling. In this paper, we investigate a geometric mean 3-equitable labeling of the graph obtained from switching of any vertex with degree one in path Pr for r ≡ 1 (mod 3), switching of any vertex other than the support vertices in path Pr for r ≡ 1, 2 (mod 3) and switching of any vertex in cycle Cr for r ≡ 1, 2 (mod 3). [ABSTRACT FROM AUTHOR]

The paper provides a novel motivation in favor of a complex and fine-grained syntax of spatial PPs in Arabic. It neatly fills a gap between the complex semantics of spatial expressions and their morphosyntax, which remains unexplained using wide spread cognitive approaches. We propose a fine-grained architecture of root nodes, categories, and features in the basic representations of Path/Place expressions, inspired by cartographic analyses of PPs, but based on a pP dual-projection model, separating the root/lexical part from the functional/categorial part, as in Distributed Morphology (=DM). In so doing, the paper challenges traditional analyses of PPs as projecting a uniform Path over Place structure (with no bifurcating domain separation). It also provides essential ingredients allowing the decomposition of Place and Path words or expressions, including COINCIDENCE, CONTAIN, CONTACT, etc., or syntactic projections such AxPs, DeixPs, DegPs, ScaleP, GoalPs, etc., which play important syntactico-semantic roles in the grammar. Our analysis successfully accounts for complexity of prepositions or spatial expressions, their morphosyntactic alternations, variation, and polysemy. [ABSTRACT FROM AUTHOR]

This article explores intersections between the author's process of making art and the analytic relationship. The author makes correlations between witnessing a deeply moving impressionist painting, engaging in Jung's method of active imagination, and the experience of reverie and opening to the imagination in the clinical relationship. Opening to the unconscious, and relating consciously to what emerges, is an art and a dance that involves the capacity to play. When there are unconscious and conscious meetings, a creative process ensues and can constellate what Jung called the transcendent function, a process that often catalyzes personal transformation. In witnessing great art and engaging in a creative process within the analytic situation, there is a curiosity and willingness to be affected and bear uncertainty for the sake of new discoveries, as well as dedication to becoming a more whole human being. [ABSTRACT FROM AUTHOR]

The technique used in studying the computational capabilities of interconnection networks and task distribution is graph embedding. Based on the recursively constructed graphs, the hypercube network is popular for its structure. Many variants of hypercube are considered in the literature. Augmented cube is considered as one of the best variants of hypercube as it holds many desirable properties like optimal routing in linear time complexity, vertex symmetricity, wide diameter and maximum connectivity. Our work deals with the exact wirelength, when augmented cube is embedded into certain tree and windmill structures. [ABSTRACT FROM AUTHOR]

Copyright of Turkish Culture & Haci Bektas Veli Research Quarterly is the property of Turkish Cultur & Haci Bektas Veli Research Quarterly and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Continue Education Research is the property of Harbin Normal University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Model worker culture is the concentrated manifestation of the spirit and working style of advanced workers represented by model workers, and as an important part of China's national spirit and the spirit of the times, it embodies the core values of patriotism and reform and innovation. Strengthening the labour education of college students is necessary for colleges and universities to implement the fundamental task of establishing moral education and promoting the comprehensive development of college students, and the culture of model workers will provide live cases and rich teaching resources for the development of labour education in colleges and universities. In this paper, we will explore the practical path of labour education in colleges and universities guided by the culture of model workers in the new era, so as to establish correct values and labour concepts of college students, and help cultivate new generations with noble character and professionalism. [ABSTRACT FROM AUTHOR]

With the progress of manufacturing capability and the requirements of modern project construction clustering and safety, unmanned technology has become a major development direction for construction machinery. The study analyzes the defects of the ACO applied to path planning, uses the basic ant colony method combined with the APF algorithm to construct comprehensive heuristic information to improve the efficiency of the initial iteration, and adds a pseudo‐random proportional transfer rule to improve its transfer rule, in addition to proposing an optimal ant pheromone release rule to ensure that the pheromone update can effectively improve the effect of the later iteration. In the 20 × 20 raster map, the optimal path of both the basic and potential field ant colony algorithms is 31.52, while the basic ant colony algorithm does not converge to the optimal path after 200 iterations in the 30 × 30 raster map, and the comparison algorithm converges to the optimal path after 156 iterations, while the potential field ant colony algorithm converges to the optimal path after 25 iterations at 47.52. And the potential field ant colony The potential field ant colony algorithm converges to the optimal path of 47.52 after 25 iterations, and the number of turns in both raster maps of different sizes is only about 50% of the basic ant colony algorithm, which is also better than that of the comparison algorithm. The proposed algorithm improves the ability of the ant colony algorithm to explore and exploit raster maps, enhances its path planning capability, and improves the construction efficiency well in practical applications. [ABSTRACT FROM AUTHOR]

Focusing on cultivating and practicing core socialist values is an important strategic measure for cultural construction in the new era. Leading the civilization practice in the new era with core socialist values are not only the fundamental need to promote the core socialist values to take root in rural areas, but also the basic principle for fulfilling the mission and task of propaganda, ideological and cultural work in the new era. The connotation of core socialist values leading the civilization practice in the new era can be summarized into three guidance: value guidance, theoretical guidance and practical guidance. To strengthen the guidance of core socialist values on the civilization practice in the new era, core socialist values should be integrated into the dissemination of scientific theories, into the ideological and political work at the grassroots level, and should be used to lead rural volunteer service. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Hubei Open Vocational College is the property of Journal of Hubei Open Vocational College Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Hubei Open Vocational College is the property of Journal of Hubei Open Vocational College Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of China Fiber Inspection / Zhongguo Xian-Jian is the property of China Fiber Inspection and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Hubei Open Vocational College is the property of Journal of Hubei Open Vocational College Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Hubei Open Vocational College is the property of Journal of Hubei Open Vocational College Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)