Power Electronic development determines introduction of nonlinear devices in Electric Power Systems. Introduction of nonlinear devices increase current harmonics in Transmission and Distribution Power Systems. Distribution transformers and feeders increase power losses and their nominal parameters are reduced. Present work introduces a procedure to evaluate maximum permissible load in single phase distribution transformers with massive introduction of a new type of nonlinear load which changes daily demand graphs.

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.

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.

While numerous studies have explored the correlation between the built environment and ride-hailing demand, few have assessed their nonlinear interplay. Utilizing ride-hailing order data and multi-source built environment data from Nanjing, China, this paper uses the machine learning method, eXtreme Gradient Boosting (XGBoost), combined with SHapley Additive exPlanations (SHAP) and Partial Dependence Plots (PDP) to investigate the impact of built environment factors on ride-hailing travel demand, including their non-linear and threshold effects. The findings reveal that dining facilities have the most significant impact, with a contribution rate of 30.75%, on predicting ride-hailing travel demand. Additionally, financial, corporate, and medical facilities also exert considerable influence. The built environment factors need to reach a certain threshold or within a certain range to maximize the impact of ride-hailing travel demand. population density, land use mix and distance to the subway station collectively influence ride-hailing demand. The results are helpful for TNCs to allocate network ride-hailing resources reasonably and effectively.

Excessive cell phone use contributes to distracted driving, may increase risk for automobile accidents, and a minority of mobile phone users exhibit behaviors consistent with technological addiction. The purpose of this study was to determine whether cell phone beliefs and behaviors could be changed by a brief educational encounter. The Theory of Reasoned Action provided a lens for viewing attitudes and behavior. A one-week pre-post design with a thirty-day follow-up was used with participants (N = 215, 67.0% female, age = 20.0 + 1.6) assigned to a peer led intervention or comparison groups. The intervention included cell-phone educational materials. A short index of cell phone behavior was developed which showed good internal consistency with a Cronbach’s alpha of .81. The intervention group “agreed” or “strongly-agreed” more than the comparison group on five of the seven areas of cell phone beliefs and behaviors ( p < 0.05, item Cohen’s d = .32 to .47, total d = .50) at one-week following receipt of informational materials. We conclude that attitudes and behaviors regarding cell phones are malleable and susceptible to change in young-adults following a brief psychoeducational intervention.

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.

Integrating photovoltaic (PV) systems plays a pivotal role in the global shift toward renewable energy, offering significant environmental benefits. In many instances, utility companies pay for both energy and peak demand. PV systems can effectively reduce energy consumption during their operational periods, while, their contribution during peak hours, particularly in the early morning and late evening, is often limited. To address this issue, battery storage systems are utilized for storing energy during off-peak hours and releasing it during peak times. However, finding the optimal size of PV-battery systems remains a challenge. This study proposes a novel statistical model to optimize PV-battery system sizing for enhanced peak demand reduction. The model aims to flatten 95% of peak demand days up to a certain demand threshold, ensuring consistent energy supply and financial benefit for utility companies. A straightforward and effective search methodology is employed to determine the optimal system sizes. Additionally, the model effectiveness is rigorously tested through a modified Monte Carlo simulation coupled with time series clustering to generate various scenarios to assess performance under different conditions. The results indicate that the optimal PV-battery system successfully flattens 95% of daily peak demand up to 2000 kW, yielding a financial benefit of $812,648 over 20 years.

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.

Heavy rains have created significant threats to human health and life. Floods and other natural disasters, which have a global impact annually, can be attributed to extended durations of intense precipitation. Accurate rainfall predictions are crucial in nations such as Bangladesh, where agriculture is the predominant occupation. The efficiency of machine learning (ML) methods is enhanced by the non-linearity of rainfall, surpassing the effectiveness of other alternative ways. Machine learning techniques show that individual classifiers exhibit worse accuracy than ensemble learning (EL) methodologies. Ensemble Learning techniques are utilized for rainfall prediction and estimating rainfall quantity and daily average temperature to enhance comprehension of the diverse Machine Learning algorithms. This research implements the machine learning techniques and ensemble-based classifier to predict the rainfall occurrence, along with the machine learning regressor models and ensemble-based regressor for the rainfall amount prediction and daily average temperature prediction, using Bangladesh Weather Dataset. The results of the machine learning and ensemble-based models are compared using the Accuracy and F1 score for rainfall occurrence prediction. In contrast, MAE and RMSE evaluation metrics are used for ensemble regressor and regression algorithms for the rainfall amount and daily average temperature prediction. With an accuracy of 83.41% and a recall of 78.17%, the Ensemble Classifier is the best at predicting when it will rain, but its precision of 51.16% stands in for the lowest. The Ensemble Regression model outperforms Linear Regression, Random Forest, and SVR in rainfall amount prediction, with the lowest MAE of 0.36 and RMSE of 0.90. The Ensemble Regression provides the most precise results for daily average temperature prediction with the lowest MAE 0.42 and RMSE 0.54 highlighting its superiority over the other regression models in forecasting temperature with less error. Ensemble approaches consistently lead task performance metrics.

Introduction: Hypertension is a serious public health problem in Morocco. The objective of this pilot study was to estimate the salt intake of Moroccan adults by measuring 24-hour urinary sodium excretion. Methods: 132 participants were recruited from the central region of Morocco. Sodium, potassium and creatinine levels were measured using the 24-hour urine samples. Additional data included anthropometric measurements and socio-demographic questionnaire. Results: The daily sodium, potassium and creatinine excretions were 2779.1±1334.9 mg, 1350.0±642.8 mg and 820.3 ± 381.2 mg, respectively. Data analysis revealed that 71.2% of the participants had a daily sodium intake more than 2000 mg (5g of salt) recommended by the WHO. The mean of potassium excretion was 1350.0±642.8 mg /day, this average was lower than 3.51g per day recommended by the WHO. Conclusion: Public health measures to reduce sodium and increase potassium consumption in order to decrease the population’s risk of high blood pressure and heart disease are recommended.

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

The past years have shown the widespread vulnerability of agro-food systems and rural diets to external perturbations such as wars, climate events, and pandemics. Experiencing numerous obstacles, Cuba constitutes an example of success in the transition to agroecological sustainability models. This article characterizes how processes of agricultural change, local development, and industrial degrowth have impacted food availability and dietary diversity among rural livelihoods in the municipality of Yaguajay, Sancti Spíritus, for the past forty years (1980s-2020s). It integrates findings from focus groups, repeated nutritional surveys, and interviews carried out between 2016 and 2022 among residents of the towns of Yaguajay and La Picadora. The goal is to identify effects and response strategies within agro-food systems of rural populations. Distinguishing between periods of abundance and shortage, our findings show two counterpoints: intensive sugar monocrop cultivation which resulted in high dietary variety; and economic crises in 1990s and during the last period of the pandemic, which have led to significant dietary adjustments. The article concludes underscoring the importance of comprehensive assessments of dietary strategies to elicit what agroecological transitions mean for local realities and of the value of food consumption and small-holder production experiences to understand the limits to sustainable transformations.

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.

Accurate demand forecasting plays a critical role in most furniture businesses’ operational, tactical, and strategic decisions, as the demand in the furniture business is considered seasonal and becomes more complex in crises. In this work, a neural network model using the Long Short-Term Memory (LSTM) method was developed to forecast the demand for specific product groups. LSTM is a leading deep learning model for time series prediction, particularly seasonal, multi-item, and non-linear situations. The developed model was used to predict the demand based on old data before the Covid-19 pandemic and recent data of the first months of the pandemic as a fast response to the crisis. In addition, a comparison study was conducted between the developed model and the traditional planning inventory used by furniture businesses that provided us with the data. The results showed that the Covid-19 pandemic significantly impacted demand forecasting. Also, the fast response to Covid-19 pandemic has slightly increased the model performance. Finally, the comparison study demonstrated that our model is robust and better than the traditional demand forecasting method. Therefore, the developed model may help the business improve inventory and production planning to create a more flexible supply chain.

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.

Various risks and uncertainties are strengthening the downside of the global economy. This paper aims to estimate the impact of US-China conflict and the WTO Appellate Body's shutdown on global logistics demand and to show the seriousness of the situation. Existing literature studies on protectionism or US-China trade conflict, with a focus on the effects of specific issues or impact on bilateral relations. No research has considered the adverse effects of the WTO Appellate Body's shutdown. This paper considers both US-China conflict and the installation of new NTBs in other countries due to weakened WTO function, and tries to suggest that the combination of tariffs and NTBs can severely reduce international trade and the demand for maritime logistics services, making this paper differs from previous studies. This paper suggests that a catastrophe could occur in global maritime logistics, based on quantitative estimates for the impact of global protectionism. Finally, underlining that the international trade order should not seriously be damaged, this paper proposes that countries around the world should seriously discuss this issue at the 12th WTO Trade Ministers' Meeting in Kazakhstan June 2020.

The study of precipitation amount at different time scales constitutes an important issue in climate research and risk assessment. When dealing with daily totals, a frequent but sometimes underestimated problem is at what time the observation day begins. The choice of different starting times may lead to incompatibility between stations and incorrect identification of extreme events. In this work, the problem of temporal misalignment between precipitation datasets characterized by different starting time of the observation day is analyzed. The most widely used adjustment methods (1day and uniform shift) and two methods based on reanalysis (NOAA and ERA5) are evaluated in terms of temporal alignment, precipitation statistics and percentile distributions. As test series, the precipitation amount collected from 9 a.m. local time (09 LT) on the previous day to 09 LT on the target day (9-9 datasets) of the Padua and nearby stations in the period 1993-2022 have been selected. Results show that the reanalysis-based methods, in particular ERA5, outperform the others in temporal alignment, regardless the station. But, for the periods in which reanalysis data are not available, “1day” method, which shifts the daily amount back one calendar day, and “unif” method, which distributes uniformly the daily total from a 2-day moving window surrounding the target date, can be considered valid alternatives. On the other side, concerning the precipitation statistics, the reanalysis-based methods are not the best option, as they increase the precipitation frequency and reduce the mean value over wet days, NOAA much more than ERA5. Nevertheless, the uniform method provides a larger deviation from the original daily series. The use of the series of a station nearby the target one, which is mandatory in case of missing data, gives similar or better results than applying any adjustment method to the 9-9 series. General conclusions can hardly be drawn as they depend on the method and station. For the Padua dataset, the analysis was repeated at monthly and seasonal resolution. In general, the adjustment series show the most relevant changes in the precipitation statistics in summer and less temporal alignment with the original series in summer and autumn, the two seasons mainly affected by heavy rains in Padua. Finally, the percentiles distribution, analyzed for all the methods and stations, indicates that any adjustment method underestimates the percentile values, except ERA5. Only Legnaro, the station most correlated with Padua, gives results like ERA5.

Neuroinflammation, defined as inflammatory reactions mediated by cytokines, chemokines, reactive oxygen species, and secondary messengers in the central nervous system (CNS) including the brain and spinal cord is the basis of many neurological disorders. Recently, erythropoietin (EPO) has been considered and studied as a modulator of neuroinflammation. On this article minireview of pathophysiology of neuroinflammation and the neuroprotective effects of EPO is discussed and a case of subacute huge subdural hematoma with double mydriasis operated urgently, treated with low daily dose (vs high dose once or twice a month in the literature) of EPO and recovered fully and discharged home with good consciousness is reported. In addition, the probable unfavorable outcome of erythropoietin administration in patients with neuroinflammation in COVID-19 is considered.

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.

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.

The performance of Integrated Multisatellite Retrievals for GPM (V06B-IMERG) is evaluated at subdaily and daily scale using 10 years of heavy precipitation over a region in the Western Med-iterranean for different temporal aggregations with a dense network of rain gauges. On a half-hourly scale, the contribution of passive microwave (PMW) and infrared (IR) sources in the satellite estimates was considered, as well as the relation of various microphysical properties of cloud tops using Cloud Microphysics (CMIC- NWC SAF) data. IMERG shows a marked tendency to underestimate precipitation compared to rain gauges as the rainfall intensity threshold and temporal resolution increases. Results indicate that the negative bias is weaker when retrievals are due to PMW data. On the other hand, the benefits of filling the PMW gaps of IMERG by including IR information come at the expense of increasing the bias. IMERG performs dramatically better in the presence of precipitating ice clouds compared to warm and mixed phase clouds, which seems to be related with microphysical properties such as cloud optical thickness and cloud top effective radius. This work contributes to the understanding of the factors affecting satellite estimates of extreme precipitation and their relationship with the microphysical characteristics of clouds, which generates added value for further downstream applications and users’ decision making.

Hybrid forecasting methods have emerged as a solution surpassing the limitations of both statistical and deep learning approaches. While the first emphasize the significance of variables, they often produce worse forecasting results when compared to newer techniques. In contrast, deep learning models remain enigmatic "black boxes" in terms of interpretability, although achieving better results in forecasting. This article introduces the Comprehensive Cross-Correlation and Lagged Linear Regression Deep Learning (CCLR-DL) framework, designed to harness the best of both approaches, enhancing forecasting accuracy while retaining model interpretability through a feature selection process. CCLR-DL blens cross-correlation analysis, lagged multiple linear regression and granger's causality procedures with deep learning architectures based on LSTM. In a practical demonstration, CCLR-DL was applied to a real database of clinical visits associated to diagnoses in Catalonia, Spain (tracking a population of 6.3 million patients during 10 years). Predicting visits enables the healthcare managers to be ready for future demand shifts. Results demonstrate a consistent and substantial improvement over standalone statistical and deep learning methods when predicting healthcare demand. This hybrid approach not only showcases its efficacy but also offers a promising solution to the challenge of balancing predictive accuracy with model explicability. In this context, this work aims to design and validate a method for feature selection and forecasting of multivariate high dimensional time series datasets not only to improve prediction accuracy but also to model transparency by identifying a subset of variables that improve predictions and G-cause the target variable.

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.

The Upper Hunter Valley is a major coal mining area in New South Wales (NSW), Australia. Due to the ongoing increase of mining activities, PM10 (air-borne particle with an aerodynamic diameter less than 10 micrometres) pollution has become a major air quality concern in local communities. The early part of this study identified two air quality subregions in the valley. This paper aims to provide a holistic summarisation of the relationships between elevated PM10 pollution in two subregions and the local- and synoptic-scale meteorological conditions for spring and summer, when PM10 pollution is relatively high. A catalogue of twelve synoptic types and a set of six local meteorological patterns have been quantitatively derived and linked to each other using the self-organising map (SOM) technique. The complex meteorology-air pollution relationships have been visualised/interpretated on the SOM planes for two representative locations. It was found that the influence of local meteorological patterns differed significantly for mean PM10 levels vs the occurrence of elevated pollution events and between air quality subregions. In contrast, synoptic types showed generally similar relationships with mean vs elevated PM10 pollution in the valley. Two local meteorological patterns, the hot-dry-northwesterly wind conditions and the hot-dry-calm conditions, were found most PM10 pollution conducive in the valley when combined with a set of synoptic counterparts. These synoptic types are featured with the influence of eastward migrating continental high pressure system and westerly troughs, or a ridge extending northwest towards coastal northern NSW or southern Queensland from the Tasman Sea. The method and results can be used in air quality research for other locations of NSW, or similar regions elsewhere.

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

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

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

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

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

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

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

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

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

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

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

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

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

In this paper, we consider a make-to-order supply chain which satisfies demand that is dependent on both price and quoted lead -time. The manufacturer chooses the lead -time and the order quantity, and the retailer sets the revenue shares. The interactions between the manufacturer and the retailer are modelled as a Nash Game, and the existence and uniqueness of pure strategy equilibrium are demonstrated. A mechanism that enables the supply chain to coordinate the decisions of the members is developed. Lastly, we also analyze how the supply chain system parameters impact the optimal supply chain decisions and the supply chain performance.

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.

Philippines as an archipelago and tropical country, which is situated near the Pacific ocean, faces uncertain rainfall intensities. This makes environmental, agricultural and economic systems affected by precipitation difficult to manage. Time series analysis of Philippine rainfall pattern has been previously done, but there is no study investigating its probability distribution. Modeling the Philippine rainfall using probability distributions is essential, especially in managing risks and designing insurance products. Here, daily and cumulative rainfall data (January 1961 - August 2016) from 28 PAGASA weather stations are fitted to probability distributions. Moreover, the fitted distributions are examined for invariance under subsets of the rainfall data set. We observe that the Gamma distribution is a suitable fit for the daily up to the ten-day cumulative rainfall data. Our results can be used in agriculture, especially in forecasting claims in weather index-based insurance.

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.

Global demand for sleep-tracking wearables, or consumer sleep technologies (CSTs), is steadily increasing. CST marketing campaigns often feature a scientific component, but the scientific relevancy and monetary value of CST features within the sleep research community remains unquantified. Sleep medicine experts were recruited through social media and nonprobability sampling techniques to complete a survey identifying sleep metrics and device features that are most desirable to the scientific community. A hypothetical purchase task (HPT) estimated economic valuation for devices with different features by price. Forty-six (N=46) respondents with an average of 10±6 years’ experience conducting research in real-world settings completed the online survey. Total sleep time was ranked as the most important measure of sleep followed by objective sleep quality while sleep architecture/depth and diagnostic information were ranked as least important. Experts preferred wrist-worn devices that could reliably determine sleep episodes as short as 20 minutes. Economic value was greater for hypothetical devices with longer battery life. These data set a precedent to determine how scientific relevance of a product impacts the potential market value of a CST device. This is the first known attempt to establish consensus opinion or economic valuation for scientifically-desirable CST features and metrics using expert elicitation.

In this short note, the described step-by-step derivations of the industrial energy demand function from the production function framework and provided researchers with two specifications. Then we applied these theoretical specifications to the time series data as empirical analysis. We concluded that theories should be considered at the beginning of the empirical analyses but the data also should be allowed to speak freely. Hence, the main suggestion of this short note is that it would be a better strategy to consider the combination of theory-driven and data-driven approaches in the empirical analyses.

Cyanobacteria (blue-green algae) may rapidly propagate under favorable conditions, forming dense blooms. As water blooms deteriorate, blue-green algae can generate potent toxins, potentially harmful to companion animals, wildlife, and even humans. One widely recognized cyanobacterial toxin is microcystin. This algal toxin has been implicated in surface waters globally, increasing liver cancer and/or disease risk amongst those who depend on sources prone to microcystin contamination. Interestingly, no study looked at weather conditions when connecting liver health outcomes to freshwater cyanotoxins. The purpose of this study was to determine if climate was an important determinant of liver mortality and total microcystins at the ecological level. Secondary data was used to evaluate the proposed hypothesis. Environmental data (CDC WONDER) and toxin data (USEPA) were used in multivariate regression analysis. Mean daily sunlight and total microcystins were significant predictors of age-adjusted chronic liver disease and cirrhosis death rates. Mean annual precipitation and mean daily max temperature were non-significant predictors. This study demonstrated how microcystins in combination with climate may increase liver mortality. The results can prompt others to study environmental exposures of terminal liver diseases, guiding environmental health and the water industry of human survival needs.

: Image guided superficial radiation therapy (IGSRT) combines superficial radiation therapy (SRT) with full dermal visualization (FDV) via high resolution dermal ultrasound (HRDUS) for the treatment of non-melanoma skin cancer (NMSC). The gold standard for IGSRT delivery includes a comprehensive cancer care model with support for the dermatologists by a multidisciplinary team. When delivered in this model, IGSRT can achieve cure rates of 99% for treatment of NMSC. This paper focuses on the benefits of IGSRT during therapy. Medical records from 7 dermatology clinics of 883 patients with 1,507 cases of NMSC treated with IGSRT be-tween 2017 and 2018 were retrospectively reviewed. 92% of the NMSC lesions showed daily depth fluctuations, 60.32% of lesions did not require changes during therapy, and nearly 40% of lesions required at least one compensatory change during therapy. 83% of NMSC lesions were labeled high-risk based on the 2024 NCCN guidelines. Increasing and decreasing tumor depth measurements during IGSRT inform dermatologists when adaptive changes in energy (kV), TDF and dose will result in more efficacy and less toxicity, respectively.

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.

This work investigates how to balance the electricity supply and demand in a carbon-neutral northern Europe. Applying a cost-minimizing electricity system model including options to invest in eleven different flexibility measures, cost-efficient combinations of strategies to manage varia-tions are identified. The results of the model are post-processed using a novel method to map the net load before and after flexibility measures are applied to reveal the contribution of each flexi-bility measure. The net load is mapped in the space spanned by the amplitude, duration, and number of occur-rences. The mapping shows that, depending on cost structure, flexibility measures contribute to reduce the net load in three different ways; 1) by reducing variations of long duration but low amplitude, 2) by reducing variations of high amplitude but short duration and low occurrence or 3) by reducing variations of high amplitude, short duration and high occurrence. It is found that cost-efficient variation management is achieved by combining wind and solar power and by combining strategies (1-3) to manage variations. The cost-efficient combination of strategies de-pends on electricity system context where electricity trade, flexible hydrogen and heat production (1) manage the majority of variations in regions with good conditions for wind power while sta-tionary batteries (3) are the main contributors in regions with good conditions for solar power.

Background: As the opioid epidemic continues, understanding the geospatial, temporal and demand patterns is important for policymakers to assign resources and interdict individual, organization, and country-level bad actors. Methods: GIS geospatial-temporal analysis and extreme-gradient boosted random forests evaluate ICD-10 F11 opioid-related admissions and admission rates using geospatial analysis, demand analysis, and explanatory models, respectively. The period of analysis was January 2016 through September 2018. Results: The analysis shows existing high opioid admissions in Chicago and New Jersey with emerging areas in Atlanta, Salt Lake City, Phoenix, and Las Vegas. High rates of admission (claims per 10,000 population) exist in the Appalachian area and on the Northeastern seaboard. Explanatory models suggest that hospital overall workload and financial variables might be used for allocating opioid-related treatment funds effectively. Gradient-boosted random forest models accounted for 87.8% of the variability of claims on blinded 20% test data. Conclusions: Based on the GIS analysis, opioid admissions appear to have spread geographically, while higher frequency rates are still found in some regions. Interdiction efforts require demand-analysis such as that provided in this study to allocate scarce resources for supply-side and demand-side interdiction: prevention, treatment, and enforcement. Based on GIS analysis, the opioid epidemic is likely to spread or diffuse through the country, and interdiction efforts require demand-analysis such as that provided in this study to allocate scarce resources for supply-side and demand-side interdiction: prevention, treatment, and enforcement.

This paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the Peak Demand Minimization problem and has been previously shown to be NP-hard. Our results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.

In this paper we develop a forecasting algorithm for recurrent patterns in consumer demand. We study this problem in two different settings: pull and push models. We discuss several features of the algorithm concerning sampling, periodic approximation, denoising and forecasting.

Introduction: In the recent years alternate day dosing has been recommended in iron deficieny treatment. The aim of this study is to compare the efficacy and side effects of oral iron treatments given daily 1x1, alternate day 1x1 and 2x1 alternate day dosing in iron deficieny anemia patients. Methods: A total of 52 patients with a diagnosis of iron deficiency anemia with serum ferritin level of 25 µg/L or less were included in this retrospective study. Statistical analyzes were done with SPSS V.25. Results: The patients included in our study were between the ages of 18-51. All of the patients included in the study were female. A statistically significant increase was found between 0-14 days(p<0.001), 14-28 days(p<0.001) and 0-28 days(p<0.001) hemoglobin values in all patients. There was no statistically significant difference between 0-14 days (p=0.397) and 0-28 days(p=0.310) ferritin values in all patients. A statistically significant difference was found between 14-28 days(p<0.001) ferritin values. When the rate of change of hemoglobin and ferritin values between the groups was compared and no statistically significant difference was observed between the groups. The rate of change of ferritin values for 14-28 days was significant (p=0.012). There was no significant difference in the frequency of symptoms in the 14th day and 28th day controls for each group (p>0.05). The incidence of metallic taste and bloating symptoms was found to be statistically significant in the third control in the group with 2x1 drug use alternate day (p=0.094). Discussion: The only difference in efficacy was observed in ferritin values between 14th and 28th days. The increase in ferritin values was higher in the group that used 1x1 oral iron every day. However, since no difference was observed between the groups in terms of ferritin and hemoglobin values on days 0 and 28, all three groups were considered equally efficient. Side effects were mainly gastrointestinal side effects. Since the group that received 2x1 oral treatment alternate day had a statistically significantly higher rate of side effects, the patients’ treatment tolerance will be lower compared to the other groups. In conlusion, there is no difference in efficacy and side effects between the patient groups receiving 1x1 daily and 1x1 alternate day oral iron therapy, so 1x1 use alternate day is the most appropriate treatment method for oral iron therapy in terms of patient tolerance, adherence to treatment and pharmacoeconomics.

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.

This article provides a comprehensive analysis of the global gas and liquefied natural gas (LNG) markets. The article begins by discussing the increasing demand for gas and LNG, particularly in Asia, as countries aim to transition to cleaner sources of energy. It explores how market volatility has led to energy security interventions and lasting economic and emissions impacts. It then explores the global supply and demand dynamics, highlighting the structural change expected in the market and the competition between Europe and Asia for limited new LNG supply. The article also focuses on Europe's increased flexibility and dependence on LNG imports, which have risen by 60% to 121 million tonnes, offsetting lower Russian pipeline imports. Furthermore, the article delves into global supply and demand dynamics, how the market is expected to remain tight, and how record gas and LNG prices have led to demand reductions. Additionally, it analyzes the future outlook and investment needs, highlighting the continued uptake of gas in heavy-duty transport and the need for further investment to avoid a supply-demand gap. The article concludes with an analysis of the implications for the future of the global gas and LNG markets.

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.

The kidney and the heart work together in balancing the body circulation and although their physiology is based on strict inter dependence, their performance fulfills different aims. While the heart can rapidly increase its own oxygen consumption to comply with the wide changes in metabolic demand linked to body function, the kidney physiology is primarily designed to maintain a stable metabolic rate and has limited capacity to cope with any steep increase in renal metabolism. In the kidneys the glomerular population filters a large amount of blood and the tubular system has been programmed to reabsorb 99% of filtrate by reabsorbing sodium together with other filtered substances including all glucose molecules. Glucose reabsorption involves the sodium-glucose cotransporters SGLT2 and SGLT1 on the apical membrane in the proximal tubular section; it also enhances bicarbonate formation so as to preserve the acid-base balance. The complex work of reabsorption in the kidney is the main factor in renal oxygen consumption; analysis of renal glucose transport in disease states is providing better understanding of the renal physiology changes that occur when clinical conditions alter the neurohormonal response leading to an increase in glomerular filtration pressure. In this circumstance glomerular hyperfiltration occurs, imposing a higher metabolic demand on kidney physiology and causing progressive renal impairment. Albumin urination is the warning signal of renal engagement over-exertion and most frequently heralds heart failure development, regardless of disease etiology. The review analyzes the mechanisms linked to renal oxygen consumption, focusing on sodium-glucose management.

Cold chain logistics of Agricultural Products demand forecasting can provide the scientific basis for the country to formulate logistics strategy, which further promotes the development of social economy and the improvement of living standards in China. In this paper, a new mathematical combined model is proposed to Agricultural Products Demand. Shandong, one of a China’s province, serves as the main producer and distributor of agricultural products. Based on the index system created from multiple related factors influencing cold chain logistics demand of agricultural products in Shandong, this paper employs principal component analysis to reduce the dimension of various indexes and predicts principal components with time series. Thereafter, multiple linear regression model and neural network model were constructed to forecast the cold chain logistics demand of agricultural products in Shandong, and their combined forecast models were compared. What's more, the paper provides insight for reference and decision-making concerning the development of cold chain logistics industry of agricultural products in Shandong province.

The case for demand-driven research and development has received important considerations among governments, donors and programme implementing partners in development planning and implementation. Addressing demand is believed to be a bottom-top approach for designing and responding to development priorities and is good for achieving development outcomes. In this paper, we discuss the concept and application of demand driven research for development (DDRD) in Africa. We use evidence of six projects implemented under the BiomassWeb Project in Africa. We focus on parameters on level of engagement of stakeholders - whose demand is being articulated, the processes for demand articulation, capacity building and implementation processes, innovativeness of the project, reporting and sustainability of the project. We find that the nature of the institutions involved in articulation and implementation of demand-driven research and development projects and their partnerships influence the impact and reporting of demand-driven projects.

PM-Gati-Shakti Initiative, integration of ministries, including railways, ports, waterways, logistic infrastructure, mass transport, airports, and roads. Aimed at enhancing connectivity and bolstering the competitiveness of Indian businesses, the initiative focuses on six pivotal pillars known as "Connectivity for Productivity": comprehensiveness, prioritization, optimization, synchronization, analytical, and dynamic. In this study, we explore the application of these pillars to address the problem of "Maximum Demand Forecasting in Delhi." Electricity forecasting plays a very significant role in the power grid as it is required to maintain a balance between supply and load demand at all times, to provide a quality electricity supply, for Financial planning, generation reserve, and many more. Forecasting helps not only in Production Planning but also in Scheduling like Import / Export which is very often in India and mostly required by the rural areas and North Eastern Regions of India. As Electrical Forecasting includes many factors which cannot be detected by the models out there, We use Classical Forecasting Techniques to extract the seasonal patterns from the daily data of Maximum Demand for the Union Territory Delhi. This research contributes to the power supply industry by helping to reduce the occurrence of disasters such as blackouts, power cuts, and increased tariffs imposed by regulatory commissions. The forecasting techniques can also help in reducing OD and UD of Power for different regions. We use the Data provided by a department from the Ministry of Power and use different forecast models including Seasonal forecasts for daily data.

This study purposes the use of plug-in electric vehicles for demand side management (DSM) considering uncertainties in demand as well as uncertainties due to mobility of PEV to mitigate peak demand. The solution also seeks to reduce electric cost in addition to reducing the effects of greenhouse gases. In recent years DSM using distributed storage system such as battery energy management system (BESS) and plugged-in electric vehicles (PEV) have become very prevalent with most implementations resorting to deterministic load forecast. These methods do not consider the potential growth in demand making their solutions less robust. In this study we propose a real-time density demand forecast and stochastic optimization for robust operation of PEV for a building. This method accounts for demand uncertainties in addition to uncertainties in mobile energy storage as found in PEV, making the resulting solution robust as compared to the deterministic case. A case study on a real site in South Korea is used for verification and testing. The proposed study is verified and tested against existing algorithms. The result verifies the effectiveness of the proposed approach

A Demand-side management technique are deployed along with battery energy-storage systems (BESSs) to lower the electricity cost by mitigating the peak load of a building. Most of the existing methods rely on manual operation of the BESS, or even an elaborate building energy-management system resorting to a deterministic method that is susceptible to unforeseen growth in demand. In this study we propose a real-time optimal operating strategy for BESS based on density demand forecast and stochastic optimization. This method takes into consideration uncertainties in demand when accounting for an optimal BESS schedule, making it robust compared to the deterministic case. The proposed method is verified and tested against existing algorithms. Data obtained from a real site in South Korea is used for verification and testing. The results show that the proposed method is effective, even for the cases where the forecasted demand deviates from the observed demand

The primary attraction of IaaS is providing elastic resources on demand. It becomes imperative that IaaS-users have an effective methodology for learning what resources they require, how many resources and for how long they need. However, the heterogeneity of resources, the diversity resource demands of different cloud applications and the variation of application-user behaviors pose IaaS-users big challenge. In this paper, we purpose a unified resource demand forecasting model suiting for different applications, various resources and diverse time-varying workload patterns. With the model, taking input from parameterized applications, resources and workload scenarios, the corresponding resources demands during any time interval can be deduced as output. The experiments configure concrete functions and parameters to help understanding the above model.

Copper demand for a country's copper industry has a greater pull effect. China's copper consumption in 2015 has accounted for 50% of the world. The scientific forecast of China's copper demands trend is also an important basis for analyzing its future environmental impact. This paper assumes that China's economy will be developing high, medium and low scenarios, and forecasts economic and social indicators such as total GDP, population and per capita GDP in China from 2016 to 2030. Then, predicted the demand of copper resources in China from 2016 to 2030 by the combination of system dynamics model, vector autoregressive moving average model and inverted U-type empirical model. The results show that: (1) in 2020, 2025 and 2030, China's refined copper demand will be 13 Mt, 15 Mt and 15.5 Mt. (2) China's copper demand growth slowed down significantly from 2016-2030. (3) 2025-2030, China's copper resource demand is stable, into the platform of demand growth, the highest peak value in 2027 will be 15.5 Mt. (4) 2030 years later, China's copper resource demand will enter a slow decline.

The present study investigates the relationship between the transmission of COVID-19 infections and climate indicators in Dhaka City, Bangladesh, using coronavirus infections data available from the Institute of Epidemiology, Disease Control and Research (IEDCR), Bangladesh. The Spearman-ranked correlation test was carried out to study the association of seven climate indicators, including humidity, air quality, minimum temperature, precipitation, maximum temperature, mean temperature and wind speed with the COVID-19 outbreak in Dhaka City, Bangladesh. The study found that, among the seven indicators, only three indicators (air quality, minimum temperature and average temperature) have a significant relationship with new COVID-19 cases. The results of this paper will give health regulators and policymakers valuable information to lessen the COVID-19 infection in Dhaka and other countries around the world.

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.

The ASCE-EWRI reference evapotranspiration (ETo) equation is recommended as a standardized method for reference crop ETo estimation. However, various climate data as input variables to the standardized ETo method are considered limiting factors in most cases and restrict the ETo estimation. This paper assessed the potential of different machine learning (ML) models for ETo estimation using limited meteorological data. The ML models used to estimate daily ETo included Gene Expression Programming (GEP), Support Vector Machine (SVM), Multiple Linear Regression (LR), and Random Forest (RF). Three input combinations of daily maximum and minimum temperature (Tmax and Tmin), wind speed (W) with Tmax and Tmin, and solar radiation (Rs) with Tmax and Tmin were considered using meteorological data during 2003–2016 from six weather stations in the Red River Valley. To understand the performance of the applied models with the various combinations, station, and yearly based tests were assessed with local and spatial approaches. Considering the local and spatial approaches analysis, the LR and RF models illustrated the lowest rate of improvement compared to GEP and SVM. The spatial RF and SVM approaches showed the lowest and highest values of the scatter index as 0.333 and 0.457, respectively. As a result, the radiation-based combination and the RF model showed the best performance with higher accuracy for all stations either locally or spatially, and the spatial SVM and GEP illustrated the lowest performance among models and approaches.

In the context of carbon neutrality and carbon peaking, in order to achieve low carbon emissions and promote the efficient utilization of wind energy, hydrogen energy as an important energy carrier is proposed to mix hydrogen and natural gas to form hydrogen enriched compressed natu-ral gas (HCNG). It is also injected into the natural gas pipeline network to realize the transmission and utilization of hydrogen energy. At the same time, the participation of demand response is considered, the load peak and trough period is adjusted, and large-scale consumption of renewa-ble energy and the reduction of carbon emissions are realized. First of all, a fine model of hydro-gen production and hydrogen use equipment is established to analyze the impact of adding hy-drogen mixing on the economy and low-carbon of the system. With green certificates and demand response, the utilization rate of hydrogen energy is improved to further explore the energy utiliza-tion rate and emission reduction capacity of the system. Secondly, on the basis of modeling, the optimal scheduling strategy is proposed with the sum of energy purchase cost, equipment opera-tion cost, carbon emission cost, wind curtailment cost and green certificate income as the lowest objective function. Considering the constraints such as hydrogen blending ratio and flexible load ratio of the pipeline network, a low-carbon economic scheduling model of hydrogen mixed natu-ral gas was established. The model was linearized and solved by using MATLAB and CPLEX solver. By comparing different scenarios, the superiority of the model and the effectiveness of the strategy are verified.

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.

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.

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.

Periodontal disease is one of the most common conditions affecting dogs worldwide and is reported to be particularly prevalent in racing greyhounds. A range of potential risk factors have been hypothesised. Previous research has suggested, regular tooth brushing can reduce both calculus and gingivitis, but the frequency required is unclear. Here, we report a controlled blinded in-situ in which kennel staff brushed 160 racing greyhounds’ teeth (living at six kennel establishments), either weekly, daily or never over two-month period. All visible teeth were scored for calculus and gingivitis, using previously validated scales. We calculated average scores for each of three teeth groups and overall averaging the teeth groups. Changes were compared to baseline. After two months, the total calculus scores (controlling for baseline) were significantly different in the three treatemnet groups, (F(2,129) = 10.76, p&lt;0.001) with both weekly and daily brushing resulting in significant reductions. Gingivitis was also significantly different (F(2,128) = 4.57, p=0.012), but in this case, only daily brushing resulted in a significant reduction. Although dogs in different kennels varied significantly in their levels of both calculus (F(5,129) =8.64, p&lt;0.001), and gingivitis (F(5,128)=3.51 p=0.005), the intervention was generally similarly effective in all establishments. Teeth groups varied and incisors were not significantly affected by treatment. Since trainers implementing the routine, reported minimal time commitment and positive experiences, we suggest that daily brushing is recommended for racing greyhounds, and that demonstrations should include attention to all teeth groups including incisors. Similar trials need to be conducted with retired greyhounds since these have been shown to present particularly high levels of periodontal disease.

: This study aimed to validate the effects of self-compassion-based forest healing therapy as an intervention for reducing stress and promoting coping resources. Therefore, we investigated the effects of self-compassion-based forest healing therapy on stress, self-compassion, and connectedness to nature. A total of 30 participants were divided into an experimental and control group. Two sessions of forest healing meditation activities were held at the Forest of Healing every two weeks between October and November 2023. As a repeated measures experiment, data were collected before the intervention, after the first intervention, and after the second intervention. Perceived stress, positive and negative affect, and salivary cortisol were measured to assess physiological and psychological stress in participants. Connectedness to nature and self-compassion were measured to evaluate stress-coping resources. The results showed that the forest healing program had significant positive effects on stress and emotional states in the experimental group after the intervention. Further, there was a significant incremental effect on connectedness to nature and self-compassion in the experimental group. Therefore, self-compassion meditation-based forest healing therapy is a feasible and efficient approach for facilitating stress management and coping resource building.

This study explores the relationship between mental and physical therapeutic through three dimensions: man-environment relationships; a sense of place and symbolic landscapes. The study used a combination of qualitative and quantitative research methods. Local residents living in the coastal area of Xinglin Bay are the research objects. Quantitative data analysis revealed that the frequency of residents' visits was an important variable affecting their physical and treatment perceptions. In addition, the significance is higher for females than for males. The text analysis shows that the environment, especially the ecological restoration of water quality and migratory birds, is of great significance to the identity of local residents. Daily activities contribute to a sense of place and are what make the coast a place of therapeutic landscape function.

The intrinsic non-linearity and complexity of suspended sediment dynamics, which are impacted by the geographical variability of basin parameters and temporal climatic patterns, make it difficult to estimate suspended sediment concentration (SSC) accurately in hydrological processes. Deep neural networks (DNNs), a cutting-edge modeling method that can capture the innate non-linearity in hydrological systems, have emerged as a solution to this problem. Using primary data on discharge, SSC, and turbidity, the long short-term memory method of DNNs was employed in this study to simulate the discharge-suspended sediment connection for the Esopus Creek, NY, USA as the first objective. To develop effective modeling strategies, multiple scenarios of feature selection, including combinations of discharge, turbidity and SSC for preceding days, were considered. Secondly, the variations in SSC and discharge between the three USGS gages along Esopus Creek that were upper stream, lower stream, and downstream, adjacent to the pourpoint were analyzed. Statistical metrics and scenarios of feature importance were used to evaluate the effectiveness of the DNN-based models. The study shows that among 24 DNN approaches feature selection is crucial in simulating the daily SSC, and discharge and presenting novel research directions for utilizing machine learning algorithms in water quality.

To address the question whether there is evidence that drinking water in general or mineral water in particular is effective in preventing diabetes; we performed a literature search of randomized controlled trials (PubMed). The search resulted in very few trials (N = 9) investigating this topic: one trial investigates the effect of increasing water consumption on glycemic control in diabetic patients; two trials investigate the effect of drinking water with a meal in diabetic patients; while six trials compare the effect of mineral rich water with that of low mineralized water on glucose metabolism in healthy subjects. There is evidence that increasing water consumption can improve glucose metabolism and randomized controlled trials with mineral water suggest that waters containing relevant amounts of magnesium can exert an additional effect. The role of bicarbonate; which is present in all the mineral waters used in the trials; will be discussed. Future research needs to investigate the effect of mineral water in prediabetic individuals or individuals with impaired glycemic control.

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

In this paper we compare the effects of forecasting demand using individual (disaggregated) components versus first aggregating the components either fully or into several clusters. Demand streams are assumed to follow autoregressive moving average (ARMA) processes. Using individual demand streams will always lead to a superior forecast compared to any aggregates, however we show that if several aggregated clusters are formed in a structured manner then these subaggregated clusters will lead to a forecast with minimal increase in mean-squared forecast error. We show this result based on theoretical MSFE obtained directly from the models generating the clusters as well as estimated MSFE obtained directly from simulated demand observations. We suggest a pivot-algorithm, that we call Pivot Clustering, to create these clusters. We also provide theoretical results to investigate sub-aggregation, including for special cases such as, aggregating MA(1) streams and ARMA streams with similar or same parameters.

Energy demand forecasting is a fundamental aspect of modern energy management. It impacts resource planning, economic stability, environmental sustainability, and energy security. This importance is making it critical for countries worldwide, particularly in cases like Türkiye, where the energy dependency ratio is notably high. The goal of this study is to propose ensemble machine learning methods such as boosting, bagging, blending, and stacking with hyperparameter tuning and k-fold cross-validation, and investigate the application of these methods for predicting Türkiye's energy demand. This study utilizes population, GDP per capita, imports and exports as input parameters based on historical data from 1979 to 2021 in Türkiye. Eleven combinations of all predictor variables were analyzed, and the best one was selected. It was observed that a very high correlation exists among population, GDP, imports, exports, and energy demand. In the first phase, the preliminary performance was investigated of 19 different machine learning algorithms using 5-fold cross-validation and measured their performance using five different metrics: MSE, RMSE, MAE, R-squared, and MAPE. Secondly, ensemble models were constructed by utilizing individual machine learning algorithms, and the performance of these ensemble models was compared with both each other and the best-performing individual machine learning algorithm. The analysis of the results revealed that placing Ridge as the meta-learner and using ET, RF and Ridge as the base learners in the stacking ensemble model produced superior results compared to the other models across performance metrics. It is anticipated that the findings of this research can be applied globally and prove valuable for energy policy planning in any country. The results obtained not only highlight the accuracy and effectiveness of our predictive model but also underscore the broader implications of this study within the framework of the United Nations' Sustainable Development Goals (SDGs).

The growing number of the accessed energy-efficient frequency conversion air conditioners is likely to generate a large number of harmonics on the power grid. The following shortage in the reactive power of peak load may trigger voltage collapse. Hence, this conflicts with people’s expectations for a cozy environment. Concerning the problems mentioned above, an active management scheme is put forward to balance the electricity use and the normal operation of air conditioning systems. To be specific, schemes to suppress the low voltage ride through (LVRT) and harmonic are designed firstly. Then to deaden the adverse effects caused by nonlinear group load running on the grid, and to prevent the unexpected accidents engendered from grid malfunction, the dynamic sensing information obtained by an online monitor is analyzed, which can be seen as an actively supervise mechanism. The combined application of active and passive filtering technology is studied as well. Thirdly, the new energy storage is accessed reliably to cope with peak-cutting or grid breaking emergencies, and the fuzzy control algorithm is researched. Finally, system feasibility is verified by functional modules co-operation simulation, and active management target is achieved under scientific and reasonable state-of-charge (SOC) management strategy.