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.

Marine renewable energy is emerging as one of the fast-growing industry in the last decades, as modern society pushes for technologies that can convert energy contained from winds, waves, tides and stream flows. The implementation of renewable energy technologies impose high demands on both structural and environmental engineering, as the energy converters have to work under extreme conditions where parameters such as sea-bottom configuration, water transparency and depth, sea-states and prevailing winds are harsh. Constant monitoring of the marine environment is crucial in order to keep this sector reliable. Active acoustics is becoming a standard tool to collect multi-dimensional data from physical, geological and biological properties of the marine environment. The Div. of Electricity of Uppsala University have been developing an environmental monitoring platform based on sonar (Sound Navigation And Raging) systems. This platform aims to monitor the installation, operation and decommissioning of marine renewable energy converters. The focus will be given the observations of behaviours of marine animals in vicinity of energy converters but also structural inspection and monitoring of MRETs. This paper describes how this multifunctional environmental monitoring platform come to existence from the design to the deployment phase.

The growing attention for plug-in electric vehicles, and the associated high-performance demands, have initiated a development trend towards highly efficient and compact on-board battery chargers. These isolated ac-dc converters are most commonly realized using two conversion stages, combining a non-isolated power factor correction (PFC) rectifier with an isolated dc-dc converter. This, however, involves two loss stages and a relatively high component count, limiting the achievable efficiency and power density and resulting in high costs. In this paper a single-stage converter approach is analyzed to realize a single-phase ac-dc converter, combining all functionalities into one conversion stage and thus enabling a cost-effective efficiency and power density increase. The converter topology consists of a quasi-lossless synchronous rectifier followed by an isolated dual active bridge (DAB) dc-dc converter, putting a small filter capacitor in between. To show the performance potential of this bidirectional, isolated ac-dc converter, a comprehensive design procedure and multi-objective optimization with respect to efficiency and power density is presented, using detailed loss and volume models. The models and procedures are verified by a 3.7 kW hardware demonstrator, interfacing a 400 V dc-bus with the single-phase 230 V, 50 Hz utility grid. Measurement results indicate a state-of-the-art efficiency of 96.1% and power density of 2.2 kW/dm³, confirming the competitiveness of the investigated single-stage DAB ac-dc converter.

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.

This study sought to investigate steel frames’ performance with dual lateral loader system (Frame bending + bracings of divergent and convergent) in near and far filed to fault. In order to this, four categories of steel frame with dual system with 8, 10 and 12 story are designed with average formation based on existing seismic regulation in 2800 standard of Iran and tenth chapter of national regulations of construction (planning and performing steel construction). Time history non-linear dynamic analysis under the effect of near and far field earthquakes has been done on plan’s models. Then the maximum of floors’ dislocation, floors’ drift, roof dislocation, base shear and energy curves of frames are shown and compared with each other. All non-linear time history analyses have been accomplished using PERFORM 3D software.

The problem of quantifying the vulnerability of graphs has received much attention nowadays, especially in the field of computer or communication networks. In a communication network, the vulnerability measures the resistance of the network to disruption of operation after the failure of certain stations or communication links. If we think of a graph as modeling a network, the average lower 2-domination number of a graph is a measure of the graph vulnerability and it is defined by ${\gamma }_{2av}\left(G\right)=\frac{1}{\left|V\left(G\right)\right|}{\sum }_{v\in V\left(G\right)}{\gamma }_{2v}\left(G\right)$, where the lower 2-domination number, denoted by ${\gamma }_{2v}\left(G\right)$, of the graph G relative to v is the minimum cardinality of 2-domination set in G that contains the vertex v. In this paper, the average lower 2-domination number of wheels and some related networks namely gear graph, friendship graph, helm graph and sun flower graph are calculated. Then, we offer an algorithm for computing the 2-domination number and the average lower 2-domination number of any graph G.

Graph coloring is a manifestation of graph partitioning, wherein, a graph is partitioned based on the adjacency of its elements. Partitioning serves potentially as a compartmentalization for any structural problem. Vertex coloring is the heart of the problem which is to find the chromatic number of a graph. The fact that there is no general efficient solution to this problem that may work unequivocally for all graphs opens up the realistic scope for combinatorial optimization algorithms to be invoked. The algorithmic complexity of graph coloring is non-deterministic in polynomial time (NP) and hard. To the best of our knowledge, there is no algorithm as yet that procures an exact solution of the chromatic number comprehensively for any and all graphs within the polynomial (P) time domain. However, several heuristics as well as some approximation algorithms have been attempted to obtain an approximate solution for the same. Here, we present a novel heuristic, namely, the 'trailing path', which returns an approximate solution of the chromatic number within polynomial time, and, with a better accuracy than most existing algorithms. The ‘trailing path’ algorithm is effectively a subtle combination of the search patterns of two existing heuristics (DSATUR and Largest First), and, operates along a trailing path of consecutively connected nodes (and thereby effectively maps to the problem of finding spanning tree(s) of the graph) during the entire course of coloring, where essentially lies both the novelty and the apt of the current approach. The study also suggests that the judicious implementation of randomness is one of the keys towards rendering an improved accuracy in such combinatorial optimization algorithms. Apart from the algorithmic attributes, essential properties of graph partitioning in random and different structured networks have also been surveyed, followed by a comparative study. The study reveals the remarkable stability and absorptive property of chromatic number across a wide array of graphs. Finally, a case study is presented to demonstrate the potential use of graph coloring in protein design – yet another hard problem in structural and evolutionary biology.

Tissue-like phantoms are widely used as a model for mimicking the optical properties of live tissue. This paper presents the results of a diffusion reflection method as well as fluorescence lifetime imaging microscopy measurements of fluorescein-conjugated gold nanorods in solution as well as inserted in solid tissue-imitating phantoms. A lack of consistency between the fluorescence lifetime results of the solutions and the phantoms raises a question about the ability of tissue-like phantoms to maintain the optical properties of inserted contrast agents.

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.

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.

Suicide and suicidal behavior are major public health concerns and affect 3-9% of the population worldwide. Despite growing evidence, there are still few effective interventions available to reduce suicide risk. In this article, we describe theoretical models of suicide ideation and behavior and propose to examine the possible effectiveness of a new and innovative preventive strategy. A model of suicidal intrusion (mental imagery related to suicide, also referred to as suicidal flash-forwards) is presented describing one of the assumed mechanisms in the etiology of suicide and the mechanism of therapeutic change. We provide a brief rationale for an Eye Movement Dual Task (EMDT) treatment for suicidal intrusions describing techniques that can be used to target these suicidal mental images and thoughts to reduce overall behavior. Based on the available empirical evidence for the mechanisms of suicidal intrusions, this approach appears to be a promising new treatment to prevent suicidal behavior as it potentially targets one of the linking pins between suicidal ideation and suicidal actions.

This article develops duality principles and related convex dual formulations suitable for the local optimization of non-convex primal formulations for a large class of models in physics and engineering. The results are based on standard tools of functional analysis, calculus of variations and duality theory. In particular, we develop applications to a Ginzburg-Landau type equation.

Let G be a finite group. The prime graph Γ(G) of G is defined as follows: The set of vertices of Γ(G) is the set of prime divisors of |G| and two distinct vertices p and p' are connected in Γ(G), whenever G has an element of order pp'. A non-abelian simple group P is called recognizable by prime graph if for any finite group G with Γ(G)=Γ(P), G has a composition factor isomorphic to P. In [4] proved finite simple groups ²D_n(q), where n ≠ 4k are quasirecognizable by prime graph. Now in this paper we discuss the quasirecognizability by prime graph of the simple groups ²D_2k(q), where k ≥ 9 and q is a prime power less than 10⁵.

Grid energy storage system for PV Applications is connected with three different power sources i.e. PV Array, Battery and the Grid. It is advisable to have Isolation between these three different sources to provide safety for the equipment. The configuration proposed in this paper provides the complete isolation between the three sources. A Power Balancing Control (PBC) for this configuration is proposed to operate the system in three different modes of operation. Control of a dual active bridge (DAB) based battery charger which provides a galvanic isolation between batteries and other sources is explained briefly. Various modes of operation of a Grid energy storage system are also presented in this paper. Hardware-In-Loop (HIL) Simulation is carried out to check the performance of the system and the PBC algorithm. Power circuit (comprises of inverter, dual active bridge based battery charger, grid, PV cell, batteries, contactors and switches) is simulated and the controller hardware and user interface panel are connected as HIL with the simulated power circuit through Real Time Digital Simulator (RTDS). HIL simulation results are presented to explain the control operation, steady state performance in different modes of operation and the dynamic response of the system.

Indoor positioning based on the received signal strength (RSS) of the WiFi signal has become the most popular solution for indoor localization. In order to realize the rapid deployment of indoor localization systems, solutions based on crowdsourcing have been proposed. However, compared to conventional methods, crowdsourced RSS values are more erroneous and can result in large localization errors. To mitigate the negative effect of the erroneous measurements, a graph-based semi-supervised learning (G-SSL) method is used to exploit the correlation between the RSS values at nearby locations to estimate an optimal RSS value at each location. Before using the G-SSL method, the Linear Regression (LR) algorithm is proposed to solve the device diversity problem in crowdsourcing system. Since the spatial distribution of the APs is sparse, the Compressed Sensing (CS) method is applied to precisely estimate the location of the APs. Based on the location of the APs and a simple signal propagation model, the RSS difference between different locations is calculated and used as an additional constraint to improve the performance of G-SSL. Furthermore, to exploit the sparsity of the weights used in the G-SSL, we use the CS method to reconstruct these weights more accurately and make a further improvement on the performance of the G-SSL. Experimental results show improved results in terms of the smoothness of the radio map and the localization accuracy.

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.

The prediction of drug--target interactions is always a key task in the field of drug redirection. However, traditional methods of predicting drug--target interactions are either mediocre or rely heavily on data stacking. In this work, we merged heterogeneous graph information and obtained effective node information and substructure information based on mutual information in graph embeddings. We then learned high quality representations for downstream tasks, and proposed an end--to--end auto--encoder model to complete the task of link prediction. Experimental results show that our method outperforms several state--of--art models. The model can achieve the area under the receiver operating characteristics (AUROC) curve of 0.959 and area under the precise recall curve (AUPR) of 0.848. We found that the mutual information between the substructure and graph--level representations contributes most to the mutual information index in a relatively sparse network. And the mutual information between the node--level and graph--level representations contributes most in a relatively dense network.

We consider a multitude of topics in mathematics where unification constructions play an important role: the Yang–Baxter equation and its modified version, Euler’s formula for dual numbers, means and their inequalities, topics in differential geometry, etc. It is interesting to observe that the idea of unification (unity and union) is also present in poetry. Moreover, Euler’s identity is a source of inspiration for the post-modern poets.

With the growth of air traffic demand in busy airspace, there is an urgent need for airspace sectorization to increase air traffic throughput and ease the pressure on controllers. The purpose of this paper is to develop a method framework that can perform airspace sectorization automatically, reasonably, which can be used as an advisory tool for controllers as an automatic system, especially for eliminating irregular sector shapes generated by simulated annealing algorithm (SAA) based on region growth method. Two graph cutting method, dynamic Monte Carlo method by changing location of flexible vertices (MC-CLFV) and Monte Carlo method by radius changing (MC-RC) were developed to eliminating irregular sector shapes generated by SAA in post-processing. The experimental results show that the proposed method framework of AS can automatically and reasonably generate sector design schemes that meet the design criteria. Our methodology framework and software can provide assistant design and analysis tools for airspace planners to design airspace, improve the reliability and efficiency of airspace design, and reduce the burden of airspace planners. In addition, this lays the foundation for reconstructing airspace with more intelligent method.

In this work, a hybrid component Fault Detection and Diagnosis (FDD) approach for industrial sensor systems is established and analyzed, to provide a hybrid schema that combines the advantages and eliminates the drawbacks of both model-based and data-driven methods of diagnosis. Moreover, it shines the light on a new utilization of Random Forest (RF) together with model-based diagnosis, beyond its ordinary data-driven application. RF is trained and hyperparameter tuned using three-fold cross validation over a random grid of parameters using random search, to finally generate diagnostic graphs as the dynamic, data-driven part of this system. This is followed by translating those graphs into model-based rules in the form of if-else statements, SQL queries or semantic queries such as SPARQL, in order to feed the dynamic rules into a structured model essential for further diagnosis. The RF hyperparameters are consistently updated online using the newly generated sensor data to maintain the dynamicity and accuracy of the generated graphs and rules thereafter. The architecture of the proposed method is demonstrated in a comprehensive manner, and the dynamic rules extraction phase is applied using a case study on condition monitoring of a hydraulic test rig using time-series multivariate sensor readings.

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.

The COVID-19 pandemic has resulted in a wide range of spatial interventions to slow down the spread of the virus. The spatial limitations of narrow public circulation spaces within informal settlements, which house over one billion people around the world, make it impossible for pedestrians to practice physical distancing (or social distancing). In this paper, we propose a flexible mathematical method, named the Cluster Lane Method, for turning a planar circulation network of any size or complexity into a network of unidirectional lanes, making physical distancing possible in narrow circulation spaces by limiting face-to-face interactions. New notions and theorems about oriented graphs in graph theory are introduced. The paper ends with a discussion of the potential implementation of this cost-efficient, low-tech, sustainable solution, and with the introduction of a novel unidirectional tactile paving for the visually impaired.

Smart grid software interconnects multiple Engineering disciplines (power systems, communication, software and hardware technology, instrumentation, big data, etc.). The software architecture is an evolving concept in smart grid systems in which systematic architecture development is a challenging process. The architecture has to realize the complex legacy power grid systems and cope up with current Information and Communication Technologies (ICT). The distributed generation in smart grid environment expects the software architecture to be distributed and to enable local control. Smart grid architecture should also be modular, flexible and adaptable to technology upgrades. In this paper, the authors have made a comprehensive review on architecture for smart grids. An in depth analysis of layered and agent based architectures is presented and compared under various domains.

Abnormal connections in brain networks of healthy people always bring the problems of cognitive impairments and degeneration of specific brain circuits, which may finally result in Alzheimer’s disease (AD). Exploring the development of the brain from normal controls (NC) to AD is an essential part of human research. Although connections changes have been found in the development, the connection mechanism that drives these changes remain incompletely understood. The purpose of this study is to explore the connection changes in brain networks in the process from NC to AD, and uncover the underlying connection mechanism that shapes the topologies of AD brain networks. In particular, we propose a model named MINM from the perspective of topology-based mutual information to achieve our aim. MINM concerns the question of estimating the connection probability between two cortical regions with the consideration of both the mutual information of their observed network topologies and their Euclidean distance in anatomical space. In addition, MINM considers establishing and deleting connections, simultaneously, during the networks modeling from the stage of NC to AD. Experiment results show that MINM is sufficient to capture an impressive range of topological properties of real brain networks such as characteristic path length, network efficiency, and transitivity, and it also provides an excellent fit to the real brain networks in degree distribution compared to experiential models. Thus, we anticipate that MINM may explain the connection mechanism for the formation of the brain network organization in AD patients.

Percutaneous coronary intervention(PCI) with stenting for the treatment of acute coronary syndrome(ACS) is the contemporary standard of care. Such treatment is followed by Dual anti-platelet therapy(DAPT) comprising of aspirin and a P2Y12 inhibitor. The efficacy of this therapy has been well established but the optimal duration of DAPT remains elusive, and has thus far attracted a prodigious deal of scientific attention. Decision regarding DAPT duration can be challenging clinically in the modern era with the evolution of newer stents, more potent antiplatelet agents and novel anticoagulant drugs in addition to an older patient population with multiple comorbidities. Major societal guidelines have emphasized comprehensive assessment of ischemic and bleeding risk, in turn recommending individualization of DAPT duration, thus encouraging "shared decision making". The following review is aimed at critically evaluating the available evidence to help make these crucial clinical decisions regarding duration of DAPT and triple therapy.

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

The mitigation of NLOS (non-line-of-sight) propagation conditions is one of main challenges in wireless signals based indoor localization. When RFID localization technology is applied in applications, RSS fluctuates frequently due to the shade and multipath effect of RF signal, which could result in localization inaccuracy. In particularly, when tags carriers are walking in LOS (line-of-sight) and NLOS hybrid environment, great attenuation of RSS will happen, which would result in great location deviation. The paper proposes an IMU-assisted (Inertial Measurement Unit) RFID based indoor localization in LOS/NLOS hybrid environment. The proposed method includes three improvements over previous RSS based positioning methods: IMU aided RSS filtering, IMU aided LOS/NLOS distinguishing and IMU aided LOS/NLOS environment switching. Also, CRLB (Cramér-Rao Low Bound) is calculated to prove theoretically that indoor positioning accuracy for proposed method in LOS/NLOS mixed environment is higher than position precision of only use RSS information. Simulation and experiments are conducted to show that proposed method can reduce the mean positioning error to around 3 meters without site survey.

Health-related data originating from diverse sources are commonly stored in manifold databases and formats, making it difficult to find, access and gather data for research purposes. In addition, so-called secondary use scenarios for health data are usually hindered by local data codes, missing dictionaries and the lack of metadata and context descriptions. Following the FAIR principles (Findable, Accessible, Interoperable and Reusable), we developed a decentralized infrastructure to overcome these hurdles and enable collaborative research by making the meaning of health-related data understandable to both, humans and machines. This infrastructure is currently being implemented in the realm of the Swiss Personalized Health Network (SPHN), a research infrastructure initiative for enabling the use and exchange of health-related data for research in Switzerland. The SPHN ecosystem for FAIR data consists of the SPHN Dataset (semantic definitions), the SPHN RDF Schema (linkage and transport of the semantics in a machine-readable format), a project RDF template, extensive guidelines and conventions on how to generate SPHN RDF schema, a Terminology Service (converter of clinical terminologies in RDF), and a Quality Assurance Framework (automated data validation with SHACLs and SPARQLs). The SPHN ecosystem has been built in a way that it can easily be adapted and extended by any SPHN project to fit individual needs. By providing such a national ecosystem, SPHN supports researchers in generating, processing and sharing FAIR data.

Social recommendation is almost as the integration of the business platform and social platform, and gradually become a top in recommendation system. Social recommendation algorithm solves the problem of cold start and data sparseness for traditional commodity, while the internal structure of the relationship graph in social relations has not been fully excavated. This paper proposes two models of Micro Relation Transfer Model and Macro Relation Transfer Model of social relations, and applies the social relations transfer models into the social recommendation system. A relationship graph is built from the relationship between customers on the Internet. Micro Relation Transfer Model establishes the transfer activation function by calculating the relationship between the two customers using the similarity of interests set. Micro Relation Transfer Model spreads the relationship of friends by calculating the proportion of common neighbors held by the customer's social relations. In order to effectively control the transmission range and effect of social relations graph, we introduce pruning algorithm based on Monte Carlo Decision Tree convergence algorithm. The experimental results show that SRRTC algorithm enhances the success rate and stability significantly.

Vertical-channel organic dual-gate/base transistors would be highly interesting since vertical organic transistors are the fastest organic transistors demonstrated today. However, incorporating a dual gate/base structure into an ultra-short channel vertical architecture represents a substantial challenge. Here, we successfully realize a new device concept of vertical organic permeable dual-base transistors (OPDBTs), where either of both base electrodes can be used to change the on-currents and tune the threshold voltages. The optimized devices yield a high on-current density of 1.54 A cm^-2 and a large current gain of 9.2×10⁵, corresponding to a high transmission value of 99.998%. The detailed operation mechanisms are investigated by calibrated TCAD simulations with the Poole-Frenkel mobility model, Gaussian density of states and tunneling model. Finally, high-performance logic circuits, e.g. inverter, NAND/AND computation functions are demonstrated with one single OPDBT operating at supply voltages of < 2.0 V. We believe that OPDBTs offer a compact and technologically simple hardware platform with excellent application potential for vertical-channel organic transistors in complex logic circuits.

Since the outbreak of 2019 novel coronavirus (2019-nCoV) at the hardest-hit city of Wuhan, the fast-moving spread has killed over three hundred people and infected more than ten thousands in China¹. There are more than one hundred cases outside of China, affecting a dozen of countries globally². The genome sequence of 2019-nCoV has been reported and fast diagnostic kits, effective treatment as well as preventive vaccines are rapidly being developed³. Initial fast-growing confirmed cases triggered lock-down of Wuhan as well as nearby cities in Hubei Province. Mathematical models have been proposed by scientists around the world to project the numbers of infected cases in the coming days ^4,5. However, major factors such as transportation and cultural customs have not been weighed enough. Our model is not set out for precise prediction of the number of infected cases, rather, it is meant for a glance of the dynamics under a public epidemic emergency situation and of different contributing factors. We hope that our model and simulation would provide more insights and perspective information to public health authorities around the globe for better informed prevention and containment solution.

This paper is a continuation of previous papers on unification theories publishes in AXIOMS. We present results about the (modified) Yang-Baxter equation, Euler’s formula, dual numbers, coalgebra structures, non-associative structures, differential geometry, and (mean) inequalities. We will also attempt to relate our discussion to some Brain Studies and Machine Learnig.

This paper describes a polynomial time algorithm for solving graph isomorphism and automorphism. We introduce a new tree data structure called Walk Length Tree. We show that such tree can be both constructed and compared with another in polynomial time. We prove that graph isomorphism and automorphism can be solved in polynomial time using Walk Length Trees.

The influence and importance of research and development (R&D) for business sustainability have gained increasing interests, especially in the high-tech sector. However, the efforts of R&D might cause complex and mixed impacts on the financial results considering the associated expenses. Thus, this study aims to examine how R&D efforts may influence business to improve its financial performance considering the dual objectives: the gross and the net profitability. This research integrated a rough-set-based soft computing technique and multiple criteria decision-making (MCDM) methods to explore this complex and yet valuable issue. A group of public listed companies from Taiwan, all in the semiconductor sector, was analyzed as a case study. Initially, more than 30 variables were considered, and the adopted soft computing technique retrieved 14 core attributes—for the dual profitability objectives—to form the evaluation model. The importance of R&D for pursuing superior financial prospects is confirmed, and the empirical case demonstrates how to guide an individual company to plan for improvements to achieve its long-term sustainability by this hybrid approach.

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.

This paper presents a new method : HIVEC to learn latent vector representations of graphs in a manner that captures the semantic dependencies of sub-structures. The representations can then be used in machine learning algorithms for tasks such as graph classification, clustering etcetera. The method proposed is unsupervised and uses the information of co-occurrence of sub-structures. It introduces a notion of hierarchical embeddings that allows us to avoid repetitive learning of sub-structures for every new graph. As an alternative to deep learning methods, the edit distance similarity between sub-structures is also used to learn vector representations. We compare the performance of these methods against previous work.

Recently, there have been revolutions in the development of both gene therapy and genome surgical treatments for inherited diseases. Much of this progress has been centered around hereditary retinal dystrophies, because the eye is an immune-privileged and anatomically ideal target. Gene therapy treatments, already demonstrated to be safe and efficacious in numerous clinical trials, are benefitting from the development of new viral vectors, such as dual and triple AAVs. CRISPR/Ca9, which revolutionized the field of gene editing, is being adapted into more precise “high fidelity” and catalytically dead variants. New CRISPR endonucleases, such as CjCas9 and Cas12a, are generating excitement in the field as well. Stem cell therapy has emerged as a promising alternative, allowing human embryo derived stem cells and induced pluripotent stem cells to be edited precisely in vitro and then reintroduced into the body. This article highlights recent progress made in gene therapy and genome surgery for retinal disorders, and it provides an update on precision medicine FDA treatment trials.

This paper presents a novel approach to demonstrate the Collatz Conjecture, an unsolved problem in mathematics stating that all positive integers will eventually converge to 1 when subjected to a recursive sequence of operations. We introduce Algebraic Inverse Trees (AITs), innovative data structures that characterize relationships within the Collatz sequence by tracing inverse transformations back to the origin. Leveraging properties unveiled through this inverted representation, including absence of non-trivial cycles and guaranteed convergence of paths, we construct a topological framework to formally prove that all trajectories invariably lead to 1 under the Collatz iterative process. This modern technique provides not only the machinery to manifest a rigorous proof, but also grants intuitive insights into the deep complexity of this notorious yet elementary conjecture.

A growing area in neurosciences is focused on the modeling and analysis the complex system of connections in neural systems, i.e. the connectome. Here we focus on the representation of connectomes by using graph theory formalisms. The human brain connectomes are usually derived from neuroimages; the analyzed brains are co-registered in the image domain and brought to a common anatomical space. An atlas is then applied in order to define anatomically meaningful regions that will serve as the nodes of the network - this process is referred to as parcellation. Recently, it has been proposed to perform atlas-free random brain parcellation into nodes and align brains in the network space instead of the anatomical image space to define network nodes of individual brain networks. In the network domain, the question of comparison of the structure of networks arises. Such question is tackled by modeling the comparison of brain network as a network alignment (NA) problem. In this paper, we first defined the NA problem formally, then we applied three existing state of the art of multiple alignment algorithms (MNA) on diffusion MRI-derived brain networks and we compared the performances. The results confirm that MNA algorithms may be applied in cases of atlas-free parcellation for a fully network-driven comparison of connectomes.

The realization of the third-generation artificial intelligence (AI) requires the evolution from perceptual intelligence to cognitive intelligence, where knowledge graphs may not meet the practical needs anymore. Based on the dual channel theory, cognitive graphs are established and developed through coordinating the implicit extraction module and the explicit reasoning module as well as integrating knowledge graphs, cognitive reasoning and logical expressions, which have achieved successes in multi-hop question answering. It is desired for cognitive graphs to be widely used in advanced AI applications such as large-scale knowledge representations and intelligent responses, promoting the development of Al dramatically. This review discusses cognitive graphs systematically and elaborately, including basic concepts, generations, theories and technologies. Moreover, we try to predict the development of cognitive intelligence in the short-term future and further enlighten more researches and studies.

Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult. For message forwarding in networks, a planar graph is used to prevent looping, and because long edges are removed by planarization and the resulting planar graph is composed of short edges, messages are forwarded along multiple nodes connected by them even though they can be forwarded directly. To solve this, face routing using information on all nodes within 2-hop range was adopted to forward messages directly to the farthest node within radio range. However, as the density of the nodes increases, network performance plunges because message transfer nodes receive and process increased node information. To deal with this problem, we propose a new face routing using the planar graphs of neighboring nodes to improve transfer efficiency. It forwards a message directly to the farthest neighbor and reduces loads and processing time by distributing network graph construction and planarization to the neighbors. It also decreases the amount of location information to be transmitted by sending information on the planar graph nodes rather than on all neighboring nodes. Simulation results show that it significantly improves transfer efficiency.

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

In order to summarized the polygenic background of psychiatric diseases, polygenic risk scores (PRS) have been developed. Recently, PRS have been use to predict patients with higher comorbidities in psychiatric diseases, like dual diagnosis. PRS are principally derived in analysis of Caucasian and Asian populations, we are not aware of how this PRS could be applied in populations with high admixture. In order to explored this, the present work has the aim to analyzed if previous calculated PRS for psychiatric diseases could predict dual diagnosis in Mexican population, and also, if PRS calculation could be influenced by Mexican Amerindian (MA) global ancestry. We performed PRS calculation, using PRSice, with summary genome-wide association statistics previously published for psychiatric diseases, and also, performed Nagelkerke correlation test in order to established if PRS are correlated with dual diagnosis. We found that dual diagnosis could be predicted by major depressive disorder polygenic risk score. Nevertheless, schizophrenia polygenic risk score is highly correlated with global MA ancestry, independently of the schizophrenia diagnosis. Our results reinforced the notion that PRS calculation could be deviated by the MA global ancestry, nevertheless analysis on larger sample sizes are required in order to clarified this issue.

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 superharmonic imaging of tissue has the potential for high spatial and contrast resolutions, compared to the fundamental and second harmonic imaging. For this technique, the spectral bandwidth of an ultrasound transducer is divided for transmission of ultrasound and reception of its superharmonics (i.e., higher than the second harmonic). Due to the spectral division for the transmission and reception, transmitted ultrasound energy is not sufficient to induce superharmonics in media without using contrast agents, and it is difficult that a transducer has a -6-dB fractional bandwidth of higher than 100%. For the superharmonic imaging of tissue, thus, multi-frequency array transducers are the best choice if available; transmit and receive elements are separate and have different center frequencies. However, the construction of a multi-frequency transducer for intravascular ultrasound (IVUS) imaging is particularly demanding because of its small size of less than 1 mm. Here, we report a recently developed dual-element focused IVUS transducer for the third harmonic imaging of tissue, which consists of a 35-MHz element for ultrasound transmission and a 105-MHz element for third harmonic reception. For high quality third harmonic imaging, both elements were fabricated to have the same focus at 2.5 mm. The results of tissue mimicking phantom tests demonstrated that the third harmonic images produced by the developed transducer had higher spatial resolution and deeper imaging depth than the fundamental images.

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.

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.

In this contribution, different lane-keeping control strategies for Autonomous Ground Vehicles (AGV) have been analyzed and compared. The AGV must be oriented and kept within a given reference path using the front wheel steering angle as the control action for a specific longitudinal velocity. While non-linear models can describe the lateral dynamics of the vehicle in an accurate manner, they might lead to difficulties when computing some real-time control laws such as Model Predictive Control (MPC). Linear Parameter Varying (LPV) models can provide a trade-off between computational complexity and model accuracy. Another way to reduce computational complexity is to explore other control strategies, for example, the one based on the Inverse Kinematic Bicycle model (IKIBI). Additionally, AGV sensors typically work at different measurement acquisition frequencies so that Kalman Filters (KF) are usually needed for sensor fusion. If these frequencies are slower than the actuation rate, a multi-rate KF may be needed. The two control strategies (MPC using a LPV model and IKIBI) have been compared in simulations over a circuit path in the presence of process and measurement Gaussian noise. The MPC controller has shown to provide a more accurate lane-keeping behavior than an IKIBI control strategy. Finally, it has been seen that Dual-Rate Extended Kalman Filters (DREKF) constitute an essential tool when only slow and noisy sensor feedback is available in an AGV lane-keeping application.

In this paper we describe a nonparametric maximum likelihood (NPML) method for estimating multivariate mixing distributions. Given $N$ independent observations, convexity theory shows that the NPML estimator is discrete with at most $N$ support points. The original infinite NPML problem then becomes the finite dimensional problem of finding the location and probability of the support points. The probability of the support points is found by a Primal-Dual Interior-Point method; the location of the support points is found by an Adaptive Grid method. Our method is able to handle high-dimensional and complex multivariate mixture models.An important application is discussed for the problem of population pharmacokinetics and a non-trivial example is treated.Our algorithm has been successfully applied in hundreds of published pharmacometric studies. In addition to population pharmacokinetics, this research also applies to empirical Bayes estimation and many other areas of applied mathematics.

Identifying fake news on the media has been an important issue. This is especially true considering the wide spread of rumors on the popular social networks such as Twitter. Various kinds of techniques have been proposed for automatic rumor detection. In this work, we study the application of graph neural networks for rumor classification at a lower level, instead of applying existing neural network architectures to detect rumors. The responses to true rumors and false rumors display distinct characteristics. This suggests that it is essential to capture such interactions in an effective manner for a deep learning network to achieve better rumor detection performance. To this end we present a simplified aggregation graph neural network architecture. Experiments on publicly available Twitter datasets demonstrate that the proposed network has performance on a par with or even better than that of state-of-the-art graph convolutional networks, while significantly reducing the computational complexity.

In this paper, we introduce the generalized dual hyperbolic Fibonacci numbers. As special cases, we deal with dual hyperbolic Fibonacci and dual hyperbolic Lucas numbers. We present Binet's formulas, generating functions and the summation formulas for these numbers. Moreover, we give Catalan's, Cassini's, d'Ocagne's, Gelin-Cesàro's, Melham's identities and present matrices related with these sequences.

The hybrid numbers are a generalization of complex, hyperbolic and dual numbers. In this paper, we introduce the Horadam hybrid polynomials called Horadam hybrinomials. We also give some special cases and algebraic properties of the Horadam hybrinomials. Finally we obtain some applications related to the Horadam hybrinomials in matrices.

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

Recent years have seen a massive increase in research on mindfulness as both a therapeutic practice as well as a protective health factor. While many associations have been made between mindfulness and clinical outcomes, understanding of the underlying mechanistic processes is still in its infancy. In this review, associations between mindfulness and other established frameworks in cognitive control are explored—in particular the dual modes of control framework in cognitive control theory. Studies in mindfulness providing evidence towards a dual-mode mindfulness model are reviewed and compared with the proactive and reactive modes of cognitive control to identify common underlying principles. Studies involving cognitive testing, advanced neuroimaging, and neurotransmitter levels and their associations with proactive and reactive control are reviewed in the context of the dual modes of mindfulness. While evidence supporting relationships between proactive and reactive modes of mindfulness and cognitive control are preliminary, existing literature on mindfulness already supports the notion of two components of mindfulness and is in line with the hypothesis that cognitive control and mindfulness are closely related. Since preliminary evidence suggests that proactive forms of mindfulness are more associated with improvement in clinical outcomes, mindfulness programs could be modified to target proactive mindfulness practices to maximize outcomes. The implications of proactive and reactive mindfulness on therapy, limitations of the framework, and necessity of studies providing direct evidence are further discussed.

This paper deals with developing a new class of quaternions, called hyper-dual Horadam quaternions which are constructed from the quaternions whose components are hyper-dual Horadam numbers. We investigate the algebraic properties of these quaternions.

Everyday place descriptions provide a rich source of knowledge about places and their relative locations. This research proposes a place graph model for modeling this spatial, non-spatial, and contextual knowledge from place descriptions. The model extends a prior place graph, and overcomes a number of limitations. The model is implemented using the Neo4j graph database, and a management system has also been developed that allows operations including querying, mapping, and visualizing the stored knowledge in an extended place graph. Then three experimental tasks, namely georeferencing, reasoning, and querying, are selected to demonstrate the superiority of the extended model.

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

Plants produce a diverse portfolio of sesquiterpenes that are important in their response to herbivores and the interaction with other plants. Their biosynthesis from farnesyl diphosphate depends on the sesquiterpene synthases. Here, we investigate to what extent metabolic pathways can be reconstructed just from knowledge of the final product and the reaction mechanisms catalyzed by sesquiterpene synthases. We use the software package MedØlDatschgerl (MØD) to generate chemical networks and elucidate pathways contained in them. As examples, we successfully consider the reachability of the important plant sesquiterpenes β-caryophyllene, α-humulene, and β-farnesene. We also introduce a graph database to integrate simulation results with experimental biological evidence for selected predicted sesquiterpenes biosynthesis.

This article develops a duality principle and a related convex dual formulation suitable for a large class of models in physics and engineering. The results are based on standard tools of functional analysis, calculus of variations and duality theory. In particular, we develop applications to a model in non-linear elasticity.

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.

The application of graph theory in chemical and molecular structure research far exceeds people's expectations, and it has recently grown exponentially. In the molecular graph, atoms are represented by vertices and bonded by edges. Closed forms of multiplicative degree-based topological indices which are numerical parameters of the structure and determine physico-chemical properties of the concerned molecular compound. In this article, we compute and analyze many multiplicative degree-based topological indices of silicon-carbon Si₂C₃-I[p,q] and Si₂C₃-II[p,q].

We present the real number system as a natural generalization of the natural numbers. First, we prove the co-finite topology, $Cof(\mathbb N)$, is isomorphic to the natural numbers. Then, we generalize these results to describe the continuum $[0,1]$. Then we prove the power set $2^{\mathbb Z}$ contains a subset isomorphic to the non-negative real numbers, with all its defining structure of operations and order. Finally, we provide two different constructions of the entire real number line. We see that the power set $2^{\mathbb N}$ can be given the defining structure of $\mathbb R$. The constructions here provided give simple rules for calculating addition, multiplication, subtraction, division, powers and rational powers of real numbers, and logarithms. The supremum and infimum are explicitly constructed by means of a well defined algorithm that ends in denumerable steps. In section 5 we give evidence our construction of $\mathbb N$ and $\mathbb R$ are canonical; these constructions are as natural as possible. In the same section, we propose a new axiomatic basis for analysis. In the last section we provide a series of graphic representations and physical models that can be used to represent the real number system. We conclude that the system of real numbers is completely defined by the order structure of $\mathbb N$.}

Objective: To evaluate three different microincisional ab interno trabeculectomy procedures in a porcine eye perfusion model. Methods: In perfused porcine anterior segments, 90 degrees of trabecular meshwork (TM) were ablated using the Trabectome (T; n = 8), Goniotome (G; n = 8), or Kahook device (K; n = 8). After 24 hours, additional 90 degrees of TM were removed. Intraocular pressure (IOP) and outflow facility were measured at 5 µL/min and 10 µL/min perfusion to simulate an elevated IOP. Structure and function were assessed with canalograms and histology. Results: At 5 µL/min infusion rate, T resulted in a greater IOP reduction than G or K from baseline (76.12% decrease versus 48.19% and 47.96%, P = 0.013). IOP reduction between G and K was similar (P = 0.420). Removing another 90 degrees of TM caused an additional IOP reduction only in T and G but not in K. Similarly, T resulted in the largest increase in outflow facility at 5 µL/min compared with G and K (first ablation: 3.41 times increase versus 1.95 and 1.87; second ablation: 4.60 versus 2.50 and 1.74) with similar results at 10 µL/min (first ablation: 3.28 versus 2.29 and 1.90 (P = 0.001); second ablation: 4.10 versus 3.01 and 2.01 (P = 0.001)). Canalograms indicated circumferential flow beyond the ablation endpoints. Conclusions: T, G and K significantly increased the outflow facility. In this model, T had a larger effect than G and K.

The topological index is a numerical quantity based on the characteristics of various invariants or molecular graph. For ease of discussion, these indices are classified according to their logical derivation from topological invariants rather than their temporal development. Degree based topological indices depends upon the degree of vertices. This paper computes degree based topological indices of Bismuth Tri-Iodide chains and sheets with the help of M-polynomial.

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.

The popular motor drive systems with a single two-level voltage source inverter (VSI) have one main problem that is the occurrence of the common-mode voltage (CMV), which is an effect of the electromagnetic interference, shaft voltage, bearing currents, leakage current. These cause the high stress, increasung temperature and early mechanical failure in machine. To overcome this problem, the technology of the dual two-level VSI fed open-end three-phase ac loads is now available to eliminate the CMV at the ac/induction motor load with the 120-degree modulation technique for controlling each inverter. In this paper, the discontinuous space vector modulation (DSVM) schemes are proposed and applied for the dual two-level VSI fed open-end load. It is based on the 120-degree modulation technique by using only 12 active voltage vectors and the 10 zero voltage vectors from the total 64 voltage vectors along with the different five-segment swicthing sequence designs with centralizing pulse width modulation technqiue in order to not only cancel the CMV in the ac load, but also reduce the switching number/switching loss of the conversion system. Among the various DSVM schemes, their performances are compared in this paper, such as the number of the switching, the step and peak value of the CMV in each inverter, and the quality of the output waveform, etc. The details of the verfication and comparison are carried out by simulation using Matlab/Simulink software.

Though the energy density of lithium-ion batteries continues to increase, safety issues related with the internal short-circuit and the resulting combustion of highly flammable electrolyte impede the further development of lithium-ion batteries. It has been well-accepted that a thermal stable separator is important to postpone the entire battery short-circuit and thermal-runaway. Traditional methods to improve the thermal stability of separators includes surface modification and/or developing alternate material systems for separators which may always affect the battery performance negatively. Herein, a thermostable and shrink-free separator with little compromise in battery performance is prepared by coaxial electrospinning and tested. The separator consists of core-shell fiber networks where poly(vinylidene fluoride-hexafluoropropylene) (PVDF-HFP) layer serves as shell and polyacrylonitrile (PAN) as the core. This core-shell fiber network exhibits little or even no shrinking/melting at elevated temperature over 250 °C. Meanwhile, it shows excellent electrolyte wettability and can take large amount of liquid electrolyte three times more than that of conventional Celgard 2400 separator. In addition, the half-cell using LiNi1/3Co1/3Mn1/3O2 as cathode and the aforementioned electrospun core-shell fiber network as separator demonstrates superior electrochemical behavior, stably cycling for 200 cycles at 1 C with a reversible capacity of 130 mAh g-1 and little capacity decay.

Surrogate model based optimization method is widely-used to accelerate the design and optimization process~\cite{marler2004survey}. The input of regression model used in the surrogate model are numbers, which requires users to parametrize the geometries. In this paper, a new parameterization-free surrogate model is introduced and its corresponding uncertainty quantification and sensitivity analysis method are discussed. The input of new surrogate model methods is surface mesh of simulation domain. \Gls{gnns} is used to extract geometric information, and \Gls{cnns} is used to predict contours. This framework bypasses parameterization,as a consequence, uncertainties introduced by manual parameterization is reduced. However, such changes compared with conventional surrogate model methods impose great challenge on uncertainties quantification and sensitivity analysis. Uncertainties quantification in this paper means the error bar of prediction results, which is calculated by Gaussian Process Regression method in current surrogate method. In this paper, a new quantification method achieved by Kullback-Leibler divergence (KLD) is introduced. And the sensitivity analysis is conducted by Automatic Differentiation, which gives a Jacobian matrix of inputs. The method and analysis mentioned above are demonstrated by a low-pressure steam turbine rotator and its exhaust system.

Clustering algorithms for multi-database mining (MDM) rely on computing $(n^2-n)/2$ pairwise similarities between $n$ multiple databases to generate and evaluate $m\in[1, (n^2-n)/2]$ candidate clusterings in order to select the ideal partitioning which optimizes a predefined goodness measure. However, when these pairwise similarities are distributed around the mean value, the clustering algorithm becomes indecisive when choosing what database pairs are considered eligible to be grouped together. Consequently, a trivial result is produced by putting all the $n$ databases in one cluster or by returning $n$ singleton clusters. To tackle the latter problem, we propose a learning algorithm to reduce the fuzziness in the similarity matrix by minimizing a weighted binary entropy loss function via gradient descent and back-propagation. As a result, the learned model will improve the certainty of the clustering algorithm by correctly identifying the optimal database clusters. Additionally, in contrast to gradient-based clustering algorithms which are sensitive to the choice of the learning rate and require more iterations to converge, we propose a learning-rate-free algorithm to assess the candidate clusterings generated on the fly in a fewer upper-bounded iterations. Through a series of experiments on multiple database samples, we show that our algorithm outperforms the existing clustering algorithms for MDM.

Neural networks models are mostly represented by oriented graphs where only the components, constitutive elements of the graph, are transcribed into mathematical xpression. Indeed, accurate knowledge of the full expression of the model is required in certain situations such as selecting among several reference models, the one that best fits the available data or comparing the explanatory and predictive performance of an established model with respect to some reference models. In this paper, we establish a formalism of the mathematical expression for multilayer perceptron neural network in a general framework, MLP-p-n-q, with p, n and q natural integers and show its restriction to cases where one has a hidden layer and multivariate outputs (MLP-p-1-q), and then a single output (MLP-p-1-1). Then, we give some specific cases of the most commonly used models. An application case is presented in the context of solving a nonlinear regression problem.

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.

In the study of QSAR/QSPR, due to high degree of predictability of pharmaceutical properties, the eccentric-connectivity index has very important place among the other topological descriptors, In this paper, we compute the exact formulas of eccentric-connectivity index and its corresponding polynomial, total eccentric-connectivity index and its corresponding polynomial, first Zagreb eccentricity index, augmented eccentric-connectivity index, modified eccentric-connectivity index and its corresponding polynomial for a class of phosphorus containing dendrimers.

This research analyzed South Korean companies’ adoption of remote work during the COVID-19 pandemic, by focusing on the dual labor market structure comprising of the primary (large corporations) and the secondary sectors (small and medium enterprises (SMEs)). Companies in the dual labor market were classified as per firm size. We used Statistics Korea’s August supplementary data from the Economically Active Population Survey, covering 2017–2020. This empirical study analyzed the factors affecting remote work in 2020, after the outbreak of the pandemic. The results showed that the probability of large corporations introducing remote work during the pandemic increased by a significantly larger margin than for small and medium-sized firms. This suggests that the polarization within the dual labor market structure between large corporations and SMEs also spilled over into companies’ adoption of remote work, which was initially introduced to prevent the spread of the pandemic. Additionally, the polarization in the use of digital technology is likely to persist even after the pandemic. Hence, based on our analysis of remote work adoption in the dual labor market, this study examined the system and factors of labor-management relations contributing toward such polarization and presented policy directions for the current labor market structure.

Based on the Graph Model of Conflict Resolution (GMCR), a two-stage decision framework is developed to reveal the essence of brownfield incidents and facilitate the resolution of brownfield conflicts caused by the incidents. More particularly, the forward GMCR is utilized in Stage I, the negotiation stage, to simulate the evolution of a brownfield conflict (BC) and predict its potential resolution via stability analysis. If no acceptable equilibrium can be obtained, the BC progresses into Stage II, the third-party-intervention stage, where the inverse GMCR is used to assist a third party in intervening the conflict to achieve a desirable outcome. To illustrate the practicality of this framework, a recent BC occurred in Changzhou, China, is taken as a case study. Invaluable insights are provided through the computation and investigation of the corresponding preference relationships.

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.

The goal of this paper is to propose a dual version of the direct cosine simplex algorithm (DDCA) for general linear problems. Unlike the two-phase and the big-M methods, our technique does not involve artificial variables. Our technique solves the dual Klee-Minty problem in two iterations and solves the dual Clausen’s problem in four iterations. The utility of the proposed method is evident from the extensive computational results on test problems adapted from NETLIB. Preliminary results indicate that this dual direct cosine simplex algorithm (DDCA) reduces the number of iterations of two-phase method.

It has recently been shown that, contrary to the wide belief that a shift-enabled condition (necessary for any shift-invariant filter to be representable by a graph shift matrix) can be ignored because any non-shift-enabled matrix can be converted to a shift-enabled matrix, such a conversion in general may not hold for a directed graph with non-symmetric shift matrix. This paper extends this prior work, focusing on undirected graphs where the shift matrix is generally symmetric. We show that while, in this case, the shift matrix can be converted to satisfy the original shift-enabled condition, the converted matrix is not associated with the original graph, that is, it does not capture anymore the structure of the graph signal. We show via a counterexample, that a non-shift-enabled matrix cannot be converted to a shift-enabled one and still maintain the topological structure of the underlying graph, which is necessary to facilitate localized signal processing.

This article aims to solve the problem of robust supervision of a reverse osmosis desalination system (RO-DS) with two models, external model and bond graph model. The structure of an industrial system from the point of view of the external model operates according to several modes of operation (degraded and normal). For this external model, we cannot locate the faults since we are talking about a global operation of the system. The possible solution for the development of research was to use the multidisciplinary model called bond graph. This model by its graphic nature and using a unified language makes it possible to model the industrial system element by element from where it helps the user not only to detect the faults but also to locate them when they appear in the system. The results suggest that the use of the bond graph model for alarm 02 is a reverse osmosis error (RO1); these phenomena are readable on the bond graph model and can be quantified by equations. The equation of the model of this reverse osmosis (RO1) is found in the residual equations (r5, r6 and r7), so that these residues will be sensitive to this rupture. The possible solution during research development was to use the bond graph model to supplement information with physical knowledge and to locate faults. This article also describes the operating safety (by minimizing false alarms and non-detections as well as delays in fault detection) of the desalination system by using the bond graph model described in Linear Fractional Transformation (LFT) form for enable it to manage the robust supervision of a desalination system. An approach based on (LFT-BG) is developed to monitor tank leakage (Cu) and reverse osmosis (RO1 and RO2) faults or valve level (V1 and V2) closures and membrane clogging reverse osmosis (Rm1 and Rm2) that can occur in the reverse osmosis desalination system (RO-DS).

In this paper, we observe that if X is a set and (Bin(X), □) is the semigroup of binary systems on X, then its center ZBin(X) consists of the locally-zero-semigroups and that these can be modeled as (simple) graphs and conversely. Using this device we show that we may obtain many results of interest concerning groupoids by reinterpreting graph theoretical properties and at the same time results on graphs G may be obtained by considering them as elements of centers of the semigroups of binary systems (Bin(X), □) where X = V(G), the vertex set of G.

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.

Social media platforms are entirely an undeniable part of the lifestyle from the past decade. Analyzing the information being shared is a crucial step to understand humans behavior. Social media analysis is aiming to guarantee a better experience for the user and risen user satisfaction. But first, it is necessary to know how and from which aspects to compare users with each other. In this paper, an intelligent system has been proposed to measure the similarity of Twitter profiles. For this, firstly, the timeline of each profile has been extracted using the official Twitter API. Then, all information is given to the proposed system. Next, in parallel, three aspects of a profile are derived. Behavioral ratios are time-series-related information showing the consistency and habits of the user. Dynamic time warping has been utilized for comparison of the behavioral ratios of two profiles. Next, Graph Network Analysis is used for monitoring the interactions of the user and its audience; for estimating the similarity of graphs, Jaccard similarity is used. Finally, for the Content similarity measurement, natural language processing techniques for preprocessing and TF-IDF for feature extraction are employed and then compared using the cosine similarity method. Results have presented the similarity level of different profiles. As the case study, people with the same interest show higher similarity. This way of comparison is helpful in many other areas. Also, it enables to find duplicate profiles; those are profiles with almost the same behavior and content.

Drug repositioning (also called drug repurposing) is a strategy for identifying new therapeutic targets for existing drugs. This approach is of great importance in pharmacology as it is a faster and cheaper way to develop new medical treatments. In this paper, we present, to our knowledge, the first application of multiplex-heterogeneous network embedding to drug repositioning. Network embedding learns the vector representations of nodes, opening the whole machine learning toolbox for a wide variety of applications including link prediction, node labelling or clustering. So far, the application of network embedding for drug repositioning focused on heterogeneous networks. Our approach for drug repositioning is based on multiplex-heterogeneous network embedding. Such method allows the richness and complexity of multiplex and heterogeneous networks to be projected in the same vector space. In other words, multiplex-heterogeneous networks aggregate different multi-omics data in the same network representation. We validate the approach on a task of link prediction and on a case study for SARS-CoV2 drug repositioning. Experimental results show that our approach is highly robust and effective for finding new drug-target associations.

Rigid-body visual tracking is an active research field with many practical applications including visual surveillance and intelligent transport system. In this paper, we define a new problem domain, called visual growth tracking, to track different parts of an object that grow non-uniformly over space and time for application in image-based plant phenotyping. The paper introduces a novel method to detect and track each leaf of a plant for automated leaf stage monitoring. The method has four phases: optimal view selection, plant architecture determination, leaf tracking and generation of a leaf status report. The proposed method uses a graph theoretic approach to reliably detect and track individual leaves by overcoming the challenge of leaf-losses based on temporal image sequence analysis for automatically generating the leaf status report containing the following phenotypes, i.e., the emergence timing of each leaf, total number of leaves present at any time, the day on which a particular leaf stopped growing, and the length and relative growth rate of individual leaves. The proposed method demonstrates high accuracy in detecting leaves and tracking them through the early vegetative stages of maize plants based on experimental evaluation on a publicly available benchmark dataset.

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.

We introduce the Concept-Model-Graph-View Cycle (CMGVC). The CMGVC facilitates coherent architecture analysis, reasoning, insight, and decision-making based on conceptual models that are transformed into a generic, robust graph data structure (GDS). The GDS is then transformed into multiple views of the model, which inform stakeholders in various ways. This GDS-based approach decouples the view from the model and constitutes a powerful enhancement of model-based systems engineering (MBSE). The CMGVC applies the rigorous foundations of Category Theory, a mathematical framework of representations and transformations. We show that modeling languages are categories, drawing an analogy to programming languages. The CMGVC architecture is superior to direct transformations and language-coupled common representations. We demonstrate the CMGVC to transform a conceptual system architecture model built with the Object Process Modeling Language (OPM) into dual graphs and a stakeholder-informing matrix that stimulates system architecture insight.

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.

Functional Connectivity analysis using Electroencephalography signals is common. The EEG signals are converted to networks by transforming the signals into a correlation matrix and analyzing the resulting networks. Here, four learning models, namely, Logistic Regression, Random Forest, Support Vector Machine, and Recurrent Neural Networks, are implemented on the correlation matrix data to classify them either on their psychometric assessment or the effect of therapy; The EEG data is trail-based/event-related. The classifications based on RNN provided higher accuracy( 74-88%) than the other three models( 50-78%). Instead of using individual graph features, a correlation matrix provides an initial test of the data. When compared with the time-resolved correlation matrix, it offered a 4-5% higher accuracy. The time-resolved correlation matrix is better suited for dynamic studies here; it provides lower accuracy when compared to the correlation matrix, a static feature.

The topological index is a numerical quantity based on the characteristics of various invariants or molecular graph. For ease of discussion, these indices are classified according to their logical derivation from topological invariants rather than their temporal development. Degree based topological indices depends upon the degree of vertices. This paper computes Zagreb polynomials and redefined first, second and third Zagrebindices of Bismuth Tri-Iodide chains and sheets.

Lithium-ion batteries have attracted enormous interests recently as promising power sources. However, the safety issue associated with the employment of highly flammable liquid electrolyte impedes the further development of next-generation lithium-ion batteries. Recently, researchers reported the use of electrospun core-shell fiber as the battery separator consisting of polymer layer as protective shell and flame retardants loaded inside as core. In case of a typical battery shorting, the protective polymer shell melts during thermal-runaway and the flame retardants inside would be released to suppress the combustion of the electrolyte. Due to the use of a single precursor solution for electrospinning containing both polymer and flame retardants, the weight ratio of flame retardants is limited and dependent. Herein, we developed a dual-nozzle, coaxial electrospinning approach to fabricate the core-shell nanofiber with a greatly enhanced flame retardants weight percentage in the final fibers. The weight ratio of flame retardants of triphenyl phosphate in the final composite reaches over 60 wt.%. The LiFePO4-based cell using this composite nanofiber as battery separator exhibits excellent flame-retardant property without compromising the cycling stability or rate performances. In addition, this functional nanofiber can also be coated onto commercial separators instead of being used directly as separators.

Background Hokkaido is the northernmost, least populous, and coldest of the Japanese islands. It was the first prefecture to be affected by COVID-19, while Kanagawa is home to one of the most populous areas of Japan, namely the Tokyo metro area. The Japanese government responded early during the pandemic by identifying infected patients, contact tracing, and performing PCR analysis on anyone who was suspected of having been exposed to SARS-CoV-2. The government has also been publishing information about each individual who tested positive for the virus. Both Hokkaido and Kanagawa started recording COVID-19 cases in the winter of 2020 and have detailed records of thousands of patients, thus providing an invaluable resource for the transmission and behavior of the virus. Methods The current study analyzed the COVID-19 registry data from the Hokkaido and Kanagawa prefectures. The Hokkaido registry contained 1,269 cases (674 (53%) females and 595 (47%) males) recorded between February 14 and July 22, 2020. The Kanagawa registry had 3,123 cases (1,346 (43%) females and 1,777 (57%) males. The final data contained a total of 4,392 cases (2,020 (46%) females and 2,372 (54%) males). By leveraging the information on viral transmission paths available in the registry data, we performed exponential random graph model (ERGM) network analysis to examine demographic and symptomological homophilies of the SARS-CoV-2 viral transmission networks. Results We observed age, symptomatic, and asymptomatic homophilies in both prefectures. Furthermore, those patients who contracted the virus through secondary or tertiary contacts were more likely to be asymptomatic than those who contracted it from primary infection cases. The transmission networks showed that transmission occurred significantly in healthcare settings, as well as in families, although the size of the networks was small in the latter. Most of the transmissions stopped at the primary and secondary levels and no transmission beyond quaternary was observed. We also observed a higher level of asymptomatic transmission in Kanagawa than in Hokkaido. Conclusions Symptom homophilies are an important component of COVID-19 and suggest that nuanced genetic differences in the virus may affect its epithelial cell type range and can thus result in the diversity of symptoms seen in individuals infected by SARS-CoV-2. Moreover, environmental variables such as temperature and humidity may also be playing an important role in the overall pathogenesis of the virus.

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.

Although different assessments and evaluations of Dual-Miller cycle performed, specified output power and thermal performance associated with engine determined. Besides, multi objective optimization of thermal efficiency, Ecological Coefficient of performance ( ) and Ecological function ( ) by the mean of NSGA-II technique and thermodynamic analysis performed. The Pareto optimal frontier obtaining the best optimum solution is chosen by fuzzy Bellman-Zadeh, LINMAP, and TOPSIS decision-making techniques. Based on the results, performances of dual-Miller cycles and their optimization are improved.

Based on the principle of Pancharatnam-Berry phase, we propose an approach to construct dual-functional dielectric metasurface doublets. This type of doublet, which is composed of a substrate and two metasurface layers, performs two different functionalities at two different operating wavelengths. The simulated results of the examples show that the designed dual-functional doublet works well as expected. The proposed approach can be used to design dielectric meta-structures with more layers of meta-surface and thereby with more functionalities, and would be of interest for miniaturization and integration.

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.

We studied generalization of a method for extending configurational studies to variables that are not exclusively geographical, in order to allow investigation of generic relationships in the built environment. We observed a number of limitations of the classical approach of configurational studies and we considered how a complex analytical method could be implemented in the study of non-topological variables, such as land use, noise pollution and financial or property rents. In order to do this we established a system of relationships based on a labeled primary graph. Categorization of the labels of the links was performed on a generic variable, specifically, the predominant use of roads. The graph was then contracted using an optimization algorithm, which we describe. The algorithm allows the network to be reduced to a more streamlined system that can better analyze the relationships between the different categories. Application of the method showed that it is faster to identify weaknesses in urban networks, and then take measures to resolve them. The case study concerns the pedestrianization of the Colosseum area in Rome.

Frames are more stable as compared to bases under the action of a bounded linear operator. Sums of different frames under the action of a bounded linear operator are studied with the help of analysis, synthesis and frame operators. A simple construction of frames from the existing ones under the action of such an operator is presented here. It is shown that a frame can be added to its alternate dual frames, yielding a new frame. It is also shown that the sum of a pair of orthogonal frames is a frame. This provides an easy construction of a frame where the frame bounds can be computed easily. Moreover, for a pair of orthogonal frames, the necessary and sufficient condition is presented for their alternate dual frames to be orthogonal. This allows for an easy construction of a large number of new frames.

Resource Description Framework(RDF) is a data representation format of the Semantic Web, and its data volume is growing rapidly. Cloud-based systems provide a rich platform for managing RDF data. However, the distributed environment has performance challenges when it is processing with RDF queries that contain multiple join operations, such as network reshuffle, memory overhead. To get over these challenges, this paper proposed a spark-based RDF query architecture, which is based on Semantic Connection Set (SCS). First of all, this spark-based query architecture adopts the mechanism of re-partitioning class data based on vertical partitioning, which can reduce memory overhead and fast index data. Secondly, a method for generating query plans based on semantic connection sets is proposed in this paper. In addition, statistics and broadcast variable optimization strategies are used to reduce shuffling and data communication costs. The experiment of this paper is based on the latest SPARQLGX on the spark platform RDF system, two synthetic benchmarks are used to evaluate the query. The experiment result illustrates that the proposed approach in this paper is more efficient in data search than SPARQLGX.

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.

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.