检索结果-内蒙古大学图书馆

Topological properties and fractal analysis of a recurrence network constructed from fractional Brownian motions

Physical Review E 2014年第3期89卷 032814-032814页

作者： Jin-Long Liu Zu-Guo Yu Vo Anh Hunan Key Laboratory for Computation and Simulation in Science and Engineering and Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane Q4001 Australia

Many studies have shown that we can gain additional information on time series by investigating their accompanying complex networks. In this work, we investigate the fundamental topological and fractal properties of recurrence networks constructed from fractional Brownian motions (FBMs). First, our results indicate that the constructed recurrence networks have exponential degree distributions; the average degree exponent 〈λ〉 increases first and then decreases with the increase of Hurst index H of the associated FBMs; the relationship between H and 〈λ〉 can be represented by a cubic polynomial function. We next focus on the motif rank distribution of recurrence networks, so that we can better understand networks at the local structure level. We find the interesting superfamily phenomenon, i.e., the recurrence networks with the same motif rank pattern being grouped into two superfamilies. Last, we numerically analyze the fractal and multifractal properties of recurrence networks. We find that the average fractal dimension 〈dB〉 of recurrence networks decreases with the Hurst index H of the associated FBMs, and their dependence approximately satisfies the linear formula 〈dB〉≈2−H, which means that the fractal dimension of the associated recurrence network is close to that of the graph of the FBM. Moreover, our numerical results of multifractal analysis show that the multifractality exists in these recurrence networks, and the multifractality of these networks becomes stronger at first and then weaker when the Hurst index of the associated time series becomes larger from 0.4 to 0.95. In particular, the recurrence network with the Hurst index H=0.5 possesses the strongest multifractality. In addition, the dependence relationships of the average information dimension 〈D(1)〉 and the average correlation dimension 〈D(2)〉 on the Hurst index H can also be fitted well with linear functions. Our results strongly suggest that the recurrence network inherits the basic characteristic

关键词： Fractal dimension

来源：评论

学校读者我要写书评

暂无评论

LDDP: A location-based directed diffusion routing protocol for smart home sensor network

LDDP: A location-based directed diffusion routing protocol f...

引用

International Conference on Systems and Informatics (ICSAI)

作者： Dapeng Cheng Yingjie Song Yanyan Mao Xiangrong Wang School of Computer Science and Technology Shandong Institute of Business and Technology Yantai China College of Information Science and Engineering Shandong University of Science and Technology Qingdao China Key Laboratory of Intelligent Information Processing in Universities of Shandong (Shandong Institute of Business and Technology) Yantai china

ISBN: (纸本)9781479954599

Directed diffusion protocol enables data-centric routing for smart home sensor network. However, traditional directed diffusion protocol makes all nodes participating in the routing process. This causes a lot of redundant data transmission which brings unnecessary energy consumption. In this paper, we proposed LDDP, a location-based directed diffusion routing protocol for smart home sensor network, which reduces the number of nodes involved in data forwarding by room-based partitioning algorithm. Simulation results show that LDDP has better scalability than traditional DDP. LDDP can save 76 th percentile energy when the node number is 200 and the transmission times is 5000. When the network size is 250, LDDP can also brings 40kb/s network throughput gain than traditional DDP.

关键词： Smart homes Wireless sensor networks Routing protocols Routing Energy consumption Educational institutions Data communication

来源：评论

学校读者我要写书评

暂无评论

Research and development of comprehensive communication experiment teaching system

引用

Computer Modelling and New Technologies 2014年第6期18卷 218-224页

作者： Wang, Bin Li, Dashe Liu, Shue School of Computer Science and Technology Shandong Institute of Business and Technology Yantai China Key Laboratory of Intelligent Information Processing Universities of Shandong Yantai China School of Computer Science and Technology Binzhou Medical University Yantai China

This paper has developed a set of management and experiment system for communication laboratories. Its development platform is Visual Basic 6.0, using access database, winsocket programming and multicast technology. Including several sets of software and using C/S architecture, the system can jointly work with data network configuration system so as to achieve the communication experiment of data network. It can conduct VLAN isolation and IP filter using right management switch, which can make multiple servers connect to the device simultaneously and completely control the numbers of computers entering the system at some point. By off-line configuration technology and shared online database technology, the system can make the device resources be assigned automatically to solve the basic problems of many people doing experiment at the same time.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

An optimized texture-by-numbers synthesis method and its visual applications

引用

Science China(information Sciences) 2013年第5期56卷 50-63页

作者： FAN Jing SHI XiaoYing ZHOU Zhan TANG Ying School of Computer Science and Technology Zhejiang University of Technology Key Laboratory of Visual Media Intelligent Processing Technology of Zhejiang Province School of Information Engineering Zhejiang University of Technology

The framework of texture-by-numbers(TBN) synthesizes images of global-varying patterns with intuitive user *** TBN synthesis methods have difficulties in achieving high-quality synthesis results and efficiency *** paper proposes a fast TBN synthesis method based on texture optimization,which uses global optimization to solve the controllable non-homogeneous texture synthesis *** algorithm produces high quality synthesis results by combining texture optimization into TBN framework with two *** initialization process is adopted to generate the initial output of the global optimization algorithm,which speeds up the algorithm’s convergence rate and enhances synthesis *** distance metrics to measure image similarities are specifically designed for different images to better match human visual perception for structural patterns and a user study is conducted to verify the effectiveness of the *** further improve the synthesis speed,the algorithm is entirely implemented on GPU based on CUDA *** optimized TBN method is applied to various visual applications including not only traditional TBN applications,but also image in-painting and texture-based flow *** experimental results show that our method synthesizes images of higher or comparable qualities with higher efficiency than other state-of-art synthesis methods.

关键词： texture-by-number texture optimization feature synthesis CUDA

来源：评论

学校读者我要写书评

暂无评论

Support vector machine with mixture of kernels for automatic image annotation

引用

High technology Letters 2013年第3期19卷 295-300页

作者：田东平 Zhao Xiaofei Shi Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Graduate University of Chinese Academy of Sciences

Automatic image annotation(AIA)has become an important and challenging problem in computer vision due to the existence of semantic *** this paper,a novel support vector machine with mixture of kernels(SVM-MK)for automatic image annotation is *** one hand,the combined global and local block-based image features are extracted in order to reflect the intrinsic content of images as complete as *** the other hand,SVM-MK is constructed to shoot for better annotating *** results on Corel dataset show that the proposed image feature representation method as well as automatic image annotation classifier,SVM-MK,can achieve higher annotating accuracy than SVM with any single kernel and mi-SVM for semantic image annotation.

关键词： automatic image annotation （ AIA） support vector machine （ SVM） kernel func-tion principal component analysis （PCA）

来源：评论

学校读者我要写书评

暂无评论

Swarm aggregations of heterogeneous multi-agent systems

引用

International Journal of Control 2014年第12期87卷 2594页

作者： Liang, Haili Su, Housheng Wang, Xiaofan Chen, Michael Z.Q. [a] Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 China[b] School of Automation Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Huazhong University of Science and Technology Luoyu Road 1037 Wuhan 430074 China[c] Department of Mechanical Engineering The University of Hong Kong Hong Kong

This paper investigates the problem of swarm aggregations of heterogeneous multi-agent systems. Comparing with the existing studies on swarm aggregations of homogeneous multi-agent systems, this paper is much more resembling the practical situations, where the agents have different dynamics. We show that the heterogeneous agents will gather with a certain error under some assumptions and conditions. The stability properties have been proven by theoretical analysis and verified via numerical simulation. The stability of the heterogeneous multi-agent systems has been achieved based on matrix theory and the Lyapunov stability theorem. Numerical simulation is given to demonstrate the effectiveness of the theoretical result. [PUBLICATION ABSTRACT]

关键词： swarm multi-agent systems heterogeneous systems stability

来源：评论

学校读者我要写书评

暂无评论

The CIV semantic relations extraction based on Markov logic networks

引用

Journal of Computational information Systems 2013年第6期9卷 2483-2490页

作者： Li, Zhen Guo, Janyi Yu, Zhengtao Xian, Yantuan Yan, Xin Wei, Sichao Information Engineering and Automation Kunming University of Science and Technology Kunming 650500 China Key Laboratory of Intelligent Information Processing Kunming University of Science and Technology Kunming 650500 China

For the issue that existing relationship extraction method often fails to consider the complex syntactic extraction. This paper, integrating syntactic structure features, proposed a method for CIV (Concept, Instance, Value) semantic relations extraction based on Markov logic networks (MLNs), the object of relation extraction were R (C, I) and R (I, V), where R represented the semantic relations, C was the domain concepts, I was instance, V was the value. Comprehensive utilization word features and syntactic structure features of CIV semantic relations, taking advantage of first-order logic to represent the two features, with the help of MLNs, integrated all the features into Markov network for CIV semantic relation extraction. The experiments show that the effect of CIV semantic relation extraction is better after integrating into the syntactic structure features, in the comparative experiment, the result of CIV semantic relation extraction based on the MLNs is better than based on the support vector machine(SVM). Show that the proposed method has a good effect. Copyright © 2013 Binary information Press.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

On the theoretical properties of bipartition dissimilarity measure

引用

Computer Modelling and New Technologies 2014年第12期18卷 322-327页

作者： Li, Shuguang Chen, Shuying Cui, Mengtian Key Laboratory of Intelligent Information Processing in Universities of Shandong Shandong Institute of Business and Technology Yantai China College of Computer Science and Technology Shandong Institute of Business and Technology Yantai China School of Computer Science and Technology Southwest University for Nationalities Chengdu China

Bipartition dissimilarity is a new measure introduced by Alix Boc et al. They proposed an algorithm for inferring horizontal gene transfer events which can rely on different optimization criteria. Simulation results suggested that the strategy based on bipartition dissimilarity provided better results than those based on other three existing tree comparison indices. However, no theoretical analysis on it has been conducted since then in the literature. The present paper reports some useful new results for this measure. The theoretical properties studied include minimum positive value, neighborhood, and local modifications.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

-labeling for brick product graphs

引用

Journal of Combinatorial Optimization 2014年第2期31卷 447-462页

作者： Shao, Zehui Xu, Jin Yeh, Roger K. School of Information Science and Technology Chengdu University Chengdu China Key Laboratory of Pattern Recognition and Intelligent Information Processing Institutions of Higher Education of Sichuan Province Chengdu China School of Electronic Engineering and Computer Science Peking University Beijing China Department of Applied Mathematics Feng Chia University Taichung Taiwan

Let $$G=(V, E)$$ be a graph. Denote $$d_G(u, v)$$ the distance between two vertices $$u$$ and $$v$$ in $$G$$ . An $$L(2, 1)$$ -labeling of $$G$$ is a function $$f: V \rightarrow \{0,1,\cdots \}$$ such that for any two vertices $$u$$ and $$v$$ , $$|f(u)-f(v)| \ge 2$$ if $$d_G(u, v) = 1$$ and $$|f(u)-f(v)| \ge 1$$ if $$d_G(u, v) = 2$$ . The span of $$f$$ is the difference between the largest and the smallest number in $$f(V)$$ . The $$\lambda $$ -number of $$G$$ , denoted $$\lambda (G)$$ , is the minimum span over all $$L(2,1 )$$ -labelings of $$G$$ . In this article, we confirm Conjecture 6.1 stated in X. Li et al. (J Comb Optim 25:716–736, 2013) in the case when (i) $$\ell $$ is even, or (ii) $$\ell \ge 5$$ is odd and $$0 \le r \le 8$$ .

关键词：

来源：评论

学校读者我要写书评

暂无评论

Chinese question classification transfer learning method based on feature mapping

引用

Journal of Computational information Systems 2013年第6期9卷 2261-2267页

作者： Wang, Yanbing Yu, Zhengtao Lin, Haobing Guo, Jianyi Mao, Cunli School of Information Engineering and Automation Kunming University of Science and Technology Kunming 650051 China The Intelligent Information Processing Key Laboratory Kunming University of Science and Technology Kunming 650051 China

Focused on the problem of the applicability of Question Classification for different domains, a Question Classification transfer learning method based on feature mapping is proposed. This method firstly statistics the question key words of source domain and target domain to construct the feature space of two domains. Secondly we get feature words of the related two domains by using the method of mutual information to optimize the question classification feature space of two domains, and use the word similarity calculation method to get the feature vector of source domain questions. By calculating the similarity between feature words of the target domain and feature words of source domain, change the feature words of source domain to the same or similar feature words of the target domain, and then by using the improved clustering algorithm, take the marked few question corpus of target domain as the clustering central point, we map the changed question instance of source domain to different categories of target domain. Finally we use SVM learning algorithm to train to get the question classification model of target domain. The results of domain transfer experiment on Chinese question classification have showed that it greatly improved the classify accuracy rate of target domain by using the marked samples of source domain. Copyright © 2013 Binary information Press.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：