An algorithm for the verification of strong open bisimulation in π-calculus with mismatch was presented, which is based on the symbolic transition graph (STG). Given two processes, we can convert them into two STGs b...An algorithm for the verification of strong open bisimulation in π-calculus with mismatch was presented, which is based on the symbolic transition graph (STG). Given two processes, we can convert them into two STGs by a set of rules at first. Next, the algorithm computes a predicate equation system (PES) from the STGs. This is the key step of the whole algorithm. Finally, the PES is solved and the greatest symbolic solution is got. Correctness of the algorithm is proved and time complexity discussed. It is shown that the worst-case time complexity is exponential.展开更多
“Open community” has aroused widespread concern and research. This paper focuses on the system analysis research of the problem that based on statistics including the regression equation fitting function and mathema...“Open community” has aroused widespread concern and research. This paper focuses on the system analysis research of the problem that based on statistics including the regression equation fitting function and mathematical theory, combined with the actual effect of camera measurement method, Prim’s algorithm and neural network to “Open community” and the applicable conditions. Research results show that with the increasing number of roads within the district, the benefit time gradually increased, but each type of district capacity is different.展开更多
以Aspen Open Solver接口集中的非线性代数方程组(NLA)部分作为研究对象,在对接口集进行系统地分析之后,利用AspenTech提供的接口代码将分别基于梯度和非基于梯度的四种求解算法嵌入生成solver组件,并实现用Aspen Plus调用该solver组件...以Aspen Open Solver接口集中的非线性代数方程组(NLA)部分作为研究对象,在对接口集进行系统地分析之后,利用AspenTech提供的接口代码将分别基于梯度和非基于梯度的四种求解算法嵌入生成solver组件,并实现用Aspen Plus调用该solver组件观察各种算法嵌入的结果。展开更多
This paper considers a scheduling problem in two-stage hybrid flow shop, where the first stage consists of two machines formed an open shop and the other stage has only one machine. The objective is to minimize the ma...This paper considers a scheduling problem in two-stage hybrid flow shop, where the first stage consists of two machines formed an open shop and the other stage has only one machine. The objective is to minimize the makespan, i.e., the maximum completion time of all jobs. We first show the problem is NP-hard in the strong sense, then we present two heuristics to solve the problem. Computational experiments show that the combined algorithm of the two heuristics performs well on randomly generated problem instances.展开更多
Entity relation is an essential component of some famous knowledge bases,such as Freebase,Yago and Knowledge Graph,while the hyponymy plays an important role in entity relations that show the relationship between the ...Entity relation is an essential component of some famous knowledge bases,such as Freebase,Yago and Knowledge Graph,while the hyponymy plays an important role in entity relations that show the relationship between the more general terms(hypernyms)and the more specific instances of the terms(hyponyms).In this paper,we present a comprehensive scheme of open-domain Chinese entity hypernym hierarchical construction.Some of the most important unsupervised and heuristic approaches for building hierarchical structure are covered in sufficient detail along with reasonable analyses.We experimentally evaluate the proposed methods and compare them with other baselines.The result shows high precision of our method and the proposed scheme will be further improved with larger scale corpora.展开更多
基金National Natural Science Foundation of China ( No. 6 98730 32 ) 86 3Hi-Τ ech Project ( 86 3-30 6 -ZT-0 6 -0 2 -2 )
文摘An algorithm for the verification of strong open bisimulation in π-calculus with mismatch was presented, which is based on the symbolic transition graph (STG). Given two processes, we can convert them into two STGs by a set of rules at first. Next, the algorithm computes a predicate equation system (PES) from the STGs. This is the key step of the whole algorithm. Finally, the PES is solved and the greatest symbolic solution is got. Correctness of the algorithm is proved and time complexity discussed. It is shown that the worst-case time complexity is exponential.
文摘“Open community” has aroused widespread concern and research. This paper focuses on the system analysis research of the problem that based on statistics including the regression equation fitting function and mathematical theory, combined with the actual effect of camera measurement method, Prim’s algorithm and neural network to “Open community” and the applicable conditions. Research results show that with the increasing number of roads within the district, the benefit time gradually increased, but each type of district capacity is different.
基金Supported by the National Natural Science Foundation of China(11071220,11001242,11201428)Zhejiang Provincial Natural Science Foundation of China(LY13A010015)Educational Commission of Zhejiang Province of China(Y201019076)
文摘This paper considers a scheduling problem in two-stage hybrid flow shop, where the first stage consists of two machines formed an open shop and the other stage has only one machine. The objective is to minimize the makespan, i.e., the maximum completion time of all jobs. We first show the problem is NP-hard in the strong sense, then we present two heuristics to solve the problem. Computational experiments show that the combined algorithm of the two heuristics performs well on randomly generated problem instances.
基金supported by ZTE Industry-Academia-Research Cooperation Funds
文摘Entity relation is an essential component of some famous knowledge bases,such as Freebase,Yago and Knowledge Graph,while the hyponymy plays an important role in entity relations that show the relationship between the more general terms(hypernyms)and the more specific instances of the terms(hyponyms).In this paper,we present a comprehensive scheme of open-domain Chinese entity hypernym hierarchical construction.Some of the most important unsupervised and heuristic approaches for building hierarchical structure are covered in sufficient detail along with reasonable analyses.We experimentally evaluate the proposed methods and compare them with other baselines.The result shows high precision of our method and the proposed scheme will be further improved with larger scale corpora.
