Physical symptoms are defined as symptoms for which adequate examination does not reveal a sufficient underlying root cause, e.g., pain and fatigue. The extant literature of the neurobiological underpinnings of physical symptoms has been largely inconsistent and primarily consists of (clinical) case-control studies with relatively small samples sizes. Therefore, we studied the association of brain morphology with physical symptoms in pre-adolescents from two independent and population-based cohorts. This study included 2,683 individuals from the Generation R Study (51% girls, 10.1 ± 0.6 years old) and 10,567 pre-adolescents from the ABCD Study (48% girls, 9.9 ± 0.6 years old). High- resolution structural magnetic resonance imaging (MRI) was collected using 3-Tesla MRI systems. Physical symptoms were evaluated using the somatic complaints syndrome scale from the parent-reported school-age version of the Child Behavior Checklist. Linear regression models were fitted for global brain metrics (i.e., cortical and subcortical grey matter volume and total white matter volume) as well as surface-based vertex-wise measures (surface area and cortical thickness). Analyses were initially conducted separately in each cohort and later meta-analysed. No associations were observed in either cohort separately. In the combined vertex-wise meta-analysis of both cohorts; the right hemisphere surface area, most notably the rostral middle frontal gyrus, superior frontal gyrus and anterior cingulate cortex, were related to physical symptoms after correcting for multiple comparisons (cluster area = 1,882 mm2). The present study, which is the most representative and well-powered to date, suggests that surface area, but not other measures of brain morphology, are modestly related to physical symptoms in pre- adolescents. While these effects are subtle, future longitudinal research is warranted to elucidate whether such associations indicate a cause or a consequence of the physical symptoms.

A novel domination invariant defined by Boutrig and Chellali in the recent: total vertex-edge domination. In this paper we obtain an improved upper bound of total vertex edge-domination number of a tree. If is a connected tree with order , then with and we characterize the trees attaining this upper bound. Furthermore we provide a characterization of trees with

In recent years, researchers have paid increasing attention on hyperspectral image (HSI) classification using deep learning methods. To improve the accuracy and reduce the training samples, we propose a double-branch dual-attention mechanism network (DBDA) for HSI classification in this paper. Two branches are designed in DBDA to capture plenty of spectral and spatial features contained in HSI. Furthermore, a channel attention block and a spatial attention block are applied to these two branches respectively, which enables DBDA to refine and optimize the extracted feature maps. A series of experiments on four hyperspectral datasets show that the proposed framework has superior performance to the state-of-the-art algorithm, especially when the training samples are signally lacking.

This study investigates the impact of governance variables on the earnings quality based on the industry the firm is in. it has been identified that earnings management have been practised differently by different industries. Most of the research under earnings management have focussed on holistic impacts of corporate governance variables on discretionary accruals while this study has categorised the firms based on what industry they fall on while identifying the impacts of the variables of corporate governance on discretionary accruals. Initially, this paper has studied the estimation of the value of discretionary accruals and identified that performance matched discretionary accruals as the best model as per the explanatory power of the model is higher than other models. Hence, the estimation of the earnings management has been calculated based on performance matched discretionary accruals in this research. This research has studied the impacts of the governance attributes on the earnings management categorising the firms based on the industry they are in; hence, the value of earnings management has been categorically separated; hereafter, the impact of the corporate governance factors on the value of categorically separated earnings management have been statistically analysed. This study has considered the descriptive study to compare the means, medians and standard deviations of the earnings management of various industries. Moreover, Pearson correlations and Spearman rank correlation have been used as a research tool to examine the correlation coefficients.

Constructing new graph from the graph's parameters and related notions in the way that, the study on the new graph and old graph in their parameters could be facilitated. As graph, new graph has some characteristics and results which are related to the structure of this graph. For this purpose, regular graph is considered so the internal relation and external relation on this new graph are studied. The kind of having same number of edges when this number is originated by common number of graphs like maximum degree, minimum degree, domination number, coloring number and clique number, is founded in the word of having regular graph

The Cohen-Macaulay vertex splittable ideals are characterized. As a consequence, we recover several Cohen-Macaulay classifications of families of monomial ideals known in the literature by new simpler combinatorial proofs.

Sombor index was recently defined in 2021 as a new vertex degree based topological index by Gutman and has received great attention of mathematicians and chemists. In this work, we determine how much the Sombor index is effected when we delete a vertex or an edge from a graph. Using the formulae obtained here successively, one can calculate the Sombor indices of large graphs by means of Sombor indices of smaller graphs which are obtained by deletion of vertices or edges.

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 connected vertex cover (CVC) problem is a variant of the vertex cover problem, which has many important applications, such as wireless network design, routing and wavelength assignment problem, etc. A good algorithm for the problem can help us improve engineering efficiency, cost savings and resources in industrial applications. In this work, we present an efficient algorithm GRASP-CVC (Greedy Randomized Adaptive Search Procedure for Connected Vertex Cover) for CVC in general graphs. The algorithm has two main phases, i.e., construction phase and local search phase. To construct a high quality feasible initial solution, we design a greedy function and a restricted candidate list in the construction phase. The configuration checking strategy is adopted to decrease the cycling problem in the local search phase. The experimental results demonstrate that GRASP-CVC is competitive with the other competitive algorithm, which validate the effectivity and efficiency of our GRASP-CVC solver.

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.

ICT and digital technology adoption, sustainable development, community empowerment and local wisdom and destinations uniqueness are keywords that will be further explored in the de-velopment of tourism villages in Kenderan as the most importance of tourism destinations de-velopment from the village level. Therefor this research is aimed at developing suitable model for post smart or wise tourism village through proposing Culture and Tradition Festival and the application of a circular economy. Circular economy development in tourism villages focuses on the application of sustainable production principles in the tourism value chain, namely in creating tourism experiences together with tourists (co-creation of experience) and integrated in a tourism system that supports environmental sustainability. This research is applied research conducted with a sequential mixed method research by conducting qualitative research through expert judgment and quantitative research by circulating questionnaire to tourists visiting Kenderan village, while the collected data is analyzed by Structural Equation Modelling to see the rela-tionship between variables. The results of this research show that creative event as the locality aspects of tourist village, digital competence, and sustainability practice are the building blocks of post smart tourism village, while digital competence and sustainable practice have significant mediating effect of locality on post smart tourism village. To make tourism village possesses sustainable competitive advantages, the village must explore and promote its locality aspects to differentiate its tourist village by identifying the valuable, rare, inimitable and non-substitutable tourism resources. The implication of this research is that to develop smart tourism destination wiser and distinctive, tourist village should explore their local values and resources, embed them into its tourism basic components and core resources, and co create, distribute, deliver and promote it to global market through technology adoption and global sustainability value.

The role of fractional calculus in circuit systems has received increased attention in recent years. In order to evaluate the effectiveness of time-domain calculation methods in the analysis of fractional-order piecewise smooth circuit systems, an experimental prototype is developed and the effects of three typical calculation methods in different test scenarios are compared and studied in this paper. It is proved that Oustaloup’s rational approximation method usually overestimates the peak-to-peak current and brings in pulse-voltage phenomenon in piecewise smooth test scenarios, while the results of two iterative recurrence-form numerical methods are in good agreement with the experimental results. The study results are dedicated to provide a reference for efficiently deploying calculation methods in fractional-order piecewise smooth circuit systems. Some quantitative analysis results are concluded in this paper.

Breast cancer (BC) is a heterogeneous disease representing a substantial economic burden. In order to develop policies that successfully decrease this burden, the factors affecting costs need to be fully understood. Evidence suggests that early detection in Stage I has a lower cost than late detection. We aim to provide conservative estimates of BC's stage-wise medical costs from German healthcare and the payer's perspective. To this end, we conducted a literature review of articles evaluating stage-wise costs of BC in Germany through PubMed, Web of Science, and Econ Lit databases supplemented by Google Scholar. We developed a decision tree model to estimate BC related medical costs in Germany using available treatment and cost information. The review generated seven studies; none estimated the stage-wise costs of BC. The studies were classified into two groups: (1) case scenarios (five studies) and two studies based on administrative data. The first sickness funds data study (Gruber, Stock, et al. 2012) used 1999 information to approach BC attributable cost; their results suggest a range between €3,929 and €11,787 depending on age. The second study (Kreis, Plöthner, et al. 2020) used 2011-2014 data and suggested an initial phase incremental cost of €21,499, an intermediate phase cost of €2,620, and a terminal phase cost of €34,513 per incident case. Our decision tree model based BC stage-wise cost estimates were €21,523 for Stage I, €25,679 for Stage II, €30,156 for Stage III, €42,086 for Stage IV. Alternatively, the modeled cost estimates are €20,284 for the initial phase of care, €851 for the intermediate phase of care, and €34,963 for the terminal phase of care. Our estimates for phases of care are consistent with recent German estimates provided by Kreis and Plöthner et al. Furthermore, the data collected by sickness funds are collected primarily for reimbursement purposes, where the German ICD-10 classification system defines a cancer diagnosis. As a result, claims data lack the clinical information necessary to understand stage-wise BC costs. Our model-based estimates fill the gap and inform future economic evaluations of BC interventions.

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.

Defect detection plays a pivotal role in quality control for fabrics. In order to enhance the accuracy and efficiency of fabric defect detection, we have proposed the PRC-Light YOLO model for fabric defect detection and have established a detection system. Firstly, we add new convolution operators in Backbone for the YOLOv7 and integrate them with Extended-Efficient Layer Aggregation Network. This combination constructs a new feature extraction module that not only reduces the computational effort of the network model, but also extracts spatial features effectively. Secondly, we employ multi-branch dilated convolutions feature pyramid, and introduce lightweight upsampling operators to improve performance of the feature fusion network. This module achieves an expanded receptive field by generating real-time adaptive convolution kernels, allowing for the collection of crucial information from regions with a richer contextual context. To further minimize the computation during network model training, we adopt the HardSwish activation function. Finally, we apply the Wise-IOU v3 bounding box loss function as a dynamic non-monotonic focusing mechanism, which decreases adverse gradients from low-quality instances. We conduct data augmentation on real fabric dataset to raise the generalization capability of the PRC-Light YOLO model. Compared with the YOLOv7 model, numerous simulation experiments show that our proposed methods reduce the model’s parameters and computation by 18.03% and 20.53%, respectively. Simultaneously, there has been a 7.6% improvement in mAP.

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.

Influence of core flow inlet swirl angle on aerodynamic performances of an exhaust nozzle with scarfed lobed mixer was studied by the validated computational approach. The computational simulation was conducted by resolving the steady form of discretized three-dimensional Reynolds Averaged Navier-Stokes equations with the shear stress transport k-Ω turbulence model. Simulation results depict that swirling motions have ignorable influence on the flow field of the top part in the cross sections slightly downstream of the lobed trailing edge. Besides, for the flow field downstream of the L/D=0.1 cross section, the swirling motions are suggested to cause the clockwise stream-wise vortex to stretch into several smaller-scale vortexes. When the case with a bigger swirling angle is investigated, the induced smaller-scale vortexes are more strengthened by the swirling motions. Concerning the 15° swirling case, the loss caused by the destroyed vortex pattern and the benefit induced by the improved smaller-scale vortexes almost counteract with each other with respect to the thermal mixing efficiency. In the last studied cross section as compared with the baseline case, the case with a maximum swirling angle of 30° has increased 6.94% for the thermal mixing efficiency and decreased 0.42% for the total pressure recovery coefficient.

Topological indices are invariant numerical fields of a graph that give facts about the structure of graphs and are found to be very helpful in predicting the physical properties of aluminophosphates. The characteristics of the aluminophosphates are similar to those of zeolites. Two examples of current applications are natural gas dehydration and humidity sensor. New frameworks are being synthesised by researchers in chemistry and materials science. There are many layers and holes in these substances. In this study, Vertex version of distance-based topological indices, the entropy of topological indices and their numerical analysis are explained.

Nutrient regulation in aquaponic environments has been the topic of research for many years. Most have focused on appropriate control of nutrients in an aquaponic set-up, but very little research has been done on commercial scale applications. In our model, the input data was sourced on a weekly basis from three commercial aquaponic farms in South-East Texas over the course of a year. Due to limited number of data points, dimensionality reduction techniques like pair-wise correlation matrix was used to remove the highly correlated predictors. Feature selection techniques like the XGBoost classifier and Recursive Feature Elimination with ExtraTreesClassifier were used to rank the features in order of their relative importance. Ammonium and calcium were found to be the top two nutrient predictors and based on the months in which lettuce was cultivated, the median of these nutrient values from the historical dataset served as the optimal concentrations to be maintained in the aquaponic solution. To accomplish this, Vernier sensors were used to measure the nutrient values and actuator systems were built to dispense the appropriate nutrient into the ecosystem via a closed loop.

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.

Background & Objectives: The global pandemic caused by novel coronavirus SARS-CoV-2 has claimed several lives worldwide. With the virus gathering rapid spread, the world has witnessed increasing number of confirmed cases and mortality rate, India is not far behind with approximately 37,000 affected individuals as on May 2, 2020. The ongoing pandemic has raised several questions which need to be answered by analysis of transmission of the infection. The data has been collected on daily basis from WHO and other sites. We have represented the data collated graphically using statistical packages, R and other online softwares. The present study provides a holistic overview of the spread of COVID-19 infection in India. Methods: Real-time data query was done based on daily observations using publicly available data from reference websites for COVID-19 and other government official reports for the period (15^th February, 2020 to April 28^th, 2020). Statistical analysis was performed to draw important inferences regarding COVID-19 trend in India. Results: A decrease in growth rate of cases due to COVID-19 in India post lockdown and improvement in recovery rate during the month of April was identified. The case fatality rate was estimated to be 3.22% of the total reported cases. State-wise analysis revealed a deteriorating situation in states of Maharashtra and Gujarat among others as cases continued to increase rapidly there. A positive linear correlation between the number of deaths and total cases and exponential relation between population density and number of cases reported per square km was established. Interpretation & Conclusions: Despite early preventive measures taken up by the Government of India, the increasing number of cases in India is a concern. This study compiles state-wise and district-wise data to report the daily confirmed cases, case fatalities and strategies adopted in the form of case studies. Understanding the transmission spread of SARS-CoV-2 in a diverse and populated country like India will be crucial in assessing the effectiveness of control policies towards the spread of COVID-19 infection.

Due to the fact that negative energies have no existence in physical reality, the advanced mechanics of purely positive energies should describe gravitational interactions and collisions in monistic terms of extended kinetic energies and their local stresses. Such non-Newtonian mechanics of continuous inertial densities reinforces the Cartesian concept of matter-extension in the metric formalism of Einstein-Grossmann with a supplemental (dark, aether) fraction of bi-vertex mass-energy distributions. Local accelerations or decelerations of mono-vertex material densities in a multi-vertex distribution of complete kinetic energy arise under its constant integral due to nonlocal organization of continuous densities. Such integral conservation of the distributed mass-energy occurs instantaneously throughout the whole continuum of correlated densities and metric stresses despite the time-varying contributions of complementary mono-vertex and bi-vertex fractions. Under the nonlocal organization of purely kinetic (positive) mass-energy, geodesic self-heating and self-cooling of the pulsating space-matter conserve the integral energy in the two-fraction virial theorem for the averaged motion of visible mono-vertexes in the presence of invisible bi-vertex (interference, dark) mass-energy. Metric stresses of such material space are subordinate to nonlocal self-government of continuously distributed kinetic energy, including the relativistic rest-energy of General Relativity. These mutually consistent or correlated stresses in inertial space-time-energy create timelessly coordinated self-accelerations, observed for dense material volumes as distant gravitational pulls. In order to falsify/verify the nonlocal self-organization of adaptive kinetic energy, the monistic mechanics of self-consistent inertial densities and metric stresses can suggest moderate field changes in the temporal redshift, cycles of geodetic falls and takeoffs in pulsating kinetic organizations, and the calculated acceleration of the expanding Metagalaxy in its current phase of geodesic self-cooling.

The minimum vertex cover (MVC) problem is a canonical NP-hard combinatorial optimization problem, aiming to find a smallest set of vertices such that every edge has at least one endpoint in the set, which has extensive applications in cyber security, scheduling, and monitoring link failures in wireless sensor networks (WSNs). Numerous local search algorithms have been proposed to obtain a “good” vertex cover. However, due to the NP-hard nature, it is challenging to efficiently solve the MVC problem, especially on large graphs. In this paper, we propose an efficient local search algorithm for MVC called TIVC, which is based on two main ideas: A 3-improvements (TI) framework with tiny perturbation, and an edge selection strategy. We conducted experiments on real-world large instances of a massive graph benchmark. Compared with two state-of-the-art MVC algorithms, TIVC shows superior performance in accuracy and possesses a remarkable ability to identify significantly smaller vertex covers on many graphs.

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.

We introduce a new class of Vertex Operator Algebras Y+ and their duals, which generalize the standard W-algebras WN of type sl(N). These algebras can be defined in terms of junctions of boundary conditions and interfaces in the GL-twisted N = 4 Super Yang Mills gauge theory. The aim of these technical calculations is to find the relation of these ortho-symplectic Y-algebras to truncations of even W\infinity.

Post-training quantization is pivotal in deploying convolutional neural networks for mobile applications. Block-wise reconstruction with adaptive rounding, as employed in prior works like BrecQ and Qdrop, facilitates acceptable 4-bit quantization accuracy. However, adaptive rounding is time-intensive, and its constraint on weight optimization space curtails the potential for quantization performance. The optimality of block-wise reconstruction hinges on the quantization status of subsequent network blocks. In this investigation, we delve into the theoretical underpinnings of the limitations inherent in adaptive rounding and block-wise reconstruction. Our exploration leads to the development of a post-training quantization methodology, designated as AE-Qdrop. This algorithm operates in two distinct phases: block-wise reconstruction and global fine-tuning. The block-wise reconstruction phase introduces a progressive optimization strategy, superseding adaptive rounding, which not only augments quantization precision but also significantly improves quantization efficiency. To mitigate the risk of overfitting, we introduce a random weighted quantized activation mechanism. During the global fine-tuning phase, we account for interdependencies among quantized network blocks. The weight of each network block will be corrected with logit matching and feature matching. Extensive experiments validate that AE-Qdrop achieves high-precision and efficient quantization. For instance, in the case of 2-bit MobileNetV2, AE-Qdrop outperforms Qdrop by achieving a 6.26% enhancement in quantization accuracy and quintupling the quantization efficiency.

The real-time Railway Traffic Management Problem (rtRTMP) is discussed in the field of railway transportation. In this paper, rtRTMP is considered for planning shunting routes based on the use of routing methods on a spatial-temporal graph. An approach and algorithm of Spatial-Temporal Graph formation for rail yard transportation network is proposed. The idea is to construct an undirected loop-free Double Vertex Graph for determining optimal shunting routes consisting of several half-runs for several trains shunting under draw-out tracks capacity constraints. Experimental results on the rail yard simulation model are presented.

In this paper, we demonstrate a useful interaction between the theory of clique partitions, edge clique covers of a graph, and the spectra of graphs. Using a clique partition and an edge clique cover of a graph we introduce the notion of a vertex-clique incidence matrix for a graph and produce new lower bounds for the negative eigenvalues and negative inertia of a graph. Moreover, utilizing these vertex-clique incidence matrices, we generalize several notions such as the signless Laplacian matrix, and develop bounds on the incidence energy and the signless Laplacian energy of the graph. %The tight upper bounds for the energies of a graph and its line graph are given. More generally, we also consider the set $S(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent. An important parameter in this setting is $q(G)$, and is defined to be the minimum number of distinct eigenvalues over all matrices in $S(G)$. For a given graph $G$ the concept of a vertex-clique incidence matrix associated with an edge clique cover is applied to establish several classes of graphs with $q(G)=2$.

The independent set, IS, on a graph $G=(V,E)$ is $V^{*}\subseteq V$ such that no two vertices in $V^{*}$ have an edge between them. The MIS problem on G seeks to identify an IS with maximum cardinality, i.e. MIS. $V^{*}\subseteq V$ is a vertex cover, i.e. VC of $G=(V,E)$ if every $e\in E$ is incident upon at least one vertex in $V^{*}$ . $V^{*}\subseteq V$ is dominating set, DS, of $G=(V,E)$ if $\forall v\in V$ either $v\in V^{*}$ or $\exists u\in V^{*}$ and $(u,v)\in E$ . The MVC problem on G seeks to identify a vertex cover with minimum cardinality, i.e. MVC. Likewise, MCV seeks a connected vertex cover, i.e. VC which forms one component in G, with minimum cardinality, i.e. MCV. A connected DS, CDS, is a DS that forms a connected component in G. The problems MDS and MCD seek to identify a DS and a connected DS i.e. CDS respectively with minimum cardinalities. MIS, MVC, MDS, MCV and MCD on a general graph are known to be NP-complete. Polynomial time algorithms are known for bipartite graphs, chordal graphs, cycle graphs, comparability graphs, claw-free graphs, interval graphs and circular arc graphs for some of these problems. We introduce a novel graph class, layered graph, where each layer refers to a subgraph containing at most some k vertices. Inter layer edges are restricted to the vertices in adjacent layers. We show that if $k=\Theta (log\mid V\mid )$ then MIS, MVC and MDS can be computed in polynomial time and if $k=O\left({(log\mid V\mid )}^{\alpha }\right)$ , where $\alpha <1$ , then MCV and MCD can be computed in polynomial time. If $k=\Theta \left({(log\mid V\mid )}^{1+ϵ}\right)$ , for $ϵ>0$ , then MIS, MVC and MDS require quasi-polynomial time. If $k=\Theta (log\mid V\mid )$ then MCV, MCD require quasi-polynomial time. Layered graphs do have constraints such as bipartiteness, planarity and acyclicity.

Due to the special characteristics of the shooting distance and angle of remote sensing satellites, the pixel area ratio of ship targets is small and the feature expression is insufficient, which leads to unsatisfactory ship detection performance and even situations such as missed detection and false detection. In this study, we propose an improved-YOLOv5 algorithm. The improvement strategies mainly include: (1) Add the Convolutional Block Attention Module (CBAM) into the Backbone to enhance the extraction of target-adaptive optimal features; (2) Introduce cross-layer connection channel and lightweight GSConv structure into the Neck to achieve higher-level multi-scale feature fusion and reduce the number of model parameters; (3) The Wise-IoU loss function is used to cal-culate the localization loss in the Output, and assign reasonable gradient gains to cope with dif-ferences in image quality. In addition, during the preprocessing stage of experimental data, a me-dian and bilateral filter method is used for noise reduction to reduce interference from ripples and waves and highlight the information of ship features. The experimental results show that Im-proved-YOLOv5 has a significant improvement in recognition accuracy compared to various mainstream target detection algorithms; Compared to the original YOLOv5s, the mean Average Precision (mAP) has improved by 3.2% and the Frames Per Second (FPN) has accelerated by 8.7%.

Recent studies have proven that synthetic aperture radar (SAR) automatic target recognition (ATR) models based on deep neural networks (DNN) are vulnerable to adversarial examples. However, existing attacks are easily failed in the case where adversarial perturbations cannot be fully fed to victim models. We call this situation perturbation offset. Moreover, since background clutter takes up most of the areas in SAR images and has low relevance to recognition results, fooling models with global perturbations is quite inefficient. This paper proposes a semi-whitebox attack network, called Universal Local Adversarial Network (ULAN), to generate universal adversarial perturbations (UAP) for the target regions of SAR images. In the proposed network, we calculate the model’s attention heatmaps through layer-wise relevance propagation (LRP), which is used to locate the target regions of SAR images that have high relevance to recognition results. In particular, we utilize a generator based on the U-Net to learn the mapping from noise to UAPs and craft adversarial examples by adding the generated local perturbations to target regions. Experiments indicate that the proposed method fundamentally prevents perturbation offset and achieves comparable attack performance to conventional global UAPs by perturbing only a quarter or less of SAR image areas.