期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Chaos Identification Based on Component Reordering and Visibility Graph 被引量:1
1
作者 朱胜利 甘露 《Chinese Physics Letters》 SCIE CAS CSCD 2017年第5期18-21,共4页
The identification between chaotic systems and stochastic processes is not easy since they have numerous similarities. In this study, we propose a novel approach to distinguish between chaotic systems and stochastic p... The identification between chaotic systems and stochastic processes is not easy since they have numerous similarities. In this study, we propose a novel approach to distinguish between chaotic systems and stochastic processes based on the component reordering procedure and the visibility graph algorithm. It is found that time series and their reordered components will show diverse characteristics in the 'visibility domain'. For chaotic series, there are huge differences between the degree distribution obtained from the original series and that obtained from the corresponding reordered component. For correlated stochastic series, there are only small differences between the two degree distributions. For uncorrelated stochastic series, there are slight differences between them. Based on this discovery, the well-known Kullback Leible divergence is used to quantify the difference between the two degree distributions and to distinguish between chaotic systems, correlated and uncorrelated stochastic processes. Moreover, one chaotic map, three chaotic systems and three different stochastic processes are utilized to illustrate the feasibility and effectiveness of the proposed method. Numerical results show that the proposed method is not only effective to distinguish between chaotic systems, correlated and uncorrelated stochastic processes, but also easy to operate. 展开更多
关键词 Chaos Identification Based on Component Reordering and Visibility graph
下载PDF
Calculation of the Water Distribution Networks Based on the Theory of Slow Transient Flow
2
作者 Hui-Zhe Cao Zhi-Gang Zhou +2 位作者 He-Ping Tan Long Guo Fei-Fei Luo 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2014年第1期49-54,共6页
Urban water supply network is a modern urban survival and development of the infrastructure of a city,and its normal running conditions have important significance. The actual hydraulic process in the variableload wat... Urban water supply network is a modern urban survival and development of the infrastructure of a city,and its normal running conditions have important significance. The actual hydraulic process in the variableload water distribution networks can be treated as the slow transient flow which belongs to the unsteady flow. This paper analyzes the multi-loops network slow transient model based on graph theory,and the link flow matrix is treated as the variables of the discrete solution model to simulate the process of the slow transient flow in the network. With the simulation of hydraulic regime in an actual pipe network,the changing laws of the flow in the pipes,nodal hydraulic heads and other hydraulic factors with the passage of time are obtained. Since the transient processes offer much more information than a steady process,the slow transient theory is not only practical on analyzing the hydraulic condition of the network,but also on identifying hydraulic resistance coefficients of pipes and detecting the leakage in networks. 展开更多
关键词 component: graph theory water distribution network slow transient flow inertial hydraulic head
下载PDF
A Practical Parallel Algorithm for Propositional Knowledge Base Revision
3
作者 SUN WEI TAO XUEHONG and MA SHAOHAO(Dept. of Computer Science, Shandong University, Jinan 250100,P.R.China) 《Wuhan University Journal of Natural Sciences》 CAS 1996年第Z1期473-477,共5页
Different methods for revising propositional knowledge base have been proposed recently by several researchers, but all methods are intractable in the general case. For practical application, this paper presents a rev... Different methods for revising propositional knowledge base have been proposed recently by several researchers, but all methods are intractable in the general case. For practical application, this paper presents a revision method in special case, and gives a corresponding polynomial algorithm as well as its parallel version on CREW PRAM. 展开更多
关键词 Prepositional knowledge base REVISION parallel algorithm satisfiability problem strongly connected component of a graph.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部