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

IEEE International Conference on Data Mining (ICDM)

作者： Zhiwei Jin Juan Cao Yu-Gang Jiang Yongdong Zhang University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology Beijing CAS China School of Computer Science Fudan University Shanghai China

ISBN: (纸本)9781479943012

Benefiting from its openness, collaboration and real-time features, Micro blog has become one of the most important news communication media in modern society. However, it is also filled with fake news. Without verification, such information could spread promptly through social network and result in serious consequences. To evaluate news credibility on Micro blog, we propose a hierarchical propagation model. We detect sub-events within a news event to describe its detailed aspects. Thus, for a news event, a three-layer credibility network consisting of event, sub-events and messages can represent it from different scale and reveal vital information for credibility evaluation. After linking these entities with their semantic and social associations, the credibility value of each entity is propagated on this network to achieve the final evaluation result. By formulating this propagation process as a graph optimization problem, we provide a globally optimal solution with an iterative algorithm. Experiments conducted on two real-world datasets show that the proposed model boosts the accuracy by more than 6% and the F-score by more than 16% over a baseline method.

关键词： Optimization Clustering algorithms Vectors Semantics Feature extraction Symmetric matrices Media

来源：评论

学校读者我要写书评

暂无评论

Sinc-Chebyshev collocation method for a class of fractional diffusion-wave equations

The Scientific World Journal

引用

The Scientific World Journal 2014年第1期2014卷 143983页

作者： Mao, Zhi Xiao, Aiguo Yu, Zuguo Shi, Long Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China Mathematics and Information Engineering Department Tongren University Tongren Guizhou 554300 China

This paper is devoted to investigating the numerical solution for a class of fractional diffusion-wave equations with a variable coefficient where the fractional derivatives are described in the Caputo sense. The approach is based on the collocation technique where the shifted Chebyshev polynomials in time and the sinc functions in space are utilized, respectively. The problem is reduced to the solution of a system of linear algebraic equations. Through the numerical example, the procedure is tested and the efficiency of the proposed method is confirmed. © 2014 Zhi Mao et al.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multifractal analysis of weighted networks by a modified sandbox algorithm

引用

Scientific reports 2015年第1期5卷 17628页

作者： Yu-Qin Song Jin-Long Liu Zu-Guo Yu Bao-Gen Li 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. College of Science Hunan University of technology Zhuzhou Hunan 412007 China. School of Mathematical Sciences Queensland University of Technology Brisbane Q4001 Australia.

Complex networks have attracted growing attention in many fields. As a generalization of fractal analysis, multifractal analysis (MFA) is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. Some algorithms for MFA of unweighted complex networks have been proposed in the past a few years, including the sandbox (SB) algorithm recently employed by our group. In this paper, a modified SB algorithm (we call it SBw algorithm) is proposed for MFA of weighted networks. First, we use the SBw algorithm to study the multifractal property of two families of weighted fractal networks (WFNs): "Sierpinski" WFNs and "Cantor dust" WFNs. We also discuss how the fractal dimension and generalized fractal dimensions change with the edge-weights of the WFN. From the comparison between the theoretical and numerical fractal dimensions of these networks, we can find that the proposed SBw algorithm is efficient and feasible for MFA of weighted networks. Then, we apply the SBw algorithm to study multifractal properties of some real weighted networks - collaboration networks. It is found that the multifractality exists in these weighted networks, and is affected by their edge-weights.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Recognition algorithm for plant leaves based on adaptive supervised locally linear embedding

引用

International Journal of Agricultural and Biological Engineering 2013年第3期6卷 52-57页

作者： Yan Qing Liang Dong Zhang Dongyan Wang Xiu Key Laboratory of Intelligent Computing&Signal Processing Ministry of EducationAnhui UniversityHefei 230039China Beijing Research Center for Information Technology in Agriculture Beijing 100097China

Locally linear embedding(LLE)algorithm has a distinct deficiency in practical *** requires users to select the neighborhood parameter,k,which denotes the number of nearest neighbors.A new adaptive method is presented based on supervised LLE in this article.A similarity measure is formed by utilizing the Fisher projection distance,and then it is used as a threshold to select *** samples will produce different k adaptively according to the density of the data *** method is applied to classify plant *** experimental results show that the average classification rate of this new method is up to 92.4%,which is much better than the results from the traditional LLE and supervised LLE.

关键词： supervised locally linear embedding manifold learning Fisher projection adaptive neighbors leaf recognition Precision Agriculture

来源：评论

学校读者我要写书评

暂无评论

Detecting community structures in social networks with particle swarm optimization

Detecting community structures in social networks with parti...

引用

2nd CCF Internet Conference of China, ICoC 2013

作者： Chen, Yuzhong Qiu, Xiaohui Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing Fuzhou University China

ISBN: (纸本)9783642539589

Community detection in social networks is usually considered as an objective optimization problem. Due to the limitation of the objective function, the global optimum cannot describe the real partition well, and it is time consuming. In this paper, a novel PSO (particle swarm optimization) algorithm based on modularity optimization for community detection in social networks is proposed. Firstly, the algorithm takes similarity-based clustering to find core areas in the network, and then a modified particle swarm optimization is performed to optimize modularity in a new constructed weighted network which is compressed from the original one, and it is equivalent to optimize modularity in the original network with some restriction. Experiments are conducted in the synthetic and four real-world networks. The experimental results show that the proposed algorithm can effectively extract the intrinsic community structures of social networks. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Remote sensing identification of shrub encroachment in grassland in Inner Mongolia

引用

Nongye Gongcheng Xuebao/Transactions of the Chinese Society of Agricultural Engineering 2014年第11期30卷 152-158页

作者： Dong, Zhou Zhao, Xia Liang, Dong Huang, Wenjiang Peng, Dailiang Huang, Linsheng Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230039 China School of Electronic and Information Engineering Anhui University Hefei 230039 China Key Laboratory of Digital Earth Science Institute of Remote Sensing and Digital Earth Chinese Academy of Sciences Beijing 100094 China State Key Laboratory of Vegetation and Environmental Change Institute of Botany Chinese Academy of Sciences Beijing 100093 China

Shrub encroachment has been a wide phenomenon across the arid and semi-arid grasslands in Inner Mongolia, China. Although numerous studies have investigated the effect of this phenomenon on community composition, ecosystem structure, and nutrient cycling, reports on the distribution patterns of shrub encroachment are limited. A recent development in satellite remote sensing enables accurate assessment of shrub distribution and its dynamics at large scales. In this paper, the combined ground survey in Xianghuangqi, four satellite images (with spatial resolution of 5.8 m) of ZY-3, covering nearly the whole area and taken between July and August in 2013, were used to identify the shrub distribution in this region. It should be noted that the shrub here indicated the shrub-grass mosaic due to the mixed pixel effect, and the identification was weak when the coverage of shrub was on low levels. The NDVI threshold method was first used to extract the vegetation coverage area, and then three traditional pixel-oriented methods (Support vector machine, Maximum likelihood and Mahalanobis distance), compared with the object-oriented method, were used for the classification of images. Object-oriented method is different from the traditional one, in that the classification is not based on the spectral characteristics of individual pixel, but relies on the image object with spatial texture and shape and size characteristics. Ground survey data were used to compare the accuracy level of these methods. It indicated that the shrub recognition accuracy by using support vector machine algorithm is the highest among the three pixel-oriented methods, with higher producer accuracy and user accuracy than the other two algorithms. Furthermore, the overall classification accuracy of this algorithm is 81.15% higher than that of the maximum likelihood (73.33%) and the Mahalanobis distance (61.77%). However, the overall recognition accuracy by using the object-oriented approach (combined scale

关键词： Maximum likelihood

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Flow Scheduling and Routing with Hard Deadlines in Data Center Networks

Energy-Efficient Flow Scheduling and Routing with Hard Deadl...

引用

International Conference on Distributed computing Systems

作者： Lin Wang Fa Zhang Kai Zheng Athanasios V. Vasilakos Shaolei Ren Zhiyong Liu University of Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing Chinese Academy of Sciences IBM China Research Lab University of Western Macedonia Greece Florida International University USA Institute of Computing Technology Chinese Academy of Sciences

The power consumption of enormous network devices in data centers has emerged as a big concern to data center operators. Despite many traffic-engineering-based solutions, very little attention has been paid on performance-guaranteed energy saving schemes. In this paper, we propose a novel energy-saving model for data center networks by scheduling and routing "deadline-constrained flows" where the transmission of every flow has to be accomplished before a rigorous deadline, being the most critical requirement in production data center networks. Based on speed scaling and power-down energy saving strategies for network devices, we aim to explore the most energy efficient way of scheduling and routing flows on the network, as well as determining the transmission speed for every flow. We consider two general versions of the problem. For the version of only flow scheduling where routes of flows are pre-given, we show that it can be solved polynomially and we develop an optimal combinatorial algorithm for it. For the version of joint flow scheduling and routing, we prove that it is strongly NP-hard and cannot have a Fully Polynomial-Time Approximation Scheme (FPTAS) unless P=NP. Based on a relaxation and randomized rounding technique, we provide an efficient approximation algorithm which can guarantee a provable performance ratio with respect to a polynomial of the total number of flows.

关键词： Schedules Routing Power demand Switches Optimal scheduling Data models Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Step semantics and action refinement in event structures

引用

Computer Modelling and New Technologies 2014年第5期18卷 94-101页

作者： Tang, Weidong Wu, Jinzhao Liu, Meiling School of Information Science and Engineering Guangxi University for Nationalities Nanning China Chengdu Institute of Computer Applications Chinese Academy of Sciences Chengdu China Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis Nanning China Science Computing and Intelligent Information Processing of GuangXi higher education key laboratory Nanning China

An event structure acts as a denotational semantic model of concurrent systems. Action refinement is an essential operation in the design of concurrent systems. However, there exists an important problem about preserving equivalence under action refinement. If two processes are equivalent with each other, we hope that they still can preserve equivalence after action refinement. In linear time equivalence and branching time equivalence spectrum, step equivalences, which include step trace equivalence and step bisimulation equivalence are not preserved under action refinement [17]. In this paper, we define a class of concurrent processes with specific properties and put forward the concept of clustered action transition, which ensures that step equivalences are able to preserve under action refinement.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Interleaving semantics and action refinement in event structures

引用

Computer Modelling and New Technologies 2014年第6期18卷 44-51页

作者： Tang, Weidong Wu, Jinzhao Liu, Meiling Chengdu Institute of Computer Applications Chinese Academy of Sciences Chengdu China School of Information Science and Engineering Guangxi University for Nationalities Nanning China Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis Nanning China Science Computing and Intelligent Information Processing of GuangXi higher education key laboratory Nanning China

An event structure acts as a denotational semantic model of concurrent systems. Action refinement is an essential operation in the design of concurrent systems. But there exists an important problem about preserving equivalence under action refinement. If two processes are equivalent with each other, we hope that they still can preserve equivalence after action refinement. In linear time equivalence and branching time equivalence spectrum, interleaving equivalences, which include interleaving trace equivalence and interleaving bisimulation equivalence are not preserved under action refinement [9-11, 14, 16, 21]. In this paper, we define a class of concurrent processes with specific properties and put forward the concept of clustered action transition, which ensures that interleaving equivalences are able to preserve under action refinement.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Controlling chaos in mixed TCP and UDP model

引用

Journal of Computational information Systems 2013年第23期9卷 9341-9346页

作者： Ding, Dawei Qiu, Sen Guo, Fan Zhang, Kun Xu, Xianfan Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039 China School of Electronics and Information Engineering Anhui University Hefei 230601 China

In this paper, a discrete time model of the mixed TCP and UDP connection with the RED is introduced. We use this one order discrete-time model to explain the instability, bifurcation and chaotic behaviors of the system. Then a time delayed feedback control approaches is applied to control the system in order to stabilize the chaotic behavior of average queue size. From numerical simulation it is concluded that the chaotic orbit can be stabilize to a fixed point when feedback parameter is properly chosen. Copyright © 2013 Binary information Press.

关键词： Transmission control protocol

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：