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

作者： Liu, Yang Luo, Xiangfeng Xuan, Junyu School of Computer Engineering and Science Shanghai University China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Science Beijing China

Online hot event discovery has become a flourishing frontier where online document streams are monitored to discover newly occurring events or assigned to previously detected events. However, hot events have the nature to evolve, and their inherent topically related words are also likely to evolve. It makes event discovery a challenging task for traditional-mining approaches. Combining word association and semantic community, Association Link Network (ALN) organizes the loosely distributed associated resources. This paper presents an ALN-based novel online hot event discovery approach. Technically, this approach is enacted around three stages. In the first stage, we extract significant features to represent the content of each document from the online document stream. During the second stage, we classify the online document stream into topically related detected events considering event evolution in the form of ALN. At the third stage, we create an ALN-based event detection algorithm, which is used to timely discover newly occurring hot events. The online datasets used in our empirical studies are acquired from Baidu News, which spans a range of 1315 hot events and 236,300 documents. Experimental results demonstrate the hot events discovery ability with respect to high accuracy, good scalability, and short runtime. © 2015 John Wiley & Sons, Ltd.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Multi-path SDN route selection subject to multi-constraints 3

Multi-path SDN route selection subject to multi-constraints

引用

3rd International Conference on Cyberspace Technology, CCT 2015

作者： Pan, Qingfeng Zheng, Xianghan College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350108 China

ISBN: (纸本)9781785610899

Multi-constrained optimal routing problem and disjoint path selection are NP-hard problem. The conventional single-path and single constraint routing can not meet people's needs. The reliability of network data transmission and packet loss rate can be decreased when the route or the transmission fails. To solve the problems, we need to study the routing path selection strategies. This paper optimizes the routing path that meets the QoS constraints under the SDN pre planning routing, and proposes a routing mechanism that can solve problems in polynomial time. Firstly, the paper combined with Clustering and Gauss algorithm to simulate the network simulation, obtain the initial experimental data. It can reflect the network status more accurately. Secondly, simplify the multi-objectives based on the AHP, It reduces the complexity of the problem and meets QoS requirements. Finally, select the disjoint communication paths and backup paths with the heuristic algorithms in order to balance the load of network and improve the transmission reliability. The selection mechanism can improve the efficiency of data transmission, and the survival of network communication.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

On Secrecy Performance of MISO SWIPT Systems with TAS and Imperfect CSI

On Secrecy Performance of MISO SWIPT Systems with TAS and Im...

引用

作者： Pan, Gaofeng Lei, Hongjiang Deng, Yansha Fan, Lisheng Yang, Jing Chen, Yunfei Ding, Zhiguo Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing School of Electronic and Information Engineering Southwest University Chongqing400715 China School of Computing and Communications Lancaster University LancasterLA14YW United Kingdom Chongqing Key Laboratory of Mobile Communications Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Centre for Telecommunications King's College London LondonWC2R2LS United Kingdom School of Computer Science and Educational Software Guangzhou University Guangzhou510000 China Department of Electronic Engineering Shantou University Guangdong515063 China School of Information Engineering Yangzhou University Yangzhou225009 China School of Engineering University of Warwick CoventryCV47AL United Kingdom

In this paper, a multiple-input single-output (MISO) simultaneous wireless information and power transfer (SWIPT) system, including one base station (BS) equipped with multiple antennas, one desired single-antenna information receiver (IR), and N (N > 1) single-antenna energy-harvesting receivers (ERs) is considered. Assuming that the information signal to the desired IR may be eavesdropped by ERs if ERs are malicious, we investigate the secrecy performance of the target MISO SWIPT system when imperfect channel state information (CSI) is available and adopted for transmit antenna selection at the BS. Considering that each eavesdropping link experiences independent but not necessarily identically distributed Rayleigh fading, the closed-form expressions for the exact and the asymptotic secrecy outage probability, and the average secrecy capacity are derived and verified by simulations. Furthermore, the optimal power splitting factor is derived for each ER to realize the tradeoff between the energy harvesting and the information eavesdropping. Our results reveal the impact of the imperfect CSI on the secrecy performance of MISO SWIPT systems in the presence of multiple wiretap channels. © 2016 IEEE.

关键词： Energy harvesting

来源：评论

学校读者我要写书评

暂无评论

Some applications of nonlinear science methods and support vector machine methods to protein problems

引用

Mini-Reviews in Organic Chemistry 2015年第6期12卷 493-505页

作者： Hana, Guo Sheng Yu, Zu-Guo Zhao, Zhi-Qin 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 XiangtanHunan411105 China School of Mathematical Sciences Queensland University of Technology GPO Box 2434 BrisbaneQ4001 Australia

Protein folding, prediction of protein structure and functions are most important problems in bioinformatics. The protein fold process mainly reflects in the kinetic order of folding. Predicting the structural classes of low-homology protein is a difficult problem in the prediction of protein structure. In order to understanding the mechanism of programmed cell death, it is very necessary to obtain the information about subcellular locations and functions of apoptosis proteins. Predicting protein subnuclear localizations is a challenging problem which is harder than predicting protein subcellular locations. Predicting membrane protein types is related to the structure and function of proteins. In this review, we introduce some applications of nonlinear science methods and support vector machine methods to the above protein problems. The nonlinear science methods including the horizontal visibility network, kernel method, recurrence quantification analysis, global descriptor, Lempel-Ziv complexity, and Hilbert-Huang transform are used to extract features in these approaches. © 2015 Bentham Science Publishers.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Simulate Human Saccadic Scan-Paths in Target Searching

引用

International Journal of Intelligence Science 2016年第1期6卷 1-9页

作者： Lijuan Duan Jun Miao David M. W. Powers Jili Gu Laiyun Qing Beijing Key Laboratory of Trusted Computing Beijing Key Laboratory on Integration and Analysis of Large-Scale Stream Data College of Computer Science and Technology Beijing University of Technology Beijing China National Engineering Laboratory for Critical Technologies of Information Security Classified Protection Beijing China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing Technology CAS Beijing China School of Computer Science Engineering & Maths Flinders University of South Australia Adelaide South Australia Beijing Samsung Telecom R&D Center Beijing China University of Chinese Academy of Sciences Beijing China

Human saccade is a dynamic process of information pursuit. There are many methods using either global context or local context cues to model human saccadic scan-paths. In contrast to them, this paper introduces a model for gaze movement control using both global and local cues. To test the performance of this model, an experiment is done to collect human eye movement data by using an SMI iVIEW X Hi-Speed eye tracker with a sampling rate of 1250 Hz. The experiment used a two-by-four mixed design with the location of the targets and the four initial positions. We compare the saccadic scan-paths generated by the proposed model against human eye movement data on a face benchmark dataset. Experimental results demonstrate that the simulated scan-paths by the proposed model are similar to human saccades in term of the fixation order, Hausdorff distance, and prediction accuracy for both static fixation locations and dynamic scan-paths.

关键词： Saccadic Scan-Paths Eye Movement Fixation Locations Dynamic Scan-Paths

来源：评论

学校读者我要写书评

暂无评论

CCF-based awareness in agent model ABGP 4th

CCF-based awareness in agent model ABGP

引用

4th IFIP TC 12 International Conference on rtificial Intelligence in Theory and Practice, IFIP AITP 2015 Held as Part of International Federation for information processing, WCC 2015

作者： Shi, Zhongzhi Yue, Jinpeng Ma, Gang Yang, Xi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China

ISBN: (纸本)9783319252605

ABGP is an agent cognitive model, which combines external perception and internal mental state of agents together. The model consists of 4-tuple . For environment awareness a framework named Coding and Combining Features (CCF) is proposed in this paper. The CCF framework combines feature descriptors together based on the compact coding. In the CCF framework firstly compact codes are learned to be robust to complex image content variations. Secondly, the compact codes from multiple information sources are combined by multi-kernel learning to generate the final feature. The experiment results show us that CCF method achieves a better performance in the identification task. © IFIP International Federation for information processing 2015.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Semantic automatic image annotation based on Non-Abstract Visual Keywords

Semantic automatic image annotation based on Non-Abstract Vi...

引用

2014 International Conference on information Technology and Application, ITA2014

作者： Ke, Xiao Chen, Guolong College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing Fuzhou University Fuzhou China

ISBN: (纸本)9781138026773

Automatic image annotation is a significant and challenging problem in pattern recognition and computer vision. Existing models did not describe the visual representations of corresponding keywords, which would lead to appearing plenty of irrelevant annotations in final annotation results. These annotations did not relate to any part of images considering visual contents. We propose a new automatic image annotation model (NAVK) based on relevant visual keywords to overcome above problems. Our model focuses on non-abstract words. First, we establish visual keyword seeds of each non-abstract word, and then a new method is proposed to extract visual keyword collections by using corresponding seeds. Second, we propose adaptive parameter method and fast solution algorithm to determine similarity thresholds of each keyword. Finally, the combinations of above methods are used to improve annotation performance. Experimental results verify the effectiveness of proposed image annotation model. © 2015 Taylor & Francis Group, London.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

A novel model for wind power forecasting based on Markov residual correction 6

A novel model for wind power forecasting based on Markov res...

引用

2015 6th International Renewable Energy Congress, IREC 2015

作者： Li, Lijuan Liu, Hongliang Wu, Jun Bo, Hai Key Laboratory of Intelligent Computing and Information Processing Xiangtan University Xiangtan China School of Mathematics and Computational Science Xiangtan University Xiangtan China College of Information Engineering Xiangtan University Xiangtan China

ISBN: (纸本)9781479979479

An accurate wind power forecasting model has great significance in wind farm operation and electric power system dispatching and operation. An auto regressive integrated moving average (ARIMA) time series model with Markov residual correction is proposed to forecast the wind power in this paper. After establishing ARIMA model, random residual sequence with Markov property can be proved through chi-square statistics. The residual correction model based on Markov chain is then established. The prediction results of wind power of two wind turbines and the wind farm are achieved. The results with the assessment of accuracy rate and qualification rate show that the proposed model has excellent performances and precision. Compared with time series and artificial neural network model, the accuracy is improved by 6-10%, and qualification rate is improved by 2-7%. The proposed method implements more simply than some combined models, which has better practical value. © 2015 IEEE.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Band structure of triangular lattices photonic crystals with lossy and dispersive materials

引用

Guangzi Xuebao/Acta Photonica Sinica 2016年第3期45卷 0319002-1-0319002-1-0319002-6页

作者： Niu, Kai-Kun Wang, Li-Hua Huang, Zhi-Xiang Wu, Bo Kuang, Xiao-Jing Wu, Xian-Liang Key Laboratory of Intelligent Computing and Signal Processing Anhui University Hefei230039 China Electronic and Information Engineering School Hefei Normal University Hefei230061 China

In order to explore the properties of photoniccrystals, the finite element method was introduced to calculate the band structure of lossy and dispersive photonic crystals with triangular lattice. By using this method, the calculation of band structure is reduced to a quadratic eigenvalue problem which the eigenvalue is the Bloch wave vector, the band structure and eigenmode can be obtained more effectively. The band structure in the TE and TM mode of photonic crystals with dielectric material in triangular lattice was compared with the reference to demonstrate the accuracy of the method. Furthermore, the dispersion relation of the lossy and lossless photonic crystals was also given by the proposed method. The symmetry and surface plasmon polarizations properties are found in lossless photonic crystals and electric field distributions are concentrated on the interface of dispersive materials and air. It is demonstrated in the lossy photonic crystals that the symmetry is destroyed, the surface plasmon polarizations properties are weakened and electric field density is decreased. The results can be used as theoretical basis and reference for studying the lossy photonic crystals and surface plasmon polarizations. © 2016, Science Press. All right reserved.

关键词： Finite element method

来源：评论

学校读者我要写书评

暂无评论

Memory bandwidth optimization of SpMV on GPGPUs

引用

Frontiers of Computer Science 2015年第3期9卷 431-441页

作者： Chenggang Clarence YAN Hui YU Weizhi XU Yingping ZHANG Bochuan CHEN Zhu TIAN Yuxuan WANG Jian YIN Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Institute of Microelectronics Tsinghua University Beijing 100084 China Automation Department Tsinghua University Beijing 100084 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China State Grid Information & Communication Company of Hunan EPC Changsha 410007 China Department of Computer Shandong University Weihai 250101 China

It is an important task to improve performance for sparse matrix vector multiplication （SpMV）, and it is a difficult task because of its irregular memory access. Gen- eral purpose GPU （GPGPU） provides high computing abil- ity and substantial bandwidth that cannot be fully exploited by SpMV due to its irregularity. In this paper, we propose two novel methods to optimize the memory bandwidth for SpMV on GPGPU. First, a new storage format is proposed to exploit memory bandwidth of GPU architecture more effi- ciently. The new storage format can ensure that there are as many non-zeros as possible in the format which is suitable to exploit the memory bandwidth of the GPU. Second, we pro- pose a cache blocking method to improve the performance of SpMV on GPU architecture. The sparse matrix is partitioned into sub-blocks that are stored in CSR format. With the block- ing method, the corresponding part of vector x can be reused in the GPU cache, so the time to access the global memory for vector x is reduced heavily. Experiments are carried out on three GPU platforms, GeForce 9800 GX2, GeForce GTX 480, and Tesla K40. Experimental results show that both new methods can efficiently improve the utilization of GPU mem- ory bandwidth and the performance of the GPU.

关键词： GPGPU performance tuning SpMV cacheblocking memory bandwidth

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：