In this paper, a modular wire-actuated robotic arm was designed to improve the safety and adaptability of service robots during human-robot interaction. To raise the stiffness adjustment range of the robotic arm, a symmetric variable-stiffness unit was designed based on flexure, which had compact and simple structure, and lowly nonlinear stiffness-force relationship. In this paper, we focused on the research of the symmetric 1-DOF joint module. Based on the kinematics and stiffness analysis, the pose of the joint module could be adjusted by controlling the length of the wires, and the stiffness of the joint module could be adjusted by controlling the tension of the wires. Because of the actuation redundancy, the pose and stiffness of the joint module could be controlled synchronously. Furthermore, a directly method was proposed for the stiffness-oriented wire tension distribution problem of the 1-DOF joint module. A simulation was carried out to verify the proposed method.

The study examines the noise, vibration, and harshness (NVH) management of electric vehicle (EV) powertrains, considering the challenges of the automotive industry's transition to electric drivetrains. The growing popularity of EVs brings new NVH challenges, as the lack of internal combustion engine (ICE) noise makes drivetrain noise more prominent. Key to managing NVH in EV powertrains is understanding the noise from electric motors, inverters, and gear systems. Noise from electric motors, mainly resulting from electromagnetic forces, and high-frequency noise generated by inverters significantly impact overall NVH performance. The article details sources of mechanical noise and vibration, including gear defects in gear systems and shaft imbalances. Methods presented in the publication include simulation and modeling techniques that help identify and solve NVH difficulties. Tools like multi-body dynamics (MBD), finite element method (FEM), and multi-domain simulation are crucial for understanding the dynamic behavior of complex systems. With the support of simulations, engineers can predict noise and vibration challenges and develop effective solutions during the design phase. The study emphasizes the importance of a system-level approach in NVH management, where the entire drivetrain is modeled and analyzed together, not just individual components.

In the design of real-world networks, researchers evaluate various structural parameters to assess vulnerability, including connectivity, toughness, and tenacity. Recently, the tightness metric has emerged as a potentially superior vulnerability measure, although many related theorems remain unknown due to its novelty. Harary graphs, known for their maximum connectivity, are an important class of graph models for network design. Prior work has evaluated the vulnerability of three types of Harary graphs using different parameters, but the tightness metric has not been thoroughly explored. This article aims to calculate the tightness values for all three types of Harary graphs. First, it will attempt to calculate the lower bound for the value of the tightness parameter in Harary graphs using existing lemmas and theorems. Then, by presenting new lemmas and theorems, we will try to find the exact value or upper bound for this parameter in Harary graphs. For the first type of Harary graph, the tightness is precisely determined, while for the second and third types, upper bounds are provided due to structural complexity. The lemmas, theorems, and proof methods presented in this research may be used to calculate other graph and network parameters. However, the newness of the tightness parameter means that further research is needed to fully characterize its properties.

Despite the partial disclosure of driving scenario knowledge graphs, they still fail to meet the comprehensive needs of intelligent connected vehicles for driving knowledge. Current issues include the high complexity of pattern layer construction, insufficient accuracy of information extraction and fusion, and limited performance of knowledge reasoning models. To address these challenges, a hybrid knowledge graph method was adopted in the construction of the Driving Scenario Knowledge Graph (DSKG). Firstly, core concepts in the field were systematically sorted and classified, laying the foundation for the construction of a multi-level classified knowledge graph top-level ontology. Subsequently, by deeply exploring and analyzing the Traffic Genome data, 34 entities and 51 relations were extracted and integrated with the ontology layer, achieving the expansion and updating of the knowledge graph. Then, in terms of knowledge reasoning models, an analysis of the training results of the TransE, Complex, Distmult, and Rotate models in the entity linking prediction task of DSKG revealed that the Distmult model performed the best in metrics such as hit rate, making it more suitable for inference in DSKG. Finally, a standardized and widely applicable Driving Scenario Knowledge Graph was proposed. The DSKG and related materials have been publicly released for use by industry and academia.

Being able to express broad families of equivariant or invariant attributed graph functions is a popular measuring stick of whether graph neural networks should be employed in practical applications. However, it is equally important to learn deep local minima of losses (i.e., with much smaller loss values than other minima), even when architectures cannot express global minima. In this work we introduce the architectural property of attracting GNN optimization trajectories to local minima as a means of achieving smaller losses. We take first steps in satisfying this property for losses defined over attributed undirected unweighted graphs with a novel architecture, called Universal Local Attractor (ULA). The latter refines each dimension of end-to-end trained node feature embeddings based on graph structure to track the optimization trajectories of losses satisfying some mild conditions. The refined dimensions are then linearly pooled to create predictions. We experiment on 10 tasks, from node classification to clique detection, on which ULA is comparable with or significantly outperforms popular alternatives of similar or greater theoretical expressive power.

A mathematical procedure enabling the transformation of an arbitrary tessellation of a surface into a bi-colored complete graph is introduced. Polygons constituting the tessellation are represented by vertices of the graphs. Vertices of the graphs are connected by two kinds of links/edges, namely, by a green link, when polygons have the same number of sides, and by a red link, when the polygons have a different number of sides. This procedure gives rise to a semi-transitive, complete, bi-colored Ramsey graph. The Ramsey number was established as R_trans (3,3)=5. Shannon entropies of the tessellation and graphs are introduced. Ramsey graphs emerging from random Voronoi and Poisson Line tessellations were investigated. The limits ζ=lim┬(N→∞)⁡〖N_g/N_r 〗, where N is the total number of green and red seeds, N_g and N_r, were found ζ=0.272±0.001 (Voronoi) and ζ= 0.47±0.02 (Poisson Line). The Shannon Entropy for the random Voronoi tessellation was calculated as S= 1.690±0.001 and for the Poisson line tessellation as S =1.265±0.015.

New notion of dimension as set, as two optimal numbers including metric number, dimension number and as optimal set are introduced in individual framework and in formation of family. Behaviors of twin and antipodal are explored in fuzzy(neutrosophic) graphs. Fuzzy(neutrosophic) graphs, under conditions, fixed-edges, fixed-vertex and strong fixed-vertex are studied. Some classes as path, cycle, complete, strong, t-partite, bipartite, star and wheel in the formation of individual case and in the case, they form a family are studied in the term of dimension. Fuzzification(neutrosofication) of twin vertices but using crisp concept of antipodal vertices are another approaches of this study. Thus defining two notions concerning vertices which one of them is fuzzy(neutrosophic) titled twin and another is crisp titled antipodal to study the behaviors of cycles which are partitioned into even and odd, are concluded. Classes of cycles according to antipodal vertices are divided into two classes as even and odd. Parity of the number of edges in cycle causes to have two subsections under the section is entitled to antipodal vertices. In this study, the term dimension is introduced on fuzzy(neutrosophic) graphs. The locations of objects by a set of some junctions which have distinct distance from any couple of objects out of the set, are determined. Thus it’s possible to have the locations of objects outside of this set by assigning partial number to any objects. The classes of these specific graphs are chosen to obtain some results based on dimension. The types of crisp notions and fuzzy(neutrosophic) notions are used to make sense about the material of this study and the outline of this study uses some new notions which are crisp and fuzzy(neutrosophic). Some questions and problems are posed concerning ways to do further studies on this topic. Basic familiarities with fuzzy(neutrosophic) graph theory and graph theory are proposed for this article.

In this paper, we observe that if X is a set and (Bin(X), □) is the semigroup of binary systems on X, then its center ZBin(X) consists of the locally-zero-semigroups and that these can be modeled as (simple) graphs and conversely. Using this device we show that we may obtain many results of interest concerning groupoids by reinterpreting graph theoretical properties and at the same time results on graphs G may be obtained by considering them as elements of centers of the semigroups of binary systems (Bin(X), □) where X = V(G), the vertex set of G.

Maize is the staple cereal in Malawi, with a daily per capita consumption of 383g (dry matter basis), primarily consumed as dehulled maize flour used to cook nsima, a thick porridge. However, the extent of mass and nutrient loss during dehulling remains unclear in this food-insecure country, where the household maize harvest typically lasts only 6–7 months. In the current study, a milling experiment to determine yield and micronutrient losses was conducted. Milling batches (30 kg) of four maize grain varieties were dehulled at three abrasive disk dehullers under controlled conditions. Mass losses ranged from 18.8% to 42.7%, with a mean of 28.2±5.7%. Maize variety and dehuller significantly affected mass loss (p<0.05). Initial protein, iron, and zinc concentrations were 8.8 ±1.0 g/100g, 20.5±2.0 µg/g, and 18.2 ±2.6 µg/g, respectively. Post-dehulling nutrient true retention varied for protein (49.7% to 75.6%, mean=64.7±7.0%), iron (18.7% to 71.6%, mean=37.6±12.0 %), and zinc (11.0% to 46.2%, mean=27.9±8.7 %). Maize variety significantly influenced mass and protein loss (p < 0.05), while dehuller influenced mass, iron, and zinc losses. However, no significant difference (p > 0.05) was found in the interaction between dehullers and variety on mass and nutrient losses, respectively. Given Malawi's precarious food insecurity situation, transitioning from dehulled maize flour nsima to whole maize flour or less refined nsima, is imperative. Our study findings can have food and nutritional savings for other southern Africa countries where the dehulling practice is rampant.

This study introduces a novel computational approach for testing conditional independence (BB CI test) within causal Directed Acyclic Graphs (DAGs), leveraging Bayesian non-parametric bootstrap and machine learning techniques. Our method offers an alternative for validating the assumptions underpinning causal DAGs. Through simulation studies and an industrial case analysis, we demonstrate the test procedure in accurately assessing conditional independence, comparing it with the Generalized Covariance Measure (GCM) test. Our findings suggest that the BB CI test is advantageous in scenarios where existing methods may falter due to violations of model assumptions. This research contributes to the causal inference literature by providing a computational tool for researchers and practitioners to validate causal models.

This study aimed to determine shifts in microbial populations regarding richness and diversity from the daily use of a popular over-the-counter nasal spray. In addition, the finding of nasal commensal bacterial species that overlap with the oral microbiome may prove to be potential probiotics for the “gateway microbiomes.” Nasal swab samples were obtained before and after using the most popular over-the-counter (OTC) nasal spray in 10 participants aged 18–48. All participants were healthy volunteers with no significant medical histories. The participants were randomly assigned a number by randomizing software and consisted of five men and five women. The sampling consisted of placing a nasal swab atraumatically into the nasal cavity. The samples were preserved and sent to Northwestern University Sequencing Center for whole-genome deep sequencing. After 21 days of OTC nasal spray use twice daily, the participants returned for further nasal microbiome sampling. The microbial analysis included all bacteria, archaea, viruses, molds, and yeasts via deep sequencing for species analysis. The Northwestern University Sequencing Center utilized artificial intelligence analysis to determine shifts in species and strains following nasal spray use that resulted in changes in diversity and richness.

Design process can be divided into stages of analysis and synthesis. This paper presents the application of the object-oriented technique to the synthesis as well as theoretical considerations concerning to design of gear size ranges. The synthesis consists in composition (aggregation) of single details into units – according to the rule: “from details up to general view”. The basics of the object-oriented synthesis were formulated. Furthermore, the consecutive stages of synthesis were formulated. The interactions between these stages were discussed. Some aspects were described in details e.g.: creation of interfaces for performance of the embodiment phase the designed artefact via CAD system drawing with specification (dimensions are still parametrically set). The final step of the procedure is creation of so called substantial (concrete) form of artifacts i.e. final assignment of dimensions which stored in the special data base. The final stage of the design process is issuing of technical documentation (technical drawings) created automatically via CAD system. The considerations are terminated by the list of advantages connected with the object-oriented approach to design (in comparison to the traditional way).

In this article, some kinds of triple belongs to metric dimensions are defined. Some classes of graphs in the matter of these kinds, are studied and the relation amid these kinds are considered. The kind of having equivalency amid these notions and some classes of graphs, is obtained. The kind of locating some vertices by some vertices when the number of locating vertices is increased, has the key role to analyze the classes of graphs, general graphs, and graph's parameters.

This paper presents a system for identification of wind features, such as gusts and wind shear. These are of particular interest in the context of energy-efficient navigation of Small Unmanned Aerial Systems (UAS). The proposed system generates real-time wind vector estimates and a novel algorithm to generate wind field predictions. Estimations are based on the integration of an off-the-shelf navigation system and airspeed readings in a so-called direct approach. Wind predictions use atmospheric models to characterize the wind field with different statistical analyses. During the prediction stage, the system is able to incorporate, in a big-data approach, wind measurements from previous flights in order to enhance the approximations. Wind estimates are classified and fitted into a Weibull probability density function. A Genetic Algorithm (GA) is utilized to determine the shaping and scale parameters of the distribution, which are employed to determine the most probable wind speed at a certain position. The system uses this information to characterize a wind shear or a discrete gust and also utilizes a Gaussian Process regression to characterize continuous gusts. The knowledge of the wind features is crucial for computing energy-efficient trajectories with low cost and payload. Therefore, the system provides a solution that does not require any additional sensors. The system architecture presents a modular decentralized approach, in which the main parts of the system are separated in modules and the exchange of information is managed by a communication handler to enhance upgradeability and maintainability. Validation is done providing preliminary results of both simulations and Software-In-The-Loop testing. Telemetry data collected from real flights, performed in the Seville Metropolitan Area in Andalusia (Spain), was used for testing. Results show that wind estimation and predictions can be calculated at 1 Hz and a wind map can be updated at 0.4 Hz. Predictions show a convergence time with a 95% confidence interval of approximately 30 s.

We address the problem of finding a unique graph embedding that best describes a graph's "topology". This issue is of particular interest in the chemistry of materials. Graphs that admit a tiling in 3-dimensional Euclidean space are termed tessellate, those that do not decussate. We give examples of decussate and tessellate graphs that are finite and 3-periodic. We conjecture that a graph has at most one tessellate embedding. We give reasons for considering this the default "topology" of periodic graphs.

Design process can be divided into stages of analysis and synthesis. This paper presents the application of the object-oriented technique to the analysis as well as theoretical considerations concerning to design of gear size ranges. This analysis consists in decomposition of the designed artefact (a gear) according to the rule “from general to details view”. The basics of the object-oriented analysis were formulated. Furthermore, design phases and the objects related to theses phases were discussed. The following models have been considered: hierarchical model, entity-relationship model, data-flow model and object model. Analysis is additionally connected with interactions between particular design phases.

Spontaneous tumours in higher plants can develop depending on plant genotype without any pathogen invasion. Spontaneous tumour formation on the taproots is consistently observed in certain inbred lines of radish (Raphanus sativus var. radicula Pers.). In this work, we have sequenced the genomes of two closely related radish inbred lines that differ in their ability to spontaneously form tumours. We have identified numerous single nucleotide variants (amino acid substitutions, insertions or deletions) that are likely to be associated with the spontaneous tumour formation. Furthermore, we performed the identification of CLE and WOX genes the genomic sequences of the radish inbred lines and, as a result, identified two unique radish CLE genes which probably encode proteins with multiple CLE domains. The results obtained provide a basis for investigating the mechanisms of plant tumour formation and also for future genetic and genomic studies of radish.

Chinese texts often feature a substantial volume of normative content, and their analysis has increasingly become a focal point in recent semantic analysis endeavors. Enhancing the effectiveness of text classification and clustering is pivotal in unveiling the intricate semantics within extensive textual data. Empirical research within the realm of computational social science has underscored the need for improved explanatory power when it comes to general text clustering methods applied to normative texts. This study introduces an innovative hierarchical clustering method that incorporates part-of-speech (POS) features and pioneers a novel semantic network model. It achieves this by amalgamating a POS-based feature weight calculation method with hierarchical clustering techniques. To assess its efficacy, the method is rigorously evaluated across three diverse text datasets, encompassing normative reports, news articles, and social media content. The experimental results unequivocally demonstrate the superior performance of the POS-HC method, surpassing the traditional TF and TF-IDF feature extraction methods in terms of clustering accuracy, and surpassing some existing clustering methods. Furthermore, its classification effectiveness exhibits notable advantages, particularly in the semantic classification of normative texts.

Simple Summary: 200 words Will biology, including humans, benefit or harm from new developments in information such as artificial intelligence (AI). First, are biology and information different? Life is an ordered form that can reproduce, maybe with variation; and any ordered arrangement, biological or not, potentially contains information. There have been ordered forms since earth was just a ball of chemicals, and some such chemicals can reproduce. So biological and non-biological information might be components of a unified process, ‘PanEvolution’ or ‘Pan-Evo’, based on the same four operations for living or non-living entities - Innovation; Transmission and replication; Adaptation; and Movement. This can produce separate groups called ‘species’. In a current Panspeciation event, information held in biology - especially our brains - is moving into its own environment. Harm to biology might be minimal if humans and AI both behave intelligently, because vastly different environments are optimal for humans and machines containing AI. This would be the first speciation-like event involving humans for millennia, but will not be particularly hostile to humans, if humans learn how to evaluate information and cooperate, to minimize the effect of both human stupidity and artificial simulated stupidity (ASS – a failure of AI). Abstract: 200 words Many people wonder whether biology, including humans, will benefit or harm from new developments in information such as artificial intelligence (AI). Biological and non-biological information might be components of a unified process, ‘Pan-Evolution’ or ‘Pan-Evo’, based on four basic operations – Innovation, Transmission, Adaptation, and Movement. Pan-Evo contains many types of variable objects, from molecules to ecosystems. Biological innovation includes mutations and behavioural changes; non-biological innovation includes naturally-occuring physical innovations, and innovation in software. Replication is commonplace in and outside biology, including autocatalytic chemicals, and autonomous software replication. Adaptation includes biological selection, autocatalytic chemicals and ‘evolutionary programming’ used in AI. Extension of biological speciation to non-biological information, creates a concept called ‘Panspeciation’. Panevolution might benefit or harm biology, but harm might be minimal if AI and the humans behave intelligently, because humans, and the machines in which AI resides, might split to the vastly different environments that suit them. That is a possible example of panspeciation, and would be the first speciation event involving humans for thousands of years. This event will not be particularly hostile to humans, if humans learn to evaluate information and cooperate better, to minimize both human stupidity and artificial simulated stupidity (ASS – a failure of AI).

Symmetry, as a key concept in geometry and the foundational principle of mathematical concepts, is a fundamental part of geometry and nature, creating patterns that help us conceptually organize our world. It is often linked with aesthetic beauty and can be observed in both natural phenomena and human-made objects, such as artworks and manufactured products, across the globe. The automorphism group of a graph is a mathematical structure that captures all the symmetries of the graph. symmetry refers to the property of a graph, indicating that it can be transformed without changing its structure, while the automorphism group is the collection of all permutations of the vertices that preserve the graph's adjacency relationships. In graph theory, the concepts of symmetry group and automorphism group play fundamental roles in understanding the symmetries and structural properties of graphs. This paper aims to explore the relationship between symmetry groups and automorphism groups, shedding light on their interconnected nature and their significance in graph theory. We delve into the definitions and properties of both symmetry groups and automorphism groups, highlighting their similarities and distinctions. Furthermore, we discuss their applications in various fields, including computer science, chemistry, and network analysis. Through this exploration, we aim to provide a comprehensive understanding of the relationship between symmetry groups and automorphism groups, deepening our comprehension of the symmetries and structures inherent in graphs.

Shannon entropy quantifying bi-colored Ramsey complete graphs is introduced. Complete graphs in which vertices are connected with two types of links, labeled as α-links and β-links are considered. Shannon-entropy is introduced according to the classical Shannon formula considering the fractions of monochromatic convex α-colored polygons with n α-sides or edges, and the fraction of monochromatic β-colored convex polygons with m β-sides in the given complete graph. Introduced Shannon entropy is insensitive to the exact shape of the graph, but it is sensitive to the distribution of monochromatic polygons in a given graph. The introduced Shannon Entropies Sα and Sβ are interpreted as follows: Sα is interpreted as an average uncertainty to find the green α-polygon in the given graph, Sβ is, in turn, an average uncertainty to find the red β-polygon in the same graph. The re-shaping of the Ramsey theorem in terms of the Shannon Entropy is suggested. Various measures quantifying the Shannon Entropy of the entire complete bi-colored graphs are suggested. Physical interpretations of the suggested Shannon Entropies are discussed.

New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have these notions. Having all possible edges amid vertices in a set is a key type of approach to have these notions namely neutrosophic failed-independent number and failed independent neutrosophic-number. Two numbers are obtained but now both settings leads to approach is on demand which is finding biggest set which have all vertices which are neighbors. Let NTG : (V,E,σ,μ) be a neutrosophic graph. Then failed independent number I(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum cardinality of a set S of vertices such that every two vertices of S are endpoints for an edge, simultaneously; failed independent neutrosophic-number In(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum neutrosophic cardinality of a set S of vertices such that every two vertices of S are endpoints for an edge, simultaneously. As concluding results, there are some statements, remarks, examples and clarifications about some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and complete-t-partite-neutrosophic graphs. The clarifications are also presented in both sections “Setting of Neutrosophic Failed-Independent Number,” and “Setting of Failed Independent Neutrosophic-Number,” for introduced results and used classes. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhoods of vertices. In path-neutrosophic graphs, two neighbors, form maximal set but with slightly differences, in cycle-neutrosophic graphs, two neighbors forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of all vertices leads us to neutrosophic failed-independent number and failed independent neutrosophic-number. In star-neutrosophic graphs, a set of vertices containing only center and one other vertex, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices including two vertices from different parts makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of t vertices from different parts makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set to extend this set to set of all vertices has key role to have these notions in the form of neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of vertices. The cardinality of a set has eligibility to neutrosophic failed-independent number but the neutrosophic cardinality of a set has eligibility to call failed independent neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices have connections amid each other, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study quasi-degree and quasi-co-degree arising from co-neighborhood. quasi-degree and quasi-co-degree is about a vertex which are applied into the setting of neutrosophic graphs. . The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs and star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and complete-multipartite-neutrosophic graphs are investigated in the terms of a vertex which is called either quasi-degree or quasi-co-degree. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form quasi-degree and quasi-co-degree. Quasi-degree is a value of a vertex which is maximum amid all values of vertices which are neighbors to a fixed vertex. Quasi-co-degree is a value of an edge which is maximum amid all values of edges which are neighbors to a fixed vertex but corresponded vertex is representative for this notion. Using different values which are related to a vertex inspire us to focus on edge and vertices which are corresponded to a fixed vertex. The notion of neighborhood is used to collect either vertices are titled neighbors or edges are incident to fixed vertex. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definitions are provided. Using fixed vertex has key role to have these notions in the form of vertex or edge. The value of an edge has eligibility to call quasi-co-degree but the value of a vertex has eligibility to call quasi-degree. Some results get more frameworks and perspective about these definitions. The way in that, two vertices have connection together, open the way to define neighborhood and co-neighborhood. The maximum values in neighborhood and co-neighborhood introduces quasi-degree and quasi-co-degree, respectively. New name is chosen from degree. Since amid all vertices with different degrees, one vertex is chosen. In other words, one vertex is fixed and its degree turns out quasi-degree where two degrees could be assigned to a vertex. Degree of edges and degree of vertices. The number of edges which are incident to the vertex and the number of vertices which are neighbors to the vertex. Degree and co-degree are the notions which are transformed to use in quasi-style. Two neutrosophic values introduce two neutrosophic vertices separately in each settings. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to purse this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

The aim of this expository article is to present recent developments in the centuries-old discussion on the interrelations between several types of domination in graphs. However, the novelty even more prominent in the newly discovered simplified presentations of several older results. Domination can be seen as arising from real-world application and extracting classical results as first described by this article.The main part of this article, concerning a new domination and older one, is presented in a narrative that answers two classical questions: (i) To what extend must closing set be dominating? (ii) How strong is the assumption of domination of a closing set? In a addition, we give an overview of the results concerning domination. The problem asks how small can a subset of vertices be and contain no edges or, more generally how can small a subset of vertices be and contain other ones. Our work was as elegant as it was unexpected being a departure from the tried and true methods of this theory that had dominated the field for one fifth a century. This expository article covers all previous definitions. The inability of previous definitions in solving even one case of real-world problems due to the lack of simultaneous attentions to the worthy both of vertices and edges causing us to make the new one. The concept of domination in a variety of graphs models such as crisp, weighted and fuzzy, has been in a spotlight. We turn our attention to sets of vertices in a fuzzy graph that are so close to all vertices, in a variety of ways, and study minimum such sets and their cardinality. A natural way to introduce and motivate our subject is to view it as a real-world problem. In its most elementary form, we consider the problem of reducing waste of time in transport planning. Our goal here is to first describe the previous definitions and the results, and then to provide an overview of the flows ideas in their articles. The final outcome of this article is twofold: (i) Solving the problem of reducing waste of time in transport planning at static state; (ii) Solving and having a gentle discussions on problem of reducing waste of time in transport planning at dynamic state. Finally, we discuss the results concerning holding domination that are independent of fuzzy graphs. We close with a list of currently open problems related to this subject. Most of our exposition assumes only familiarity with basic linear algebra, polynomials, fuzzy graph theory and graph theory.

We introduce a new variation on the domination theme which we call vertex domination as reducing waste of time in transportation planning and optimization of transport routes. We determine the vertex domination number $\gamma_v$ for several classes of fuzzy graphs. The bounds is obtained for it. In fuzzy graphs, monotone decreasing property and monotone increasing property are introduced. We prove both of the vizing's conjecture and the Grarier-Khelladi's conjecture are monotone decreasing fuzzy graph property for vertex domination. We obtain Nordhaus-Gaddum (NG) type results for these parameters. The relationship between several classes of operations on fuzzy graphs with the vertex domination number of them is studied. Finally, we discuss about vertex dominating set of a fuzzy tree by using the bridges and $\alpha$-strong edges equivalence.

Many various using of this new-born fuzzy model for solving real-world problems and urgent requirements involve introducing new concept for analyzing the situations which leads to solve them by proper, quick and ecient method based on statistical data. This gap between the model and its solution cause that we introduce nikfar domination in neutrosophic graphs as creative and eective tool for studying a few selective vertices of this model instead of all ones by using special edges. Being special selection of these edges aect to achieve quick and proper solution to these problems. Domination hasn't ever been introduced. So we don't have any comparison with another denitions. The most used graphs which have properties of being complete, empty, bipartite, tree and like stu and they also achieve the names for themselves, are studied as fuzzy models for getting nikfar dominating set or at least becoming so close to it. We also get the relations between this special edge which plays main role in doing dominating with other special types of edges of graph like bridges. Finally, the relation between this number with other special numbers and characteristic of graph like order are discussed.

A popular approach to learning about admixture from population genetic data is by computing the allele-sharing summary statistics known as f-statistics. Compared to some methods in population genetics, f-statistics are relatively simple, but interpreting them can still be complicated at times. In addition, f-statistics can be used to build admixture graphs (multi-population trees allowing for admixture events), which provide more explicit and thorough modeling capabilities but are correspondingly more complex to work with. Here, I discuss some of these issues to provide users of these tools with a basic guide for protocols and procedures. My focus is on the kinds of conclusions that can or cannot be drawn from the results of f₄-statistics and admixture graphs, illustrated with real-world examples involving human populations.

In this paper, we investigated the formation isolation regulation issue regarding multiple autonomous underwater vehicles (AUVs) characterized by a "leader-follower" framework. Considering the cooperative-competitive relationship among the follower AUVs and the impact of unknown external disturbances, an extended state observer was designed based on backstepping to mitigate these disturbances, and an event-triggered control scheme was designed to realize the two-part consensus control within the multi-AUV system. Through rigorous theoretical analysis, it is shown that the system achieves asymptotic steadiness and is free from zeno behavior under the proposed event-triggered control scheme. Finally, numerical simulations confirm the efficiency of the regulation strategy in achieving formation separation within the multi-AUV, where the trajectory tracking errors of individual AUVs gather in a compact vicinity close to the source and the structure converges was achieved, with the absence of zeno behavior also demonstrated.

Semi-continuous data are very common in the social science and economics. In this paper, a Bayesian variable selection procedure is developed to assess the influence of exogenous factors including observed and unobserved on the semi-continuous data. Our formulation is based on the two-part latent variable model with polytomous response. We consider two schemes for the penalties of regression coefficients and factor loadings: the Bayesian spike and slab bimodal prior and the Bayesian lasso prior. Within the Bayesian framework, we implement Markov Chains Monte Carlo sampling method to conduct posterior inference. To facilitate posterior sampling, we recast the logistic model in part one as the norm-like mixture model. Gibbs sampler is designed to draw observations from the posterior. Our empirical results show that with suitable hyper-parameters, the spike and slab bimodal method slightly outperforms the Bayesian lasso in the current analysis. Finally, a real example related to the China household finance survey is analyzed to illustrate the application of the methodology.. .

Numerous varieties of Capsicum annuum L. with multiple valuable traits, such as adaptation to biotic and abiotic stress factors, can be found in south-east Romania, well known for vegetable cultivation and an important area of biodiversity conservation. To obtain useful information toward a sustainable agriculture, management and conservation of local pepper varieties, we analyzed the genetic diversity and we did deep molecular characterization using Whole Genome Resequencing (WGS) for variant/mutation detection. The pepper varieties used in the present study were registered by VRDS in the ISTIS catalog between 1974 and 2019 and maintained in conservative selection, however, no studies have been published yet using WGS analysis in order to characterize this specific germplasm. The genome sequences, annotation and alignments provided in this study offer essential resources for genomic research as well as for future breeding efforts using the C. annuum local varieties.

The Aspergillus genus comprises fungi that are widely distributed in nature. The Terrei section is particularly important due to its functions in recycling organic matter. Aspergillus hortae is a species from this section that has been isolated from clinical samples, but its role as a pathogenic agent is unclear. In this study, three clinical A. hortae isolates from Colombia, initially identified as A. terreus, were characterised by micro and macro-morphological analysis at 26°C and 37°C. A bioinformatic pipeline was used for molecular typing, which included analysis of whole genome sequences for accurate species identification. Susceptibility assays were also conducted using the microdilution broth method (EUCAST). It was confirmed that this species is intrinsically resistant to Amphotericin B with a minimum inhibitory concentration (MIC) of 2-4 mg/L, and is also thermotolerant. We obtained the in vitro susceptibility profiles for three azole drugs (MIC, 0.25-1 mg/L). The three isolates showed phylogenetic divergence from the reference genome strain. A mutation (M769K) in the MelA ortholog of a hypopigmented isolate, which had the lowest MIC value for AmB (2 mg/L), was identified. This study presents the morphological characterization, molecular typing through whole-genome analysis and identification of susceptibility profiles to azoles and amphotericin B of three clinical isolates of A. hortae from Colombia.

The process involved in preparing driving simulator tests is a labor intensive one, and the nature of this complexity depends on the sophistication of the tests to be carried out, as well as the number of participants. Which has an impact on the duration of the research itself. The very solution of using driving simulators is a research tool that has been in use for many years and with great success. They are used in a very wide range of areas of human functioning. They replicate in a very realistic way the conditions that can occur in the external environment, offer the possibility of repetition of particular conditions and insight into certain behaviors that could be very difficult to initiate in real life. This article also describes the dis- ease of using simulators to conduct research activities, along with the workflow from assumptions to finalizing the research. An algorithm is also presented for the study of individual participants, with examples for separate research scenarios concerning driver behavior in the vicinity of pedestrian crossings.

The study on graphs emerging from different algebraic structures like groups, rings, fields, vector spaces, etc. is a prominent area of research in mathematics, as algebra and graph theory are two mathematical fields that focuses on creating and analysing structures. There are numerous studies linking algebraic structures and graphs, which began with the introduction of Cayley graphs of groups. Several algebraic graphs have been defined on rings, which have huge-growing literature. In this article, we systematically review the literature on some variants of Cayley graphs that are defined on rings, to understand the research in this area.

In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node or link failure. He then shows that “whether there is a protection routing to the destination” is NP-complete. Tapolcai find that two completely independent spanning trees, abbreviated as CISTs, can be used to configure the protection routing. In this paper, we propose dual protection routing trees, denoted as dual-PRTs to replace CISTs, which are less restrictive than CISTs. Next, we propose a transformation algorithm that uses dual-PRTs to configure the protection routing. Taking complete graphs Kn, complete bipartite graphs Km,n, hypercubes Qn, locally twisted cubes LTQn as examples, we provide a recursive method to construct dual-PRTs on them. This article will show that there are no two CISTs on K3,3, Q3, and LTQ3, but there exist dual-PRTs that can be used to configure the protection routing. As shown in the performance evaluation of simulation results, for both Qn and LTQn, we get the average path length of protection routing configured by dual-PRTs is shorter than that by two CISTs.

Graph entropies have been used to interpret the complexity of the networks. There are various graph entropies in the literature. In this note a new graph entropy is defined which is based on the dominating sets of the graphs. Moreover the entropy of some classes of the graphs is obtained

The purpose of this study was to establish the association between total and segmental body composition (BC) variables and anaerobic performance and to create optimal models that best predict such performance in CrossFit® (CF) athletes. Fifty athletes, 25 males and 25 females (age: 33.26 ± 6.81 years; body mass: 72.57 ± 12.17 kg; height: 169.55 ± 8.71 cm; BMI: 25.06 ± 2.31 kg·m−2) were recruited to participate and underwent BC analysis using dual-energy X-ray absorptiometry (DXA) and an all-out laboratory test on a cycle ergometer (Wingate) to determine their anaerobic performance. The results show a significant correlation between BC values and performance, ranging from moderate (r = -0.34, p = 0.015) to near-perfect (r = 0.96, p < 0.01). Furthermore, the created performance prediction models exhibited predictive capacities ranging from 19% (p = 0.017) to 93% (p < 0.001). All prediction models were created using total or segmental lean mass variables, excluding others. BC and performance variables found significant differences between males and females. The findings demonstrate that BC variables are crucial indicators of anaerobic performance in CF athletes. Professionals responsible for athlete performance should use this information to monitor athletes and design training programs.

The canonical decomposition of a bipartite graph is a new decompositionmethod that involves three operators, parallel, series and K+S. The class of weak bisblit graphs is totally decomposable with respect of these operators, and the class of bicographs is totally decomposable with respect of parallel and series operators. We prove in this paper that the class of bipartite (P_6,C_6)-free graphs is exactly the class of bipartite graphs that are totally decomposable with respect of parallel and K+S operators. We simplify the recognition algorithm of weak-bisplit graphs to adepte with bipartite (P_6,C_6)-free graphs. As a result of this adapted algorithm, we prsent efficient solutions in this class of graphs for two optimization graph problems, the first is the maximm balanced bi-clique problem and the the second is the maximum independent set problem.

Let G[F,Vk, Huv] be the graph with k pockets, where F is a simple graph of order n ≥ 1,Vk= {v1,v2,··· ,vk} is a subset of the vertex set of F and Hvis a simple graph of order m ≥ 2,v is a specified vertex of Hv. Also let G[F,Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek= {e1,e2,···ek} is a subset of the edge set of F and Huvis a simple graph of order m ≥ 3, uv is a specified edge of Huvsuch that Huv− u is isomorphic to Huv− v. In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of G[F,Vk, Hv] and G[F,Ek, Huv] in terms of the resistance distance and Kirchhoff index F, Hv and F, Huv, respectively.

Heavy metals are dangerous contaminants constituting a threat to human health because they persist in soils and are easily transferred into the food chain, causing damages to human health. Among heavy metals, nickel appears to be one of the most dangerous responsible for different disorders. Public health protection requires nickel detection in environment and food chains; a simple, rapid and sensitive method to detect nickel contamination is represented by biosensors. In this paper we report the setup of a whole-cell based system, in which protoplasts, obtained from Nicotiana tabacum leaves, were used as transducers to detect the presence of heavy metal ions and, in particular, nickel ions. Protoplasts were genetically modified with a plasmid containing the GFP reporter gene under the promoter region of a sunflower small HSP gene control. By this device the presence of heavy metal ions was detected. Thus, the possibility to use this whole-cell system as a novel tool to detect the presence of nickel ions in food matrices was assessed.

The key question for the understanding of corrosion phenomena of Si3N4-SiC material in Al reduction cell – whether corrosion by gases (and oxidation in particular) opens way for the corrosion by molten cryolite, or corrosion of Si3N4-SiC by cryolite plays its own role in degradation of the material in service. More probably the reactions of silicon carbide and silicon nitride with molten cryolite go after the stage of pre oxidation to silicon dioxide. The corrosion of Si3N4-SiC material in the reduction cell may take place by “gas-solid” reaction and by “liquid-solid” reaction. There are several variants of lab corrosion test for the evaluation of corrosion resistance of Si3N4-SiC material to cryolite. The results of investigation of Si3N4-SiC lab corrosion test give no direct evidence of selective dissolution of specific phase (Si3N4 or SiC, α-Si3N4 or β-Si3N4) in cryolite. The existing variants of lab corrosion testing require clarification.

There is no formal difference between particles and black holes. This formal similarity lies in the intersection of gravity and quantum theory; quantum gravity. Motivated by this similarity, `wave-black hole duality' is proposed, which requires having a proper energy-momentum tensor of spacetime itself. Such a tensor is then found as a consequence of `principle of minimum gravitational potential'; a principle that corrects the Schwarzschild metric and predicts extra periods in orbits of the planets. In search of the equation that governs changes of observables of spacetime, a novel Hamiltonian dynamics of a Pseudo-Riemannian manifold based on a vector Hamiltonian is adumbrated. The new Hamiltonian dynamics is then seen to be characterized by a new `tensor bracket' which enables one to finally find the analogue of Heisenberg equation for a `tensor observable' of spacetime.

Purpose: Investigation for the co-occurrence of two unrelated genetic disorders of muscular dystrophy and Prader-Willi syndrome (PWS) (OMIM # 176270) using joint whole genome sequencing (WGS). Methods: Trio WGS joint analysis was performed to investigate the genetic etiology in a proband with PWS, prolonged muscular hypotonia associated hyperCKemia, and early-onset obesity. The parents were unaffected. Results: Results showed maternal isodisomy uniparental disomy (UPD) in chromosome 15 expanding from 15q11.2 to 15q22.2, including PWS regions at 15q11.2-15q13. Maternal heterodisomy was detected from 15q22.2 to 15q26.3. A pathogenic variant, NM_000070.3(CAPN3):c.550del (p.Thr184fs), was identified at 15q15.1 in a heterozygous state in the mother that was homozygous in the proband due to maternal isodisomy. Conclusion: This is the first study of the concurrent molecular etiology of PWS and calpainopathy (OMIM # 253600) in the same patient. This report highlights the utility of joint analysis and need for the assessment of autosomal recessive disease in regions of isodisomy in patients with complex and unexplained phenotype.

Knowledge graphs (KGs) play a crucial role in many applications, such as question answering, but incompleteness is an urgent issue for their broad application. Much research in knowledge graph completion (KGC) has been performed to resolve this issue. The methods of KGC can be classified into two major categories: rule-based reasoning and embedding-based reasoning. The former has high accuracy and good interpretability, but a major challenge is to obtain effective rules on large-scale KGs. The latter has good efficiency and scalability, but it relies heavily on data richness and cannot fully use domain knowledge in the form of logical rules. We propose a novel method that injects rules and learns representations iteratively to take full advantage of rules and embeddings. Specifically, we model the conclusions of rule groundings as 0-1 variables and use a rule confidence regularizer to remove the uncertainty of the conclusions. The proposed approach has the following advantages: 1) It combines the benefits of both rules and knowledge graph embeddings (KGEs) and achieves a good balance between efficiency and scalability. 2) It uses an iterative method to continuously improve KGEs and remove incorrect rule conclusions. Evaluations on two public datasets show that our method outperforms the current state-of-the-art methods, improving performance by 2.7% and 4.3% in mean reciprocal rank (MRR).

When an aircraft malfunctions, quickly and accurately identifying the faulty unit is essential for ensuring normal operation. Unfortunately, maintenance engineers often struggle to acquire the necessary fault-related knowledge due to poor management and utilization of aircraft fault documents. To address this issue, we introduce knowledge graph technology into the field of aircraft fault diagnosis, exploring its construction and application for effective knowledge management. Our work starts by analyzing the critical knowledge elements required for aircraft fault diagnosis and designing a schema layer for fault knowledge graphs. We then we then combine deep learning and heuristic rules to extract fault knowledge from both structured and unstructured data, enabling the construction of aircraft fault knowledge graphs. Finally, we develop a fault question-answering system based on fault knowledge graphs that can accurately give solutions to questions posed by maintenance engineers. Our practice demonstrates that knowledge graphs provide an effective means of managing aircraft fault knowledge, assisting engineers in locating fault reasons accurately and quickly.

The generalization of Farey graphs and extended Farey graphs are all originated from Farey graph and scale-free and small-world simultaneously. We propose a labeling of the vertices for it that allows determining all the shortest paths routing between any two vertices only based on their labels. The maximum number of shortest paths between any two vertices is huge as the product of two Fibonacci numbers, however, the label-based routing algorithm runs in linear time O(n). The existence of an efficient routing protocol for Farey-type models should help the understanding of several physical dynamic processes on it.

Combinatoric measures of entropy capture the complexity of a graph, but rely upon the calculation of its independent sets, or collections of non-adjacent vertices. This decomposition of the vertex set is a known NP-Complete problem and for most real world graphs is an inaccessible calculation. Recent work by Dehmer et al. and Tee et al. identified a number of alternative vertex level measures of entropy that do not suffer from this pathological computational complexity. It can be demonstrated that they are still effective at quantifying graph complexity. It is intriguing to consider whether there is a fundamental link between local and global entropy measures. In this paper, we investigate the existence of correlation between vertex level and global measures of entropy, for a narrow subset of random graphs. We use the greedy algorithm approximation for calculating the chromatic information and therefore Körner entropy. We are able to demonstrate close correlation for this subset of graphs and outline how this may arise theoretically.

Topological indices have been used to modeling biological and chemical properties of molecules in quantitive structure property relationship studies and quantitive structure activity studies. All the degree based topological indices have been defined via classical degree concept. In this paper we define a novel degree concept for a vertex of a simple connected graph: S degree. And also we define S indices of a simple connected graph by using the S degree concept. We compute the S indices for well-known simple connected graphs such as paths, stars, complete graphs and cycles.

Euler's theorem about the relationship between the numbers of individual elements of planar graphs (vertices, edges, faces) is also satisfied when the graph has zero vertices. The problem of the existence or not of such graphs has so far been the subject of very few studies. Plus, research that didn't prove anything. The paper presents an interpretation of this kind of graphs as mathematical formations lying on piecewise smooth surfaces. The lines of intersection of two or more smooth surfaces (faces of a graph) form edges without a vertex of the graph. The elementary properties of such graphs are discussed, the method of counting non-isomorphic 0-vertex graphs and their importance in physics and chemistry are given.

The Collatz conjecture is a well-known number theory puzzle that states that every positive integer would eventually converge to the trivial cycle of 1, 2, 1, 2,... when repeatedly exposed to a particular transformation. In this transformation, even numbers are divided in half, odd numbers are tripled, and one is added. In this study, we present a new method for creating a directed graph and using it to display and analyze Collatz sequences. Our technique creates what we call a Collatz directed graph by joining an endless number of simple directed graphs, each of which corresponds to a natural number. We show by careful mathematical analysis that all positive integers are included in this Collatz directed graph. Moreover, we give an evidence that verifies the Collatz conjecture by showing that the sole cycle in this graph is the trivial cycle of 1, 2, 1, 2,... We also prove that there is no sequence that diverges to infinity in this graph. Our results provide insights into the fundamental structure of Collatz sequences and further our knowledge of the Collatz conjecture .

In large-scale parallel computing and communication systems, an interconnect network structure is usually modeled as a graph, in which vertices and edges correspond to processors and communication links, respectively. In a graph, the vertices and edges are likely to fail, so we must think about the fault tolerance of a graph. Connectivity is an important parameter in the study of faulty tolerance for a graph. In this paper, we study a special class of connectivity: $m$-component connectivity, this is a natural generalization of the classical connectivity of graphs defined in terms of the minimum vertex-cut. Let $F$ is a vertex set of $G$ $(i.e, F\subseteq V(G))$, if the following conditions are satisfied, we say $F$ is a $m$-component cut: $(1)$ $G-F$ is disconnected; $(2)$ the number of components in $G-F$ is greater than or equal to $m$. In another word, the $m$-component connectivity $c\kappa_{m}(G)$ is defined as $min\{|F|~|~F\subseteq V(G)$ and $F$ is a $m$-component cut$\}$. Determining $m$-component connectivity is still unsolved in most interconnection networks even for small $m'$s. Leaf-sort graph is a special Cayley graph, it has many special properties that are different from other Cayley graphs. So we need to pay attention to some of it's special properties when we study it. In this paper, we can get the values: $c\kappa_{3}(CF_{n})=3n-6$ $(n$ is odd$)$ and $c\kappa_{3}(CF_{n})=3n-7$ $(n$ is even$)$ for $n\geq3$; $c\kappa_{4}(CF_{n})=\frac{9n-21}{2}$ $(n$ is odd$)$ and $c\kappa_{4}(CF_{n})=\frac{9n-24}{2}$ $(n$ is even$)$ for $n\geq4$; $c\kappa_{5}(CF_{n})=6n-16$ $(n$ is odd$)$ and $c\kappa_{5}(CF_{n})=6n-18$ $(n$ is even$)$ for $n\geq5$.

During the creation and integration of a health care system based on medical knowledge graphs, it is necessary to review and select the vocabularies and definitions that best fit the information requirements of the system being developed. This implies the reuse of medical knowledge graphs; however, full importation of knowledge graphs is not a tractable solution in terms of memory requirements. In this paper we present a modularization-based method for knowledge graph reuse. A case study of graph reuse is presented by transforming the original model into a lighter one.

New setting is introduced to study co-neighborhood, neutrosophic t-neighborhood, neutrosophic quasi-vertex set, neutrosophic quasi-order, neutrosophic neighborhood, neutrosophic co-t-neighborhood, neutrosophic quasi-edge set, neutrosophic quasi-size, Neutrosophic number, neutrosophic co-neighborhood, co-neutrosophic number, quasi-number and quasi-co-number. Some classes of neutrosophic graphs are investigated.

New setting is introduced to study failed zero-forcing number and failed zero-forcing neutrosophic-number. Leaf-like is a key term to have these notions. Forcing a vertex to change its color is a type of approach to force that vertex to be zero-like. Forcing a vertex which is only neighbor for zero-like vertex to be zero-like vertex but now reverse approach is on demand which is finding biggest set which doesn’t force. LetNTG : (V,E,σ,μ) be a neutrosophic graph. Then failed zero-forcing number Z(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximal cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black after finitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing neutrosophic-number Zn(NTG) for a neutrosophic graphNTG : (V,E,σ,μ) is maximal neutrosophic cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black afterfinitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing number and failed zero-forcing neutrosophic-number are about a set of vertices which are applied into the setting of neutrosophic graphs. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, bipartite-neutrosophic graphs, and t-partite-neutrosophic graphs are investigated in the terms of maximal set which forms both of failed zero-forcing number and failed zero-forcing neutrosophic-number. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form failed zero-forcing number and failed zero-forcing neutrosophic-number. In path-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set but with slightly differences, in cycle-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of vertices excluding two vertices leads us to failed zero-forcing number and failed zero-forcing neutrosophic-number. In star-neutrosophic graphs, a set of vertices excluding only two vertices and containing center, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set not to extend this set to set of all vertices has key role to have these notions in the form of failed zero-forcing number and failed zero-forcing neutrosophic-number. The cardinality of a set has eligibility to form failed zero-forcing number but the neutrosophic cardinality of a set has eligibility to call failed zero-forcing neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices don’t have unique connection together, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study the global powerful alliance. Global powerful alliance is about a set of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has the key role to define this notion. Also, neighborhood is defined based on strong edges. Strong edge gets a framework as neighborhood and after that, too close vertices have key role to define global powerful alliance based on strong edges. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs excluding empty, path, star, and wheel and containing complete, cycle and r-regular-strong are investigated in the terms of set, minimal set, number, and neutrosophic number. Neutrosophic number is used in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number. It’s called “modified neutrosophic number”. Summation of three values of vertex makes one number and applying it to a set makes neutrosophic number of set. This approach facilitates identifying minimal set and optimal set which forms minimal-global-powerful-alliance number and minimal-global-powerful-alliance-neutrosophic number. Two different types of sets namely global-powerful alliance and minimal-global-powerful alliance are defined. Global-powerful alliance identifies the sets in general vision but minimal-global-powerful alliance takes focus on the sets which deleting a vertex is impossible. Minimal-global-powerful-alliance number is about minimum cardinality amid the cardinalities of all minimal-global-powerful alliances in a given neutrosophic graph. New notions are applied in the settings both individual and family. Family of neutrosophic graphs has an open avenue, in the way that, the family only contains same classes of neutrosophic graphs. The results are about minimal-global-powerful alliance, minimal-global-powerful-alliance number and its corresponded sets, minimal-global-powerful-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-global-powerful alliances, minimal-t-powerful alliance, minimal-t-powerful-alliance number and its corresponded sets, minimal-t-powerful-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-t-powerful alliances. The connections amid t-powerful-alliances are obtained. The number of connected components has some relations with this new concept and it gets some results. Some classes of neutrosophic graphs behave differently when the parity of vertices are different and in this case, cycle, and complete illustrate these behaviors. Two applications concerning complete model as individual and family, under the titles of time table and scheduling conclude the results and they give more clarifications and closing remarks. In this study, there’s an open way to extend these results into the family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t study deeply and with more results but it seems that analogous results are determined. Slight progress is obtained in the family of these models but there are open avenues to study family of other models as same models and different models. There’s a question. How can be related to each other, two sets partitioning the vertex set of a graph? The ideas of neighborhood and neighbors based on strong edges illustrate open way to get results. A set is global powerful alliance when two sets partitioning vertex set have uniform structure. All members of set have more amount of neighbors in the set than out of set and reversely for non-members of set with less members in the way that the set is simultaneously t-offensive and(t-2)-defensive. A set is global if t=0. It leads us to the notion of global powerful alliance. Different edges make different neighborhoods but it’s used one style edge titled strong edge. These notions are applied into neutrosophic graphs as individuals and family of them. Independent set as an alliance is a special set which has no neighbor inside and it implies some drawbacks for these notions. Finding special sets which are well-known, is an open way to purse this study. Special set which its members have only one neighbor inside, characterize the connected components where the cardinality of its complement is the number of connected components. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study the global offensive alliance. Global offensive alliance is about a set of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has the key role to define this notion. Also, neighborhood is defined based on strong edges. Strong edge gets a framework as neighborhood and after that, too close vertices have key role to define global offensive alliance based on strong edges. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs containing complete, empty, path, cycle, star, and wheel are investigated in the terms of set, minimal set, number, and neutrosophic number. Neutrosophic number is defined in new way. It’s first time to define this type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number. It’s called “modified neutrosophic number”. Summation of three values of vertex makes one number and applying it to a set makes neutrosophic number of set. This approach facilitates identifying minimal set and optimal set which forms minimal-global-offensive-alliance number and minimal-global-offensive-alliance-neutrosophic number. Two different types of sets namely global-offensive alliance and minimal-global-offensive alliance are defined. Global-offensive alliance identifies the sets in general vision but minimal-global-offensive alliance takes focus on the sets which deleting a vertex is impossible. Minimal-global-offensive-alliance number is about minimum cardinality amid the cardinalities of all minimal-global-offensive alliances in a given neutrosophic graph. New notions are applied in the settings both individual and family. Family of neutrosophic graphs is studied in the way that, the family only contains same classes of neutrosophic graphs. Three types of family of neutrosophic graphs including m-family of neutrosophic stars with common neutrosophic vertex set, m-family of odd complete graphs with common neutrosophic vertex set, and m-family of odd complete graphs with common neutrosophic vertex set are studied. The results are about minimal-global-offensive alliance, minimal-global-offensive-alliance number and its corresponded sets, minimal-global-offensive-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-global-offensive alliances. The connection of global-offensive-alliances with dominating set and chromatic number are obtained. The number of connected components has some relations with this new concept and it gets some results. Some classes of neutrosophic graphs behave differently when the parity of vertices are different and in this case, path, cycle, and complete illustrate these behaviors. Two applications concerning complete model as individual and family, under the titles of time table and scheduling conclude the results and they give more clarifications. In this study, there’s an open way to extend these results into the family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t study deeply and with more results but it seems that analogous results are determined. Slight progress is obtained in the family of these models but there are open avenues to study family of other models as same models and different models. There’s a question. How can be related to each other, two sets partitioning the vertex set of a graph? The ideas of neighborhood and neighbors based on strong edges illustrate open way to get results. A set is global offensive alliance when two sets partitioning vertex set have uniform structure. All members of set have more amount of neighbors in the set than out of set. It leads us to the notion of global offensive alliance. Different edges make different neighborhoods but it’s used one style edge titled strong edge. These notions are applied into neutrosophic graphs as individuals and family of them. Independent set as an alliance is a special set which has no neighbor inside and it implies some drawbacks for these notions. Finding special sets which are well-known, is an open way to purse this study. Special set which its members have only one neighbor inside, characterize the connected components where the cardinality of its complement is the number of connected components. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

For the first time, We do fuzzification the concept of domination in crisp graph on a generalization of fuzzy graph by using membership values of vertices, α-strong edges and edges. In this paper, we introduce the first variation on the domination theme which we call vertex domination. We determine the vertex domination number γ_v for several classes of t-norm fuzzy graphs which include complete t-norm fuzzy graph, complete bipartite t-norm fuzzy graph, star t-norm fuzzy graph and empty t-norm fuzzy graph. The relationship between effective edges and α-strong edges is obtained. Finally, we discuss about vertex dominating set of a fuzzy tree with respect to a t-norm ⨂ by using the bridges and α-strong edges equivalence.

Lecanicillium lecanii KMZW-1, is recognized for its potential as a bio-control agent against agricultural and forestry pests, particularly due to its compatibility with integrated pest management (IPM) strategies. This study aimed to investigate the complete genome of L. lecanii KMZW-1 and assess its pathogenicity against Bactrocera dorsalis. Whole genome sequencing revealed a genome size of 47,239,278 bp, comprising 27 contigs, with a GC content of 51.16%. The genome completeness was assessed as 97.93% using BUSCO analysis, AntiSMASH analysis identified 29 gene clusters associated with secondary metabolite biosynthesis providing insights into the genetic basis of its pathogenic mechanisms and biocontrol potential. The pathogenicity of L. lecanii KMZW-1 was assessed using concentrations ranging from 1×10^4 to 1×10^11 spores/mL. Higher-concentrations (1×10^10 to 1×10^11 spores/mL), resulted in significantly increased cumulative mortality rates of B. dorsalis adults compared to the control group. Notably, the pathogenicity was higher in male adults than in females. Probit regression analysis yielded LogLC50 values as 5.662 for female and 4.486 for male B. dorsalis adults. In summary, L. lecanii KMZW-1 exhibits strong insecticidal activity against B. dorsalis and shows potential as a biocontrol agent with IPM strategies. These findings provide robust genomic evidence supporting the use of L. lecanii KMZW-1in managing against B. dorsalis populations.

(1) Background: A wide literature based on loading and unloading bending tests has been carried out over the half past century for assessing the force released by superelastic wires. The aim of this investigation is not only to characterize a broadly described superelastic NiTi and a novel CuNiTi archwire, but also to provide novel insights into the load vs deflection profiles. A harmonic scenario for superelastic wires will be shown as temperature is kept constant at 37°C. However, a completely different picture will be highlighted as a temporary heating step up to 50°C is introduced within the force vs deflection profiles. (2) Methods: A variety of NiTi and a novel CuNiTi round and rectangular cross-section archwires have been investigated. Static 3-point bending tests up to a deflection level of 3.0 mm have been carried out for detecting the unloading force plateau levels occurring at 37°C. A hold deflection step of 5 min at deflection levels occurring along the unloading plateau extension is introduced. The effect of a temporary heating up to 50°C on the force plateau level released by the investigated wires is analyzed. (3) Results: Mechanical profiles suggest that the plateau force levels detected at 37°C are consistent with those broadly reported in the literature, but they only represent a single block puzzle of the force scenario that a superelastic wire releases during the orthodontic treatment. (4) Conclusions: Once a superelastic wire is bent and clinically applied, the effect of a temporary heating up to 50°C (e.g. hot food or drink ingestion) produces a significant plateau force increase whose magnitude depends on the deflection level. The highest force increase of about 50% and 40% have been detected at deflection levels located at the beginning of the unloading plateau extension for NiTi and CuNiTi wires, respectively.

Whole genome alignment (WGA) is a critical process in comparative genomics, facilitating the detection of genetic variants and aiding our understanding of evolution. This paper offers a detailed overview and categorization of WGA techniques, encompassing suffix tree-based, anchors-based, and graph-based methods. It elaborates on the algorithmic properties of these tools, focusing on performance and methodological aspects. The paper underscores the latest progress in WGA, emphasizing the increasing capacity to manage the growing intricacy and volume of genomic data. However, the field still grapples with computational and biological hurdles affecting the precision and speed of WGA. We explored these challenges and potential future solutions. This paper aims to provide a comprehensive resource for researchers, deepening our understanding of WGA tools and their applications, constraints, and prospects.

Paper-based sensors, microfluidic platforms and electronic devices have attracted attention in the past couple of decades because they are flexible, can be recycled easily, environmentally friendly, and inexpensive. Here we report a paper aptamer-based potentiometric sensor to detect the whole Zika virus for the first time with a minimum sensitivity of 2.6 nV/Zika and the minimum detectable signal (MDS) of 1.2x10⁶ Zika. Our paper sensor works very similar to a P-N junction where a junction is formed between two different wet regions with different electrochemical potentials near each other on the paper. These two regions with slightly different ionic contents, ionic species and concentrations, produce a potential difference given by the Nernst equation. Our paper sensor consisted of a 2-3 mm x 10 mm segments of a paper with a conducting silver paint contact patches on its two ends. The paper is soaked in a buffer solution containing aptamers designed to bind to the capsid proteins on Zika. Atomic force microscopy studies were carried out to show both the aptamer and Zika become immobilized in the paper. We then added the Zika (in its own buffer) to the region close to one of the silver-paint contacts. The Zika virus (40 nm diameter with 43 kDa or 7.1x10^-20 gm weight), became immobilized in the paper’s pores and bonded with the resident aptamers creating a concentration gradient. The potential measured between the two silver paint contacts reproducibly became more negative as upon adding the Zika. We also showed that an LCD powered by the sensor, can be used to detect the sensor output.

(1) Background: Among the chronic complications of type 2 diabetes mellitus, cancer became the leading cause of death in several countries. Our objective was the determination of whether prevalent type 2 diabetes mellitus is associated with a higher incidence of cancer. (2) Methods: This study is a nationwide analysis performed in Hungary. Study population was divided into a group with type 2 diabetes mellitus and into a non-diabetic group. The primary outcome was the risk related to overall cancer incidence. A key secondary outcome was the overall incidence of cancer in distinct study years. Further outcomes were the annual percent changes. (3) Results: The odds ratio related to the overall incidence of cancer was 2.50 (95% confidence interval: 2.46-2.55, P<0.0001) in patients with diabetes as related to controls. The odds ratio was higher in males than in females. The highest risk was found in the 18-39-year-old subgroup. The annual cancer incidence rate declined in controls, but not in patients with diabetes. Several types of cancer showed a decreasing tendency in non-diabetic controls.; (4) Conclusions: type 2 diabetes is associated with a higher risk of cancer. High risk in young patients with type 2 diabetes suggests that these young individuals should be considered as a risk group.

(1) Background: Patients with type 2 diabetes mellitus (T2DM) are at higher risk of cancer but how these two diseases associate is still debated. The goal was the assessment of the overall incidence of cancer among patients with newly diagnosed T2DM in Hungary. Summarizing, incident T2DM is associated with a significantly higher overall risk of incident cancer, with a reverse correlation of age. Newly registered T2DM patients were suggested to be screened for cancer within 6 months. (2) Methods: A nationwide, retrospective, longitudinal study was performed using a Hungarian database. The incident T2DM and diabetes free Hungarian population were included in the study. The primary endpoints were the overall and site-specific incidence and annual percentage change of the incidence of cancer in both populations. (3) Results: The overall incidence of cancer in patients amounted to 29.4/1000 and 6.6/1000 with or without T2DM, respectively, and the OR (95%CI) of cancer of the T2DM group was 4.32 (4.14-4.53), p<0.0001. The risk of having cancer was age-dependent, having the highest odd in the age group 18-39. The incidence of cancer was declining in the non-diabetic but was unchanged in T2DM population. The average lag time of diagnosing a cancer after the detection of T2DM was 3.86 months.; (4) Conclusions: Iincident T2DM is associated with a significantly higher overall risk of incident cancer, with a reverse correlation of age. Newly registered T2DM patients were suggested to be screened for cancer within 6 months.

Salmonella species are important foodborne pathogens worldwide. Salmonella pathogenicity is associated with multiple virulence factors and enhanced antimicrobial resistance. To determine the molecular characteristics and genetic correlations of Salmonella, 24 strains of Salmonella isolated from different sources (raw poultry, human stool, and food) in the Wenzhou area were investigated to determine the distribution of antimicrobial resistance and virulence determinants using whole-genome sequencing (WGS). Aminoglycoside-resistance genes were detected in all samples. Over half of the samples found antimicrobial resistance genes (ARGs) and point mutations for several clinically frequently used antibiotic, β-lactamases, tetracyclines, and fluoroquinolones. Of these strains, 62.5% were predicted to be multidrug-resistant (MDR). The quinolone-modifying enzyme gene aac(6')-Ib-cr, detected in five samples (S1–S4 and S10), were located on integrons. Analysis of Salmonella pathogenicity island (SPI) profiles suggests that serotypes with close genetic relationships share the same distribution of virulence factors, revealing a link between genotype and SPI profiles. CgMLST analysis indicated that five isolates S14–S18 were closely related to strains originating from the UK, suggesting that they may have been introduced from the UK. Data from this study may enrich the molecular traceability database for Salmonella and provide a basis for effective public health policies.

The Harmonic Graphs Conjecture states that there exists an asymptotic relation involving the Harmonic Index and the natural logarithm as the order of the graph increases. This conjecture, grounded in the novel context of Prime Graphs, draws upon the Prime Number Theorem and the sum of divisors function to unveil a compelling asymptotic connection. By carefully expanding the definitions of the harmonic index and the sum of divisors function, and leveraging the prime number theorem's approximations, we establish a formula that captures this intricate relationship. This work is an effort to contribute to the advancement of graph theory, introducing a fresh lens through which graph connectivity can be explored. The synthesis of prime numbers and graph properties not only deepens our understanding of structural complexity but also paves the way for innovative research directions.

In this paper, we give some upper and lower bounds for the multiplicative Randic index, reduced reciprocal Randic index, Narumi-Katayama index and symmetric division index a graph using solely the vertex degrees. Then we obtain upper and lower bounds for these indices for the complete graphs, path graphs and Fibonacci-sum graphs. Finally, we compared the bounds of these indices for a general graph and some special graphs.

Chellali et al. introduced two degree concepts, ve-degree and ev-degree (Chellali et al, 2017). The ve-degree of a vertex equals to number of different edges which are incident to a vertex from the closed neighborhod of v. Moreover the ev-degree of an edge e=ab equals to the number of vertices of the union of the closed neighborhoods of a and b. The most private feature of these degree concepts is, total number of ve-degrees and total number of ev-degrees equal to first Zagreb index of the graphs for triangle-free graphs. In this paper we introduce ve-degree entropy, ev-degree entropy and investigate the relations between these entropies and the first Zagreb index entropy. Finally we obtain the maximal trees with respect to ve-degree irregularity index.

Whole cell biosensors could serve as eco-friendly and cost-effective alternatives for detecting potentially toxic bioavailable heavy metals in aquatic environments. However, they often fail to meet practical requirements due to an insufficient limit of detection (LOD) and high background noise. In this study, we designed a synthetic genetic circuit specifically tailored for detecting ionic mercury, which we applied to environmental samples collected from artisanal gold mining sites in Peru. We developed two distinct versions of the biosensor, each utilizing a different reporter protein: a fluorescent biosensor (Mer-RFP) and a colorimetric biosensor (Mer-Blue). Mer-RFP enabled real-time monitoring of the culture’s response to mercury samples using a plate reader, whereas Mer-Blue was analysed for colour accumulation at the endpoint using a specially designed, low-cost camera set up for harvested cell pellets. Both biosensors exhibited negligible baseline expression of their respective reporter proteins and responded specifically to HgBr2 in pure water. Mer-RFP demonstrated a linear detection range from 1 nM to 1 μM, whereas Mer-Blue showed a linear range from 2 nM to 125 nM. Our biosensors successfully detected a high concentration of ionic mercury in the reaction bucket where artisanal miners produce a mercury-gold amalgam. However, they did not detect ionic mercury in the water from active mining ponds, indicating a concentration lower than 3.2 nM Hg2+ -a result consistent with chemical analysis quantitation. Furthermore, we discuss the potential of Mer-Blue as a practical and affordable monitoring tool, highlighting its stability, reliance on simple visual colorimetry, and the possibility of sensitivity expansion to organic mercury.

In different fields in our life, like physics, coding theory and computer science, graph labeling dramas an vital role and appears in many applications. A labeling of a graph is a map which assign each element in with a positive integer number. An edge irregular total -labeling is a function such that where and are weights for any two distinct edges. In this case, has total edge irregularity strength (TEIS) if is minimum. In our paper, we defined a new type of graphs called a triple star snake graph and star snake graph . Also, we investigated TEIS for a triple star snake graph . After that, we generalized the results for star snake graph .

Tracking information diffusion is a non-trivial task and it has been widely studied across different domains and platforms. The advent of social media has led to even more challenges, given the higher speed of information propagation and the growing impact of social bots and anomalous accounts. Nevertheless, it is crucial to derive a trustworthy information diffusion graph, which is capable of highlighting the importance of specific nodes in spreading the original message. The paper introduces the interaction strength, a novel metric to model retweet cascade graphs by exploring users’ interactions. Initial findings show the soundness of the approaches based on this new metric with respect to the state-of-the-art model, and its ability to generate a denser graph, revealing crucial nodes that participated in the retweet propagation. Reliable retweet graph generation will enable a better understanding of the diffusion path of a specific tweet.

Fusarium solani KMZW-1, is recognized for its potential as a biocontrol agent against agricultural and forestry pests, particularly due to its compatibility with integrated pest management (IPM) strategies. This study aimed to investigate the complete genome of F. solani KMZW-1 and assess its pathogenicity against Bactrocera dorsalis. Whole genome sequencing revealed a genome size of 47,239,278 bp, comprising 27 contigs, with a GC content of 51.16% and fungus identified as F. solani KMZW-1. The genome completeness was assessed as 97.93% using BUSCO analysis, DFVF sequence identifier was Fusarium 0G092560.1, AntiSMASH analysis identified 29 gene clusters associated with secondary metabolite biosynthesis providing insights into the genetic basis of its pathogenic mechanisms and biocontrol potential. Comparative genomic analysis found 269 unique genes of F. solani KMZW-1 and the collinearity analysis exhibited a high degree of synteny with Fusarium solani-melongenae. The pathogenicity of F. solani KMZW-1 was assessed using concentrations ranging from 1×10^4 to 1×10^11 conidia/mL. Higher concentrations (1×10^10 to 1×10^11 conidia/mL), resulted in significantly increased cumulative mortality rates of B. dorsalis adults compared to the control group. Notably, the pathogenicity was higher in male adults than in females. Probit regression analysis yielded LogLC50 values as 5.662 for fe-male and 4.486 for male B. dorsalis adults. In summary, F. solani KMZW-1 exhibits strong insecti-cidal activity against B. dorsalis and shows potential as a biocontrol agent with IPM strategies. These findings provide robust genomic evidence supporting the use of F. solani KMZW-1 in managing against B. dorsalis populations.

The e-commerce sector is in a constant state of growth and evolution, particularly within its subdomain of online food delivery. As such, ensuring customer satisfaction is critical for companies working in this field. One way to achieve this is by providing accurate delivery time estimation. While companies can track couriers via GPS, they often lack real-time data on traffic and road conditions, complicating delivery time predictions. To address this, a range of statistical and machine learning techniques are being employed, including neural networks and specialized expert systems, with different degree of success. One issue with neural networks and machine learning models is their heavy dependence on vast, high quality data. To mitigate this issue we propose two Bayesian generalized linear models to predict time of the delivery. Utilizing a linear combination of predictor variables, we generate practical range of outputs with Hamiltonian Monte Carlo sampling method. These models offer a balance of generality and adaptability, allowing for tuning with expert knowledge. They were compared with PSIS-LOO and WAIC criteria. Results show that both models accurately estimated delivery times from the dataset, while maintaining numerical stability. Model with more predictor variables proved to be more accurate.

The Upper Hunter Valley is a major coal mining area containing approximately 40% of the currently identified total coal reserves in New South Wales (NSW), Australia. Due to the ongoing increase of mining activities, PM10 (air-borne particle with an aerodynamic diameter less than 10 micrometres) pollution has become a major air quality concern in local communities. This paper summarises the spatial and temporal variability modes of PM10 pollution in the region, based on long-term multi-site monitoring data and the application of the rotated principal component analysis (RPCA) and wavelet analysis techniques. RPCA identified two distinct air quality clusters/subregions in the valley, one in the west/northwest, the other in the southeast. Wavelet analysis revealed the annual cycle to be most persistent temporal mode of PM10 variability in both subregions, with intermittent signals observed at time scales of around 120, 30~90 and under 30 days. How these variation modes are related to the effects of local PM10 emissions and the influence of meteorology at different time scales deserves further attention in future work. The findings will be used in air quality reporting and forecasting in NSW. The methodology and results can also be useful for air quality research in similar regions elsewhere.

The medical care and welfare of domestic dogs are now respected worldwide at the same level as that of humans. We previously established a test method to determine whole mitochondrial DNA (mtDNA) using oral mucosal DNA that may be useful for the medical care and welfare of dogs. However, the sample types tested in dogs are not limited to those obtained from the oral mucosa. Therefore, in the present study, we attempted to establish a test method to determine whole mtDNA sequences using feces, which represents the least invasive specimen. Two Japanese domestic dogs were used in the present study. DNA was extracted from approximately 100 mg of fresh feces from each dog, and PCRs were performed using four primer-pairs that can amplify whole mtDNA. Following PCR, amplicons were pooled to create a DNA library using an experimental robot with an original program. Data were then acquired via NGS and data analysis was performed. The results showed that the whole mtDNA sequence of the two dogs was determined with high accuracy. Our results suggest that feces can be adapted for mitochondrial disease and individual identification testing and could serve as a useful testing method for the future medical care and welfare of domestic dogs.

Smith-Magenis syndrome is a complex neurobehavioral genetic disorder. The spectrum of SMS phenotype is broad but commonly includes craniofacial, neurobehavioral, and otolaryngologic features. While the etiology of SMS is commonly attributed to one copy interstitial deletion in the 17p11.2 region (90-95% of cases), variants identified by sequence analysis in RAI1 have also been reported in 5-10% of cases. The phenotypic spectrum of patients with RAI1 sequence alterations is not clear. In this study, we report a 9-year-old male with global cognitive and psychomotor developmental delay, musculoskeletal and cardiovascular abnormalities, and dysmorphic craniofacial features. Whole genome quad analysis of the proband, unaffected parent, and unaffected brother identified a novel de novo RAI1:c.2736delC variant. This is the first report of this variant in the literature. This report also highlights the details of the genome analysis and this patient's phenotypic spectrum.

A total $m$-labelling $\alpha$ on graph $\Gamma$ is called an edge irregular total $m$-labelling if for any two different edges of $\Gamma$, their weights respect to $\alpha$ are distinct, where the weight of any edge is defined as the sum of its label and the labels of its end vertices. We determine the minimum $m$ such that $\Gamma$ can be labelled by an edge irregular total $m$-labelling whenever $\Gamma$ is an odd staircase graph or an even staircase graph.

Lipofuscin is indigestible garbage that accumulates in the autophagic vesicles and cytosol of post-mitotic cells with age. Drs. Brunk and Terman postulated that lipofuscin accumulation is the main or at least a major driving factor in aging. They even posited that the evolution of memory is the reason why we get lipofuscin at all, as stable synaptic connections must be maintained over time, meaning that the somas of neurons must also remain in the same locale. In other words, they cannot dilute out their garbage over time through cell division. Mechanistically, their position certainly makes sense given that rendering a large percentage of a post-mitotic cell’s lysosomes useless must almost certainly negatively affect that cell and the surrounding microenvironment. Here, I explore the possibility that the accumulation of lipofuscin may to some extent exacerbate every other kind of age-related damage. I do not think that lipofuscin removal will reverse/prevent all forms of aging, just the major component facing us currently. In this piece, I will review what is known about lipofuscin accumulation from evolutionary and mechanistic standpoints and discuss a method of removing it from single cells in vitro.

Crop domestication and breeding considerably increased productivity over centuries, but simultaneously involved unconscious selection against ‘selfish plant behavior’. Paradoxically, modern-day crop breeding largely enhances individual plant-fitness. As agriculture relies on community performance, embracing an “Agroecological Genetics and Genomics” viewpoint might maximize communal yield by matching crop genotypes to target environments.

Paper-based sensors, microfluidic platforms and electronic devices have attracted attention in the past couple of decades because they are flexible, can be recycled easily, environmentally friendly, and inexpensive. Here we report a paper aptamer-based potentiometric sensor to detect the whole Zika virus for the first time with a minimum sensitivity of 2.6 nV/Zika and the minimum detectable signal (MDS) of 0.8x1e6 Zika. Our paper sensor works very similar to a P-N junction where a junction is formed between two different wet regions with different electrochemical potentials near each other on the paper. These two regions with slightly different ionic contents, ionic species and concentrations, produce a potential difference given by the Nernst equation. Our paper sensor consisted of a 2-3 mm x 10 mm segments of a paper with a conducting silver paint contact patches on its two ends. The paper is soaked in a buffer solution containing aptamers designed to bind to the capsid proteins on Zika. Atomic force microscopy studies were carried out to show both the aptamer and Zika become immobilized in the paper. We then added the Zika (in its own buffer or simulant Urine) to the region close to one of the silver-paint contacts. The Zika virus (40 nm diameter with 43 kDa or 7.1x10-20 gm weight), became immobilized in the paper’s pores and bonded with the resident aptamers creating a concentration gradient. The potential measured between the two silver paint contacts reproducibly became more negative as upon adding the Zika. We also showed that an LCD powered by the sensor, can be used to detect the sensor output.

The global antibiotic resistance crisis, driven by antibiotic overuse and misuse, is multifaceted. This study aimed to assess the microbiological and genetic characteristics of raw retail pork meat, including the isolation, antibiotic susceptibility testing (AST), whole genome sequencing (WGS) of selected indicator bacteria, antibiotic residue testing, and metagenomic sequencing. Samples were purchased from 10 randomly selected retail stores in Gauteng, South Africa. Samples were aseptically separated, with a portion sent to an external laboratory for isolating indicator bacteria and antibiotic residue testing. Identification of the isolated bacteria was reconfirmed using matrix-assisted laser desorption/ionization-time of flight mass spectrometry (MALDI-TOF MS). AST was performed using the Microscan Walkaway system. WGS and metagenomic sequencing were performed using the Illumina NextSeq 550 instrument. The isolated E. coli and enterococci exhibited little phenotypic resistance, with WGS revealing tetracycline resistance genes. Isolated bacteria and meat samples all harboured tetracycline resistance genes, and the antibiotic residue concentrations were within acceptable limits for human consumption. In the metagenomic context, most identified bacteria were of food/meat spoilage and environmental origin, with the resistome analysis primarily indicating beta-lactam, tetracycline and multidrug resistance genes. Further research is needed to understand the broader implications of these findings on environmental health and antibiotic resistance.

A signed graph is an undirected graph such that all of its edges are labeled positive or negative. Let D be an embedding of a signed graph G in the Euclidean line. If in D for all of the vertices their positive neighbors are closer than the negative neighbors, then D is called a valid drawing of G. In this paper we show that signed trees, unicyclic graphs, and ladder graphs have a valid drawing in the Euclidean line.

The realization of the third-generation artificial intelligence (AI) requires the evolution from perceptual intelligence to cognitive intelligence, where knowledge graphs may not meet the practical needs anymore. Based on the dual channel theory, cognitive graphs are established and developed through coordinating the implicit extraction module and the explicit reasoning module as well as integrating knowledge graphs, cognitive reasoning and logical expressions, which have achieved successes in multi-hop question answering. It is desired for cognitive graphs to be widely used in advanced AI applications such as large-scale knowledge representations and intelligent responses, promoting the development of Al dramatically. This review discusses cognitive graphs systematically and elaborately, including basic concepts, generations, theories and technologies. Moreover, we try to predict the development of cognitive intelligence in the short-term future and further enlighten more researches and studies.

Part II, like Part I, discusses geometry, kinematics and statics in detail without taking into account power losses in meshing. The main goal of Part II, however, is to prove that there are complex and structurally coupled planetary gear systems, i.e. containing a closed circuit in which no circulation of power flow is generated. The power flow analysis is also carried out using the direct method, with a slight modification in the way of writing the equations identifying active and passive gears, i.e. at the same time the directions of power flow on all transmission paths. The analysed planetary gear system (PGS) is characterised by mobility equal to 1, i.e. single degree of freedom (DoF). It consists of three subsystems in the form of the 2KH type planetary units connected in series-parallel, specially selected to demonstrate the thesis of this paper. It consists of three subsystems in the form of single planetary subsystems of the 2KH type connected series-parallel, specially chosen to illustrate the thesis of this paper.

In recent decades, a number of high-profile cases involving fraud as research misconduct have been in the media and resulted in severe consequences for those convicted. According to the increased cases of allegations and coverage in the media, this reflects a heightened awareness that fraudulent actions exist. Nonetheless, the Office of Research Integrity data suggests that despite the growth in the number of the cases of allegation there has not been a commensurate increase in findings of misconduct. The purpose of this paper is to explore misconduct to better understand what it entails. An analysis of misconduct from the perspective of the definitions of allegations and fraud of is conducted and potential frameworks for understanding both are considered. The paper considers serial-positioning effects of primacy and recency on allegation phenomena, as well as supervenience theory and contextualism as a lens for understanding fraud. Discussion of the relational semantics of the core aspects of fraud and de facto grouping of forms of misconduct. It is concluded that the interrogative pronouns of “what” and “when” could be used to categorize forms of misconduct laying the foundation for the next paper that deconstructs the definition of falsification according to the Public Health Service.

Idiopathic granulomatous mastitis (IGM) is a rare condition characterised by chronic inflammation and granuloma formation in the breast. The aetiology of IGM is unclear. By focusing on the protein-coding regions of the genome, where most disease-related mutations often occur, whole-exome sequencing (WES) is a powerful approach for investigating rare and complex conditions, like IGM. We report WES results on paired blood and tissue samples from eight IGM patients. Samples were processed using standard genomic protocols. Somatic variants were called with two analytical pipelines: nf-core/sarek with Strelka2 and GATK4 with Mutect2. Our WES study of eight patients did not find evidence supporting a clear genetic component. The discrepancies between variant calling algorithms, along with the considerable genetic heterogeneity observed amongst the eight IGM cases, indicate that common genetic drivers are not readily identifiable. With only three genes, CHIT1, CEP170, and CTR9, recurrently altered in multiple cases, the genetic basis of IGM remains uncertain. The absence of validation for somatic variants by Sanger sequencing raises further questions about the role of genetic mutations in the disease. These observations suggest that IGM may be influenced by non-genetic factors, such as environmental triggers or immune system dysregulation, rather than being primarily a genetic disorder.

Previous reviews by the authors [1, 2] indicate the continuing development and improvement of thermal protective systems through the introduction of polymer nanocomposites into polymer matrix composites. These materials perform as thermal protective systems for a variety of aerospace applications, such as thermal protection systems (TPS), solid rocket motors (SRM) nozzles, internal insulation of SRM, leading edges of hypersonic vehicles, and missile launch structures. A summary of the most recent, global technical research is presented. Polymeric resin systems continue to emphasize phenolic resins and other materials. New high-temperature organic resins based on phthalonitrile (PN), and polysiloxane are described and extend the increased temperature range of resin matrix systems.

Escherichia coli is an indicator microorganism in One Health antibiotic resistance surveillance programmes. The purpose of the study was to describe and compare E. coli isolates obtained from pigs and human contacts from a commercial farm in South Africa using conventional methods and whole genome sequencing (WGS). Porcine E. coli isolates were proportionally more resistant phenotypically and harboured a richer diversity of antibiotic resistance genes, as compared to human E. coli isolates. Different pathovars, namely ExPEC (12.43%, 21/169), ETEC (4.14%; 7/169), EPEC (2.96%, 5/169), EAEC (2.96%, 5/169) and STEC (1.18%, 2/169) were detected at low frequencies. Sequence type complex (STc) 10 were the most prevalent (85.51%, 59/169) among human and porcine isolates. Six STcs (STc10, STc86, STc168, STc206, STc278 and STc469) were shared at the human-livestock interface according to multilocus sequence typing (MLST). Core genome MLST and hierarchical clustering (HC) showed that human and porcine isolates were overall genetically diverse, but some clustering at HC2 to HC200 were observed. In conclusion, even though the isolates shared a spatio-temporal relationship, there were still differences in the virulence potential, antibiotic resistance profiles, and cgMLST and HC according to the source of isolation.

Genetic disorders are preeminent determinants of infant mortality. The inherited pediatric-onset genetic disorders have consequential stress on child growth and development: several congenital, complex and rare disorders with indistinguishable clinical symptoms where diagnosis always remains a challenging task. Traditional diagnosis methods include biochemical tests followed by chromosomal microarray and sequencing of a single gene or panel of genes. These methods had several limitations, but with the advent of whole-exome sequencing (WES), genetic testing has become cost-effective and transformative. Exome sequencing has been known for its effectiveness, which appropriately elucidates and distinguishes the heterogeneous disorders to avoid misdiagnosis and decode the underlying genetic alterations. WES has led to discovering genes and genomic variants in a broad spectrum of diseases, including autism, epilepsy, congenital heart diseases, neurodevelopmental diseases, cancer, nephrotic disorders, neural tube defects and fetal structural anomalies. WES is significant in producing immense genomic biomarkers that can be made as appropriate pharmacogenomic targets for drug therapy. In this article, we analyze the recent exploration of WES technology to revolutionize not only the process of genetic variation and disease detection but also the convention of preventative and targeted drug discovery.

Atherosclerosis, a complex metabolic-immune disease characterized by a chronic inflammation driven by the buildup of lipid-rich plaques within arterial walls, has emerged as a pivotal factor in the intricate interplay between cancer and cardiovascular disease. This bidirectional relationship, marked by shared risk factors and pathophysiological mechanisms, underscores the need for a comprehensive understanding of how these two formidable health challenges intersect and influence each other. Cancer and its treatments can contribute to the progression of atherosclerosis while atherosclerosis with its inflammatory microenvironment can exert profound effects on cancer development and outcomes. Both cancer and cardiovascular disease involve intricate interactions between general and personal exposomes. In this review we want to summarize the state-of-the-art of translational data and try to show how oncologic studies on cardiotoxicity can broaden our knowledge of crucial pathways in cardiovascular biology with a positive impact on precision cardiology and cardioncology.

The paper considers two models of queuing with a varying structure based on the introduction of additional transient intensities into known models or their combinations, which create stationary distributions convenient for calculation. In the first model, it is a probabilistic mixture of known stationary distributions with given weights. In the second model, this uniform distribution is repeatedly used in physical statistics. Both models are based on the selection of states, between which additional transient intensities are introduced. The algorithms used in the paper for introducing new transient intensities are closely related to the concept of flow in a deterministic transport network. The introduced controls are selected so that the marginal distribution of the combined system is a mixture of the marginal distributions of the combined systems with different weights determined by the introduced transient intensities. As a result, the process of functioning of the combined system is obtained by switching processes corresponding to different combined systems at certain points in time.

The problem of quantifying the vulnerability of graphs has received much attention nowadays, especially in the field of computer or communication networks. In a communication network, the vulnerability measures the resistance of the network to disruption of operation after the failure of certain stations or communication links. If we think of a graph as modeling a network, the average lower 2-domination number of a graph is a measure of the graph vulnerability and it is defined by ${\gamma }_{2av}\left(G\right)=\frac{1}{\left|V\left(G\right)\right|}{\sum }_{v\in V\left(G\right)}{\gamma }_{2v}\left(G\right)$, where the lower 2-domination number, denoted by ${\gamma }_{2v}\left(G\right)$, of the graph G relative to v is the minimum cardinality of 2-domination set in G that contains the vertex v. In this paper, the average lower 2-domination number of wheels and some related networks namely gear graph, friendship graph, helm graph and sun flower graph are calculated. Then, we offer an algorithm for computing the 2-domination number and the average lower 2-domination number of any graph G.

Background: Whole-body computed tomography (WBCT) is commonly employed for primary screening in pediatric patients experiencing out-of-hospital cardiac arrest (OHCA) without prehospital return of spontaneous circulation (ROSC). This study aimed to evaluate the cause of OHCA on WBCT and compare WBCT findings between ROSC and non-ROSC groups in non-traumatic pediatric OHCA cases in an emergency department (ED) setting. Methods: A retrospective analysis was conducted on 27 pediatric patients (mean age: 32.4 months; median age: 10 months) who experienced non-traumatic OHCA without prehospital ROSC and were transported to our tertiary care hospital between January 2013 and December 2023. WBCT scans were performed to investigate the cause of OHCA, with recorded findings in the head, chest, abdomen, and subcutaneous tissues. Results: In all cases, the direct causes of OHCA were undetermined, and WBCT identified no fatal findings. Statistical comparisons of CT findings between the ROSC and non-ROSC groups revealed significant differences. The non-ROSC group had a higher incidence of brain swelling, loss of cerebral gray-white matter differentiation, symmetrical lung consolidation/ground-glass opacity, cardiomegaly, hyperdense aortic walls, narrowed aorta, gas in the mediastinum, and hepatomegaly compared to the ROSC group. Conclusions: Although WBCT did not provide the direct cause of OHCA, it clarified several indicative findings for non-ROSC. These imaging findings could support clinical decision-making, offering objective criteria for discontinuing resuscitation in pediatric OHCA cases where prehospital ROSC is absent.

The second article in the series presents the application of the Smoothed Particle Hydrodynamics (SPH) method to modelling of batch crystallisation in stirred tanks. A methodology to integrate the population balance equations (PBE) in parallel and independently from the Navier-Stokes equations is demonstrated. The benefits of the proposed methodology in terms of computational requirements, accuracy and availability of the crystal size distribution are discussed. The specific formulation of the SPH equations where the resulting system of ordinary differential equations is solved using the weighted contributions rather than numerically by solving a linear system of equations allows for massive parallelisation and a very loose coupling of the population balance and the fluid dynamics. It has been demonstrated, that the population balance equations can be solved on a Shared Memory Architecture (SMA) system using the OpenMP interface while the fluid dynamics equations being computed independently on a General Purpose Graphics Processing Unit (GPGPU) using the NVidia CUDA technology. This way, a significant portion of the computational overhead due to the large number of additional transport equations resulting from the discretisation of the population balance was removed: the SPH simulation coupled with 200 population balance equations was only 40% slower compared to SPH-only simulation. Two methods for the solution of population balance equations that preserve full crystal size distribution were implemented: discretised population balance (DPB) and method of characteristics (MOCH). The DPB equations are solved using the high-resolution finite-volume method with flux limiter and the effect of a large number of different flux limiters have been investigated. Both methods were validated using the case studies from the literature where an analytical solution can be derived. The developed models were applied to a numerical solution of coupled computational fluid dynamics and population balance equations to model a batch crystallization process. The effect of the hydrodynamics on the local temperature/supersaturation and the resulting crystal size distribution was captured and compared to the ideal mixing case. The simulation results from the DPB and MOCH methods were compared in terms of computational requirements and accuracy and MOCH selected as computationally more efficient and accurate.

We characterize the form of the order divisor graph of cyclic groups based on the group order. Furthermore, we describe some topological indices of the order divisor graph of cyclic groups, including the Wiener index, Harary index, first Zagreb index, and second Zagreb index.

It has recently been shown that, contrary to the wide belief that a shift-enabled condition (necessary for any shift-invariant filter to be representable by a graph shift matrix) can be ignored because any non-shift-enabled matrix can be converted to a shift-enabled matrix, such a conversion in general may not hold for a directed graph with non-symmetric shift matrix. This paper extends this prior work, focusing on undirected graphs where the shift matrix is generally symmetric. We show that while, in this case, the shift matrix can be converted to satisfy the original shift-enabled condition, the converted matrix is not associated with the original graph, that is, it does not capture anymore the structure of the graph signal. We show via a counterexample, that a non-shift-enabled matrix cannot be converted to a shift-enabled one and still maintain the topological structure of the underlying graph, which is necessary to facilitate localized signal processing.

This paper presents a new method : HIVEC to learn latent vector representations of graphs in a manner that captures the semantic dependencies of sub-structures. The representations can then be used in machine learning algorithms for tasks such as graph classification, clustering etcetera. The method proposed is unsupervised and uses the information of co-occurrence of sub-structures. It introduces a notion of hierarchical embeddings that allows us to avoid repetitive learning of sub-structures for every new graph. As an alternative to deep learning methods, the edit distance similarity between sub-structures is also used to learn vector representations. We compare the performance of these methods against previous work.

In this paper, different concepts of reconfigurable RF-MEMS attenuators for beamforming applications are proposed and critically assessed. Capitalizing on the previous part of this work, the 1-bit attenuation modules featuring series and shunt resistors and low-voltage membranes (7-9 V) are employed to develop a 3-bit attenuator for fine-tuning attenuations (&lt; -10 dB) in the 24.25-27.5 GHz range. More substantial attenuation levels are investigated by means of fabricated samples of coplanar waveguide (CPW) sections equipped with Pi-shaped resistors aiming at attenuations of -15, -30, and -45 dB. The remarkable electrical features of such configurations, showing flat attenuation curves and limited return losses, and the investigation of a switched-line attenuator design based on them led to the final proposed concept of a low-voltage 24-state attenuator. Such simulated device combines the Pi-shaped resistors for substantial attenuations with the 3-bit design for fine-tuning operations, showing a maximum attenuation level of nearly -50 dB while maintaining steadily flat attenuation levels and limited return losses (< -11 dB) along the frequency band of interest.

This paper describes different variants of broadband and simple attenuator modules for beamforming applications, based on Radio Frequency Micro Electro-Mechanical Systems (RF-MEMS), framed within Coplanar Waveguide (CPW) structures. The modules proposed in the first part of this work differ in their actuation voltage, topology, and desired attenuation level. Fabricated samples of basic 1-bit attenuation modules, characterized by a moderate footprint of 690 x 1960 µm2 and aiming at attenuation levels of -2, -3 and -5 dB in the 24.25-27.5 GHz range, are presented in their variants featuring both low actuation voltages (5-7 V) as well as higher values (~ 45V), the latter ones ensuring larger mechanical restoring force (and robustness against stiction). Beyond the fabrication non-idealities that affected the described samples, the substantial agreement between simulations and measurement outcomes proved that the proposed designs could provide precise attenuation levels up to 40 GHz, ranging up to nearly -3 dB and -5 dB for the series and shunt variants, respectively. Moreover, they could be effective building blocks for future wideband and reconfigurable RF-MEMS attenuators. In fact, in the second part of this work, combinations of the discussed cells and other configurations meant for larger attenuation levels will be investigated.

(1) Background: The aim of this investigation is to determine the effect of archwires’ deflection on the temperature transitions driving the austenite to martensite transformation (and vice versa) and the force released by NiTi and CuNiTi orthodontic wires. (2) Methods: Round cross-section archwires have been investigated. The calorimetric approach has been used for measuring transition temperatures occurring in the unstressed (e.g. undeflected) state of the wires. Static Thermo-mechanical analysis in a temperature controlled wet environment has been performed in the range of temperature between 5°C and 55°C for measuring temperature transitions occurring in highly deflected archwires in conjunction with the force released by these wires. (3) Results: Plateau forces investigated in Part I and those reported in the literature describes the wire’s behaviour only at deflection levels close to the end point of the force plateau extension detected at 37°C. Upon heating or cooling, the austenite finish (Af) transition temperature and the martensite start (Ms) temperature largely depends on the deflection level for both NiTi and CuNiTi. (4) Conclusions: The plateau force levels at 37°C, broadly reported in the literature, only represent the lower boundary force that a superelastic wire releases at 37°C above its elastic limit. For both NiTi and CuNiTi, plateau force levels at 37°C can be predicted by the static TMA profile matching the end point of the force plateau extension. Transition temperatures in largely deflected wires are significantly higher than those determined through the calorimetric approach.

This paper is the second part of a two-part report studying the responses of a typical point-contact elastohydrodynamic lubrication (EHL) problem to multiscale roughness that is mimicked by artificially generated waviness with different amplitudes, frequencies, and directions. The previous Part I paper (doi:10.3390/lubricants10120368) focuses on the full film regime, while the current paper focuses on the partial film regime. The amplitudes and frequencies are related to the feature geometry of smooth EHL problems. Generated waviness is input to a transient thermal EHL model. The simulation is conducted 1,600 times for different waviness parameters, loads, and speeds. Eight performance parameters are extracted: the asperity contact ratio, minimum film thickness, maximum pressure, central point film thickness, central point pressure, mean film thickness, coefficient of friction (COF), and the maximum temperature rise. The ratios of the first seven parameters with and without waviness and the asperity contact ratio values are plotted on the frequency–amplitude coordinate plane as contour maps. The influences of the amplitude, frequency, wave direction, load, and speed on the eight performance parameters are analyzed and summarized. The simulated data and plotted contour maps are provided to the readers in the Supplementary Material.

This paper delves into the intricate nature of the different essence interactions that shape our perceived reality, leveraging a blend of existing empirical data and original experiments. Through a multidisciplinary approach encompassing quantum mechanics, general physics, metaphysics, philosophy, and spiritualism, it seeks to elucidate the fundamental interplays governing phenomena such as gravity, mass, electromagnetism, force, motion, and quantum mechanics. This exploration promises a reexamination and unification of these principles, offering novel perspectives on the extraordinary phenomena that underpin our reality. By comprehending and manipulating these interactions, the potential arises to orchestrate reality towards desired ends. This study not only unveils compelling avenues for scientific advancement but also proposes transformative technologies and concepts, including light-speed transportation, remote viewing, communication with the deceased, alchemy, and the realization of what is commonly perceived as magic. These visionary notions not only push the boundaries of current understanding but also provide a captivating glimpse into the future possibilities that may await humanity.