Design of control strategies for gene regulatory networks is a challenging and important topic in systems biology. In this paper, the problem of finding both a minimum set of control nodes (control inputs) and a contr...Design of control strategies for gene regulatory networks is a challenging and important topic in systems biology. In this paper, the problem of finding both a minimum set of control nodes (control inputs) and a controller is studied. A control node corresponds to a gene that expression can be controlled. Here, a Boolean network is used as a model of gene regulatory networks, and control specifications on attractors, which represent cell types or states of cells, are imposed. It is important to design a gene regulatory network that has desired attractors and has no undesired attractors. Using a matrix-based representation of BNs, this problem can be rewritten as an integer linear programming problem. Finally, the proposed method is demonstrated by a numerical example on a WNT5A network, which is related to melanoma.展开更多
This paper introduces how to automatically derive a minimum set of viewpoints for maximum coverage over a large scale of digital terrain data.This is a typical data and computation-intensive research covering a series...This paper introduces how to automatically derive a minimum set of viewpoints for maximum coverage over a large scale of digital terrain data.This is a typical data and computation-intensive research covering a series of geocomputation tasks that have not been implemented efficiently or optimally in prior works.This paper introduces a three-step computational solution to resolve the problem.For any given digital elevation model(DEM)data,automatic generation of control viewpoints is the first step through map algebra calculation and hydrological modeling approaches.For each viewpoint,the viewshed calculation then has to be implemented.The combined viewshed derived from the viewshed of all viewpoints establishes the maximum viewshed coverage of the given DEM.Finally,detecting the minimum set of viewpoints for the maximum coverage is a Non-deterministic Polynomial-time hard problem.The outcome of the computation has broader societal impacts since the research questions and solutions can be adapted into realworld application and decision-making practice,such as the distribution,optimization and management of telecommunication infrastructure and wildfire observation towers,and military tactics and operations dependent upon landscape and terrain features.展开更多
The relativity of instructions of motor control digital signal processor (MCDSP) in the design is analyzed. A method for obtaining a minimum instruction set in plac e of the complete instruction set during generatio...The relativity of instructions of motor control digital signal processor (MCDSP) in the design is analyzed. A method for obtaining a minimum instruction set in plac e of the complete instruction set during generation of testing procedures is giv en in terms of the processor presentation matrix between micro-operators and in structions of MCDSP.展开更多
Using quantum algorithms to solve various problems has attracted widespread attention with the development of quantum computing.Researchers are particularly interested in using the acceleration properties of quantum a...Using quantum algorithms to solve various problems has attracted widespread attention with the development of quantum computing.Researchers are particularly interested in using the acceleration properties of quantum algorithms to solve NP-complete problems.This paper focuses on the well-known NP-complete problem of finding the minimum dominating set in undirected graphs.To expedite the search process,a quantum algorithm employing Grover’s search is proposed.However,a challenge arises from the unknown number of solutions for the minimum dominating set,rendering direct usage of original Grover’s search impossible.Thus,a swap test method is introduced to ascertain the number of iterations required.The oracle,diffusion operators,and swap test are designed with achievable quantum gates.The query complexity is O(1.414^(n))and the space complexity is O(n).To validate the proposed approach,qiskit software package is employed to simulate the quantum circuit,yielding the anticipated results.展开更多
【目的】开展土壤健康评价,不仅可以了解甜瓜田土壤健康状况,还可以精准识别土壤障碍因子,为甜瓜田健康土壤培育提供理论支撑。本研究通过建立土壤健康评价数据库并构建最小数据集(minimum data set,MDS),系统评价吐鲁番市甜瓜田的土壤...【目的】开展土壤健康评价,不仅可以了解甜瓜田土壤健康状况,还可以精准识别土壤障碍因子,为甜瓜田健康土壤培育提供理论支撑。本研究通过建立土壤健康评价数据库并构建最小数据集(minimum data set,MDS),系统评价吐鲁番市甜瓜田的土壤健康状况。【方法】在新疆吐鲁番市吐峪沟乡、亚尔镇、三堡乡的甜瓜田中,选择种植年限平均为5年的72个甜瓜地块,采集0—20 cm土层土壤样品,测定了28项土壤物理、化学和生物学指标,建立土壤健康评价数据库。利用主成分分析构建最小数据集,运用线性和非线性评分函数进行土壤健康评价,并通过全数据集(total data set,TDS)对最小数据集的评价结果进行验证。【结果】用主成分分析法筛选出容重、电导率、有效磷、有机碳、交换性钙、土壤呼吸和β-木糖苷酶7个指标,建立了土壤健康评价最小数据集。采用线性评分函数法,基于全数据集和最小数据集计算的土壤健康指数分别为0.44和0.49,变异系数分别为22.5%和18.7%;采用非线性评分函数法,得到的土壤健康指数平均值分别为0.46和0.47,变异系数分别为25.8%和24.3%。基于全数据集和最小数据集计算的土壤健康指数间均呈显著正相关(P<0.01),斜率接近0.9。整体上,吐峪沟乡和亚尔镇甜瓜田土壤健康指数均高于三堡乡。【结论】最小数据集可以代替全数据集用于甜瓜田土壤健康评价,非线性评分函数计算的土壤健康指数变异系数大,说明非线性评分函数更加敏感,建议选择非线性评分函数用于甜瓜田土壤健康评价。新疆吐鲁番市甜瓜田土壤pH为碱性,土壤养分含量处于丰富水平,但有机碳和活性碳含量较低。经最小数据集评价,吐鲁番甜瓜田土壤健康指数在0.5以下,处于中等水平。展开更多
Aiming at the problem that the vehicles always turn left in advance which causes heavy conflicts in the intersection and effected traffic efficiency,the solution of the left-turn lane’s stop line backwards setting wa...Aiming at the problem that the vehicles always turn left in advance which causes heavy conflicts in the intersection and effected traffic efficiency,the solution of the left-turn lane’s stop line backwards setting was proposed,and the critical conditions on the stop line’s setting were studied.Firstly,we studied the characteristics of trajectories distribution in the release process of turning left in advance vehicles.Based on that,we proposed to move the stop line backwards to solve the problem of turning left in advance.Considering the intersection’s geometric features and the vehicle operation features,the geometric critical condition was given for setting the position of left-turn lane’s stop line.And then the model of left-turn vehicles’queuing length was established based on queuing theory and traffic wave theory.By using queuing length model,the flow restrictions of stop line backwards could be found.Assuming left-turn vehicles’arrival rate is stable in a certain period of time,the minimum green time and the maximum red time of left-turn phase were given after the stop line was set up.According to the changes of the vehicles’turning paths,the shortest yellow setting recommendation was given.Finally,the application of the critical limits used in stop line backwards setting was demonstrated.The research result could provide a theoretical basis for traffic signs and markings’setting and perfect the relevant laws and regulations.展开更多
Given a finite simple graph G, a set D ⊆V(G) is called a dominating set if for all v ∈ V(G) , either v ∈ D or v is adjacent to some vertex in D. A dominating set D is independent if none of the vertices in...Given a finite simple graph G, a set D ⊆V(G) is called a dominating set if for all v ∈ V(G) , either v ∈ D or v is adjacent to some vertex in D. A dominating set D is independent if none of the vertices in D are adjacent, and D is perfect if each vertex not in D is adjacent to precisely one vertex in D. If a dominating set is both independent and perfect, then it is called an efficient dominating set. For a graph G, a set D is called a unique efficient dominating set of G if it is the only efficient dominating set of G. In this paper, the authors propose the definition of unique efficient dominating set, explore the properties of graphs with unique efficient dominating sets, and completely characterize several families of graphs which have unique efficient dominating sets.展开更多
Randićenergy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randićenergy RE<sub>C</sub> (G) of a graph G in this paper. This p...Randićenergy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randićenergy RE<sub>C</sub> (G) of a graph G in this paper. This paper contains computation of minimum covering Randićenergies for some standard graphs like star graph, complete graph, thorn graph of complete graph, crown graph, complete bipartite graph, cocktail graph and friendship graphs. At the end of this paper, upper and lower bounds for minimum covering Randićenergy are also presented.展开更多
In this paper we study the relationship between minimum rank of graph G and the minimum rank of graph for some families of special graph G, where is the jth power of graph G.
文摘Design of control strategies for gene regulatory networks is a challenging and important topic in systems biology. In this paper, the problem of finding both a minimum set of control nodes (control inputs) and a controller is studied. A control node corresponds to a gene that expression can be controlled. Here, a Boolean network is used as a model of gene regulatory networks, and control specifications on attractors, which represent cell types or states of cells, are imposed. It is important to design a gene regulatory network that has desired attractors and has no undesired attractors. Using a matrix-based representation of BNs, this problem can be rewritten as an integer linear programming problem. Finally, the proposed method is demonstrated by a numerical example on a WNT5A network, which is related to melanoma.
基金the National Science Foundation[NSF SMA-1416509].
文摘This paper introduces how to automatically derive a minimum set of viewpoints for maximum coverage over a large scale of digital terrain data.This is a typical data and computation-intensive research covering a series of geocomputation tasks that have not been implemented efficiently or optimally in prior works.This paper introduces a three-step computational solution to resolve the problem.For any given digital elevation model(DEM)data,automatic generation of control viewpoints is the first step through map algebra calculation and hydrological modeling approaches.For each viewpoint,the viewshed calculation then has to be implemented.The combined viewshed derived from the viewshed of all viewpoints establishes the maximum viewshed coverage of the given DEM.Finally,detecting the minimum set of viewpoints for the maximum coverage is a Non-deterministic Polynomial-time hard problem.The outcome of the computation has broader societal impacts since the research questions and solutions can be adapted into realworld application and decision-making practice,such as the distribution,optimization and management of telecommunication infrastructure and wildfire observation towers,and military tactics and operations dependent upon landscape and terrain features.
文摘The relativity of instructions of motor control digital signal processor (MCDSP) in the design is analyzed. A method for obtaining a minimum instruction set in plac e of the complete instruction set during generation of testing procedures is giv en in terms of the processor presentation matrix between micro-operators and in structions of MCDSP.
基金Project supported by the National Natural Science Foundation of China(Grant No.62101600)the Science Foundation of China University of Petroleum,Beijing(Grant No.2462021YJRC008)the State Key Laboratory of Cryptology(Grant No.MMKFKT202109).
文摘Using quantum algorithms to solve various problems has attracted widespread attention with the development of quantum computing.Researchers are particularly interested in using the acceleration properties of quantum algorithms to solve NP-complete problems.This paper focuses on the well-known NP-complete problem of finding the minimum dominating set in undirected graphs.To expedite the search process,a quantum algorithm employing Grover’s search is proposed.However,a challenge arises from the unknown number of solutions for the minimum dominating set,rendering direct usage of original Grover’s search impossible.Thus,a swap test method is introduced to ascertain the number of iterations required.The oracle,diffusion operators,and swap test are designed with achievable quantum gates.The query complexity is O(1.414^(n))and the space complexity is O(n).To validate the proposed approach,qiskit software package is employed to simulate the quantum circuit,yielding the anticipated results.
文摘【目的】开展土壤健康评价,不仅可以了解甜瓜田土壤健康状况,还可以精准识别土壤障碍因子,为甜瓜田健康土壤培育提供理论支撑。本研究通过建立土壤健康评价数据库并构建最小数据集(minimum data set,MDS),系统评价吐鲁番市甜瓜田的土壤健康状况。【方法】在新疆吐鲁番市吐峪沟乡、亚尔镇、三堡乡的甜瓜田中,选择种植年限平均为5年的72个甜瓜地块,采集0—20 cm土层土壤样品,测定了28项土壤物理、化学和生物学指标,建立土壤健康评价数据库。利用主成分分析构建最小数据集,运用线性和非线性评分函数进行土壤健康评价,并通过全数据集(total data set,TDS)对最小数据集的评价结果进行验证。【结果】用主成分分析法筛选出容重、电导率、有效磷、有机碳、交换性钙、土壤呼吸和β-木糖苷酶7个指标,建立了土壤健康评价最小数据集。采用线性评分函数法,基于全数据集和最小数据集计算的土壤健康指数分别为0.44和0.49,变异系数分别为22.5%和18.7%;采用非线性评分函数法,得到的土壤健康指数平均值分别为0.46和0.47,变异系数分别为25.8%和24.3%。基于全数据集和最小数据集计算的土壤健康指数间均呈显著正相关(P<0.01),斜率接近0.9。整体上,吐峪沟乡和亚尔镇甜瓜田土壤健康指数均高于三堡乡。【结论】最小数据集可以代替全数据集用于甜瓜田土壤健康评价,非线性评分函数计算的土壤健康指数变异系数大,说明非线性评分函数更加敏感,建议选择非线性评分函数用于甜瓜田土壤健康评价。新疆吐鲁番市甜瓜田土壤pH为碱性,土壤养分含量处于丰富水平,但有机碳和活性碳含量较低。经最小数据集评价,吐鲁番甜瓜田土壤健康指数在0.5以下,处于中等水平。
基金the National Natural Science Foundation of China(Nos.51108208,512782520 and 51278220)
文摘Aiming at the problem that the vehicles always turn left in advance which causes heavy conflicts in the intersection and effected traffic efficiency,the solution of the left-turn lane’s stop line backwards setting was proposed,and the critical conditions on the stop line’s setting were studied.Firstly,we studied the characteristics of trajectories distribution in the release process of turning left in advance vehicles.Based on that,we proposed to move the stop line backwards to solve the problem of turning left in advance.Considering the intersection’s geometric features and the vehicle operation features,the geometric critical condition was given for setting the position of left-turn lane’s stop line.And then the model of left-turn vehicles’queuing length was established based on queuing theory and traffic wave theory.By using queuing length model,the flow restrictions of stop line backwards could be found.Assuming left-turn vehicles’arrival rate is stable in a certain period of time,the minimum green time and the maximum red time of left-turn phase were given after the stop line was set up.According to the changes of the vehicles’turning paths,the shortest yellow setting recommendation was given.Finally,the application of the critical limits used in stop line backwards setting was demonstrated.The research result could provide a theoretical basis for traffic signs and markings’setting and perfect the relevant laws and regulations.
文摘Given a finite simple graph G, a set D ⊆V(G) is called a dominating set if for all v ∈ V(G) , either v ∈ D or v is adjacent to some vertex in D. A dominating set D is independent if none of the vertices in D are adjacent, and D is perfect if each vertex not in D is adjacent to precisely one vertex in D. If a dominating set is both independent and perfect, then it is called an efficient dominating set. For a graph G, a set D is called a unique efficient dominating set of G if it is the only efficient dominating set of G. In this paper, the authors propose the definition of unique efficient dominating set, explore the properties of graphs with unique efficient dominating sets, and completely characterize several families of graphs which have unique efficient dominating sets.
文摘Randićenergy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randićenergy RE<sub>C</sub> (G) of a graph G in this paper. This paper contains computation of minimum covering Randićenergies for some standard graphs like star graph, complete graph, thorn graph of complete graph, crown graph, complete bipartite graph, cocktail graph and friendship graphs. At the end of this paper, upper and lower bounds for minimum covering Randićenergy are also presented.
文摘In this paper we study the relationship between minimum rank of graph G and the minimum rank of graph for some families of special graph G, where is the jth power of graph G.
