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.

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).

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.

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.

Motion related human activity recognition using wearable sensors can potentially enable various useful daily applications. So far, most studies view it as a stand-alone mathematical classification problem without considering the physical nature of human motions. Consequently, they suffer from data dependencies and encounter the dimension disaster problem and the over-fitting issue, and their models are never human-readable. In this study, we start from a deep analysis on natural physical properties of human motions, and then propose a useful feature selection method to quantify each feature's classification contribution capability. On one hand, the "dimension disaster" problem can be avoid to some extent, due to the affined dimension of key features; On the other hand, over-fitting issue can be depressed since the knowledge implied in human motions are nearly invariant, which compensates the possible data inadequacy. The experiment results indicate that the proposed method performs superior to those adopted in related works, such as decision tree, k-NN, SVM, neural networks.

Financial market data analysts are increasingly turning towards machine learning techniques for data analysis and making decisions. This paper explores how knowledge graphs, essentially a network of real entities and their relationships, can be used to improve collaborative financial market data analysis and make it more efficient and user friendly. This paper reviews the current state of financial market data analysis, the challenges in deploying machine learning models in industrial environments, and the concepts such as ML-Ops and knowledge graphs. A software architecture comprising various roles, layers and services such as Data Engineers, Data Analysts, public users, APIs, workflows, analytics libraries, UX layer, Business Layer, etc. is introduced and described in detail. Then, it discusses how knowledge graphs can be used to enhance collaborative financial market data analysis. Finally, a case study is presented to demonstrate the usage of the whole system, within the context of financial market data analytics of equities.

Recent years have seen the growing adoption of non-relational data models for representing diverse, incomplete data. Among these, the RDF graph-based data model has seen ever-broadening adoption, particularly on the Web. This adoption has prompted the standardization of the SPARQL query language for RDF, as well as the development of a variety of local and distributed engines for processing queries over RDF graphs. These engines implement a diverse range of specialized techniques for storage, indexing, and query processing. A number of benchmarks, based on both synthetic and real-world data, have also emerged to allow for contrasting the performance of different query engines, often at large scale. This survey paper draws together these developments, providing a comprehensive review of the techniques, engines and benchmarks for querying RDF knowledge graphs.

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.

This article presents a state-of-the-art system to extract and synthesize causal statements from company reports into a directed causal graph. The extracted information is organized by the relevance to different stakeholder groups’ benefits (customers, employees, investors, and the community/environment). The presented method of synthesizing extracted data into a knowledge graph comprises a framework that can be used for similar tasks in other domains, e.g. medical information. The current work addresses the problem of finding, organizing, and synthesizing a view of the cause-and-effect relationships based textual data, in order to inform and even prescribe the best actions that may affect target business outcomes related to different stakeholders’ benefits (customers, employees, investors, and the community/environment).

The accurate diagnosis and effective treatment of mental health disorders such as depression remain challenging owing to the complex underlying causes and varied symptomatology. Traditional information extraction methods struggle to adapt to evolving diagnostic criteria such as the Diagnostic and Statistical Manual of Mental Disorders fifth edition (DSM-5) and to contextualize rich patient data effectively. This study proposes a novel approach for enhancing information extraction from mental health data by integrating medical knowledge graphs and large language models (LLMs). Our method leverages the structured organization of knowledge graphs specifically designed for the rich domain of mental health combined with the powerful predictive capabilities and zero-shot learning abilities of LLMs. This research enhances the quality of knowledge graphs through entity linking and demonstrates superiority over traditional information extraction techniques, making a significant contribution to the field of mental health. It enables a more fine-grained analysis of the data and the development of new applications. Our approach redefines the manner in which mental health data are extracted and utilized. By integrating these insights with existing healthcare applications, the groundwork is laid for the development of real-time patient monitoring systems. The performance evaluation of this knowledge graph highlights its effectiveness and reliability, indicating significant advancements in automating medical data processing and depression management.

Despite the demonstrated benefits of data monetization initiatives in achieving competitive advantages, many of these efforts struggle to realize their potential. Companies often find it challenging to sustain even initially successful data monetization initiatives due to significant data quality issues. This reflects a disconnect between advancements in data monetization research—spanning digitization, digitalization, and digital transformation—and practical implementation within companies. Consequently, misguided approaches to data monetization are relatively common. A critical prerequisite for successful data monetization is the establishment and maintenance of clean, high-quality data. This study underscores the importance of data quality by conducting an in-depth analysis of Medical Inc., a company engaged in preparing pristine customer master data for advanced customer analytics. The investigation aims to elucidate Medical Inc.’s approach to addressing data cleanliness challenges and to distill a general framework for the customer master data cleansing process. This framework illuminates a relatively unexplored aspect of data monetization supplementing existing literature on digitization, digitalization, and digital transformation.

In the last decade several projects have been developed for the digitization and semantization of cultural heritage data. They were developed to preserve and maintain this heritage, but bringing it closer to all types of users and allowing access to this information to other sectors such as tourism, education, etc. In these developments, web technologies are combined, along with the use of knowledge graphs and interactive visualisation tools. Although remarkably interesting projects have been developed, in those projects, the data visualization tools are usually focused on the project context. This makes it difficult to reuse these jobs. Additionally, there are peculiarities of cultural heritage data considered with little depth, such as uncertainty, spatial and temporal granularity, as well as other aspects, such as relationships between data. In this article, these problems are described and based on other works such as VUMO or VISO, the design of an ontology that formalizes how to visualise this information is proposed, considering these problems. In addition, the development of a platform that allows the visualisation of this information through a web application and its evaluation of its use in projects such as SILKNOW, or Arxiu Valencià del Disseny is exposed

Sudden cardiac arrest (SAC) is a leading cause of mortality. In recent years, though, many lives have been saved through the use of defibrillators by random bystanders. As a result, defibrillators have been popping up in various locations. In this work we propose a state mandate demanding the presence of a defibrillator at every pharmacy store and argue that it could greatly enhance and augment the impact of the defibrillator network. We support our claim via detailed calculations of the immediate (a defibrillator readily available) and partial (a defibrillator available at a reasonable distance) population coverage achievable by the implementation of our proposal, taking the Argolis area in Peloponnese Greece as a case study. Our findings indicate that, in addition to other benefits, the use of pharmacies to establish a defibrillator network could bring an eight-fold increase in the immediate population coverage of defibrillators and would provide immediate / partial access to a defibrillator to 18 / 24 incidents of SCA per year that would otherwise lead to death, potentially leading to the saving of numerous lives. Alternative scenaria are also discussed.

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.

Exosomes, nanoscale extracellular vesicles, are a hot area of investigation in the biomedical field, as they have been shown to play a crucial role in the physiology of numerous tissues, including bone. This study explores the landscape of exosome-based bone regeneration research using infometric techniques. By relying on BERTopic, an advanced topic modeling algorithm, we analyzed a comprehensive corpus of scientific literature to identify key themes and trends in exosome research in the bone regeneration field. We then extracted significant concepts from the abstracts of the corpus and we used them to create knowledge graphs using GPT 3.5 turbo Large Language Model, to map the distribution of information within this domain. The resulting ide-oscape highlights the key ideas that aggregate most of the recent research in the area, from mesenchymal stem cell-derived exosomes to engineered exosome-integrated biomaterials. This exploration provides a holistic view of the field and uncovers its emerging trends, providing useful insight to guide future research directions.

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.

"Public legal information from all countries and international institutions is part of the common heritage of humanity. Maximizing access to this information promotes justice and the rule of law". In accordance with the aforementioned declaration on Free Access to Law by Legal information institutes of the world, a plethora of legal information is available through the Internet, while the provision of legal information has never before been easier. Given that law is accessed by a much wider group of people, the majority of whom are not legally trained or qualified, diversification techniques, should be employed in the context of legal information retrieval, as to increase user satisfaction. We address diversification of results in legal search by adopting several state of the art methods from the web search, network analysis and text summarization domains. We provide an exhaustive evaluation of the methods, using a standard data set from the Common Law domain that we subjectively annotated with relevance judgments for this purpose. Our results i) reveal that users receive broader insights across the results they get from a legal information retrieval system, ii) demonstrate that web search diversification techniques outperform other approaches (e.g., summarization-based, graph-based methods) in the context of legal diversification and iii) offer balance boundaries between reinforcing relevant documents or sampling the information space around the legal query.

In the rapidly evolving field of real estate economics, the prediction of house prices continues to be a complex challenge, intricately tied to a multitude of socio-economic factors. However, traditional predictive models have often overlooked the spatial interdependencies that play a vital role in shaping housing prices. This study applies Graph Neural Networks (GNNs) on Open Statistics Knowledge Graphs to model spatial dependencies and predict house prices across Scotland’s 2011 data zones. To this end, integrated statistical indicators are retrieved from the official Scottish Open Government Data portal. The three representative GNN algorithms employed - ChebNet, GCN, and GraphSAGE - demonstrate higher prediction accuracy than traditional models, including the tabular-based XGBoost and a simple Multi-Layer Perceptron (MLP). In addition, local and global explainability are employed to increase transparency and trust in the predictions made by the most accurate GNN - GraphSAGE. The global feature importance is determined by a logistic regression surrogate model while the local, region-level understanding of the GNN predictions is achieved through the use of GNNExplainer. Explainaibility results are compared with those from a previous work that applied the XGBoost machine learning algorithm and the SHapley Additive exPlanations (SHAP) explainability framework on the same dataset. Interestingly, both global surrogate model and the SHAP approach underscored the Comparative Illness Factor, a health indicator, and the ratio of detached dwellings as the most crucial features in the global explainability. In the case of local explanations, while both methods showed similar results, the GNN approach provided a richer, more comprehensive understanding of the predictions for two specific data zones.

We leverage the explainability feature of KAN network and build an explainable language model where certain neurons encode individual words and neuron activation is fully interpretable in terms of the basis of a word. To do that, we propose a continuous word2vec model where a meaning of a word is expressed by a continuous profile of distances of this word from the words in the basis of words which is interpolated. As a result, the whole KAN network can be interpreted as a sequential procedure with word expressions. We then proceed from words to logic programs and develop a clause learning technique based on KAN. A logic program construction process from facts now become fully interpretable. We follow the differentiable inductive logic programming technique, representing a logic program as a matrix learned by KAN. Hence, we obtain an efficient and fully interpretable rule learning approach.

Today, LLMs are not good at personalization providing recommendation. They advise physicians and financial advisors to ask professionals in respective fields for help, even having user information available. Answering questions of software professionals, LLM needs to deliver in-depth answers with codes or algorithms, whereas for professionals in other fields would need definitions and main concepts. The intent of this chapter is to make LLM answer tailored to the needs of users, taking into account available information about them. To do that, we need to generalize available information about a person like her health record, maintaining the privacy of this person. We rely on meta-learning techniques to design a LLM prompt to produce a personalization prompt to obtain a suitable relevant information. Such “meta-prompt” is produced by generalization operation applied to available documents for the user. These documents need to be de-identified so that they are sufficient for personalization on one hand and will maintain user privacy on the other hand. The second neuro-symbolic technique to support personalization is abductive reasoning, acting in parallel to LLM fine-tuning. Traditional recommendation and personalization techniques as well as modern, deep learning – based are presented, and the comparison is drawn to the proposed approach. We also share the evaluation and comparative analyses of these approaches. We consider an example for how to build personalization LLM systems coming from Langchain platform. We will explore how to construct chains to form a personalization profile for a user and apply it to user search and recommendation requests.

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.

Personal protective equipment (P PE) rules must be respected and followed to the letter of healthcare professionals in Cameroon to avoid the transmission of infectious diseases. This research proposes solutions to the problems of non-adherence and non-compliance among healthcare workers in Cameroon towards PPE rules. Inadequate access to suitable PPE, discomfort when wearing PPE during poor quality, and a lack of training on correct PPE use are just a few of these obstacles amongst HCWs in Cameroon. Hospitals and healthcare facilities should prioritize offering thorough instruction on PPE use and pinpoint the need to adhere consistently to PPE rules to remove these obstacles. They should also ensure that all healthcare personnel have access to and a sufficient supply of the proper PPE. Through the organization of impromptu visits by surveillance teams to identify areas of support and training, there is a need for assistance from government bodies and public health groups in creating awareness of the security value of PPE use among healthcare professionals. There is a lack of PPE in health care settings in rural areas in Cameroon, thus a need for an adequate supply. Then can we put appropriate PPE policies and practices for HCWs in Cameroon, as they will keep to it.Healthcare professionals in Cameroon must comprehend that following PPE standards protects not just their selves from diseases but also their patients, coworkers, and communities. We are accountable for ensuring everyone's safety and well-being, and adhering to PPE regulations is an essential first step.

Vaccine hesitancy has emerged as a significant barrier to achieving herd immunity and protecting populations from preventable diseases. Despite the proven effectiveness and safety of vaccines, many individuals remain hesitant or refuse to vaccinate themselves or their children. This review aims to identify the factors contributing to vaccine hesitancy, including misinformation, lack of trust in authorities, cultural beliefs, and access barriers. We also discuss the impact of vaccine hesitancy on public health, including outbreaks of vaccine-preventable diseases and erosion of trust in public health authorities. Furthermore, we present evidence-based communication strategies for addressing vaccine hesitancy, including building trust, providing accurate information, addressing myths and misconceptions, engaging with local influencers, and utilizing social media and digital platforms. By understanding the factors contributing to vaccine hesitancy and implementing effective communication strategies, healthcare providers, public health officials, and community leaders can work towards promoting widespread vaccine acceptance and protecting public health.

It is concerning that Cameroon's urban centers are experiencing an alarming rise in air pollution as a result of urbanization, population growth, industrial activity, and transportation emissions. We examined the causes, health impacts, research methodology, case studies, and government measures to address the urgent issue of air pollution in Cameroon's urban regions. We have emphasized how Cameroon's air pollution levels have significantly increased as a result of causes like population expansion, urbanization, industrial emissions, and automobile exhaust A thorough discussion of the negative health impacts of extended exposure to air pollution is included, with special attention to the sensitivity of the old and young. These effects include respiratory disorders, cardiovascular ailments, and early mortality. We emphasized the pressing need for all-encompassing strategies to address air pollution, such as increased public awareness campaigns, stronger emissions regulations, the development of renewable energy sources, and better waste management. The techniques employed in studies on air pollution, like as epidemiological research and air quality monitoring, are also explained to provide light on the unique health dangers that Cameroonian urban dwellers must contend with. We emphasized in our conclusion the significance of joint efforts by legislators, medical professionals, and the general people to reduce air pollution and protect public health in Cameroon in order to create a cleaner and healthier future. In order to protect public health in the future, it is imperative that Cameroon's air pollution be addressed.

This paper numerically investigates a 3D mesh independency study of a straight blade horizontal axis tidal turbine modelled using Computational Fluid Dynamics (CFD). The solution was produced by employing two turbulence models, the standard k-ε model and Shear Stress Transport (SST) in ANSYS CFX. Three parameters were investigated: mesh resolution, turbulence model, and power coefficient in the initial CFD, analysis. It was found that the mesh resolution and the turbulence model affect the power coefficient results. The power coefficients obtained from the standard k-ε model are 15% to 20% lower than the accuracy of the SST model. It can also be demonstrated that the torque coefficient increases with the increasing Tip Speed Ratio (TSR), but drops drastically after TSR = 5 and k-ε model failing to capture the non-linearity in the torque coefficient with the increasing TSR.

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.

Background. The Stanford Health Assessment Questionnaire-Disability Index (HAQ) is widely used to measure functional ability in persons with Rheumatoid Arthritis (RA). The instrument was developed with limited involvement from persons with RA, and their perception of the instrument has not been studied in depth. The aim of this study was to explore how persons with RA experience the use of the HAQ in care. Methods. Forty persons with RA were purposefully recruited to participate in semi-structured interviews. The interviews were then analyzed qualitatively using thematic analysis. Results. The participants questioned the relevance of the HAQ but nevertheless experienced that the instrument had a profound effect on their understanding of health and how care is delivered. The analysis resulted in three themes: Problems with individual items, meaning of the summative score, and effects on care and health perceptions. Conclusions. To make the HAQ relevant to persons with RA, it needs to be revised or to include an option to select items most meaningful to the respondent. To ensure relevance, the HAQ update should preferably be co-created by researchers, clinicians and persons with RA.

Cryptocurrencies have obtained a crucial position in the international financial landscape. The cryptocurrency market has been perceived as a highly volatile market since the inception of Bitcoin. This study investigates the relevant performance of extreme value models (EVM) in estimating the Value-at-Risk (VaR) of Bitcoin and Ethereum returns. The extreme value mixture models, GPD-Normal-GPD (GNG) and GPD-KDE-GPD models are fitted to the returns of Bitcoin and Ethereum and the Kupiec likelihood backtesting procedure is performed on the VaR estimates to assess the fits. Both models’ results showed that the fits were a much more decent representation of the observed data when compared to the Normal distribution. The backtesting results showed that the GPD-KDE-GPD model’s fit was superior to that of the GPD-Normal-GPD for both sets of returns at all VaR risk levels except at the 99% level. The results of this study may assist with understanding the dynamics and risks associated with cryptocurrencies and can serve as a beneficial tool for decision-making and risk management to investors, traders, financial institutions and many other participants in the cryptocurrency ecosystem.

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 review article focuses on the role of Artificial Intelligence (AI) in transforming healthcare in Africa, specifically in combatting infectious diseases, neglected tropical diseases (NTDs), and antimicrobial resistance. We provide a comprehensive overview of the significance of AI in the healthcare industry, highlighting its urgency and importance in addressing these specific health challenges in Africa. We begin by discussing the role of AI in infectious disease surveillance and outbreak detection. We explore how AI technology can be employed for real-time tracking and prediction of outbreaks, providing examples of successful AI applications in infectious disease surveillance within the African context.Next, we examine the potential of AI-enabled diagnosis and treatment for faster and more accurate diagnoses of infectious diseases and NTDs. We highlight specific examples of AI applications in diagnosing and treating these diseases in Africa, showcasing the potential of AI to improve clinical outcomes and save lives.Furthermore, we focus on how AI-driven drug discovery and development can expedite the search for new treatments for infectious diseases and combat antimicrobial resistance. We present examples of AI applications in drug discovery within the African context, illustrating the potential for AI to revolutionize the development of effective therapeutics.In addition, we delve into how AI-powered public health interventions can enhance the design and implementation of targeted interventions. We explore how AI can optimize resource allocation and facilitate data-driven decision-making processes, providing examples of AI applications in public health in Africa.Finally, we address the challenges and limitations of implementing AI in combatting infectious diseases, NTDs, and antimicrobial resistance in Africa. We discuss potential barriers and ethical concerns surrounding AI applications in healthcare, aiming to encourage informed and responsible utilization of AI technologies.Overall, this review emphasizes the importance and potential of AI in combatting infectious diseases, NTDs, and antimicrobial resistance in Africa. It positions AI as a catalyst for revolutionizing healthcare in the region, leading to more effective disease surveillance, diagnosis, treatment, drug discovery, and public health interventions.

The healthcare situation in Africa is characterized by limited resources and a high burden of disease, presenting significant challenges to the healthcare systems in the region. The integration of Artificial Intelligence (AI) technologies in African healthcare holds immense potential for addressing these challenges and improving health outcomes. This paper aims to provide a comprehensive understanding of the current healthcare landscape in Africa and the urgent need for AI-driven solutions.In addition to discussing the potential applications of AI in African healthcare, such as disease diagnosis, treatment planning, and medical imaging analysis, this manuscript seeks to shed light on the specific challenges hindering the implementation of AI in the region. By providing detailed examples and case studies, we aim to offer insights into the obstacles that need to be overcome and potential solutions that can be pursued.By leveraging AI technologies, Africa has the opportunity to revolutionize its health systems, bridging the gap in access to quality healthcare across the continent. The objective of this review article is to not only highlight the potential benefits that AI can bring to African healthcare but also to emphasize the urgent need for action and collaboration in implementing and scaling up AI innovations in the region. By doing so, African countries can pave the way for improved health outcomes and ensure that their populations receive the healthcare services they deserve.

Artificial intelligence (AI) has emerged as a powerful tool for addressing the challenges posed by climate change and their impact on public health. By leveraging its capacity to analyze and predict climatic patterns, AI offers opportunities to enhance resource management and develop effective strategies for climate change mitigation. Moreover, AI can contribute to generating sustainable solutions that address the complex and interconnected nature of climate change. For example, AI can enable the optimization of energy consumption and facilitate the integration of renewable energy sources into existing systems. It can also support the development of climate models that provide timely and accurate predictions, enabling policymakers to implement proactive measures for disaster preparedness and response. Furthermore, AI-powered disease surveillance and mitigation techniques can improve public health outcomes by identifying patterns and trends in the spread of diseases in relation to climatic factors.However, the widespread adoption of AI-based solutions is not without challenges. Ethical concerns surrounding privacy and data ownership must be addressed, as the use of AI requires access to large datasets, raising potential privacy risks. Technical constraints, such as limited computational power and the need for sophisticated algorithms, also pose obstacles to the implementation of AI in climate change mitigation strategies. Furthermore, issues related to the accessibility and affordability of AI technologies must be resolved to ensure equitable distribution and maximize its potential impact on public health.To fully harness the power of AI in addressing climate change and improving public health outcomes, it is crucial to promote innovation, multidisciplinary collaboration, and open data science. Innovation can drive the development of new AI algorithms and technologies specifically tailored to address climate change challenges. Multidisciplinary approaches that bring together experts from diverse fields, including climate science, public health, and computer science, can foster a holistic understanding of complex systems and enable the design of comprehensive solutions. Finally, open data science practices, such as sharing data and algorithms, can facilitate collaboration and accelerate progress in mitigating climate change and its public health impacts.In conclusion, AI offers promising opportunities for effectively addressing climate change and its impact on public health. However, to fully realize its potential, it is essential to tackle ethical and privacy concerns, overcome technical constraints, and ensure accessibility and affordability. By promoting innovation, multidisciplinary collaboration, and open data science, we can unlock the transformative power of AI in mitigating climate change and improving public health outcomes.

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.

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.

In the intricate dance between viruses and host cells, RNA-binding proteins (RBPs) serve as crucial orchestrators of gene expression and cellular processes. We will delve into the riveting realm of viral hijacking, where viruses deftly exploit host RBPs to manipulate cellular machinery for their replication and pathogenesis. Through a masterstroke of molecular subterfuge, viruses co-opt RBPs involved in various facets of RNA metabolism - from transcription to degradation - to promote viral gene expression and evade host immune defenses. This manipulation leads to global alterations in cellular RNA metabolism, impacting essential host genes vital for immune responses and homeostasis.Unveiling this clandestine alliance between viruses and RBPs is not just a scientific pursuit, but a critical imperative for devising innovative antiviral strategies to disrupt these interactions. By unraveling the intricate interplay between viral proteins and host RBPs throughout the viral life cycle - from entry to assembly - researchers aim to identify vulnerabilities that can be targeted for therapeutic intervention. Strategies such as disrupting viral protein-RBP interactions hold promise for inhibiting viral replication and curbing pathogenesis, offering a beacon of hope in the battle against viral infections.Our manuscript elucidates the indispensable roles played by RBPs in viral replication, translation, and pathogenesis, shedding light on the molecular mechanisms driving viral success. Delving deeper, it explores how viruses intricately entwine with host RBPs, manipulating cellular signaling pathways to create a hospitable environment for viral spread. By dissecting these manipulative tactics, researchers uncover new targets for antiviral therapy, envisioning a future where tailored interventions disrupt viral-host RBP interactions with precision and efficacy.As the narrative unfolds, the therapeutic implications of targeting RBPs or their interactions with viral proteins emerge as a promising frontier in the fight against viral infections. From small molecule inhibitors to RNA-based therapeutics, innovative approaches are on the horizon, offering new avenues for combatting viral diseases. We set the stage for future research, beckoning researchers to delve deeper into the molecular intricacies of viral hijacking of RBPs and charting a course towards novel therapeutic interventions that promise to reshape the landscape of antiviral therapy.\Ultimately, it beckons the scientific community to embark on a voyage of discovery, unraveling the secrets of viral hijacking of RBPs and paving the way for transformative advances in antiviral therapeutics. The stage is set for a new chapter in the battle against viral infections, where knowledge becomes the sword and innovation the shield against the pernicious machinations of viral pathogens.

Artificial intelligence (AI) is increasingly being used to improve the quality control of point-of-care diagnostics. This is caused by a number of factors, including the following: 1. AI can accelerate and improve testing accuracy. In comparison to humans, AI technology can review data more quickly and precisely, reducing errors and improving overall quality assurance. 2. When it comes to improving POC test findings on healthcare issues such as infectious diseases or medical crises such as heart attacks, AI can be used for sophisticated predictive analytics and modeling that aid in better decision-making. 3. Artificial intelligence facilitates process automation, increasing productivity and lowering labor costs in labor-intensive tasks such as testing and analyzing samples collected at point-of-care facilities. 4. The use of AI enables organizations implementing these solutions to gain insights from large volumes of raw diagnostic data generated faster and more accurately, allowing them to build solid frameworks around preventive care initiatives and significantly influence public health outcomes.5. Artificial intelligence (AI) has been demonstrated to be a useful tool for real-time monitoring systems that identify any problems with test results early so that they can be corrected before affected patients receive inaccurate diagnoses or treatment plans based on false information provided by diagnostic tests performed at points of care such as clinics or hospitals.Using these technologies would allow healthcare organizations to spend less on labor while still receiving exact diagnoses and rapid treatment delivery at a fraction of the cost that manual approaches required earlier.

This paper introduces a novel framework for zero-shot learning (ZSL), i.e., to recognize new categories that are unseen during training, by distilling knowledge from foundation models. Specifically, we first employ ChatGPT and DALL-E to synthesize reference images of unseen categories from text prompts. Then, the test image is aligned with text and reference images using CLIP and DINO. Finally, the predicted logits are aggregated according to their confidence to produce the final prediction.Experiments are conducted on multiple datasets, including CIFAR-10, CIFAR-100, and TinyImageNet. The results demonstrate that our model can significantly improve classification accuracy compared to previous approaches, achieving AUROC scores above 96\% across all test datasets. Our code is available at https://github.com/1134112149/MICW-ZIC.

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.

Knowledge is not merely the characteristic of certain pieces of information being deemed true and justifiable, but rather a process. Within an axiomatic system, the set of information that reaches the status of knowledge forms a universe that provides an interpretation of the reality one aims to describe. Language exchanges information through communication and the process of justification (exchange of information), if it consistently justifies a particular piece of information, it elevates it to knowledge. In this paper, we provide a framework for knowledge within an axiomatic model where we define the fundamental elements of communication and grammar. As a result, the structure dictates that knowledge, to be considered as such, must be investigateable by anyone who utilizes it in its entirety, both in form and content. Ultimately, the development of knowledge processing, referred to as \emph{knowmatics}, represents a clear evolution of the computer science that processes information (subset of knowledge).

Background: Microscopic examination of acid-fast stained sputum smears for detecting mycobacterial acid-fast bacilli (AFB) remains the most economical and readily available method for laboratory diagnosis of tuberculosis (TB). However, this conventional approach has limitations, including low sensitivity and labor-intensive procedures. Methods: An automated microscopy system incorporating artificial intelligence (AI) and machine learning for AFB identification was evaluated. The study was conducted at an Infectious Disease Hospital in Jiangsu Province, China, utilizing an intelligent microscope system (TB-Scan, Wellgen Medical, Kaohsiung). A total of 1,000 sputum smears were included in the analysis, with the system capturing digital microscopic images and employing an image recognition model to automatically identify and classify AFB. Referee technicians provided the gold standard for discrepant results. Results: The automated system demonstrated an overall accuracy of 95.00% (950/1,000), sensitivity of 91.24% (177/194), and specificity of 95.91% (773/806). Notably, the system identified 21 smears as positive that were previously reported as negative, with referee technicians confirming 17 of these as true positive and retracting the test results accordingly. Recalculating the performance, the accuracy increased to 96.70% (967/1,000), sensitivity to 91.94% (194/211), and specificity to 97.97% (773/789), with a false negative rate of 8.06% (17/211) and a false positive rate of 2.03% (16/789). Conclusions: The incorporation of AI and machine learning into an automated microscopy system demonstrated the potential to enhance the sensitivity and efficiency of AFB detection in sputum smears compared to conventional manual microscopy. This approach holds promise for widespread application in TB diagnostics and potentially other fields requiring labor-intensive microscopic examination.

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 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.

Thyroid surgery rates have tripled over the past 3 decades making it one of the most frequently performed procedures within general surgery. They are associated with the possibility of serious postoperative complications having a significant impact on the patient's quality of life. The recurrent laryngeal nerve (RLN) palsy and the external branch of the superior laryngeal nerve (EBSLN) palsy are, next to hypoparathyroidism and bleeding after operation, one of the most common complications. The introduction of neuromonitoring into thyroid surgery, enabling both confirmation of anatomical integrity and assessment of laryngeal nerve function, was a milestone that has begun a new era in thyroid surgery. The International Neural Monitoring Study Group made standardization of the technique of RLN and EBSLN monitoring during thyroid and parathyroid surgery which increased prevalence of neural monitoring during thyroidectomy. Current status of IONM and benefits of its use have been presented in this publication.

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.

The assessment of existing bridges constitutes a serious challenge for the researchers since their safety evaluation is a complex task due to several sources of uncertainty affecting the parameters identified in the knowledge process. In particular, a high level of uncertainties may arise in the case of prestressing systems requiring special investigation strategies and experimental technologies. The paper aims to investigate how the knowledge uncertainties influence the safety assessment of existing post-tensioned bridges. The semi-probabilistic approach is used, and uncertainties related to the knowledge process are described considering the number of tests, the confidence level assumed for the estimation of the problem parameters, and the measurement errors of in-situ tests. Results concerning a typical post-tensioned bridge are reported and the variability of the outcomes is discussed and compared with a reference case of “perfect knowledge”. The main results of the study confirm the general robustness of the semi-probabilistic Eurocodes safety format and provide an overview of dispersion due to different choices about the number of tests and confidence level. The measurement errors may lead to significant under-estimation of the computed structural capacity with respect to the reference one.

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$.

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.

This scientific paper explores the increasingly widespread use of collaborative robots in the industrial environment, highlighting them as a solution to challenges related to the high costs of human labour and the associated management difficulties. The authors focus on the process of defining requirements for the implementation of collaborative robots, providing strategies based on mathematical management models. This approach translates into significant benefits for companies, such as cost reduction, quality improvement, and increased operational efficiency. Additionally, the paper proposes an innovative mathematical model for assessing total costs, budgeting, profitability, and electric power consumption associated with the operation of collaborative robots. This model allows for a comparison between the costs involved in using human labour and those associated with collaborative robots, providing critical information for technological investment decisions. The efficiency of this mathematical model is demonstrated through a practical application, where collaborative robots were integrated into a production environment, and costs and efficiency were evaluated compared to the use of human labour. This scientific paper provides a systematic and efficient approach to implementing collaborative robots in industrial processes, benefiting from strategies based on mathematical management models and an original mathematical model for evaluating performance and associated costs.

Multimodal knowledge graph completion necessitates the integration of information from multiple modalities (such as images and text) into the structural representation of entities to improve link prediction. However, most existing studies have overlooked the interaction between different modalities. To address this issue, this paper proposed a Transformer-based knowledge graph link prediction model (MM-Transformer) that fuses multimodal features. Different modal encoders are employed to extract structural, visual and textual features, and hybrid key-value calculations are performed on features from different modalities based on the Transformer architecture. The similarities of textual tags to structural tags and visual tags are calculated and aggregated respectively, and multimodal entity representations are modeled and optimized to reduce the heterogeneity of the representations. Experimental results demonstrate that, compared to the current multimodal state-of-the-art methods, the proposed method achieves significant performance improvements in knowledge graph link prediction tasks. This proves that the proposed method effectively addresses the problem of multimodal feature fusion in knowledge graph link prediction tasks.

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.

Parents play an important role in shaping the eating habits of their children through: appropriate selection of food products, snacking between meals and appropriate exposure to information from television advertisements, the press or the Internet. The level of parents' knowledge about proper nutrition and substances added to food is therefore crucial in promoting appropriate dietary choices in children and adolescents in order to prevent diet-related diseases. Objectives: Assessment of the consumption of snack foods by children and adolescents according to the surveyed parents and analysis of parents' knowledge about additional substances in food. Methods: The study was conducted among 129 parents of students from selected primary schools. The research tool was an original survey questionnaire consisting of 24 questions. Survey interviews were conducted with parents during meetings at schools. Statistical analysis was performed using the Pearson ch2 test, the significance level was set to p<0.05. Results: Parents most often indicated sweets, confectionery products and sweetened drinks (25%) and vegetables or fruit (21%) as the form of snack for their children. 46% of children and adolescents drank sweetened drinks at least once a day. Parents had an average level of knowledge about food additives. Significant correlations were found between the level of knowledge of parents of school-age children about food additives and their level of education. Parents' knowledge and education did not significantly influence the level of snack consumption by their children. Children's eating behavior should be considered unsatisfactory. Conclusions: Research has shown the need for parents to be educated about food additives and to pay more attention to reading food labels so that they can reliably prepare their children to make the right food choices. Measures should be implemented to improve the eating habits of children and adolescents.

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.

CD4 count recovery is the main goal for an HIV patient who initiated ART. Some patients respond positively to ART and attain CD4 count recovery, some patients might fail to recover their CD4 count due to non-adherence, treatment resistance, and virological failure, leading to HIV-related complications and death. The purpose of this study is to find the determinants of death in patients who failed to recover their CD4 count after initiating antiretroviral therapy. The data used in this study was obtained from KwaZulu-Natal, South Africa, where 2528 HIV-infected patients with a baseline CD4 count of 200 cells/ were initiated on ART. We used a Fine-Gray sub-distribution hazard and cumulative incidence function to estimate potential confounding factors of death, where CD4 count recovery was a competing event for failure due to death. Patients who were not suffering from tuberculosis were 1.33 times at risk of dying before attaining CD4 count recovery [aSHR 1.33; 95% CI (0.96-1.85] compared to those who had no tuberculosis. Rural patients had a higher risk of not recovering and leading to death [aSHR 1.97; 95%CI (1.57-2.47)] than those from urban areas. The patient’s tuberculosis status, viral load, regimen, baseline CD4 count, and location were significant contributors to death before CD4 count recovery. Intervention programs targeting HIV testing in rural areas for early ART initiation and promoting treatment adherence are recommended.

Clinical trials, by contributing to the development of diagnostics and to the search for modern, more effective, and safer therapies, have become one of the most important elements of the healthcare system. The aim of this study was to assess Poles' knowledge and beliefs about clinical trials. Methods: The survey was conducted among Poles aged 18 and over with the help of external company, Ariadna, which is an independent research panel. The questionnaire contained 22 questions, of which 13 questions concerned beliefs and attitudes towards clinical trials. Results: One thousand and seventy-nine participants took part in the study (N = 1079). The mean age of respondents was 44.96 years (SD = 16.30). Slightly more women (N = 568, 52.6%) than men (N = 511, 47.4%) took part in the study. Among the respondents, 86.5% (N = 933) were aware of clinical trials. The main sources of information about clinical trials were the media (53.8%) including the Internet (N= 355, 32.9%), TV (N = 175, 16.2%), press (N = 30, 2.8%) and radio (N = 21, 1.9%). 43.2% (N = 466) of respondents reported little knowledge of clinical trials, while more than three quarters (N = 805, 75.2%) said they would like to learn more about clinical trials. Most respondents (N = 879, 81.4%) agreed with the statement that participation in a clinical trial is completely voluntary, and more than half (N = 580, 53.7%) agreed with the statement that hospitals participating in clinical trials provide better healthcare. The statement that the results of clinical trials are made available to the public was disagreed with by 37.2% (N = 402) of participants. Only 30.3% (N = 327) of participants agreed that clinical trials should be conducted with children. Conclusions: Poles rate their knowledge of clinical trials as low and would like to learn more. To reach the largest possible group of Polish patients, parallel educational activities on multiple levels may have the best effect. Poles' knowledge of clinical trials is mainly based on commercial sources. Further studies in different groups, i.e., clinical trial patients and investigators, are needed.

Innovation is an essential key factor in the technology development history. Past research on innovation focused more on the innovation behavior of technology, but seldom described knowledge assets which also influence innovation behavior greatly. The effect of knowledge assets attribute and result on disruptive innovation is therefore regarded as the research topic in this study, where disruptive innovation is divided into outbound and inbound to combine combination-embeddednessandmajor business specificityof knowledge assets as the research model. Manufacturing enterprises in China are proceeded the questionnaire survey, and 173 valid copies are collected. The empirical analysis shows that combination-embeddedness of knowledge assets presents significantly positive effects on major business specificity and outbound innovationof an enterprise but reveals remarkably negative effects on inbound innovation. Enterprises are suggested to constantly accumulate knowledge assets with low major business specificity before disruptive innovation in order to reduce ineffective inbound innovation.

In this research, the primary goal was to investigate the relationship between strategic planning and organizational performance in Iraq's manufacturing context. The study's primary data sources were 360 manager respondents. The structured questionnaire was used to collect primary data from manufacturing firms located throughout Iraq. To analyze the result, the researcher used descriptive statistics, correlation, and multiple regression analysis. SPSS version 16 software was used to conduct data analysis. The result reveals that the process of strategic planning has a beneficial effect on financial performance. Environmental scanning has a statistically significant positive effect on a company's non-financial performance. Management participation and planning formality positively and statistically significantly affect a business's non-financial performance at the 10 percent level. The domain of strategy and technique has not impacted the company's non-financial performance.

This paper, from the perspective of Mode 3 of knowledge production, takes the important carrier of knowledge, scientific research papers, as the research object. The mainstream databases (SCIE and SSCI) are chosen as the data sources. Firstly, bibliometric methods are applied to analyze the cooperation status among the main bodies of paper production, including authors and their affiliated institutions, countries, and disciplines; secondly, the Analytic Hierarchy Process (AHP) is used to construct a comprehensive evaluation model for the state of research cooperation in carbon neutrality. Based on the evaluation model, the cooperation characteristics of different disciplinary fields and the relationship between paper cooperation status and high-impact research papers are comparatively analyzed. At the same time, an analysis is conducted on the support from the government, the sponsorship from enterprises, and the participation of the public in the process of paper production. Finally, some suggestions are put forward on how to build an innovative ecosystem for carbon neutrality research from the perspective of Mode 3 of knowledge production.

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.

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.

We develop new theory from a broad case-study approach to explore a better understanding of what constitutes knowledge and its value as identifiable to human-machine teams. From past research, this trail of exploration will lead to these initial questions: What is the value of debate in the furtherance of knowledge? Will machines with AI be able to contribute to a debate if we humans cannot define it or determine its value sufficiently for a machine’s understanding, contribution, exploration and identification? Like humans, as teammates, machines must be able to determine with AI what constitutes the usable knowledge that contributes to a team’s success in the field (e.g., testing "knowledge" in the field, identifying new knowledge, using knowledge to develop innovation) or its failure (viz., trouble shooting; identifying weaknesses; discovering vulnerabilities, hiding by deception). It matters not whether a debate is public, private or unexpressed by an individual human or machine agent alone; we speculate in this exploration that the process advances the science of autonomous human-machine teams and assists in interpretable machine learning. We conclude with questions and a speculation: How does a human become aware or express its awareness of knowledge? Can a machine be as expressive as its human teammates? And how does a human-machine teammate become aware that its teammates possess sufficient knowledge to perform a task? We speculate that the structure of “knowledge," once found, is resistant to alternatives (i.e., it is ordered); that its functional utility is generalizable; and that its applications are multifaceted (akin to maximum entropy production). The complexity of the team is taken into consideration in our search for knowledge, which can also be used as an information metric.

This paper presents how social media platforms and their components could be integrated into the KMS for the purpose of managing and sustaining Somali Indigenous knowledge (IK). The discovery of knowledge and its utilization is now fuelled by the advancement of technology, which connects users to external sources through using different platforms. The rapidly increasing use of SM and mobile technologies create opportunities to form knowledge networks that can facilitate the process of creating, preserving, and sharing knowledge and skills that are unique to communities in the Somali context. Somali society being an oral society with rich IK and other cultural practices lacked a framework in place to organize the existing knowledge in various methods. The paper refers to existing methodology E-learning and KM functions. This method first identifies functional similarities between SM, E-Learning, and KM systems and their interactions if they are properly integrated. The proposed framework consists of two functional parts; KM and SM. The KM part involves knowledge capturing, validation, formatting, storing, and distribution. SM part of the framework involves knowledge presentation, sharing, and application. Since the Somalis are said to be an oral society, this framework helps to capture and disseminate IK residing in knowledge holders.

The objective of this research is to establish a better understanding of the current landscape of digital learning research and sustainable development by using CiteSpace. First, we retrieved published publications from the Web of Science (2004–2022). Following that, we examined the primary research strengths and important subjects of digital learning from two perspectives: collaboration networks (including collaborative networks across countries, institutions, and authors) and co-citation networks. We examined the co-citation network from three perspectives: cluster analysis, the most active citers, top references. Furthermore, referenced journals, popular themes, and rising trends were examined. These findings indicate the primary study subjects in the field of digital learning, the most intriguing research literature, and each period's emerging research hotspots. Finally, we proposed further study ideas for future paths.

In the dynamic interplay between people and their physical environments, the Global South stands as a mosaic undergoing a multitude of transformative influences in architecture and urbanism where examining social sustainability becomes imperative. While prevailing attention remains on environmental and economic sustainability, this study addresses a persistent gap in the urban literature by focusing on the dynamic and manifold nature of social sustainability. Positioning itself within the context of sustainable development, the study links the pursuit of social aspects of sustainability with selected unique urban contexts from the Global South. Five cases that include Alexandria (Egypt), Tripoli (Libya), Basra (Iraq), Lilongwe (Malawi), and Accra (Ghana) are discussed through multi-layered investigations that involve attitude surveys, interviews, focus groups, participatory systematic observations, and behavioral mapping, engaging directly with inhabitants and stakeholders. Uncovering people-place narratives in the identified contexts, the cases are developed into five knowledge typologies that serve as practical tools for planning and design decision-making, policy formulation, and academic discourse. Discussions are conceived to demonstrate the transformative role people-place narratives play in fostering a more sustainable and equitable urban future. Conclusions are drawn to offer practical insights for stakeholders involved in various capacities in shaping the urban landscape of the Global South.

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.

Fungal infections (FIs) are spreading globally causing a significant public health concern. However, its documentation remains sparse in Africa, particularly in Rwanda. This literature review, aims to assess the risk and document current gaps in evidence and policy. It summarizes the published data about FIs in Rwanda, including ten reports published between 1972-and-2022. Blastomyces, Candida, Cryptococcus, Histoplasma, Microsporum, Pneumocystis, Rhinosporidium, and Trichophyton caused human infections. These infections primarily affected the brain, respiratory, urinary and reproductive organs, and they were diagnosed using culturing, histopathology, immunology, and/or microscopic techniques. Our findings provide an overview of the diversity and distribution of FIs, highlighting significant limitations in the country’s diagnostic capacity and surveillance system for FIs. Also, indicating severe gaps in evidence to inform policymaking, guide strategic planning and intervention, underscoring the urgent need to build national capacity in fungal diagnosis, surveillance, and research. Raising awareness among the public, scientific community, healthcare providers, and policymakers remains crucial. Furthermore, this report reveals the threats of FIs on public health and food insecurity in Rwanda. A Multisectoral One Health Strategy is essential in research and intervention to determine and reduce the health and safety impacts of fungal pathogens on human, animal, and the environment.

The report details out programming approach for automating warehouse using Answer Set Programming.

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.

Background: Pharmacists need up-to-date knowledge and decision-making support in HIV care. We aim to develop MARVIN-Pharma, an adapted artificial intelligence-based chatbot initially for people with HIV, to assist pharmacists, considering evidence-based needs. Methods: From Dec 2022 to Dec 2023, an online needs-assessment survey evaluated Québec pharmacists' knowledge, attitudes, involvement, and barriers relative to HIV care, alongside perceptions relevant to the usability of MARVIN-Pharma. Recruitment involved convenience and snowball sampling, targeting National HIV and Hepatitis Mentoring Program affiliates. Results: Forty-one pharmacists (28 community, 13 hospital-based) across 15 Québec municipalities participated. Participants perceived their HIV knowledge as moderate (M=3.74/6). They held largely favorable attitudes towards providing HIV care (M=4.02/6). They reported a “little” involvement in the delivery of HIV care services (M=2.08/5), most often ART adherence counseling, refilling, and monitoring. The most common barriers reported to HIV care delivery were a lack of time, staff resources, clinical tools, and HIV information/training, with pharmacists at least somewhat agreeing that they experienced each (M≥4.00/6). On average, MARVIN-Pharma's acceptability and compatibility were in the ‘undecided’ range (M=4.34, M=4.13/7, respectively), while pharmacists agreed to their self-efficacy to use online health services (M=5.6/7). Conclusion: MARVIN-Pharma might help address pharmacists' knowledge gaps and barriers to HIV treatment and care, but pharmacist engagement in the chatbot’s development seems vital for its future uptake and usability.

Structured science summaries or research contributions using properties or dimensions beyond traditional keywords enhances science findability. Current methods, such as those used by the Open Research Knowledge Graph (ORKG), involve manually curating properties to describe research papers' contributions in a structured manner, but this is labor-intensive and inconsistent between the domain expert human curators. We propose using Large Language Models (LLMs) to automatically suggest these properties. However, it's essential to assess the readiness of LLMs like GPT-3.5, Llama 2, and Mistral for this task before application. Our study performs a comprehensive comparative analysis between ORKG's manually curated properties and those generated by the aforementioned state-of-the-art LLMs. We evaluate LLM performance through four unique perspectives: semantic alignment and deviation with ORKG properties, fine-grained properties mapping accuracy, SciNCL embeddings-based cosine similarity, and expert surveys comparing manual annotations with LLM outputs. These evaluations occur within a multidisciplinary science setting. Overall, LLMs show potential as recommendation systems for structuring science, but further finetuning is recommended to improve their alignment with scientific tasks and mimicry of human expertise.

Whilst prior works have characterised the affordances of prototyping methods in terms of generating knowledge about a product or process, the types, or ‘dimensions’ of knowledge towards which they contribute are not fully understood. In this paper we adapt the concept of ‘design domains’ as a method to interpret, and better understand the contributions of different prototyping methods to design knowledge in new product development. We first synthesise a set of ten dimensions for design knowledge from a review of literature in design-related fields. A study was then conducted in which participants from engineering backgrounds completed a Likert-type questionnaire to quantify the perceived contributions to design knowledge of 90 common prototyping methods against each dimension. We statistically analyse results to identify patterns in the knowledge contributions of different methods. Results reveal that methods exhibit significantly different contribution profiles, suggesting different methods to be suited to different knowledge generation. Thus, this paper indicates potential for new methods, methodology and processes to leverage such characterisations for better selection and sequencing of methods in the prototyping process.

Keywords: knowledge; behaviour; ergonomics; posture; musculoskeletal; pain; university; students; survey.

Conceptual distance refers to the degree of proximity between two concepts within a conceptualization. It is closely linked with semantic similarity and relationship, but its computation relies entirely on the context of the given concepts. The DIS-C algorithm, which requires using search algorithms such as Breadth First Search, represents an advance in computing the semantic similarity/relation regardless of the type of knowledge structure and semantic relationships. The shortest path algorithm facilitates the determination of the semantic closeness between two indirectly connected concepts in an ontology by propagating local distances. This process is implemented for each concept pair to establish the most effective and efficient paths to connect these concepts. The algorithm identifies the shortest path between the concepts, allowing for the inference of the most relevant relationships between them. This approach contributes to developing a comprehensive understanding of the ontology and enhances the accuracy and precision of the semantic representation of the concepts. However, one of the critical issues is associated with the computational complexity due to the nature of the algorithm, which is errorn3. This paper studies alternatives to accelerate the DIS-C based on approximation and optimized algorithms, focusing on Dijkstra, pruned Dijkstra, and Sketched-based algorithms to compute conceptual distance. Based on the experiments, we discovered that the bottleneck can be avoided using the proposed 2-hop coverages, bringing DIS-C almost linearity.

Wireless sensor networks (WSNs) are a critical research area with numerous practical applications. WSNs are utilized in real-life scenarios, including environmental monitoring, healthcare, industrial automation, smart homes, and agriculture. As WSNs advance and become more sophisticated, they offer limitless opportunities for innovative solutions in various fields. However, due to their unattended nature, it is essential to develop strategies to improve their performance without draining the battery power of the sensor nodes, which is their most valuable resource. This paper proposes a novel sink mobility model based on constructing a bipartite graph from a deployed wireless sensor network. Using the bipartite graph’s properties, the mobile sink node can visit stationary sensor nodes in an optimal way to collect data and transmit it to the base station. We evaluated the proposed approach through simulations using the NS-2 simulator to investigate the performance of wireless sensor networks when adopting this mobility model. Our results show that using the proposed approach can significantly enhance the performance of wireless sensor networks while conserving the energy of the sensor nodes.

Let G be a graph with n vertices and let 1; 2; : : : ; n be the eigenvalues of Randic matrix. The Randic Estrada index of G is REE(G) = Ón i=1 ei . In this paper, we establish lower and upper bounds for Randic index in terms of graph invariants such as the number of vertices and eigenvalues of graphs and improve some previously published lower bounds.

We compute explicitly traces of one-dimensional diffusion processes. The obtained trace forms can be regarded as Dirichlet forms on graphs. Then we discuss conditions ensuring the trace forms to be conservative. Finally, the obtained results are applied to the one-dimensional diffusion related to the Bessel’s process of order $\nu$.

In mathematics, one always aims to obtain new frameworks from specific ones. This also stratified to the regality of graphs, where one can produce numerous new graphs from a specific set of graphs. In this work we define some classes of pyramid graphs created by a gear graph and we derive straightforward formulas of the complexity of these graphs, using linear algebra matrix analysis techniques and employing knowledges of Chebyshev polynomials.

Topological indices are numerical parameters of a graph which characterize its topology and are usually graph invariant. In this paper, bounds for the Randić, general Randić, sum-connectivity, the general sum-connectivity and harmonic indices for tensor product of graphs are determined by using the combinatorial inequalities and combinatorial computing.