Search Results (726)

As the scale of shipboard power systems expands, their vulnerability becomes increasingly prominent. Identifying vulnerable points in ship power grids is essential for enhancing system stability, optimizing overall performance, and ensuring safe navigation. To address this issue, this paper proposes an algorithm based on fuzzy local dimension and topology (FLDT). The algorithm distinguishes contributions from nodes at different radii and within the same radius to a central node using fuzzy sets, and then derives the final importance value of each node by combining the local dimension and topology. Experimental results on nine datasets demonstrate that the FLDT algorithm outperforms degree centrality (DC), closeness centrality (CC), local dimension (LD), fuzzy local dimension (FLD), local link similarity (LLS), and mixed degree decomposition (MDD) algorithms in three metrics: network efficiency (NE), largest connected component (LCC), and monotonicity. Furthermore, in a ship power grid experiment, when 40% of the most important nodes were removed, FLDT caused a network efficiency drop of 99.78% and reduced the LCC to 2.17%, significantly outperforming traditional methods. Additional experiments under topological perturbations—including edge addition, removal, and rewiring—also show that FLDT maintains superior performance, highlighting its robustness to structural changes. This indicates that the FLDT algorithm is more effective in identifying and evaluating vulnerable points and distinguishing nodes with varying levels of importance. Full article

This paper presents a highly linear one-bit loaded-line phase shifter that leverages PIN diodes in combination with a coupler-based impedance transformer. The proposed phase shifter adopts a loaded-line topology, where PIN diodes are configured in a parallel-to-ground arrangement to improve linearity performance. To further enhance linearity, a coupler-based impedance transformer is employed to reduce the impedance seen by each PIN diode, thereby minimizing nonlinear behavior. To demonstrate the effectiveness of this design, a one-bit digital phase shifter is developed, simulated, and fabricated to achieve a 45-degree phase shift at 2 GHz. Experimental measurements confirm an input third-order intercept point (IIP3) exceeding 100 dBm under a range of test conditions, validating the proposed architecture’s linearity advantages. Full article

The early detection of Alzheimer’s disease (AD) is important for effective therapeutic interventions and optimized enrollment for clinical trials. Recent studies have shown high accuracy in identifying mild AD by applying visibility graph and machine learning methods to electroencephalographic (EEG) data. We present a novel analytical framework combining Weighted Visibility Graphs (WVG) and ensemble learning to detect individuals in the “preclinical” stage of AD (preAD) using a word repetition EEG paradigm, where WVG is an advanced variant of natural Visibility Graph (VG), incorporating weighted edges based on the visibility degree between corresponding data points. The EEG signals were recorded from 40 cognitively unimpaired elderly participants (20 preclinical AD and 20 normal old) during a word repetition task. Event-related potential (ERP) and oscillatory signals were extracted from each EEG channel and transformed into a WVG network, from which relevant topological features were extracted. The features were selected using t-tests to reduce noise. Subsequent statistical analysis reveals significant disparities in the structure of WVG networks between preAD and normal subjects. Furthermore, Principal Component Analysis (PCA) was applied to condense the input data into its principal features. Leveraging these PCA components as input features, several machine learning algorithms are used to classify preAD vs. normal subjects. To enhance classification accuracy and robustness, an ensemble method is employed alongside the classifiers. Our framework achieved an accuracy of up to 92% discriminating preAD from normal old using both linear and non-linear classifiers, signifying the efficacy of combining WVG and ensemble learning in identifying very early AD from EEG signals. The framework can also improve clinical efficiency by reducing the amount of data required for effective classification and thus saving valuable clinical time. Full article

In recent years, the concept of the myofascial network has transformed biomechanical understanding by emphasizing the body as an integrated, multidirectional system. This study advances that paradigm by applying graph theory to model the osteo-myofascial system as an anatomical network, enabling the identification of topologically central nodes involved in force transmission, stability, and coordination. Using the aNETomy model and the BIOMECH 3.4 database, we constructed an undirected network of 2208 anatomical nodes and 7377 biomechanical relationships. Centrality analysis (degree, betweenness, and closeness) revealed that structures such as the sacrum and thoracolumbar fascia exhibit high connectivity and strategic importance within the network. These findings, while derived from a theoretical modeling approach, suggest that such key nodes may inform targeted treatment strategies, particularly in complex or compensatory musculoskeletal conditions. The proposed concept of a polyconnective skeleton (PCS) synthesizes the most influential anatomical hubs into a functional core of the system. This framework may support future clinical and technological applications, including integration with imaging modalities, real-time monitoring, and predictive modeling for personalized and preventive medicine. Full article

A reduced representation of a dynamical system helps us to understand what the true degrees of freedom of that system are and thus what the possible instabilities are. Here we extend previous work on barotropic flows to the more general non-barotropic flow case and study the implications for variational analysis and conserved quantities of topological significance such as circulation and helicity. In particular we introduce a four-function Eulerian variational principle of non-barotropic flows, which has not been described before. Also new conserved quantities of non-barotropic flows related to the topological velocity field, topological circulation and topological helicity, including a local version of topological helicity, are introduced. The variational formalism given in terms of a Lagrangian density allows us to introduce canonical momenta and hence a Hamiltonian formalism. Full article

A graph with $q(a+t)$ vertices is known as a q-broom-like graph $K_q\sqcap B(a;t)$, which is produced by the hierarchical product of the complete graph $K_q$ by the rooted broom $B(a;t)$, where $q\ge 3,a\ge 1$ and $t\ge 1$. A numerical quantity associated with graph structure is called a topological index. The inverse sum indeg index (shortened to $ISI$ index) is a topological index defined as $ISI\left(G\right)={\displaystyle \sum _{v_i{v}_j\in E\left(G\right)}}{\displaystyle \frac{d_{v_i}{d}_{v_j}}{d_{v_i}+d_{v_j}}}$, where $d_{v_i}$ is the degree of the vertex $v_i$. In this paper, we take into consideration the $ISI$ index for q-broom-like graphs and perform a thorough analysis of it. We find the $ISI$ spectrum of q-broom-like graphs and derive the closed formulas for their $ISI$ index and $ISI$ energy. We also characterize extremal graphs and arrange them according to their $ISI$ index and $ISI$ energy, respectively. Further, a quantitative structure–property relationship is used to predict six physicochemical properties of sixteen alkaloid structures using $ISI$ index and $ISI$ energy. Both graph invariants have significant correlation values, indicating the accuracy and utility of the findings. The conclusions made in this article can help chemists and pharmacists research alkaloids’ structures for applications in industry, pharmacy, agriculture, and daily life. Full article

With the continuous development of the Internet, people have put forward higher requirements for the stability and availability of the network. Although we constantly strive to take measures to avoid network failures, it is undeniable that network failures are unavoidable. Therefore, in this situation, enhancing the stability and reliability of the network to cope with possible network failures has become particularly crucial. Therefore, researching and developing high fault protection rate intra-domain routing protection schemes has become an important topic and is the subject of this study. This study aims to enhance the resilience and service continuity of networks in the event of failures by proposing innovative routing protection strategies. The existing methods, such as Loop Free Alternative (LFA) and Equal Cost Multiple Paths (ECMP), have some shortcomings in terms of fast fault detection, fault response, and fault recovery processes, such as long fault recovery time, limitations of routing protection strategies, and requirements for network topology. In response to these issues, this article proposes a new routing protection scheme, which is an intra-domain routing protection scheme based on the minimum cross-degree backup path. The core idea of this plan is to find the backup path with the minimum degree of intersection with the optimal path, in order to avoid potential fault areas and minimize the impact of faults on other parts of the network. Through comparative analysis and performance evaluation, this scheme can provide a higher fault protection rate and more reliable routing protection in the network. Especially in complex networks, this scheme has more performance and protection advantages than traditional routing protection methods. The proposed scheme in this paper exhibits a high rate of fault protection across multiple topologies, demonstrating a fault protection rate of 1 in the context of real topology. It performs commendably in terms of path stretch, evidenced by a figure of 1.06 in the case of real topology Ans, suggesting robust path length control capabilities. The mean intersection value is 0 in the majority of the topologies, implying virtually no common edge between the backup and optimal paths. This effectively mitigates the risk of single-point failure. Full article

Topological optimization uses two main optimization conditions aimed at achieving the maximum stiffness at minimum weight of the loaded object, while not exceeding the allowable stress. This process naturally creates complex structures with varying degrees of density. There is a certain regularity between the density of the structure and stiffness, with the optimal density being related to the golden ratio. This study contributes to materials modeling and their characterization by introducing a mathematical theory related to the virial theorem as a predictive framework for understanding stiffness–density relationships in additively manufactured structures. The definition of virial stability and the methodology for deriving this stability from the kinetic and potential components of a random signal are introduced. The proposed virial-based model offers a generalizable tool for materials characterization, applicable not only to topological optimization but also to broader areas of materials science and advanced manufacturing. Full article

Analogous to Kolmogorov’s theorem for the existence of stochastic processes describing random functions, we consider theorems for the existence of stochastic processes describing random measures as limits of inverse measure systems. Specifically, given a coherent inverse system of random (bounded/signed/positive/probability) histograms on refining partitions, we study conditions for the existence and uniqueness of a corresponding random inverse limit, a Radon probability measure on the space of (bounded/signed/positive/probability) measures. Depending on the topology (vague/tight/weak/total-variational) and Kingman’s notion of complete randomness, the limiting random measure is in one of four phases, distinguished by their degrees of concentration (support/domination/discreteness). The results are applied in the well-known Dirichlet and Polya tree families of random probability measures and a new Gaussian family of signed inverse limit measures. In these three families, examples of all four phases occur, and we describe the corresponding conditions of defining parameters. Full article

We developed the Global–Local Integrated Topology inverse design algorithm (denoted as the GLINT algorithm), which employs a trajectory-based optimization strategy with waveguide–substrate material-flipping structural modifications, enabling the direct optimization of discrete waveguide–substrate binary structures. Compared to the conventional Direct Binary Search (DBS), the GLINT algorithm not only significantly enhances computational efficiency through its global search–local refinement framework but also achieves a superior 20 nm × 20 nm optimization resolution while maintaining its optimization speed—substantially advancing the design capability. Utilizing this algorithm, we designed and experimentally demonstrated a 3.5 µm × 3.5 µm dual-port wavelength division multiplexer (WDM), achieving a minimum crosstalk of −11.3 dB and a 2 µm × 2 µm 90-degree bending waveguide exhibiting a 0.31–0.52 dB insertion loss over the 1528–1600 nm wavelength range, both fabricated on silicon-on-insulator (SOI) wafers. Additionally, a 4.5 µm × 4.5 µm three-port WDM structure was also designed and simulated, demonstrating crosstalk as low as −36.5 dB. Full article

As power grids continue to expand in scale, the occurrence of cascading failures within them can lead to significant economic losses. Therefore, assessing the criticality of grid nodes is crucial for ensuring the secure and stable operation of power systems and for mitigating losses when cascading failures occur. The classical Local Link Similarity (LLS) algorithm in complex networks evaluates the importance of network nodes from a neighborhood topology perspective, but it suffers from issues such as the excessive weighting of node degrees and the neglect of electrical parameters. Based on the classical algorithm, this paper first develops the Improved Local Link Similarity (ILLS) algorithm by substituting alternative similarity metrics and comparatively evaluating their performance. Building upon the ILLS, we then propose the Electrical LLS (ELLS) algorithm by integrating node power flow and electrical coupling connectivity as multiplicative factors, with optimal combinations determined via simulation experiments. Compared to classical approaches, ELLS demonstrates superior adaptability to power grid contexts and delivers enhanced accuracy in power system node importance assessments. These algorithms are applied to rank the node importance in the IEEE 300-bus system. Their performance is evaluated using the loss-of-load-size metric, comparing ELLS, ILLS, and the classical algorithm. The results demonstrate that under the loss-of-load-size metric, the ELLS algorithm achieves approximately 25% higher accuracy compared to both the ILLS and the classical algorithm, validating its effectiveness. Full article

Identifying correspondences of road segments in different road networks, namely road-network matching, is an essential task for road network-centric data processing such as data integration of road networks and data quality assessment of crowd-sourced road networks. Traditional road-network matching usually relies on feature engineering and parameter selection of the geometry and topology of road networks for similarity measurement, resulting in poor performance when dealing with dense and irregular road network structures. Recent development of graph neural networks (GNNs) has demonstrated unsupervised modeling power on road network data, which learn the embedded vector representation of road networks through spatial feature induction and topology-based neighbor aggregation. However, weighting spatial information on the node feature alone fails to give full play to the expressive power of GNNs. To this end, this paper proposes a Spatial Pattern-aware Graph EMbedding learning method for road-network matching, named SP-GEM, which explores the idea of spatially-explicit modeling by identifying spatial patterns in neighbor aggregation. Firstly, a road graph is constructed from the road network data, and geometric, topological features are extracted as node features of the road graph. Then, four spatial patterns, including grid, high branching degree, irregular grid, and circuitous, are modelled in a sector-based road neighborhood for road embedding. Finally, the similarity of road embedding is used to find data correspondences between road networks. We conduct an algorithmic accuracy test to verify the effectiveness of SP-GEM on OSM and Tele Atlas data. The algorithmic accuracy experiments show that SP-GEM improves the matching accuracy and recall by at least 6.7% and 10.2% among the baselines, with high matching success rate (>70%), and improves the matching accuracy and recall by at least 17.7% and 17.0%, compared to the baseline GNNs, without spatially-explicit modeling. Further embedding analysis also verifies the effectiveness of the induction of spatial patterns. This study not only provides an effective and practical algorithm for road-network matching, but also serves as a test bed in exploring the role of spatially-explicit modeling in GNN-based road network modeling. The experimental performances of SP-GEM illuminate the path to develop GeoEmbedding services for geospatial applications. Full article

Background/Objectives: Cutaneous melanoma is one of the aggressive forms of skin cancer originating from melanocytes. The high incidence of melanoma metastasis continues to rise, partly due to the complex nature of the molecular mechanisms driving its progression. While melanomas generally arise from melanocytes, we investigated whether aberrant keratinocyte differentiation pathways—like cornified envelope formation—discriminate primary melanoma from metastatic melanoma, revealing novel biomarkers in progression. Methods: In the present study, we retrieved four datasets (GSE15605, GSE46517, GSE8401, and GSE7553) associated with primary and metastatic melanoma tissues and identified differentially expressed genes (DEGs). Thereafter, an integrated meta-analysis and functional enrichment analysis of the DEGs were performed to evaluate the molecular mechanisms involved in melanoma metastasis, such as immune cell deconvolution and protein-protein interaction (PPI) network construction. Hub genes were identified based on four topological methods, including ‘Betweenness’, ‘MCC’, ‘Degree’, and ‘Bottleneck’. We validated the findings using the TCGA-SKCM cohort. Drug-gene interactions were evaluated using the DGIdb, whereas structural druggability was assessed using the ProteinPlus and AlphaFold databases. Results: We identified a total of eleven hub genes associated with melanoma progression. These included members of the keratin gene family (e.g., KRT5, KRT6A, KRT6B, etc.). Except for the gene CDH1, all the hub genes were downregulated in metastatic melanoma tissues. From a prognostic perspective, these hub genes were associated with poor prognosis (i.e., unfavorable). Using the Human Protein Atlas (HPA), immunohistochemistry evaluation revealed mostly undetected levels in metastatic melanoma. Additionally, the cornified envelope formation was the most enriched pathway, with a gene ratio of 17/33. The tumor microenvironment (TME) of metastatic melanomas was predominantly enriched in NK cell–associated signatures. Finally, several hub genes demonstrated favorable druggable potential for immunotherapy. Conclusions: Through integrated meta-analysis, this study identifies transcriptional, immunological, and structural pathways to melanoma metastasis and highlights keratin family genes as promising biomarkers for therapeutic targeting. Full article

As China’s economy grows and travel demand increases, its aviation market has evolved to become the second-largest in the world. This study presents a pioneering analysis of China’s aviation network evolution (1990–2024) by integrating temporal dynamics into a network density matrix theory, addressing critical gaps in prior static network analyses. Unlike conventional studies focusing on isolated topological metrics, we introduce a triangulated methodology: ① a network sequence analysis capturing structural shifts in degree distribution, clustering coefficient, and path length; ② novel redundancy–entropy coupling quantifying complexity evolution beyond traditional efficiency metrics; and ③ economic-network coordination modeling with spatial autocorrelation validation. Key innovations reveal previously unrecognized dynamics: ① Time-embedded density matrices ($\rho$) demonstrate how sparsity balances information propagation efficiency ($\eta$) and response diversity, resolving the paradox of functional yet sparse connectivity. ② Redundancy–entropy synergy exposes adaptive trade-offs. Entropy ($H$) rises 18% (2000–2024), while redundancy ($R$) rebounds post-2010 (0.25→0.33), reflecting the strategic resilience enhancement after early efficiency-focused phases. ③ Economic-network coupling exhibits strong spatial autocorrelation ($Moran’sI>0.16$, $p<0.05$), with eastern China achieving “primary coordination”, while western regions lag due to geographical constraints. The empirical results confirm structural self-organization. Power-law strengthening, route growth exponentially outpacing cities, and clustering ($C$) rising 16% as the path length ($L$) increases, validating the hierarchical hub formation. These findings establish aviation networks as dynamically optimized systems where economic policies and topological laws interactively drive evolution, offering a paradigm shift from descriptive to predictive network management. Full article

Instead of measuring the distance between two points with a positive real number, determining the degree to which the distance between these two points is close, not close, or uncertain allows for more detailed measurement. Recently, researchers have overcome this grading problem by using probability distribution functions, along with fuzzy, intuitionistic fuzzy, and neutrosophic sets. This study pioneers neutrosophic quadruple metric spaces as a powerful new tool for quantifying distances under complex, multi-dimensional uncertainty. It provides a comprehensive mathematical structure, including topology, convergence theory, and completeness, and handles both symmetric and asymmetric cases, generalising previous neutrosophic metric results. For this purpose, neutrosophic quadruple metric spaces were derived from neutrosophic metric spaces in order to better model situations involving uncertainty. Also, we generalised the findings obtained with the neutrosophic metric to the quadruple neutrosophic metric. Full article