We present an incorporation of the kinetic Monte Carlo(kMC)simulation with the adjacency matrix(AM)method to investigate structural parameters of randomly branched polymers.The AMs of branched polymers are obtained by...We present an incorporation of the kinetic Monte Carlo(kMC)simulation with the adjacency matrix(AM)method to investigate structural parameters of randomly branched polymers.The AMs of branched polymers are obtained by the growth generation model,which is employed in the kMC simulation based on Gillespie’s algorithm.Of particular interest is the effect of the branched units on the relevant structural parameters.As an application in randomly hyperbranched polymers formed by AB_(2)type of monomers,average maximum span length,average length of sub-chains,number distribution of branched units,and meansquare radius of gyration are calculated.It is shown that the branched units can give rise to a significant effect on these physical quantities,whereby such a structure-property relationship can be employed to optimize reaction conditions and implement material designs.展开更多
A compliant metamorphic mechanism attributes to a new type of metamorphic mechanisms evolved from rigid metamorphic mechanisms. The structural characteristics and representations of a compliant metamorphic mechanism a...A compliant metamorphic mechanism attributes to a new type of metamorphic mechanisms evolved from rigid metamorphic mechanisms. The structural characteristics and representations of a compliant metamorphic mechanism are different from its rigid counterparts, so does the structural synthesis method. In order to carry out its structural synthesis, a constraint graph representation for topological structure of compliant metamorphic mechanisms is introduced, which can not only represent the structure of a compliant metamorphic mechanism, but also describe the characteristics of its links and kinematic pairs. An adjacency matrix representation of the link relationships in a compliant metamorphic mechanism is presented according to the constraint graph. Then, a method for structural synthesis of compliant metamorphic mechanisms is proposed based on the adjacency matrix operations. The operation rules and the operation procedures of adjacency matrices are described through synthesis of the initial configurations composed of s＋1 links from an s-link mechanism （the final configuration）. The method is demonstrated by synthesizing all the possible four-link compliant metamorphic mechanisms that can transform into a three-link mechanism through combining two of its links. Sixty-five adjacency matrices are obtained in the synthesis, each of which corresponds to a compliant metamorphic mechanism having four links. Therefore, the effectiveness of the method is validated by a specific compliant metamorphic mechanism corresponding to one of the sixty-five adjacency matrices. The structural synthesis method is put into practice as a fully compliant metamorphic hand is presented based on the synthesis results. The synthesis method has the advantages of simple operation rules, clear geometric meanings, ease of programming with matrix operation, and provides an effective method for structural synthesis of compliant metamorphic mechanisms and can be used in the design of new compliant metamorphic mechanisms.展开更多
The adjacency matrix operations,which connect with configuration transformation correspondingly,can be used for analysis of configuration transformation of metamorphic mechanisms and the corresponding algorithm can ea...The adjacency matrix operations,which connect with configuration transformation correspondingly,can be used for analysis of configuration transformation of metamorphic mechanisms and the corresponding algorithm can easily be simulated by computer.But the adjacency matrix based on monochrome topological graph is not suitable for the topological representation of mechanisms with multiple joints.The method of adjacency matrix operations has its own limitations for analysis of configuration transformation of metamorphic mechanisms because it can only be used in the topological representation of mechanisms with single joints.In order to overcome the drawback of the adjacency matrix,a kind of new matrix named as extended adjacency matrix is proposed to express topological structures of all mechanisms.The extended adjacency matrix is not only suitable for the topological representation of mechanisms with single joints,but also can be used in that of mechanisms with multiple joints.On this basis,a method of matrix operations based on the extended adjacency matrix is proposed to analyze the configuration transformation of metamorphic mechanisms.The method is not only suitable for configuration analysis of metamorphic mechanisms with single joints as well as metamorphic mechanisms with multiple joints.The method is evaluated by calculating two examples representing metamorphic mechanisms with single joint and multiple joints respectively.It can be concluded that the method is effective and correct for analysis of configuration transformation of all metamorphic mechanisms.The proposed method is simple and easy to be achieved by computer programming.It provides a basis for structural synthesis of all metamorphic mechanisms.展开更多
This paper proposes an algorithm for building weighted directed graph, defmes the weighted directed relationship matrix of the graph, and describes algorithm implementation using this matrix. Based on this algorithm, ...This paper proposes an algorithm for building weighted directed graph, defmes the weighted directed relationship matrix of the graph, and describes algorithm implementation using this matrix. Based on this algorithm, an effective way for building and drawing weighted directed graphs is presented, forming a foundation for visual implementation of the algorithm in the graph theory.展开更多
The relation is a semantic expression relevant to two named entities in a sentence.Since a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes de...The relation is a semantic expression relevant to two named entities in a sentence.Since a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes dependency information specific to the two named entities.In related work,graph convolutional neural networks are widely adopted to learn semantic dependencies,where a dependency tree initializes the adjacency matrix.However,this approach has two main issues.First,parsing a sentence heavily relies on external toolkits,which can be errorprone.Second,the dependency tree only encodes the syntactical structure of a sentence,which may not align with the relational semantic expression.In this paper,we propose an automatic graph learningmethod to autonomously learn a sentence’s structural information.Instead of using a fixed adjacency matrix initialized by a dependency tree,we introduce an Adaptive Adjacency Matrix to encode the semantic dependency between tokens.The elements of thismatrix are dynamically learned during the training process and optimized by task-relevant learning objectives,enabling the construction of task-relevant semantic dependencies within a sentence.Our model demonstrates superior performance on the TACRED and SemEval 2010 datasets,surpassing previous works by 1.3%and 0.8%,respectively.These experimental results show that our model excels in the relation extraction task,outperforming prior models.展开更多
A mixed graph means a graph containing both oriented edges and undirected edges. The nullity of the Hermitian-adjacency matrix of a mixed graph G, denoted by ηH（G）,is referred to as the multiplicity of the eigenval...A mixed graph means a graph containing both oriented edges and undirected edges. The nullity of the Hermitian-adjacency matrix of a mixed graph G, denoted by ηH（G）,is referred to as the multiplicity of the eigenvalue zero. In this paper, for a mixed unicyclic graph G with given order and matching number, we give a formula on ηH（G）, which combines the cases of undirected and oriented unicyclic graphs and also corrects an error in Theorem 4.2 of [Xueliang LI, Guihai YU. The skew-rank of oriented graphs. Sci. Sin. Math., 2015, 45：93-104（in Chinese）]. In addition, we characterize all the n-vertex mixed graphs with nullity n-3, which are determined by the spectrum of their Hermitian-adjacency matrices.展开更多
In order to discover the probability distribution feature of edge in aviation network adjacent matrix of China and on the basis of this feature to establish an algorithm of searching non-overlap community structure in...In order to discover the probability distribution feature of edge in aviation network adjacent matrix of China and on the basis of this feature to establish an algorithm of searching non-overlap community structure in network to reveal the inner principle of complex network with the feature of small world in aspect of adjacent matrix and community structure,aviation network adjacent matrix of China was transformed according to the node rank and the matrix was arranged on the basis of ascending node rank with the center point as original point.Adjacent probability from the original point to extension around in approximate area was calculated.Through fitting probability distribution curve,power function of probability distribution of edge in adjacent matrix arranged by ascending node rank was found.According to the feature of adjacent probability distribution,deleting step by step with node rank ascending algorithm was set up to search non-overlap community structure in network and the flow chart of algorithm was given.A non-overlap community structure with 10 different scale communities in aviation network of China was found by the computer program written on the basis of this algorithm.展开更多
Fine particulatematter(PM_(2.5))samples were collected in two neighboring cities,Beijing and Baoding,China.High-concentration events of PM_(2.5) in which the average mass concentration exceeded 75μg/m^(3) were freque...Fine particulatematter(PM_(2.5))samples were collected in two neighboring cities,Beijing and Baoding,China.High-concentration events of PM_(2.5) in which the average mass concentration exceeded 75μg/m^(3) were frequently observed during the heating season.Dispersion Normalized Positive Matrix Factorization was applied for the source apportionment of PM_(2.5) as minimize the dilution effects of meteorology and better reflect the source strengths in these two cities.Secondary nitrate had the highest contribution for Beijing(37.3%),and residential heating/biomass burning was the largest for Baoding(27.1%).Secondary nitrate,mobile,biomass burning,district heating,oil combustion,aged sea salt sources showed significant differences between the heating and non-heating seasons in Beijing for same period(2019.01.10–2019.08.22)(Mann-Whitney Rank Sum Test P<0.05).In case of Baoding,soil,residential heating/biomass burning,incinerator,coal combustion,oil combustion sources showed significant differences.The results of Pearson correlation analysis for the common sources between the two cities showed that long-range transported sources and some sources with seasonal patterns such as oil combustion and soil had high correlation coefficients.Conditional Bivariate Probability Function(CBPF)was used to identify the inflow directions for the sources,and joint-PSCF(Potential Source Contribution Function)was performed to determine the common potential source areas for sources affecting both cities.These models facilitated a more precise verification of city-specific influences on PM_(2.5) sources.The results of this study will aid in prioritizing air pollution mitigation strategies during the heating season and strengthening air quality management to reduce the impact of downwind neighboring cities.展开更多
In this paper,we propose a novel graph signal processing convolution recurrent network(GSP CRN)for signal enhancement against high suppressive interference(HSI)in wireless communications.GSPCRN consists of the short-t...In this paper,we propose a novel graph signal processing convolution recurrent network(GSP CRN)for signal enhancement against high suppressive interference(HSI)in wireless communications.GSPCRN consists of the short-time graph signal processing(SGSP)approach and a modified convolution recurrent network.Similar to the traditional shorttime time-frequency transformation,SGSP frames the complex-valued communication signal and transforms it to the graph-domain representations,where the connection and weight flexibility of each vertex are fully taken into account.In the presence of HSI,SGSP can extract signal features from new graph-domain dimensions and empower neural networks for weak signal enhancement.Two SGSP methods,adjacency singular value decomposition and implicit graph transformation,are designed to capture relationships among the sampling points in the segmented signals.Simulation results demonstrate that our proposed GSPCRN outperforms existing classic methods in extracting weak signals from the HSI environment.When the interference-to-signal ratio exceeds 27dB,only our proposed GSPCRN can achieve the interference mitigation.展开更多
The occurrence of local circulating ventilation can be caused by many factors, such as the airflow reversion during mine fire,the improper arrangement of local fan or underground fan station and the man-made error inp...The occurrence of local circulating ventilation can be caused by many factors, such as the airflow reversion during mine fire,the improper arrangement of local fan or underground fan station and the man-made error input of raw data before network solving. Once circulating ventilations occur,the corresponding branches in the ventilation network corresponding to the relevant airways in ventilation system form circuits,and all the direc- tions of the branches in the circuits are identical,which is the unidirectional problem in ventilation network.Based on the properties of node adjacent matrix,a serial of mathe- matical computation to node adjacent matrix were performed,and a mathematical model for determining unidirectional circuits based on node adjacent matrix was put forward.展开更多
基金supported by the Central Guidance on Local Science and Technology Development Fund of Hebei Province (No.236Z7601G)the Interdisciplinary Research Program of Natural Science of Hebei University, China (No.DXK202112)。
文摘We present an incorporation of the kinetic Monte Carlo(kMC)simulation with the adjacency matrix(AM)method to investigate structural parameters of randomly branched polymers.The AMs of branched polymers are obtained by the growth generation model,which is employed in the kMC simulation based on Gillespie’s algorithm.Of particular interest is the effect of the branched units on the relevant structural parameters.As an application in randomly hyperbranched polymers formed by AB_(2)type of monomers,average maximum span length,average length of sub-chains,number distribution of branched units,and meansquare radius of gyration are calculated.It is shown that the branched units can give rise to a significant effect on these physical quantities,whereby such a structure-property relationship can be employed to optimize reaction conditions and implement material designs.
基金supported by National Natural Science Foundation of China (Grant No. 51075039, Grant No. 50805110,Grant No. 50705010)Beijing Municipal Natural Science Foundation of China (Grant No. 3082014)the Fundamental Research Funds for the Central Universities of China (Grant No. 2009CZ08, Grant No. JY10000904010)
文摘A compliant metamorphic mechanism attributes to a new type of metamorphic mechanisms evolved from rigid metamorphic mechanisms. The structural characteristics and representations of a compliant metamorphic mechanism are different from its rigid counterparts, so does the structural synthesis method. In order to carry out its structural synthesis, a constraint graph representation for topological structure of compliant metamorphic mechanisms is introduced, which can not only represent the structure of a compliant metamorphic mechanism, but also describe the characteristics of its links and kinematic pairs. An adjacency matrix representation of the link relationships in a compliant metamorphic mechanism is presented according to the constraint graph. Then, a method for structural synthesis of compliant metamorphic mechanisms is proposed based on the adjacency matrix operations. The operation rules and the operation procedures of adjacency matrices are described through synthesis of the initial configurations composed of s＋1 links from an s-link mechanism （the final configuration）. The method is demonstrated by synthesizing all the possible four-link compliant metamorphic mechanisms that can transform into a three-link mechanism through combining two of its links. Sixty-five adjacency matrices are obtained in the synthesis, each of which corresponds to a compliant metamorphic mechanism having four links. Therefore, the effectiveness of the method is validated by a specific compliant metamorphic mechanism corresponding to one of the sixty-five adjacency matrices. The structural synthesis method is put into practice as a fully compliant metamorphic hand is presented based on the synthesis results. The synthesis method has the advantages of simple operation rules, clear geometric meanings, ease of programming with matrix operation, and provides an effective method for structural synthesis of compliant metamorphic mechanisms and can be used in the design of new compliant metamorphic mechanisms.
基金supported by National Natural Science Foundation of China (Grant No. 51075039, Grant No. 50705010)Beijing Municipal Natural Science Foundation of China (Grant No. 3082014, Grant No.3053017)Fundamental Research Funds for the Central Universities of China (Grant No. 2009CZ08)
文摘The adjacency matrix operations,which connect with configuration transformation correspondingly,can be used for analysis of configuration transformation of metamorphic mechanisms and the corresponding algorithm can easily be simulated by computer.But the adjacency matrix based on monochrome topological graph is not suitable for the topological representation of mechanisms with multiple joints.The method of adjacency matrix operations has its own limitations for analysis of configuration transformation of metamorphic mechanisms because it can only be used in the topological representation of mechanisms with single joints.In order to overcome the drawback of the adjacency matrix,a kind of new matrix named as extended adjacency matrix is proposed to express topological structures of all mechanisms.The extended adjacency matrix is not only suitable for the topological representation of mechanisms with single joints,but also can be used in that of mechanisms with multiple joints.On this basis,a method of matrix operations based on the extended adjacency matrix is proposed to analyze the configuration transformation of metamorphic mechanisms.The method is not only suitable for configuration analysis of metamorphic mechanisms with single joints as well as metamorphic mechanisms with multiple joints.The method is evaluated by calculating two examples representing metamorphic mechanisms with single joint and multiple joints respectively.It can be concluded that the method is effective and correct for analysis of configuration transformation of all metamorphic mechanisms.The proposed method is simple and easy to be achieved by computer programming.It provides a basis for structural synthesis of all metamorphic mechanisms.
基金Project supported by Science Foundation of Shanghai MunicipalConmission of Education (Grant No .03A203)
文摘This paper proposes an algorithm for building weighted directed graph, defmes the weighted directed relationship matrix of the graph, and describes algorithm implementation using this matrix. Based on this algorithm, an effective way for building and drawing weighted directed graphs is presented, forming a foundation for visual implementation of the algorithm in the graph theory.
基金supported by the Technology Projects of Guizhou Province under Grant[2024]003National Natural Science Foundation of China(GrantNos.62166007,62066008,62066007)Guizhou Provincial Science and Technology Projects under Grant No.ZK[2023]300.
文摘The relation is a semantic expression relevant to two named entities in a sentence.Since a sentence usually contains several named entities,it is essential to learn a structured sentence representation that encodes dependency information specific to the two named entities.In related work,graph convolutional neural networks are widely adopted to learn semantic dependencies,where a dependency tree initializes the adjacency matrix.However,this approach has two main issues.First,parsing a sentence heavily relies on external toolkits,which can be errorprone.Second,the dependency tree only encodes the syntactical structure of a sentence,which may not align with the relational semantic expression.In this paper,we propose an automatic graph learningmethod to autonomously learn a sentence’s structural information.Instead of using a fixed adjacency matrix initialized by a dependency tree,we introduce an Adaptive Adjacency Matrix to encode the semantic dependency between tokens.The elements of thismatrix are dynamically learned during the training process and optimized by task-relevant learning objectives,enabling the construction of task-relevant semantic dependencies within a sentence.Our model demonstrates superior performance on the TACRED and SemEval 2010 datasets,surpassing previous works by 1.3%and 0.8%,respectively.These experimental results show that our model excels in the relation extraction task,outperforming prior models.
基金Supported by the National Natural Science Foundation of China(Grant No.11571360)
文摘A mixed graph means a graph containing both oriented edges and undirected edges. The nullity of the Hermitian-adjacency matrix of a mixed graph G, denoted by ηH（G）,is referred to as the multiplicity of the eigenvalue zero. In this paper, for a mixed unicyclic graph G with given order and matching number, we give a formula on ηH（G）, which combines the cases of undirected and oriented unicyclic graphs and also corrects an error in Theorem 4.2 of [Xueliang LI, Guihai YU. The skew-rank of oriented graphs. Sci. Sin. Math., 2015, 45：93-104（in Chinese）]. In addition, we characterize all the n-vertex mixed graphs with nullity n-3, which are determined by the spectrum of their Hermitian-adjacency matrices.
基金National Natural Science Foundation of China(71971017).
文摘In order to discover the probability distribution feature of edge in aviation network adjacent matrix of China and on the basis of this feature to establish an algorithm of searching non-overlap community structure in network to reveal the inner principle of complex network with the feature of small world in aspect of adjacent matrix and community structure,aviation network adjacent matrix of China was transformed according to the node rank and the matrix was arranged on the basis of ascending node rank with the center point as original point.Adjacent probability from the original point to extension around in approximate area was calculated.Through fitting probability distribution curve,power function of probability distribution of edge in adjacent matrix arranged by ascending node rank was found.According to the feature of adjacent probability distribution,deleting step by step with node rank ascending algorithm was set up to search non-overlap community structure in network and the flow chart of algorithm was given.A non-overlap community structure with 10 different scale communities in aviation network of China was found by the computer program written on the basis of this algorithm.
基金supported by the National Institute of Environmental Research(NIER)funded by the Ministry of Environment(No.NIER-2019-04-02-039)supported by Particulate Matter Management Specialized Graduate Program through the Korea Environmental Industry&Technology Institute(KEITI)funded by the Ministry of Environment(MOE).
文摘Fine particulatematter(PM_(2.5))samples were collected in two neighboring cities,Beijing and Baoding,China.High-concentration events of PM_(2.5) in which the average mass concentration exceeded 75μg/m^(3) were frequently observed during the heating season.Dispersion Normalized Positive Matrix Factorization was applied for the source apportionment of PM_(2.5) as minimize the dilution effects of meteorology and better reflect the source strengths in these two cities.Secondary nitrate had the highest contribution for Beijing(37.3%),and residential heating/biomass burning was the largest for Baoding(27.1%).Secondary nitrate,mobile,biomass burning,district heating,oil combustion,aged sea salt sources showed significant differences between the heating and non-heating seasons in Beijing for same period(2019.01.10–2019.08.22)(Mann-Whitney Rank Sum Test P<0.05).In case of Baoding,soil,residential heating/biomass burning,incinerator,coal combustion,oil combustion sources showed significant differences.The results of Pearson correlation analysis for the common sources between the two cities showed that long-range transported sources and some sources with seasonal patterns such as oil combustion and soil had high correlation coefficients.Conditional Bivariate Probability Function(CBPF)was used to identify the inflow directions for the sources,and joint-PSCF(Potential Source Contribution Function)was performed to determine the common potential source areas for sources affecting both cities.These models facilitated a more precise verification of city-specific influences on PM_(2.5) sources.The results of this study will aid in prioritizing air pollution mitigation strategies during the heating season and strengthening air quality management to reduce the impact of downwind neighboring cities.
基金supported by he National Social Science Found of China(2022-SKJJ-B-112).
文摘In this paper,we propose a novel graph signal processing convolution recurrent network(GSP CRN)for signal enhancement against high suppressive interference(HSI)in wireless communications.GSPCRN consists of the short-time graph signal processing(SGSP)approach and a modified convolution recurrent network.Similar to the traditional shorttime time-frequency transformation,SGSP frames the complex-valued communication signal and transforms it to the graph-domain representations,where the connection and weight flexibility of each vertex are fully taken into account.In the presence of HSI,SGSP can extract signal features from new graph-domain dimensions and empower neural networks for weak signal enhancement.Two SGSP methods,adjacency singular value decomposition and implicit graph transformation,are designed to capture relationships among the sampling points in the segmented signals.Simulation results demonstrate that our proposed GSPCRN outperforms existing classic methods in extracting weak signals from the HSI environment.When the interference-to-signal ratio exceeds 27dB,only our proposed GSPCRN can achieve the interference mitigation.
基金National Nature Science Foundation of China(50704019)Nature Science Foundation of Liaoning Province(20062204)
文摘The occurrence of local circulating ventilation can be caused by many factors, such as the airflow reversion during mine fire,the improper arrangement of local fan or underground fan station and the man-made error input of raw data before network solving. Once circulating ventilations occur,the corresponding branches in the ventilation network corresponding to the relevant airways in ventilation system form circuits,and all the direc- tions of the branches in the circuits are identical,which is the unidirectional problem in ventilation network.Based on the properties of node adjacent matrix,a serial of mathe- matical computation to node adjacent matrix were performed,and a mathematical model for determining unidirectional circuits based on node adjacent matrix was put forward.
