The popularity and development of social media has made it more and more convenient to spread rumors, and it has become especially important to detect rumor information from massive amounts of information. Most of the traditional rumor detection methods use content characteristics or propagation structure to mine rumor characteristics, ignoring the fusion characteristics of content and structure and their interaction characteristics. Therefore, a novel rumor detection method based on heterogeneous convolutional networks is proposed. Firstly, this paper constructs a heterogeneous map of joint rumor content and propagation structure to explore the interaction between content and propagation structure during rumor propagation and obtain rumor representation. On that basis, this paper uses the deep residual graph convolutional neural network to construct the content and structure interaction information of the current network propagation model. Finally, this paper uses the two datasets of Twitter15 and Twitter16 to verify the proposed method. Experimental results show that the proposed method has higher detection accuracy than the traditional rumor detection method.

This report gives a comprehensive summary of two problems about graph convolutional networks (GCNs): over-smoothing and heterophily challenges, and outlines future directions to explore.

The chemical feedback between building blocks in templated polymerization of diblock copolymers and their consecutive micellization was studied for the first time by means of coarse-grained molecular dynamics simulations. Using a stochastic polymerization model, we were able to reproduce the experimental findings on the effect of chemical feedback on the polymerization rates at low and high solution concentrations. The size and shape of micelles were computed using a newly development software in python conjugated with graph theory. In full agreement with the experiments, our simulations revealed that micelles formed by the templated micellization are more spherical and have lower radius of gyration than those formed by the traditional two-step micellization method. Understanding the underlying mechanisms in templated reaction/assembly of polymers will help for rational design of new synthetic supramolecular materials.

We apply the Ramsey theory to the analysis of geometrical properties of closed contours. Consider a set of six points placed on a closed contour. The straight lines connecting these points are yikx=αikx+βik i,k=1...6, αik≠0. We color the edges connecting the points for which αik>0 holds with red, and the edges for which αik<0 with green with red. At least one monochromic triangle should necessarily appear within the curve (according to the Ramsey number R3,3=6). This result is immediately applicable for the analysis of dynamical billiards. The second theorem emerges from the combination of the Jordan curve and Ramsey theorem. The closed curve is considered. We connect the points located within the same region with green links and the points placed within the different regions with red links. In this case, transitivity/intransitivity of the relations between the points should be considered. Ramsey constructions arising from the differential geometry of closed contours are discussed.

We present a Deep Learning generative model specialized to work with graphs with a regular geometry. It is build on a Variational Autoencoder framework and employs Graph convolutional layers in both encoding and decoding phases. We also introduce a pooling technique (ReNN-Pool), used in the encoder, that allows to downsample graph nodes in a spatially uniform and highly interpretable way. In the decoder, a symmetrical un-pooling technique is used to retrieve the original dimensionality of graphs. Performance of the model are tested on the standard Sprite benchmark dataset, a set of 2D images of video game characters, adequately transforming images data into graphs, and on the more realistic use-case of a dataset of cylindrical-shaped graph data that describe the distributions of the energy deposited by a particle beam in a medium.

In the modern world where research is taking a huge leap, the collaboration network between authors is also expanding, increasing the probability of different authors coming together to work on the same project, same research paper making them co-authors. In coauthorship, link prediction is used to anticipate new interactions between its members that are likely to occur in the future. Researchers have concentrated their efforts on studying and suggesting methods for providing effective reviews for authors who can collaborate on a scientific endeavor. In order to provide a precise link prediction, a graph database approach is proposed in this paper using nodes to determine most possible co-authors in future. In order to forecast the connections, we preprocessed the data set for the maximum relative contents. A supervised learning approach is used to execute the solution, which includes random forest classifier and logistic regression. The first findings of our technique reveal that the total of two author node’s research collaboration indices has the greatest influence on the performance of supervised link prediction than that of the traditional approach, which stimulates us to conduct further study on employing such a forecast.

The study of the brain networks using analysis of electroencephalography (EEG) data based on statistical dependencies (functional connectivity) and mathematical graph theory concepts is common in neuroscience and cognitive sciences for examinations of patient and healthy individuals. The Consciousness Fields according to Taheri theory and applications in the optimization of system under study have been investigated in various studies. In this study, we examine the results of working with Faradarmani Consciousness Field (FCF) in the brain of Faradarmangars. Faradarmangars are one of the necessary components in mind mediation of the function of Faradarmani Consciousness Fields according to Taheri. For this purpose, the functional and effective connectivity and the corresponding brain graphs of EEG from the brain of Faradarmangars is compared with that of non Faradarmangar groups during FCF connection. According to the results of the present study, the brain of the Faradarmangars shows significant decreased activity in delta (BA8), beta2 (BA4/6/8/9/10/11/32/44/47) and beta3 (in 34 of 52 BA) frequency bands mainly in frontal lobe and after that in parietal and temporal lobes in the comparison with the non Faradarmangars. Moreover, the functional and effective connectivity analysis in the frontal network shows dominant multiple decreased connectivity mainly in the case of beta3 frequency band in all parts of the frontal network. On the other hand, the graph theory analysis of the Faradarmangar brain shows an increase in the activity of the O2-T5-F4-F3-FP2-F8 areas and significant decrease in the characteristic path length and increases in global efficiency, clustering coefficient and transitivity. In conclusion, the unique higher graph function efficiency and the reduction in the brain activity and connectivity during the Faradarmani Consciousness Field mind mediation, shown the passive and detector like function of the human brain in this task.

It is shown how the secondary structure of proteins, musical forms and verses of poems are approximately ruled by universal laws relying on graph coverings. In this direction, one explores the group structure of a variant of the SARS-Cov-2 spike protein and the group structure of apolipoprotein-H, passing from the primary code with amino acids to the secondary structures organizing the foldings. Then one look at the musical forms employed in the classical and contemporary periods. Finally, one investigates in much detail the group structure of a small poem in prose by Charles Baudelaire and that of the Bateau Ivre by Arthur Rimbaud.

In this essay, the new notion concerning longest path is introduced. Longest path has a close relation with the notion of diameter in graph. The classes of graph are studied in the terms of having the vertex with longest path. Valued number is the number of edges belong to the longest path in the matter of vertex. For every vertex, there’s a valued number and new notion of valued set is the generalization of valued number for the vertex when all vertices of the graphs are corresponded to a vertex which has the greater valued number. For any positive integer, there’s one graph in that, there’s vertex which its valued number is that. By deleting the vertices which don’t belong to valued set, new notion of new graph is up. It’s called valued graph. The comparison amid valued graph and initial graph is up, too.

Existing proofs of the 4-color theorem succeeded by establishing an unavoidable set of reducible configurations. By this device, their authors showed that a minimum counterexample cannot exist. G.D. Birkhoff proved that a minimum counterexample must satisfy a connectivity property that is referred to in modern parlance as internal 6-connectivity. We show that a minimum counterexample must also satisfy a coloring property, one that we call Kempe-locking. We define the terms Kempe-locking configuration and fundamental Kempe-locking configuration. We provide a heuristic argument that a fundamental Kempe-locking configuration must be of low order and then perform a systematic search through isomorphism classes for such configurations. We describe a methodology for analyzing whether an arbitrary planar triangulation is Kempe-locked; it involves deconstructing the triangulation into a stack of configurations with common endpoints and then creating a bipartite graph of coloring possibilities for each configuration in the stack to assess whether certain 2-color paths can be transmitted from the configuration's top boundary to its bottom boundary. All Kempe-locked triangulations we discovered have two features in common: (1) they are Kempe-locked with respect to only a single edge, say $xy$, and (2) they have a Birkhoff diamond with endpoints $x$ and $y$ as a proper subgraph. On the strength of our various investigations, we are led to a plausible conjecture that the Birkhoff diamond is the only fundamental Kempe-locking configuration. If true, this would establish that the connectivity and coloring properties of a minimum counterexample to the 4-color theorem are incompatible. It would also point to the singular importance of a particularly elegant 4-connected triangulation of order 9 that consists of a triangle enclosing a pentagon enclosing a single vertex.

Here we present a fast and highly scalable community structure preserving network module detection that recursively integrates graph sparsification and clustering. Our algorithm, called SparseClust, participated in the most recent DREAM community challenge on disease module identification, an open competition to comprehensively assess module identification methods across a wide range of biological networks.

For a graph G, let P(G, λ) be its chromatic polynomial. Two graphs G and H are said to be chromatically equivalent if P(G,λ) = P(H,λ). A graph is said to be chromatically unique if no other graph shares its chromatic polynomial. In this paper, chromatic polynomial of the necklace graph N_n, for n ≥ 2 has been determined. It is further shown that N₃ is chromatically unique.

Background/Objectives: Population aging is rapidly increasing, and the importance of preventive medicine has been stressed. Health checkup, diet, and exercise are of paramount importance. This study aimed to evaluate the effectiveness of a personalized dual-task intervention that combined exercise with cognitive tasks in improving physical and cognitive functions among independently living elderly individuals. Methods: Participants were aged >65 years who were mostly independent in their activities of daily living, divided into 2 groups. The group receiving the 20-min robot-assisted session was compared to the group receiving traditional functional restoration training. This randomized trial assessed the impact of this intervention on the 30-s chair stand test score and Montreal Cognitive Assessment-Japanese version score of the participants. Results: Both scores significantly improved in the intervention group, indicating enhanced lower-limb function and cognitive capabilities. Conclusions: These findings suggest that integrating cognitive tasks with physical exercise can be a potent strategy to improve overall well-being in the elderly, offering valuable insights for designing comprehensive preventive health programs tailored to this demographic.

In this paper, we establish the necessary and sufficient conditions for solving a dual split quaternion matrix equation AXB=C, and present the general solution expression when solvability is achieved. As an application, we delve into the necessary and sufficient condition for the existence of Hermitian solution to this equation by using a newly defined real representation method. Furthermore, we obtain the solutions for the dual split quaternion matrix equations AX=C and XB=C. Finally, we provide a numerical example to demonstrate the findings of this paper.

Hydrogen is considered as an ideal substitute to the traditional fossil fuels because of its widespread sources, high calorific value of combustion, and zero carbon emissions. The electrocatalytic water-splitting to produce hydrogen is also deemed to be the best approach, however, it is a challenge to make high-efficient and low-cost electrocatalysts. Single-atom catalysts (SACs) are considered the most promising candidate to replace the traditional noble-metal catalysts. Compared with SACs, the dual-atom catalysts (DACs) are of greater attraction including higher metal loading, more versatile active sites, and excellent catalytic activity. In the review, several general synthetic strategies and structural characterization methods of DACs are introduced, and the mechanisms of hydrogen evolution reaction (HER) and oxygen evolution reactions (OER) are discussed. The authors hope that the review has given some insights and inspiration to the researchers about DACs in electrocatalytic water-splitting.

Endoscopic medical images can suffer from uneven illumination, low contrast, and lack of texture information due to the use of point directional light sources and the presence of narrow tissue structures, posing diagnostic difficulties for physicians. In this paper, a deep learning-based su-pervised illumination enhancement network is designed for low-light endoscopic images, aiming to improve both global illumination and local details. Initially, a global illumination enhancement module is formulated utilizing a higher-order curve function to improve global illumination. Sec-ondly, a local feature extraction module incorporating dual attention is designed to capture local detailed features. Considering the significance of color fidelity in biomedical scenarios, the designed loss function prioritizes introducing color loss to alleviate image color distortion. Compared with seven state-of-the-art enhancement algorithms on Endo4IE endoscopic datasets, experimental re-sults show that the proposed method can better enhance low-light endoscopic images and avoid image color distortion. It provides an efficient method to enhance images captured by endoscopes which can effectively assist clinical diagnosis and treatment.

The groundbreaking Advanced Forest-Based Tagging Framework (AFTF) represents a paradigm shift in the domain of information extraction from medical texts. AFTF introduces a novel dual-binary tree structure that redefines how entity-relation triples are extracted. This innovative approach directly tackles the limitations of traditional linear and graph-based methods, effectively addressing challenges related to overlapping triples and computational efficiency. The AFTF model stands as a beacon of excellence, surpassing established baselines by significant margins in comprehensive evaluations on two pivotal medical datasets. Notably, AFTF achieves remarkable improvements in F1 scores, showcasing its prowess in accurate information extraction from complex medical narratives. Beyond its exceptional performance in the medical domain, AFTF exhibits remarkable versatility. This adaptability is vividly demonstrated through its robust performance across three diverse public datasets, further affirming its position as a versatile and reliable solution for information extraction tasks. This paper provides a comprehensive exposition of the AFTF architecture, shedding light on its innovative design principles and its efficient handling of intricate medical texts. AFTF represents a groundbreaking step forward in the realm of information extraction, promising enhanced accuracy, efficiency, and adaptability for a wide range of applications.

Micro-gyroscopes based on the Coriolis principle are widely employed in inertial navigation, motion control, and vibration analysis applications. This paper presents our main contributions which include a novel dual-frame optomechanical gyroscope, a unique photonic crystal cavity design, and advanced numerical simulation and optimization methods. The proposed design utilizes an optical cavity formed between dual oscillating frames, whereby input rotation induces a measurable phase shift via optomechanical coupling. Actuation of the frames is achieved electrostatically via an interdigitated comb-drive design. Through theoretical modeling based on cavity optomechanics and finite element simulation, the operating principle and performance parameters are evaluated in detail. Results indicate an expected angular rate sensitivity of 22.8 mV/°/s and angle random walk of 7.1×10-5 °/h1/2, representing superior precision than to existing micro-electromechanical systems gyroscopes of comparable scale. Detailed analysis of the optomechanical transduction mechanism suggests this dual-frame approach could enable angular vibration detection with resolution exceeding state-of-the-art solutions.

Bovine lactoferrin (bLf) is a milk-derived protein that exhibits multiple biological activities and has been explored towards different therapeutic applications. Since this molecule is susceptible to degradation and some of its properties depend on its tertiary structure, the encapsulation of bLf in stimuli-responsive therapeutic formulations provides an added value to potentiate its biological activities when administered. Plasmonic magnetoliposomes emerge as promising nanosystems for dual hyperthermia (magneto-photothermia) and local therapy, since the combination of magnetic and gold nanoparticles (NPs) in a single nanosystem (multifunctional liposomes) enables the targeting and controlled release of encapsulated drugs. In this work, plasmonic magnetoliposomes (PMLs) containing manganese ferrite nanoparticles (28 nm size) and gold nanoparticles (~ 5 nm size) functionalized with 11-mercaptoundecanoic acid or octadecanethiol, were synthesized and loaded with bLf. The structural, magnetic and optical properties of the nanoparticles were measured by TEM, SQUID and UV/vis/NIR absorption spectroscopy. Specific Absorption Rate was determined to assess the capabilities for magnetic and photothermal hyperthermia. Finally, Saccharomyces cerevisiae was used as an eukaryotic cellular model to assess the biological activity and the mechanism of entry of bLf-loaded PMLs, through counting of colony forming units and fluorescence microscopy, respectively. The results demonstrate that PMLs are mainly internalized through an energy- and temperature-dependent endocytic process, though the contribution of a diffusion component cannot be discarded. Most notably, only bLf-loaded PMLs exhibit cytotoxicity with an efficiency similar to free bLf, attesting their promising potential for bLf delivery in the context of therapeutic interventions.

Fractals offer the ability to generate fascinating geometric shapes with all sorts of unique characteristics (for instance, fractal geometry provides a basis for modelling infinite detail found in nature). While fractals are non-euclidean mathematical objects which possess an assortment of properties (e.g., attractivity and symmetry), they are also able to be scaled down, rotated, skewed and replicated in embedded contexts. Hence, many different types of fractals have come into limelight since their origin discovery. One particularly popular method for generating fractal geometry is using Julia sets. Julia sets provide a straightforward and innovative method for generating fractal geometry using an iterative computational modelling algorithm. In this paper, we present a method that combines Julia sets with dual-quaternion algebra. Dual-quaternions are an alluring principal with a whole range interesting mathematical possibilities. Extending fractal Julia sets to encompass dual-quaternions algebra provides us with a novel visualize solution. We explain the method of fractals using the dual-quaternions in combination with Julia sets. Our prototype implementation demonstrate an efficient methods for rendering fractal geometry using dual-quaternion Julia sets based upon an uncomplicated ray tracing algorithm. We show a number of different experimental isosurface examples to demonstrate the viability of our approach.

Despite the popularity of Zumba in several countries, research is scarce about its impact on older adults. Meanwhile, the integration of cognitive tasks with physical exercises, known as dual-tasking, is an evolving strategy to facilitate activities for older people. This study investigated the perceptions of older adults regarding Zumba and the potential of implementing it in a dual-task program. We conducted a qualitative-descriptive research involving 44 Filipino older adults from August to November 2020. Content analysis was employed to analyze the data. Four themes were identified: moving towards match or mismatch; balancing benefits with burdens; dual-tasking as innovative yet potentially challenging; and overcoming barriers with enablers. While Zumba is an inclusive and beneficial activity, individual and contextual limitations could hinder its suitability for older people. Dual-tasking in Zumba was also recognized as an innovative approach, although challenges should be addressed to promote its utility. Several strategies could support the design of these programs in communities. This is the first study to explore older adults’ perceptions towards Zumba and its potential utilization as a dual-tasking program. Findings could guide the implementation of appropriate Zumba and dual-tasking activities that seek to integrate cognitive and physical training for older adults.

Current therapeutic protocols for the treatment of HIV infection consist of the combination of diverse anti-retroviral drugs in order to reduce the selection of resistant mutants and to allow for the use of lower doses of each single agent to reduce toxicity. However, avoiding drugs interactions and patient compliance are issues not fully accomplished so far. In this respect the identification of single agents with multitarget potential might represent the ideal solution. Accordingly, a small library of biphenylhydrazo 4-arylthiazoles derivatives has been synthesised and evaluated to investigate the ability of the new derivatives to simultaneously inhibit both associated functions of HIV reverse transcriptase. All compounds were active towards the two functions, although at different concentrations. The substitution pattern on the biphenyl moiety appears relevant to determine the activity.

In this paper, we study singularities of the spherical indicatrix and evolute of spacelike ruled surface with spacelike ruling. Finally, we give an example to illustrate our results.

The etiology of ‘dual harm’ (the co-occurrence of self-harm and externalized violence in the same individual) is under-researched. Risk factors have mostly been investigated for each behavior separately. We aimed to examine adversities experienced between birth and age 15 years among adolescents and young adults with histories of self-harm and violent criminality, with a specific focus on dual harm. Three nested case-control studies were delineated using national interlinked Danish registers; 58,409 cases in total aged 15-35 were identified: 28,956 with a history of violent criminality (but not self-harm), 25,826 with a history of self-harm (but not violent criminality), and 3987 with dual harm history. Each case was matched by date of birth and gender to 20 controls who had not engaged in either behavior. We estimated exposure prevalence for cases vs. controls for each of the three behavior groups, and incidence rate ratios (IRRs). Experiencing 5 or more childhood adversities was more prevalent among individuals with dual harm history (19.3%; 95% CI 18.0, 20.8%) versus self-harm (10.9%; 10.5, 11.3%) and violence (11.4%; 11.0%, 11.8%) histories. The highest IRRs for dual harm were linked with parental unemployment (5.15; 95% CI 4.71, 5.64), parental hospitalization following self-harm (4.91; 4.40, 5.48) or assault (5.90; 5.07, 6.86), and parental violent criminality (6.11; 5.57, 6.70). Growing up in environments that are characterized by poverty, violence and substance misuse, and experiencing multiple adversities in childhood, appear to be especially strongly linked with elevated dual harm risk. These novel findings indicate potential etiologic pathways to dual harm.

In this paper, the design process of BLDC adopting the dual rotor method that can reduce the overall size of the motor while generating the same torque as the conventional Permanent Magnet BLDC is analyzed. A simple size is selected by obtaining the torque per rotor volume (TRV), and a method of matching the counter electromotive force by selecting the pole arc of the magnet through a magnetic equivalent circuit is analyzed. Since the efficiency is low because the 120-degree commutation method is selected, the middle stator is optimized through detailed design through the experimental design method. Afterwards, it has the advantage of being able to shift without stopping due to the characteristic of a dual rotor. For this, an analysis of the driving characteristics for each mode is performed.

Single nanowires (NWs) are of great importance for optoelectronic applications, especially solar cells serving as powering nanoscale devices. However, weak off-resonant absorption can limit its light-harvesting capability. Here, we propose a single NW coated with the graded-index dual shells (DSNW). We demonstrate that with appropriate thickness and refractive index of the inner shell, the DSNW exhibits significantly enhanced light trapping compared with the bare NW (BNW), and the NW only coated with the outer shell (OSNW) and the inner shell (ISNW), which can be attributed to the optimal off-resonant absorption mode profiles due to the improved coupling between the reemitted light of the transition modes of the leak mode resonances of the Si core and the nanofocusing light from the dual shells with the graded refractive index. We found that the light absorption can be engineered via tuning the thickness and the refractive index of the inner shell, the photocurrent density is significantly enhanced by 134% (56%, 12%) in comparison with that of the BNW (OSNW, ISNW). This work advances our understanding of how to improve off-resonant absorption by applying graded dual-shell design and provides a new choice for designing high-efficiency single NW photovoltaic devices.

This paper presents a configuration of dual output single phase current source inverter with 6 switches for microgrid applications. The inverter is capable of delivering power to two independent set of loads of equal voltages or different voltages at the load end. The control strategy is based on Integral Sliding Mode Control (ISMC). The remote monitoring of the inverter is performed with cyber infrastructure. The cyber physical test bench is developed based on Reconfigurable I/O processor (NI MyRIO-1900) for control and monitoring of the inverter. The inverter prototype is tested in cyber physical test bench in laboratory conditions. The performance of the inverter is analyzed and monitored through the remote system. Also, the inverter is analyzed with different voltage conditions.

Continuous object tracking in WSNs, such as monitoring of mud-rock flows, forest fires etc., is a challenging task due to characteristic nature of continuous objects. They can appear randomly in the network field, move continuously, and can change in size and shape. Monitoring such objects in real-time generally require tremendous amount of messaging between sensor nodes to synergistically estimate object’s movement and track its location. In this paper, we propose a novel twofold-sink mechanism, comprising of a mobile and a static sink node. Both sink nodes gather information about boundary sensor nodes, which is then used to uniformly distribute energy consumption across all network nodes, thus helping in saving residual energy of network nodes. Numerous object tracking schemes, using mobile sink, have been proposed in the literature. However, existing schemes employing mobile sink cannot be applied to track continuous objects, because of momentous variation of network topology. Therefore, we present in this paper a mechanism, transformed from K-means algorithm, to find the best sensing location of the mobile sink node. It helps to reduce transmission load on the intermediate network nodes situated between static sink node and the ordinary network sensing nodes. The simulation results show that the proposed scheme can distinctly improve life time of the network, compared to one-sink protocol employed in continuous object tracking.

Although mammography has been the gold standard for early detection of breast cancer, if a woman has dense breast tissue, a false negative diagnosis may occur. Breast ultrasound, whether hand-held or automated, is a useful adjunct to mammography but adds extra time and cost. The primary aim was to demonstrate that our second-generation Aceso system, which combines full-field digital mammography (FFDM) and automated breast ultrasound (ABUS) in a single platform, is able to produce improved quality images that provide clinically meaningful results. Aceso was first tested using two industry standards: a CDMAM phantom to assess the FFDM images; and the CIRS 054GS phantom to evaluate the ABUS images. In addition, 25 women participated in a clinical trial: 14 were healthy volunteers while 11 were patients referred by the breast clinic at Groote Schuur Hospital. The CDMAM phantom results showed the FFDM results were better than EUREF’s standard of “acceptable” and were approaching “achievable”. The ABUS results showed lateral and axial spatial resolution of 0.5 mm and adequate depth penetration of 80 mm. Our second-generation Aceso system, with its improved quality of clinical FFDM and ABUS images, has demonstrated its potential for early detection of breast cancer in a busy clinic.

We investigate new graph characteristics namely total (vertex, edge) face irregularity strength of gen- eralized plane grid graphs Gmn under k-labeling Phi of type (Alpha, Beta, Gamma). The minimum integer k for which a vertex-edge labelled graph has distinct face weights is called the total face irregularity strength of the graph and is denoted by tfs(Gmn). In this article, the graphs G = (V;E; F) under consideration are simple, finite, undirected and planar. We will estimate the exact tight lower bounds for the total face irregularity strength of some families of generalized plane grid graphs.

Mechanical equipment is composed of several parts, the interaction between the parts exists throughout whole life cycle leads to the widespread phenomenon of fault coupling and the diagnosis of independent faults cannot meet the requirements of the health management of mechanical equipment under actual working conditions. In this paper, the topological structure of graph neural network is used to describe the correlation of coupling faults and multiple fault types are regarded as network nodes respectively. The fault features are fused and extracted by graph convolution to achieve the classification of coupling faults. In this paper, dynamic vertexes are defined in data topology and the parameters of DIGNN classification model are optimized by changing the fault type of dynamic vertexes during training stage. The data is loaded into dynamic vertexes for classification and analysis during testing stage. The one-dimensional vibration data is converted into two-dimensional time-frequency domain data by wavelet transform making the input features of the model interpretable to reduce the uncertainty of model training. The data topology is then fed into DIGNN for fault classification, and GCN's node aggregation gives interpretability to each layer of network data processing. The method proposed in this paper can realize accurate diagnosis of independent faults on the data set, and can effectively judge the coupling mode of coupling faults, which is suitable for coupling fault analysis of mechanical equipment.

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

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.

It is essential to deal with data scattered among heterogeneous information sources, which can be structured, semi-structured, or unstructured, to give consumers a cohesive perspective of the data. Information gathering is challenging as a result, and one of the major causes of this is that data sources are developed to support specific applications. A method to simplify this procedure is to use ontology representation as an intermediate step. An ontology represents a knowledge structure that reasonably reflects the real world's complexity and is ideally used in many industries today. This research aims to enhance the functionality of a global ontology system by implementing and integrating a natural language query system. Leveraging NLP-based approaches, we constructed SPARQL queries for our ontologies to facilitate natural language translation into a well-structured query format. A dedicated query component was developed to transform natural language questions into SPARQL queries, with the selection of the optimal query graph to generate the final queries. In the subsequent phase, we explored the integration of distinct sentence encoders to improve latent sentence representations during query construction. The generated SPARQL queries were executed on the global ontology output and then translated into source-specific questions. This innovative approach enables unified access to heterogeneous data sources through a user-friendly natural language querying interface.

With the deepening of the diversification and openness of financial system, financial vulnerability, as an endogenous attribute of financial system, becomes an important measurement of financial security. Based on network analysis, we introduce network curvature indicator improved by Copula entropy as an innovative metric of financial vulnerability. Compared with previous network curvature analysis method, CE-based curvature proposed in this paper can measure market vulnerability and systematic risk with significant advantages.

: Biological networks such as protein interaction networks, gene regulation networks and metabolic pathways are examples of complex networks which are large graphs with small-world and scale-free properties. Analysis of these networks has a profound effect on our understanding the origins of life, health and disease states of organisms, and diagnose diseases to aid the search for remedial processes. In this review, we describe main analysis methods of biological networks using graph theory by first defining main parameters such as clustering coefficient, modularity and centrality. We then survey fundamental graph clustering methods and algorithms followed by the network motif search algorithms with the aim of finding repeating subgraphs in a biological network graph. A frequently appearing subgraph usually conveys a basic function carried out by that small network and discovering such a function provides an insight to the overall function of the organism. Lastly, we review network alignment algorithms that achieve to find similarities between two or more graphs representing biological networks. A conserved subgraph between the biological networks of organisms may mean a common ancestor and finding such relationship may help researchers derive ancestral relationships and predict the future evolution of organisms to enable designing new drugs. We conclude by the current challenging areas of biological network analysis using graph theory and parallel processing for high performance analysis

Breast cancer is one of the most common types of malignant tumors worldwide and the leading cause of cancer-related deaths in women. According to the latest report from the World Health Organization, breast cancer has surpassed lung cancer, becoming the most diagnosed cancer globally. Herein, a systematic, quantitative, and visual analysis of the scientific achievements in natural products research and development for breast cancer over the past 30 years is presented. The study utilizes bibliometric and knowledge graph visualization techniques to analyze the trends, co-occurrence of keywords, cooperative networks, cited literature, and research hotspots in the field. The analysis shows that breast cancer natural drug development involves mutual cooperation between multiple countries, with China, the United States, and India being the most active players. Pharmacology is the discipline with the largest number of articles published in nearly 30 years. The study also reveals that the extraction of drugs from organisms and their metabolites is an important direction in the current development of anticancer drugs. The development of natural medicines for breast cancer together with the mining of genetic knowledge play an important role in treating human breast cancer. The research presented here provides insights into the current state of natural product research and development for breast cancer, and highlights the need for strengthening mutual communication and cooperation between countries and scientific research institutions to enhance the development of breast cancer treatment technologies and natural medicines.

In recent years, intensive work has been carried out to achieve maximum energy production in photovoltaic power plants. Today, this challenge has to be solved for arrays of solar panels that move with the object on which they are installed (vehicles, trucks, ships, etc.). The present work tries to find the best solution for both constant voltage systems and for cases of maximum intensity. Once found, these solutions will be applied in real time for the dynamic recharging of battery packs, trying to achieve energetically autonomous vehicles.To solve these situations, a new computational method of voltage and amperage calculation has been developed in this paper, based on Dijkstra’s minimum path finding algorithm on graph theory, adapted to electrical circuits. For this purpose, panel performance analysis sensors, developed at the University of Malaga, have been combined with different electronic solutions (wifi relay devices using esp8266 or similar chips) achieving an accurate and sufficiently fast solution at very low cost. With this, series or parallel configurations can be carried out depending on the type of energy generation sought. The theoretical solutions using Minkowski paths, achieved in the past, have been simulated and subsequently constructed in this article, indicating the diagrams necessary for their realisation.

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.

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.

Zero-Knowledge Proofs ZKP provide a reliable option to verify that a claim is true without giving detailed information other than the answer. A classical example is provided by the ZKP based in the Graph Isomorphism problem (GI), where a prover must convince the verifier that he knows an isomorphism between two isomorphic graphs without publishing the bijection. We design a novel ZKP exploiting the NP-hard problem of finding the algebraic ideal of a multivariate polynomial set, and consequently resistant to quantum computer attacks. Since this polynomial set is obtained considering instances of GI, we guarantee that the protocol is at least as secure as the GI based protocol.

Dual quaternions have wide applications in automatic differentiation, computer graphics, mechanics and others. Due to its application in control theory, the matrix equation AXB=C has been extensively studied. However, there is currently limited information on matrix equation AXB=C over the dual quaternion algebra. In this paper, we provide the necessary and sufficient conditions for the solvability of the dual quaternion matrix equation AXB=C, and present the expression for the general solution when it is solvable. As an application, we derive the ϕ-Hermitian solutions for the dual quaternion matrix equation AXAϕ=C, where the ϕ-Hermitian extends the concepts of Hermiticity and η-Hermiticity. Lastly, we present a numerical example to verify the main research results of this paper.

The co-occurrence of substance use disorders (SUDs) and psychiatric conditions, often referred to as comorbidity or concurrent disorders, presents intricate challenges in both diagnosis and treatment. This comprehensive narrative review aims to synthesize and critically evaluate the existing evi-dence surrounding the management of individuals with comorbid SUDs and psychiatric disorders. Comorbidity in these domains carries profound implications for clinical practice, research, and policymaking, emphasizing the need for a holistic understanding of the intricate dynamics that arise when these conditions coexist. This review explores recent research findings, evidence-based guidelines, and emerging trends within the field, offering valuable insights for clinicians, re-searchers, and policymakers seeking to navigate the complex terrain of comorbidity in substance use and psychiatric disorders.

FV (finger vein) identification is a biometric identification technology that extracts the features of FV images for identity authentication. To address the limitations of CNN-based FV identification, particularly the challenge of small receptive fields and difficulty in capturing long-range dependencies, an FV identification method Let-Net(Large kernel and attention mechanism Network) was introduced, which combines local and global information. Firstly, Let-Net employs large kernels to broaden the receptive field and incorporates depthwise convolution with residual connections to reduce parameter count. Secondly, Let-Net integrates an attention mechanism to enhance the information flows in channels and spaces for more comprehensive and distinctive FV feature extraction. The experimental results on nine public datasets show that Let-Net has excellent identification performance, and the EER and accuracy rate on the FV_USM dataset can reach 0.04% and 99.77%. The parameter number and FLOPs of Let-Net are only 0.89M and 0.25G, which means that the time cost of training and reasoning of the model is low, and it is easier to deploy and integrate into various applications.

Intrauterine adhesions (IUA) has become one of the main causes of female infertility, how to effectively prevent postoperative re-adhesion has been a clinical challenge. In this study, a mussel-inspired dual-network hydrogel was proposed for postoperative anti-adhesion of IUA. First, calcium alginate/polyacrylamide (CA-PAM) hydrogel was prepared by covalent and Ca2+ cross-linking. Benefiting from abundant phenolic hydroxyl groups, polydopamine (PDA) was introduced to further enhance the adhesion ability and biocompatibility. This CA-PAM hydrogel immersed in 10 mg/mL dopamine solution possessed remarkable mechanical strength (elastic modulus > 5 kPa) and super stretchability (with a breaking elongation of 720%). At the same time, it shown excellent adhesion more than 6 kPa. Surprisingly, the coagulation index of the hydrogel was 27.27 ± 4.91, demonstrating attractive coagulation performance in vitro and the potential for rapid hemostasis after surgery.

The utilization of dual-potential mode of integrated array (IDA) electrodes and other two-electrode systems has revolutionized electrochemical detection by enabling the simultaneous and independent detection of two species, accompanied by the exhibition of unique characteristics. In contrast to conventional dual-potential electrodes, the rotating ring disk electrodes (RRDE), IDA electrodes demonstrate analogous yet vastly improved performance metrics, characterized by remarkable collection efficiency and sensitivity. Notably, due to the distinctive microscale structure of IDA electrode, the special “feedback” effect makes IDA a unique signal amplifier. In recent decades, the research surrounding IDA electrodes has garnered escalating interest due to their attractive attributes. This review centers its focus on the fabrication and applications of IDA electrodes. In the realm of fabrication, two critical breakthroughs are poised for realization: the achievement of reduced dimensions and the diversification of materials. Established fabrication methods for IDA electrodes encompass photolithography, inkjet printing, and direct laser writing, each affording distinct advantages in terms of size and precision in IDA construction. Predominantly employed materials for IDA electrodes include gold, platinum, and carbon, with the selection of fabrication methods guided by considerations such as material properties, desired dimensions, cost-efficiency, and specific application requisites. Within the domain of applications, IDA electrodes, capitalizing on their distinctive attributes, have found utility in diverse fields. This review summarizes the applications of IDA electrodes based on their fundamental working principles, encompassing redox cycling, resistance modulation, capacitance variations, and more. The potential for further development of this specialized tool to exhibit enhanced properties holds substantial promise.

Stevia rebaudiana (Bert.) is a natural sweetener with diterpenic glycosides, offering 300 times more sweetness than sucrose, and boasting low-calorie content, along with medicinal and therapeutic properties. To address a limited genetic diversity, a germplasm bank comprising 115 segregated lines of stevia was established in Colombia. Notwithstanding, the fungus Athelia rolfsii adversely impacted key stevia lines, leading to wilting and plant mortality. For this reason our study aimed to explore the biocontrol potential of native strains of Trichoderma spp., isolated from productive lots in Colombia's Cordoba department, as a solution to manage A. rolfsii. Soil samples underwent serial dilution technique (103 conidia.mL-1) to obtain Trichoderma spp. isolates, which were thoroughly morphologically and molecularly characterized. A total five native strains were identified through sequencing the PCR products using universal ITS primers, and comparisons with the GENBANK database confirmed their identity (OK310695.1, ON237703.1, ON238106.1, ON237737.1, and ON237923.1). Their biocontrol efficacy against A. rolfsii was evaluated using the dual culture technique. Remarkably, all strains exhibited significant biocontrol capacity against the A. rolfsii isolate INVEPAR-05 (OK271308.1), except for Trichoderma viride INVEPAR-T10 (ON237923.1). These findings suggest that Trichoderma spp. could be a potential option to manage the fungus in stevia.

The minimum dominating tree (MDT) problem consists of finding a minimum weight sub-graph from an undirected graph, such that each vertex not in this sub-graph is adjacent to at least one of the vertices in it, and the sub-graph is connected without any ring structures. This paper presents a Dual Neighborhoods Search (DNS) algorithm for solving the MDT problem, which integrates several distinguishing features, such as two neighborhoods collaboratively working for optimizing the objective function, a fast neighborhood evaluation method to boost the searching effectiveness, and several diversification techniques to help the searching process jump out of the local optimum trap thus obtaining better solutions. DNS improves the previous best-known results for 4 public benchmark instances while providing competitive results for the remaining ones. Several ingredients of DNS are investigated to demonstrate the importance of the proposed ideas and techniques.

The present paper provides a new definition for dual spline curves in a geometric intuitive way based on adaptive curve refinement techniques. The dual spline is an implementation of the interpolatory subdivision scheme for curve modeling, which is comprised of polynomial segments of different degrees. Specially, the dual spline curves are mainly aims to solve the difficult geometry defeaturing problems in the existing computer-aided technology. Dual spline curves maintain various desirable properties of conventional curve modeling methods, such as local adaptive subdivision, high interpolation accuracy and convergence, continuous and discontinuous boundary approximation. By adding fictitious and intrinsic nodes inside or at the vertices of interpolation elements, the dual spline is flexible and convenient for approximating a set of ordered points or discrete segments. Combined with the Lagrange interpolation polynomial and meshless method, the proposed approach is capable of approximating the non-smooth boundary for geometry defeaturing. Experimental results are given to verify the validity, robustness, and accuracy of the proposed method.

Duchenne muscular dystrophy (DMD) is a yet incurable rare genetic disease that affects the skeletal and cardiac muscles, leading to progressive muscle wasting and premature death. DMD is caused by the lack of dystrophin, a muscle protein essential for the biochemical support and integrity of muscle fibers. Gene replacement strategies for Duchenne muscular dystrophy (DMD) employing the adeno-associated virus (AAV) face the challenge imposed by the limited packaging capacity of AAV, only allowing the accommodation of a short version of dystrophin (µDys) that is still far removed from correcting human disease. The need to develop strategies leading to the expression of a best performing dystrophin variant led to only few studies reporting on the use of dual vectors, but none reported on a method to assess in vivo transgene reconstitution efficiency, the degree of which directly affects the use of safe AAV dosing. We report here on the generation of a dual AAV vector approach for the expression of a larger dystrophin version (quasidystrophin) based on homologous recombination, and the development of a methodology employing a strategic droplet digital PCR design, to determine the recombination efficiency as well as the occurrence of unwanted concatemerization events or aberrant expression from the single vectors. We demonstrated that, upon systemic delivery in the dystrophic DBA2mdx mice, our dual AAV approach led to high transgene reconstitution efficiency and negligible ITR-dependent concatemerization, with consequent remarkable protein restoration in muscles and improvement of muscle pathology. This evidence supports the suitability of our system for gene therapy application and the potential of this methodology to assess and improve the feasibility for therapeutic translation of multiple vector approaches

The study presents the synthesis and characterization of dual-layer sulfonated polyphenylenesulfone (SPPSu) nanocomposite hollow fiber nanofiltration membranes incorporating titanium dioxide (TiO2) nanoparticles using the phase inversion technique. The newly developed membranes were systematically characterized using advanced tools and methods to evaluate their properties and performance. The study focused on investigating the effects of TiO2 addition in the SPPSu inner layer on pure water permeability, and salt rejection. The nanocomposite hollow fiber nanofiltration membranes exhibited a significant enhancement in pure water permeability, with a three-fold increase compared to the pristine membranes, achieving a flux of 5.4 L/m2h.bar. The addition of TiO2 also led to an improvement in the mechanical properties of the membranes, as evidenced by the increase in the expected tensile strength from 2.4 to 3.9 MPa. To evaluate the salt rejection performance, rejection tests were conducted using a laboratory-scale filtration setup in recycle mode. Aqueous solutions containing different divalent ions, specifically magnesium sulfate (Mg2SO4) and sodium sulfate (Na2SO4) at a concentration of 500 ppm, were used as the feed solution. The modified dual-layer hollow fiber nanocomposite membranes exhibited a maximal rejection of 95% for Mg2SO4, demonstrating their effective separation capabilities for divalent ions. The findings of this study highlight the successful synthesis and characterization of dual-layer SPPSu nanocomposite hollow fiber nanofiltration membranes incorporating TiO2 nanoparticles. The incorporation of TiO2 resulted in improved pure water flux, mechanical strength, and salt rejection performance. These enhanced properties make the developed nanocomposite membranes promising candidates for applications in nanofiltration processes, particularly for the selective separation of divalent ions from aqueous solutions.

Objective: To evaluate two different DECT postprocessing protocols for detection of MSU deposits in foot tendons of cadavers with verification by polarizing light microscopy as gold standard.Material and Methods: A total of 40 embalmed cadavers (15 male; 25 female; median age, 82 years; mean, 80 years; range, 52 - 99; SD ± 10.9) underwent DECT to assess MSU deposits in foot tendons.Two postprocessing DECT protocols with different Hounsfield unit (HU) thresholds 150/500 (=established) versus 120/500 (= modified) HU were applied to dual source acquisition with 80 kV for tube A and 140 kV for tube B.Six fresh cadavers (4 male; 2 female; median age, 78; mean, 78,5; range 61 - 95 ) were examined by DECT. Tendon dissection of 2/6 fresh cadavers with positive DECT 120 and negative DECT 150 studies were used to verify MSU deposits by polarizing light microscopy.Results: The tibialis anterior tendon was found positive in 57.5%/100% (DECT 150/120), peroneus tendon in 35%/100%, achilles tendon in 25%/90%, flexor halluces longus tendon in 10%/100%, and tibialis posterior tendon in 12.5%/97.5%. DECT 120 resulted in increased tendon MSU deposit detection, when DECT 150 was negative, with an overall agreement between DECT 150 and DECT 120 of 80 % (P = 0.013). Polarizing light microscope confirmed MSU deposits detected only by DECT 120 in tibialis anterior, achilles, flexor halluces longus and peroneal tendons.Conclusion: The DECT 120 protocol showed a higher sensitivity when compared to DECT 150.

In this nano era, nanomaterials and nanostructures are popular in developing novel functional materials. However, the combinations of nanoproducts with materials at micro and macro scale can open new routes for conceiving novel materials with an improved or even new functional performances. In this study, a brand-new hybrid, containing both nanofibers and particles having a microsize, was fabricated using a sequential electrohydrodynamic atomization (EHDA) process. Firstly, the microparticles loaded with drug (berberine hydrochloride, BH) molecules in the cellulose acetate (CA) were fabricated using a solution electrospraying process. Later, these microparticles were suspended into a co-dissolved solution containned BH and a hydrophilic polymer (polypyrrolidone, PVP), and were co-electrospun into the nanofiber/microparticle hybrids. The EHDA processes were clearly recorded, and the resultant products showed a typical hybrid topography, with microparticles distributed all over the nanofibers, which was demonstrated by SEM assessments. FTIR and XRD demonstrated that the components within the hybrids were presented in an amorphous state and have fine compatibility with each other. In vitro dissolution tests verified that the hybrids were able to provide the designed dula-step drug release profiles, a combination of the fast release step of BH from the hydrophilic PVP nanofibers through an erosion mechanism and the sustained release step of BH from the insoluble CA microparticles via a typical Fickian diffusion mechanism. The present protocols pave a new way for developing trans-scale functional materials.

A low-profile broadband dual-polarized antenna is investigated for base station applications. It consists of two orthogonal dipoles, fork-shaped feeding lines, an artificial magnetic conductor (AMC), and parasitic strips. By utilizing the dispersion Brillouin diagram, the AMC is designed as the antenna reflector. It has a wide in-phase reflection bandwidth of 54.7% (1.54-2.70 GHz) and a surface wave bound range of 0-2.65 GHz. This design effectively reduces the antenna profile by over 50% compared to traditional antennas without an AMC. For demonstration, a prototype is fabricated for 2G/3G/LTE base station applications. Good agreement between simulations and measurements is observed. The measured -10-dB impedance bandwidth of our antenna is 55.4% (1.58 –2.79 GHz), with a stable gain of 9.5 dBi and high isolation of more than 30 dB across the impedance passband. As a result, this antenna is an excellent candidate for miniaturized base station antenna applications.

Human induced pluripotent stem cells (hiPSCs) have two characteristic abilities 1) self-renewal and 2) differentiation into all cell types in the human body. It is this ability of iPSCs to differentiate into any desired cell type that makes them amenable to disease modeling. iPSCs can further be engineered to carry a disease-specific mutation or be derived from patients to phenocopy the disease. To model neurodegenerative/neurodevelopmental disorders iPSCs are differentiated into neurons. This chapter describes protocols for two different approaches to generate neurons from iPSCs, first using dual SMAD inhibition to generate neural progenitor cells which are then differentiated into neurons, and second using single transcription factor (NGN2) over-expression to drive differentiation of iPSCs directly into neurons.

To promote low-carbon and green travel, this study proposes a tripartite evolutionary game model among new energy vehicle manufacturers, consumers, and government agencies. The game strategy combinations of each party and the stability conditions of the equilibrium point in the evolutionary game system are analyzed, and the validity of the conclusions is verified through simulation results. The study shows a strong correlation between the three parties in the evolutionary game system. From the perspective of car manufacturers, the probability of producing new energy vehicles is positively proportional to the subsidy received from new energy policy, the additional revenue gained from the management of the carbon trading scheme, and the fine received for producing conventional fuel vehicles. However, from the consumer perspective, the likelihood that consumers purchase new energy vehicles is positively related to the utility value to consumers and the coverage of public charging points in the city, and inversely related to the sales price of new energy vehicles. From the government perspective, a combination of direct subsidy policies and indirect support strategies should be considered to stimulate the rapid development of the new energy vehicle industry.

Nowadays, many Muslim-majority countries have implemented a dual banking system, namely the sharia and conventional systems. The development of Islamic banks is to fulfill the Muslims' need for the existence of halal transactions in financial institutions. However, in some countries, it turns out that conventional banks still dominate the country's economy. Because of that, it is necessary to see whether there are differences in financial risk and Earnings management between Islamic and conventional banks. The samples are conventional and Islamic banks in Southeast Asia, analyzed by the purposive sampling method from 2010-2019. The analytical tool used is the statistical difference test and economometrics analysis using generalized least square (GLS) regression with panel data (time series and cross-sectional data). These models are intended to forecasting the macroeconomics effects in applying dual banking system in one country or region. The results using non parametrics means difference test showed that the first hypothesis is accepted It means that Earnings management in conventional banks is greater than in Islamic banks. The Random Model Effect (REM) for second and third hypotheses testing on Conventional banks shows the Bankruptcy Risk and NPL do not affect the dependent variable Earnings Management (LLP). While fixed effect model testing on Islamic banks, the second and third hypothesis testing is rejected. Therefor Islamic Banks the value of Bankruptcy Risk (z-score) and the value of Non-Performing Loans (NPL) do not affect Earnings management. It also means that hypothesis 2 and 3 are rejected both in conventional as well as Islamic Banking. Sensitivity analysis for conventional as well as Islamic banking altogether using fixed effect model shows that the second and third hypotheses show that the independent variables (Bankruptcy Risk and NPL) do not affect the dependent variable Earnings Management (LLP). These results can be concluded that Islamic bank are enganged in less earnings management. Therefor in the the long run there are still more research that should conduct in comparing dual banking system in one region.

Introduction: A dual malignancy with both Ewing Sarcoma and Prostate Adenocarcinoma has not been reported in the English literature. We report a case of simultaneous diagnosis of Ewing sarcoma and prostate adenocarcinoma with profound clinical manifestation. Case presentation: A 53-year-old male with advanced metastatic prostate cancer (Gleason-9) admitted with classical presentation of cauda equina syndrome including incontinence, back pain, and paresis following bilateral nephrostomy insertion for the treatment of bilateral renal hy-dronephrosis. The patient was diagnosed with an epidural abscess at the level of L5-S1 and an emergency surgical spine decompression was performed. No abscess was found, and pathology results showed a concomitant primary Ewing sarcoma in the spine. Conclusions: Very rare occurrences of a dual primary malignancy, in this case, Ewing sarcoma and prostate adenocarcinoma, should be kept in mind in patients suffering from complex clinical course of malignancies.

Aims: In late December 2019, early reports predicted the onset of a potential Coronavirus outbreak in china, given the estimate of a reproduction number for the 2019 Novel Coronavirus (COVID-19). Because of high ability of transmission and widespread prevalence, the mortality of COVID-19 infection is growing fast worldwide. Absent of an anti-COVID-19 has put scientists on the urge to repurpose already approved therapeutics or to find new active compounds against coronavirus. Here in this study, a set of computational approaches were performed in order to repurpose antivirals for dual inhibition of the frontier proteases involved in virus replication, papain-like protease (PLpro; corresponding to nsp3) and a main protease (Mpro), 3C‑like protease (3CLpro; corresponding to nsp5). Materials and Methods: In this regard, a rational virtual screening procedure including exhaustive docking techniques was performed for a database of 160 antiviral agents over 3CLpro and PLpro active sites of SARS-CoV-2. The compounds binding energies and interaction modes over 3CLpro and PLpro active sites were analyzed and ranked with the aid of free Gibbs binding energy. The most potent compounds, based on our filtering process, are then proposed as dual inhibitors of SARSC-CoV-2 proteases. Key findings: Accordingly, seven antiviral agents including two FDA approved (Nelfinavir, Valaganciclovir) and five investigational compounds (Merimepodib, Inarigivir, Remdesivir, Taribavirine and TAS106-106) are proposed as potential dual inhibitors of the enzymes necessary for RNA replication in which Remdesivir as well as Inagrivir have the highest binding affinity for both of the active sites. Significance: The mentioned drug proposed to inhibit both PLpro and 3CLpro enzymes with the aim of finding dual inhibitors of SARSC-CoV-2 proteases.

Dislocation is one of the major challenges in unmanned aerial vehicle (UAV) image stitching. In this paper, we propose a new dynamic programming for seamlessly stitching UAV images using optical flow. Our solution consists of two steps: Firstly, an image-matching algorithm is used to correct the images so that they are in the same coordinate system. Secondly, a new dynamic programming algorithm is develop based on the concept of a stereo dual-channel energy accumulation using optical flow. A new energy aggregation and traversal strategy is adopted in our solution, which can find a more optimal seam line for adjacent image stitching. Our algorithm overcomes the theoretical limitation of the classical Duplaquet algorithm. Experiments show that the algorithm can effectively solve the dislocation problem in UAV image stitching. Beyond that, our solution is also direction-independent, which has more adaptability and robustness for UAV images.

In order to correct attenuated millimeter-wavelength (Ka-band) radar data and address the problem of instability, an attenuation correction methodology (attenuation correction with variation trend constraint; VTC) was developed. Using synchronous observation conditions and multi-band radars, the VTC method adopts the variation trends of reflectivity in X-band radar data captured with wavelet transform as a constraint to adjust reflectivity factors of millimeter-wavelength radar. The correction was evaluated by comparing reflectivities obtained by millimeter-wavelength cloud radar and X-band weather radar. Experiments showed that attenuation was a major contributory factor in the different reflectivities of the two radars when relatively intense echoes exist, and the attenuation correction developed in this study significantly improved data quality for millimeter-wavelength radar. Reflectivity differences between the two radars were reduced and reflectivity correlations were enhanced. Errors caused by attenuation were eliminated, while variation details in the reflectivity factors were retained. The VTC method is superior to the bin-by-bin method in terms of correction amplitude and can be used for attenuation correction of shorter wavelength radar assisted by longer wavelength radar data.

Durability monitoring of insecticide-treated nets (ITNs) containing a pyrethroid in combination with a second active ingredient (AI) must be adapted so that the insecticidal bioefficacy of each AI can be monitored independently. An effective way to do this is to measure rapid knock down of a pyrethroid-susceptible strain of mosquitoes to assess the bioefficacy of the pyrethroid component and to use a pyrethroid-resistant strain to measure the bioefficacy of the second ingredient. To allow robust comparison of results across tests within and between test facilities, and over time, protocols for bioefficacy testing must include either characterisation of the resistant strain, standardisation of the mosquitoes used for bioassays, or a combination of the two. Through a series of virtual meetings, key stakeholders and practitioners explored different approaches to achieving these goals. Via an iterative process we decided on the preferred approach and produced a protocol consisting of characterising mosquitoes used for bioefficacy testing before and after a round of bioassays, for example at each time point in a durability monitoring study. We present the final protocol and justify our approach to establishing a standard methodology for durability monitoring of ITNs containing pyrethroid and a second AI.

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.

In recent years, there has been significant growth in the ubiquity and popularity of three dimensional(3D) point clouds, with an increasing focus on the classification of 3D point clouds. To extract richer features from point clouds, many researchers have turned their attention to various point set regions and channels within irregular point clouds. However, this approach has limited capability in attending to crucial regions of interest in 3D point clouds and may overlook valuable information from neighboring features during feature aggregation. Therefore, this paper proposes a novel 3D point cloud classification method based on global attention and adaptive graph convolution. The method consists of two main branches: the first branch com-putes attention masks for each point, while the second branch employs adaptive graph convolu-tion to extract global features from the point set. It dynamically learns features based on point interactions, generating adaptive kernels to effectively and precisely capture diverse relationships among points from different semantic parts. Experimental results demonstrate that the proposed model achieves 93.8% in overall accuracy and 90.8% in average accuracy on the ModeNet40 dataset.

In the intricate domain of text analysis, syntactic dependency trees play a crucial role in unraveling the web of relations among entities embedded in the text. These trees provide a structural roadmap, guiding us through the complex syntax to pinpoint the interactions and connections between different entities. However, the challenge lies in sifting through this intricate structure to extract relevant information, a task that requires precision and discernment. Traditional approaches often rely on rule-based pruning methods to simplify these dependency structures, focusing on certain parts while discarding others. Yet, this approach has its pitfalls, as it can overlook critical nuances and connections that are vital for a comprehensive understanding of the text. Addressing this gap, our research introduces the Syntactic Dependency-Aware Neural Networks (SDANNs), a groundbreaking model designed to harness the full power of the entire dependency tree. This approach marks a significant departure from the conventional methods. Instead of the rigid rule-based pruning, SDANNs implement a more flexible and dynamic 'soft-pruning' technique. This method allows the model to adaptively focus on the sub-structures within the dependency tree that are most relevant for understanding the relationships between entities. By doing so, it ensures that no vital information is overlooked, and all potential connections are considered. The efficacy of SDANNs is not just theoretical but has been empirically validated through extensive testing and evaluations across a wide range of tasks. These tasks include the extraction of complex relations spanning multiple sentences, as well as detailed analyses at the sentence level. In each of these scenarios, SDANNs have demonstrated a remarkable ability to leverage the full structural complexity of dependency trees. This capability sets them apart from existing models, enabling a more nuanced and comprehensive analysis of textual relations. The results of these evaluations consistently show that SDANNs not only meet but significantly exceed the performance of prior models. This superiority is evident in the way SDANNs handle the multifaceted and often subtle interactions within the text, offering insights that were previously inaccessible with conventional methods. In summary, the Syntactic Dependency-Aware Neural Networks represent a significant advancement in the field of text analysis. By fully embracing the complexity of syntactic dependency trees and employing a sophisticated 'soft-pruning' approach, SDANNs open new avenues for exploring and understanding the intricate relationships that exist within written language. This model stands as a testament to the potential of combining advanced neural network architectures with a deep understanding of linguistic structures, paving the way for more accurate, nuanced, and comprehensive analyses of text.

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

Network neuroscience delves into comprehending the intricate arrangement and interactions within the neural networks of the brain. By merging insights from both neuroscience and network theory, it investigates the brain's structure and function through the lens of interconnected nodes (symbolizing brain regions) and edges (symbolizing the connections among these regions) forming a dynamic network. Graph metrics play a pivotal role in neuroscience by providing quantifiable insights into the intricate connectivity patterns within the brain's neural networks. Frequently, nodes are extracted from functional or structural atlases, which can lead to diverse shapes and sizes. Nevertheless, our understanding of how these differing node characteristics and definitions impact the computed graph metrics in neuroimaging data remains limited. This study adopts a data-driven methodology to delineate functional nodes, subsequently examining the influence of their sizes on resultant graph metrics. By employing the Neuromark framework, an entirely automated independent component analysis (ICA) is applied to resting state fMRI data. Through this, functional network connectivity (FNC) matrices are computed—capturing Pearson correlations between component-time courses—while employing a proportional threshold to streamline node connections based on these correlations. Subsequently, various global and local graph metrics are computed, offering insights into network characteristics. Global metrics provide an overarching summary of the network structure, while local measures delve into structural intricacies at the individual component level. Node sizes are computed based on voxel counts surpassing a designated threshold. Next, we calculated the Pearson correlation between the obtained node sizes and the graph metrics, which we term 'node-metric coupling' (NMC). Our findings revealed consistent and noteworthy correlations between the values of graph metrics and the dimensions of brain nodes. To delve deeper into the implications of this correlation, we examined the node-metric coupling within a dataset comprising Alzheimer's disease, mild cognitive impairment, and control subjects. The disparities observed in node-metric coupling among these groups underscore the necessity of accounting for this factor during analysis. The two principal outcomes of this study are as follows: Firstly, the substantial interplay between varying node sizes within a given atlas and the resultant graph metrics; and secondly, the potential utility of node-metric coupling as a viable biomarker for brain disorders. These discoveries hold significant ramifications. While comparing studies employing diverse atlases is already a challenge, our work highlights an additional, critical source of variability: accounting for node sizes. Consequently, the association between intra-atlas node size and graph metric should be thoughtfully acknowledged in future neuroimaging investigations.

Convolutional neural networks (CNN) have attracted much attention as a commonly used method for hyperspectral image (HSI) classification in recent years, however, CNNs can only be applied to Euclidean data and have limitations in dealing with relationships due to the limitations of local feature extraction. However, each pixel of a hyperspectral image contains a set of spectral bands that are correlated and interact with each other, and the methods used to process Euclidean data cannot effectively obtain these correlations. In contrast, the graph convolutional network (GCN) can be used in non-Euclidean data, but usually leads to oversmoothing and ignoring local detail features due to the need for superpixel segmentation processing to reduce computational effort. To overcome the above problems, we constructed a network a fusion network based on GCN and CNN, which contains two branches: a graph convolutional network based on superpixel segmentation and a convolutional network with added attention mechanism. The graph convolu-tional branch can extract the structural features and capture the relationships between the nodes, and the convolutional branch can extract the detailed features in the local fine region. Owing to the fact that the features extracted from the two branches are different, the classification performance can be improved by fusing the complementary features extracted from the two branches. To vali-date the proposed algorithm, experiments were conducted on three widely used datasets, namely Indian Pines, Pavia University, and Salinas, and the overall accuracy of 98.78% was obtained in the Indian Pines dataset, and the overall accuracy of 98.99% and 98.69% was obtained in the other two datasets. The results showed that the proposed fusion network can obtain richer features and achieve high classification accuracy.

Directed acyclic graphs (DAGs) are nonparametric causal path diagrams that have substantial utility as principled representations of disease and healthcare pathways, and of the underlying ‘data generating mechanisms’ these pathways involve. As such, DAGs provide a valuable bridge between: the aetiological knowledge, operational insight and professional experience on which clinical training and practice depend; and the more abstract epistemological and analytical considerations required to extract robust statistical insight from health and healthcare data. DAGs are nonetheless vulnerable to imperfect biomedical paradigms, partial clinical knowledge and limited empirical data. DAGs drawn under such circumstances offer limited scope for statistical insight free from cognitive, analytical or inferential bias if: they misrepresent the data generating mechanisms involved; or ignore the important role that omitted variables (whether measured, unmeasured or unacknowledged) might play therein. To address these weaknesses and broaden the appeal and application of DAGs, this chapter provides ten simple steps that educators can use to improve the analytical competence and statistical confidence of the healthcare students, qualified practitioners and experienced researchers they support. These steps use temporal logic to draw DAGs so as to: reduce reliance on uncertain knowledge, incomplete information, flawed assumptions or guesswork; and avoid, mitigate or acknowledge the errors and biases that each of these incur. The chapter comprises an accessible, non-technical overview of the perspective and thoughtfulness required to generate temporally coherent DAGs as objective representations of the probabilistic causal paths involved in context-specific data generating mechanisms. It encourages a focus on those variables operating as potential sources of analytical or inferential bias when estimating the plausible, probabilistic causal relationship between two pre-specified variables; and specifically addresses the challenges posed by: omitted; time-variant; non-asynchronous; and temporally obscure variables. The chapter includes a worked example based on a published clinical study to demonstrate how each of the steps required to generate temporally-informed DAGs can be applied to: critically appraise the analytical decisions made during applied healthcare research; and inform the decisions required when designing, undertaking and analysing primary and secondary, prospective and retrospective research. The appendices include a summary of ten recommendations for improving the reporting and interrogability of DAGs and DAG-informed analyses.

The origins of directed acyclic graphs (DAGs) date back to the emergence of ‘graph theory’ in the early 1700s (Biggs et al. 1986). DAGs are conceptual or literal, diagrammatic representations of causal paths between variables which are constructed – as their name suggests – on the basis of two over-riding principles: first, that all causal paths are ‘directed’ (i.e. for each pair of variables, only one can represent the cause, while the other must be its consequence); and second, that no direct cyclical paths, or indirect cyclical pathways (comprising sequences of consecutive paths) are allowed, such that no consequence can be considered its own direct or indirect cause (hence ‘acyclic’; Law et al., 2012). As such DAGs reflect the knowledge, presumptions, assumptions and/or speculation of the analyst(s) concerned regarding the causal relationships between each of the variables included therein. Current convention dictates that variables are represented as nodes/vertices, and that any causal paths between variables are represented as directed arcs/edges/lines, often in the form of arrows (see Figure 1). Although each arc indicates the presence and direction of a known/presumed/assumed/speculative causal relationship between the two variables concerned, drawing an arc does not require the sign, magnitude, precision or shape of the relationship to be known or declared (Tennant et al., 2021). In this respect, DAGs provide a simple, uncomplicated, accessible and entirely nonparametric approach for postulating causal relationships amongst any variables of interest even when these are uncertain, unknown or entirely speculative (Ellison, 2020). Nonetheless, as a result of the parametric constraints imposed by the presence/absence of possible arcs within any given DAG, these also reflect and support a number of more sophisticated statistical applications which make it possible to use DAGs to inform the design of multivariable statistical models that reflect the causal structure(s) involved – albeit without the need to know or understand the mathematical technicalities on which these are based (Lewis and Kuerbis, 2016). These features make DAGs attractive cognitive, educational and analytical tools for strengthening the epistemological, theoretical and empirical basis of causal inference, and there has been a recent proliferation in the use of DAGs across a range of applied scientific disciplines (e.g. Knight and Winship, 2013), and an associated upsurge in analytical methods training (e.g. Elwert, 2011; Gilthorpe, 2017; Hernán 2018; Roy, 2021; Hünermund, 2021). This Chapter reflects on a decade of delivering medical statistics training to undergraduate medical students at the University of Leeds between 2012-2021 in which the third year research, evaluation and special studies module (‘RESS3’) has used DAGs to support the development of applied statistical skills relevant to the extended student-selected research and evaluation projects (ESREP) students undertake in their fourth and final years (Ellison, 2021; Ellison et al., 2014a,b). Based on successive iterations of the structure and content of the RESS3 module, together with notes made during formal and informal planning and review meetings with module leads, lecturers, tutors and students, we draw on the claims and criticisms made of DAGs in the epidemiological literature to identify a number of explicit strengths (and associated, often implicit. weaknesses) that are central to their use in prediction and causal inference modelling. While using DAGs requires (and benefits from) a clear understanding of their non-parametric nature and parametric implications, the weaknesses of DAGs seem likely to reflect both: the challenges inherent in the modelling of data generating processes when these are imperfectly understood; and troublesome cognitive and heuristic tendencies common to all analytical tools – in which the tool facilitates the task in hand by reducing the necessity (and benefits of) exploring uncertainties and identifying assumptions. These, more epistemological considerations appear particularly challenging for medical undergraduates to grasp (Ellison, 2021), but also appear poorly understood by many established analysts and clinical epidemiologists (Ellison, 2020).

A simple undirected graph $\Gamma=(V_\Gamma,E_\Gamma)$ admits an $H$-covering if every edge in $E_\Gamma$ belongs to at least one subgraph of $\Gamma$ that isomorphic to a graph $H$. For any graph $\Gamma$ admitting $H$-covering, a total Labelling $\beta: V_\Gamma \cup E_\Gamma \longrightarrow \{1,2,\dots,p\}$ is called an $H$-irregular total $p$-labelling of $\Gamma$ if every two different subgraphs $H_1$ and $H_2$ of $\Gamma$ isomorphic to $H$ have distinct weights where the weight $w_\beta(K)$ of subgraph $K$ of $\Gamma$ is defined as $w_f(K):=\displaystyle \sum_{v\in V_K} f(v) + \sum_{e\in E_K} f(e)$. The smallest number $p$ for which a graph $\Gamma$ admits an $H$-irregular total $p$-labelling is called the total $H$-irregularity strength of $\Gamma$ and is denoted by $ths(\Gamma)$. In this paper, we determine the total $H$-irregularity strength of edge comb product of two graphs.

Graph neural networks (GNNs) build on the success of deep learning models by extending them for use in graph spaces. Transfer learning has proven extremely successful for traditional deep learning problems: resulting in faster training and improved performance. Despite the increasing interest in GNNs and their use cases, there is little research on their transferability. This research demonstrates that transfer learning is effective with GNNs, and describes how source tasks and the choice of GNN impact the ability to learn generalisable knowledge. We perform experiments using real-world and synthetic data within the contexts of node classification and graph classification. To this end, we also provide a general methodology for transfer learning experimentation and present a novel algorithm for generating synthetic graph classification tasks. We compare the performance of GCN, GraphSAGE and GIN across both the synthetic and real-world datasets. Our results demonstrate empirically that GNNs with inductive operations yield statistically significantly improved transfer. Further we show that similarity in community structure between source and target tasks support statistically significant improvements in transfer over and above the use of only the node attributes.

The chemical graph theory is a subfield of mathematical chemistry which applies classic graph theory to chemical entities and phenomena. Chemical graphs are main data structures to represent chemical structures in cheminformatics. Computable properties of graphs lay the foundation for (quantitative) structure activity and structure property predictions - a core discipline of cheminformatics. It has a historic relevance for natural sciences, such as chemistry, biochemistry and biology, and is in the heart of modern disciplines, such as cheminformatics and bioinformatics. This review first covers the history of chemical graph theory, then provides an overview of its various techniques and applications for CASE, and finally summarises modern tools using chemical graph theory for CASE.

This work presents a multi-start algorithm for solving the capacitated vehicle routing problem with two-dimensional loading constraints (2L-CVRP) allowing for the rotation of goods. Researches dedicated to graph theory and symmetry considered the vehicle routing problem as a classical application. This problem has complex aspects that stimulate the use of advanced algorithms and symmetry in graphs. The use of graph modeling of the 2L-CVRP problem by undirected graph allowed the high performance of the algorithm. The developed algorithm is based on metaheuristics such as the Constructive Genetic Algorithm (CGA), to construct promising initial solutions; a Tabu Search (TS), to improve the initial solutions on the routing problem; and a Large Neighborhood Search (LNS), for the loading subproblem. Although each one of these algorithms allowed to solve parts of the 2L-CVRP, the combination of these three algorithms to solve this problem was unprecedented in the scientific literature. In our approach, a parallel mechanism for checking the loading feasibility of routes was implemented using multi-threading programming to improve the performance. Additionally, memory structures, like hash-tables, were implemented to save time by storing and querying previously evaluated results for the loading feasibility of routes. For benchmarks, tests were done on well-known instances available in the literature. The results proved that the framework matched or outperformed most of the previous approaches. As the main contribution, this work brings higher quality solutions for large-size instances of the pure CVRP. This paper involves themes related to the symmetry journal, mainly complex algorithms, graphs, search strategies, complexity, graph modeling, and genetic algorithms. In addition, the paper especially focuses on topic-related aspects of special interest of the community involved in symmetry studies, such as, graph algorithms and graph theory.

Paraphrase generation is an important yet challenging task in NLP. Neural network-based approaches have achieved remarkable success in sequence-to-sequence(seq2seq) learning. Previous paraphrase generation work generally ignores syntactic information regardless of its availability, with the assumption that neural nets could learn such linguistic knowledge implicitly. In this work we make an endeavor to probe into the efficacy of explicit syntactic information for the task of paraphrase generation. Syntactic information can appear in the form of dependency trees which could be easily acquired from off-the-shelf syntactic parsers. Such tree structures could be conveniently encoded via graph convolutional networks(GCNs) to obtain more meaningful sentence representations, which could improve generated paraphrases. Through extensive experiments on four paraphrase datasets with different sizes and genres, we demonstrate the utility of syntactic information in neural paraphrase generation under the framework of seq2seq modeling. Specifically, our GCN-enhanced models consistently outperform their syntax-agnostic counterparts in multiple evaluation metrics.

This paper presents a new framework to classify floor plan elements and represent them in a vector format. Unlike existing approaches using image-based learning frameworks as the first step to segment the image pixels, we first convert the input floor plan image into vector data and utilize graph neural network. Our framework consists of three steps. (1) image pre-processing and vectorization of the floor plan image. (2) region adjacency graph conversion. (3) graph neural network on converted floor plan graphs. Our approach is able to capture different types of indoor elements including basic elements such as walls, doors, and symbols as well as spatial elements such as rooms and corridors. In addition, the proposed method can also detect element shapes. Experimental results show that our framework can classify indoor elements with an F1 score of 95%, with scale and rotation invariance. Furthermore, we propose a new graph neural network model that takes the distance between nodes into account, which is a valuable feature of spatial network data.

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

Indoor scene recognition has great significance for intelligent applications such as mobile robots, location-based services (LBS) and so on. Wherever we are or whatever we do, we are under a specific scene. The human brain can easily discern a scene with a quick glance. However, for a machine to achieve this purpose, on one hand, it often requires plenty of well-annotated data which is time-consuming and labor-intensive. On the other hand, it is hard to learn effective visual representations due to large intra-category variation and inter-categories similarity of indoor scenes. To solve these problems, in this paper, we adopted an unsupervised visual representation learning method which can learn from unlabeled data with a Siamese Convolutional Neural Network (Siamese ConvNet) and graph-based constraints. Specifically, we first mined relationships between unlabeled samples with a graph structure. And then, these relationships can be used as supervision for representation learning with a Siamese network. In this method, firstly, a k-NN graph would be constructed by taking each image as a node in the graph and its k nearest neighbors are linked to form the edges. Then, with this graph, cycle consistency and geodesic distance would be considered as criteria for positive and negative pairs mining respectively. In other words, by detecting cycles in the graph, images with large differences but in the same cycle can be considered as same category (positive pairs). By computing geodesic distance instead of Euclidean distance from one node to another, two nodes with large geodesic distance can be regarded as in different categories (negative pairs). After that, visual representations of indoor scenes can be learned by a Siamese network in an unsupervised manner with the mined pairs as inputs. In order to evaluate the proposed method, we tested it on two scene-centric datasets, MIT67 and Places365. Experiments with different number of categories have been conducted to excavate the potential of proposed method. The results demonstrated that semantic visual representations for indoor scenes can be learned in this unsupervised manner. In addition, with the learned visual representations, indoor scene recognition models trained with the learned representations and a few of labeled samples can achieve competitive performance compared to the state-of-the-art approaches.

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.

List-only entity linking is the task of mapping ambiguous mentions in texts to target entities in a group of entity lists. Different from traditional entity linking task, which leverages rich semantic relatedness in knowledge bases to improve linking accuracy, list-only entity linking can merely take advantage of co-occurrences information in entity lists. State-of-the-art work utilizes co-occurrences information to enrich entity descriptions, which are further used to calculate local compatibility between mentions and entities to determine results. Nonetheless, entity coherence is also deemed to play an important part in entity linking, which is yet currently neglected. In this work, in addition to local compatibility, we take into account global coherence among entities. Specifically, we propose to harness co-occurrences in entity lists for mining both explicit and implicit entity relations. The relations are then integrated into an entity graph, on which Personalized PageRank is incorporated to compute entity coherence. The final results are derived by combining local mention-entity similarity and global entity coherence. The experimental studies validate the superiority of our method. Our proposal not only improves the performance of list-only entity linking, but also opens up the bridge between list-only entity linking and conventional entity linking solutions.

Sleep quality is known to affect automatic and executive brain functions such as gait control and cognitive processing. This study aimed to assess the effect of dual tasks on gait spatiotemporal parameters among young adults with good and poor sleep quality in the United Arab Emirates. In total, 65 young adults with a mean age of 21.1±2.5 were assessed for gait analysis during single-task and dual-task conditions. The participants’ sleep quality was assessed using the Pittsburgh Sleep Quality Index (PSQI), and gait was assessed using the BTS Gaitlab System. The participants were asked to walk at natural speed as a single-task condition, followed by walking while performing a cognitive task as a dual-task condition. The parameters assessed included the gait velocity (m/s), cadence (steps/min), step width (m), and stride length (m). The DTC on each gait parameter was calculated. The Mann–Whitney U test was used to compare the differences in the DTC on gait variables between the good and poor sleep quality groups, and the Spearman correlation test was used to assess the correlation between total PSQI scores and the DTC. At a significance level of p<0.05, a significant difference in cadence between the two sleep quality groups was observed, in addition to a positive correlation between sleep quality and the DTC effect on gait mean velocity, cadence, and stride length. Our findings also revealed a greater DTC on participants with poorer sleep quality. These findings contribute to our understanding of the significance of sleep quality in gait performance while multitasking in younger populations.

Computational simulations of three-dimensional flow around a NACA 0018 wing with an aspect ratio of AR=5 are carried out using the Unsteady Reynolds-Averaged Navier-Stokes (URANS) equations with the Shear-Stress Transport turbulence model closure. Simulations were performed to capture the aerodynamic stall hysteresis using a developed Pseudo-Transient Continuation (PTC) method based on a dual time step approach in the CFD code OpenFOAM. The flow was characterized by an incompressible Mach number of M=0.12 and a moderate Reynolds number Re=0.67×10^6. The results obtained indicate the presence of a noticeable aerodynamic hysteresis in the static dependencies of the force and moment coefficients, as well as the manifestation of bi-stable flow separation patterns, accompanied by the development of asymmetry in the stall zone. The URANS simulation results are in good agreement with the experimental data obtained for the NACA 0018 finite aspect ratio wing from the low-speed wind tunnel under the same test conditions. A new phenomenological bifurcation model of aerodynamic stall hysteresis under static and dynamic conditions is formulated, which is proven to be able to closely match the experimental data.

The dual-station Interferometric Synthetic Aperture Radar (InSAR) system can overcome the physical limitations imposed by the baseline of single-station dual-antenna InSAR. It provides greater flexibility and can enhance elevation measurement accuracy through a well-designed baseline configuration.Unmanned aerial vehicles (UAV) equipped with dual-station InSAR, with relatively low cost and high flexibility, are useful for mapping and land resource exploration. However, due to challenges including spatiotemporal synchronization and motion errors, there are limited reports on UAV-borne dual-station InSAR. This paper proposes a comprehensive method for processing data from small UAV-borne dual-station InSAR by integrating two-way synchronization chain signals. The proposed method includes compensation for time and phase synchronization errors, trajectory refinement with synchronized chain and Position and Orientation System (POS) data, high-precision dual-station InSAR imaging and interferometric processing. Height inversion results based on the proposed method is also provided, demonstrating the effectiveness of the proposed method and improving interferometric accuracy at calibration points from 0.66 meters to 0.42 meters.

The dual leucine zipper kinase (DLK) alias mitogen-activated protein 3 kinase 12 (MAP3K12) has gained much attention in recent years. DLK belongs to the mixed lineage kinases, characterized by homology to serine/threonine and tyrosine kinase but exerts serine/threonine kinase activity. DLK has been implicated in many diseases including several neurodegenerative diseases, glaucoma, and diabetes mellitus. As a MAP3K, it is generally assumed that DLK becomes phosphorylated and activated by upstream signals and phosphorylates and activates itself, the downstream serine/threonine MAP2K, and ultimately MAPK. In addition, other mechanisms such as protein-protein interactions, proteasomal degradation, dephosphorylation by various phosphatases, palmitoylation, and subcellular localization have been shown to be involved in the regulation of DLK activity or its fine-tuning. In the present review, the diverse mechanisms regulating DLK activity will be summarized to provide a better insight into DLK action and possibly new targets to modulate DLK function.

Pesticides are chemical products are used to protect crops to prevent or eliminate undesirable organisms. Pesticides can contaminate continental waters, air, soil and food products. The presence of pesticide residues must therefore be monitored in water and food using sensitive, reliable and broad-spectrum analytical methods, as there is a huge variety of pesticides. Biosensors are one of the screening methods with great potential for detecting residues below the maximum residue limits. The different sensing principles of enzymatic biosensors for pesticide analysis will be described. This review highlights the great potential of colorimetric, enzymatic biosensors for detecting pesticide residues in water and food. Moreover the development of dual colorimetric and fluorimetric sensors during the past years is presented. These methods are most often based on the enzyme acetylcholinesterase, whose activity is inhibited by pesticides. The different approaches used in the development of these biosensors will be detailed, based on different chemical substrates, fluorophores and nanomaterials. The advantages and disadvantages of each approach will be discussed. Finally, the development prospects for improving these biosensors will be presented.

Measuring pulmonary nodules accurately can help with early diagnosis of lung cancer, which can improve a patient’s chances of survival. Many methods for segmenting nodules have been developed, but they all rely on input from radiologists in the form of a 3D volume of interest (VOI) or use a constant region of interest (ROI) and only consider the presence of nodule within the given VOI. These approaches limit the networks’ ability to detect nodules outside the given VOI and can also include unnecessary structures in the VOI, leading to potentially inaccurate segmentation. In this work, we propose a novel approach for 3D lung nodule segmentation by using 2D region of interest (ROI) inputted from radiologist or computer-aided detection (CADe) system. Particularly, we design a dual-encoder-based hard attention network (DEHA-Net) which incorporates the full slice of thoracic computed tomography scan along with the ROI mask to produce an accurate segmentation mask of lung nodule in the given slice. The proposed architecture exploits the adaptive region of interest (A-ROI) algorithm to automatically investigates the penetration of lung nodule into surrounding slices while eliminating the need to drawing separate ROIs in each slice. Further, the framework performs the multi-view analysis, i.e., in sagittal and coronal views, to improve the segmentation performance. The proposed scheme has been rigorously evaluated on the lung image database consortium and image database resource initiative (LIDC/IDRI) dataset and an extensive analysis of results have been performed. The quantitative analysis shows that the proposed method not only improves the existing state-of-the-art in term of dice score but also, significantly robust against the different types, shape and dimensions of lung nodules.

In this paper a microstrip Wilkinson power divider with a 90^° phase delay at one output port is proposed to obtain circular polarization to feed a dual port RFID antenna. The 90^° phase delay was obtained by embedding an extra quarter wavelength at one port of the Wilkinson power divider. The feeding circuit is then mounted on the ground plane of the microstrip antenna feeding the radiating patch directly through the ground plane and dielectric layer thus reducing any fringing effect and resulting a mechanically compact unit. The proposed feeding method offers better expectation of antenna performance with minimal attenuation and coupling losses. The design process generalizes geometric pa- rameters of the Wilkinson power divider for variable port distances. The paper considers both UK and US RFID center frequencies, 870 MHz and 915 MHz respectively. Numeri- cally computed values for geometric design parameters for both frequencies are tabled as future design tools for port distances varying from 18 mm up to 34 mm at 870 MHz and 17 mm up to 32 mm at 915 MHz. Simulation results indicate a return loss (S11) of -20 dB and -26 dB at 870 MHz and 915 MHz operational frequencies respectively at 270^° angled quarter wavelength.

The kinetics and modeling of dual-wavelength controlled photopolymerization confinement (PC) are presented and measured data are analyzed by analytic formulas and numerical data. The UV-light initiated inhibition effect is strongly monomer-dependent and different monomers have different C=C bond rate constants and conversion efficacy. Without the UV-light, for a given blue-light intensity, higher initiator concentration (C₁₀) and rate constant (k’) lead to higher conversion, as also predicted by analytic formulas, in which the total conversion rate (R_T) is an increasing function of k’R, which is proportional to k[gB₁C₁]^0.5. However, the coupling factor b₁ plays a different role that higher b₁ leads to higher conversion only in the transient regime; whereas higher b₁ leads lower steady-state conversion. For a fixed initiator concentration C₁₀, higher inhibitor concentration (C₂₀) leads to lower conversion due to stronger inhibition effect. However, same conversion reduction was found for the same H-factor of H₀ = [b₁C₁₀ - b₂C₂₀]. Conversion of blue-only are much higher than that of UV-only and UV-blue combined, in which high C₂₀ results a strong reduction of blue-only-conversion, such that the UV-light serves as the turn-off (trigger) mechanism for the purpose of spatial confirmation within the overlap area of UV and blue light. For example, UV-light controlled methacrylate conversion of a glycidyl dimethacrylate resin formulated with a tertiary amine co-initiator, and butyl nitrite, subject to a continuous exposure of a blue light, but an on-off exposure of a UV-light. Finally, we developed a theoretical new finding for the criterion of a good material/candidate governed by a double ratio of light-intensity and concentration, [I₂₀C₂₀.]/[I₁₀C₁₀].

Lung cancer remains the leading cancer killer worldwide. Early diagnosis can effectively increase the patient cure rate but existing diagnostic methods limit early lung cancer diagnosis. Therefore, development of a simple but efficient lung cancer screening method is important to improvement of both the diagnosis rate and the survival rate of lung cancer patients. In this study, ten photosensitive materials with high sensitivity and high specificity were screened accurately to construct a microarray sensor that can rapidly identify six types of lung cancer biomarkers in exhaled breath. Results from hierarchical cluster analysis (HCA), principal component analysis (PCA) and difference maps showed that the classification of the analytes agreed with structure similarity laws. The detection results from parallel experiments and structurally similar analytes, in turn, cluster into a group; the fingerprints of the different analytes have specific response regions. The well-screened sensor chip fabrication workload and cost were both reduced by approximately two thirds, while the microfluidic device sensitivity and stability increased by approximately 1.3 times their corresponding values before optimization. The dual-channel device also offers real-time contrast detection and synchronous parallel detection functions and has potential application prospects for use in extensive screening of high-risk populations for lung cancer.

Graph visualization has evolved significantly over time, offering various methods to effectively represent complex data structures. This study introduces a novel force-directed algorithm for 3D data visualization, specifically tailored for commonly used datasets in linked data visualization. Leveraging the power of graph theory and methods, the algorithm aims to address the challenge of creating visually appealing and easily interpretable visualizations, which often necessitate advanced user interaction. By utilizing 3D space and the Unity Engine, the research successfully visualizes data and develops interactive visualizations, overcoming limitations of basic force-directed implementations. The main contribution of presented research is in the force-directed algorithm with springs and controlled placement as a visualization technique that combines the use of springs and attractive forces to stabilize a graph in a 3D environment. The combination of these two techniques also helps prevent the formation of a single large cluster within the graph, enhancing the overall visualization quality.

This paper presents a theory on graph topological structure and graph coloring, proving that for any N-order graph structure (with a topological structure similar to ), the maximum number of colors required for coloring is less than or equal to . The Four Color Theorem is just one special case of this theory, with the maximum structure size for a four-color graph being a 4-order structure graph, hence requiring only a maximum of 4 colors for coloring.

Activities of daily living (ADLs) are fundamental routine tasks that the majority of physically and mentally healthy people can independently execute. In this paper, we present a Semantic Framework for detecting problems in ADLs execution, monitored through Smart Home sensors. In the context of this work, we conducted a pilot study, gathering raw data from various sensors and devices installed in a smart home environment. The proposed Framework combines multiple Semantic Web technologies (i.e. ontology, RDF, triplestore) to handle and transform these raw data into meaningful representations forming a Knowledge Graph. Subsequently, SPARQL queries are used to define and construct explicit rules to detect problematic behaviours in ADLs execution, a procedure that leads to generating new implicit knowledge. Finally, all available results are visualized in a clinician dashboard. The proposed framework can monitor the deterioration of ADLs performance for people in the spectrum of dementia, by offering a comprehensive way for clinicians to describe problematic behaviors in the every-day life of an individual.

This article combines the traditional definition of portfolio risk with minimum spanning tree based “interconnectedness risk" to improve the equal risk contribution portfolio performance. We use betweenness centrality to measure an asset’s importance in a market graph (network). After filtering the complete correlation network to a minimum spanning tree, we calculate the centrality score and convert it to a centrality heuristic. We develop an adjusted variance-covariance matrix using the centrality heuristic, to bias the model to assign peripheral assets in the minimum spanning tree higher weights. We test this methodology using the constituents of the S&P 100 index. The results show that the centrality equal risk portfolio can improve upon the base equal risk portfolio returns, with a similar level of risk. We observe that during bear markets, the centrality-based portfolio can surpass the base equal risk portfolio risk.

The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs) and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for making decisions on real-world problems that need an answer of types “yes, neutral, and no". Consequently, in previous work, we generalized the concept into picture fuzzy graphs (PFGs) where each element in the PFG has membership, neutral, and non-membership degrees. Moreover, we constructed the notion of the coloring of PFGs based on strong and weak adjacencies between vertices. In this paper, we investigate some properties of the chromatic number of PFGs based on the concept of strong and weak adjacencies between vertices. According to the properties, we construct an algorithm to find the chromatic number of PFGs. The algorithm is usefull when we work with large PFGs. Further, we improve the method to implement the PFG’s coloring for determining traffic signal phasing at an intersection. A case study has also been done to evaluate the method.

In this research, we present a comprehensive methodology to categorize perfumes based on their fragrance profiles and subsequently aid in creating innovative odoriferous molecules using advanced neural networks. Drawing from data on Parfumo and the Good Scents Company webpage (Parfumo, 2008; The Good Scents Company, 2021), the study employs sophisticated web scraping techniques to gather diverse perfume attributes. Following this, a k-means algorithm is applied for perfume clustering, paving the way for recommending similar scents to consumers. The process then bridges customer preferences to molecular design by incorporating their feedback into generating new molecules via graph neural networks (GNNs). Through converting the Simple Molecular Input Line Entry System (SMILES) representation into graph structures, the GNN facilitates the creation of new molecular designs attuned to consumer desires. The proposed approach offers promising avenues for consumers to pinpoint similar perfume choices, incorporating feedback, and for manufacturers to conceptualize new fragrant molecules with a high likelihood of market resonance.

Unmanned construction machinery vehicles mostly carry work in bridges, tunnels, and outdoor open spaces. Obtaining accurate pose estimation of the entire vehicle and establishing a map of the surrounding environment is of great significance for path planning and control in the later stage. Traditional simultaneous localization and mapping (SLAM) schemes, which mostly use a single sensor, but there are problems with localization drift and mapping failure in scenarios where there are few geometric features and the environment is prone to degradation. Currently, the multi-sensor fusion strategy has been proven to be an effective solution and widely used in the field of unmanned vehicle localization and mapping. This paper proposes a SLAM framework that tightly couples a LiDAR, IMU and camera to achieve accurate and reliable pose estimation. The framework is based on LiDAR-inertial system(LIS) and factor graph optimization theory. Texture information provided by vision is integrated into the LiDAR-inertial odometry to generate a new visual-inertial subsystem(VIS).The two subsystems, VIS and LIS, can assist each other and work jointly. Through real vehicle tests, the system can perform incremental, real-time state estimation, reconstruct dense 3D point cloud maps,and effectively solve the problems of localization drift and mapping failure in the lack of geometric features or challenging construction environments. Meanwhile, the system has a safety redundancy mechanism. When any subsystem fails, the system can also operate normally, to ensure the reliability and robustness of vehicle positioning.

The fusion of machine learning, biomedical, and bioengineering research offers novel ways to understand, diagnose, and treat various health conditions. However, the complexities of biomedical and bioengineering data, coupled with the intricate process of developing and deploying machine learning solutions, often pose significant challenges to researchers in these fields. We introduce a new Automatic Semantic Machine Learning Microservice Framework (AIMS) that addresses these challenges by automating key aspects of the machine learning pipeline, from data preprocessing to model evaluation. Our proposed framework emphasizes model interpretability, the integration of domain knowledge, and the efficient handling of biomedical data. Furthermore, it incorporates self-supervised knowledge learning strategies, enabling the automatic generation, optimization, and continuous adaptation of machine learning models in response to new tasks and data. We illustrate the potential of our framework through three case studies in biomedical research, showcasing its capacity to streamline research processes, improve scientific exploration quality, and provide a foundation for significant breakthroughs.

Animal models of diseases in particular, the mice, are considered to be the cornerstone for translational research in immunology. The aim of the present study is to model the geometry and analyze the network structure of murine lymphatic system (LS). The algorithm for building the graph model of the LS makes use of anatomical data. To identify the edge directions of the graph model, a mass balance approach to lymph dynamics based on Hagen-Poiseuille equation is applied. It is the first study in which a geometric model of the murine LS has been developed and characterized in terms of its structural organization and the lymph transfer function. Our study meets the demand for quantitative mechanistic approaches in the growing field of immunoengineering to utilize or exploit the lymphatic system for immunotherapy.

Ramsey theory influences the dynamics of mechanical systems, which may be described as abstract complete graphs. We address a mechanical system which is completely interconnected with the two kinds of ideal Hookean springs. The suggested system mechanically corresponds to the cyclic molecules, in which functional groups are interconnected with two kinds of chemical bonds, represented mechanically with two springs k1 and k2. In this paper, we consider a Cyclic system (molecule) built of six equal masses m and two kinds of springs. We pose the following question: what is the minimal number of masses in the such a system in which three masses are constrained to be connected with spring k1 or three masses to be connected with spring k2? The answer to this question is supplied by the Ramsey theory, and it is formally stated as follows: what is the minimal number R3,3? The result emerging from the Ramsey theory is R3,3=6. Thus, in the aforementioned interconnected mechanical system will be necessarily present the triangles (at least one triangle), built of masses and springs. This prediction constitutes the vibrational spectrum of the system. Thus, the Ramsey Theory supplies the selection rules for the vibrational spectra of the cyclic molecules. Symmetrical system built of six vibrating entities is addressed. The Ramsey approach works for 2D and 3D molecules, which may be described as abstract complete graphs. The extension of the proposed Ramsey approach to the systems, partially connected by ideal springs, viscoelastic systems and systems, in which elasticity is of an entropy nature is discussed. “Multi-color systems” built of three kinds of ideal springs are addressed. The notion of the inverse Ramsey network is introduced and analyzed.