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

作者： Rui, Yun Deng, Lei Wang, Qian Li, Jing Qian, Guoming Li, Mingqi Wang, Yingguan Shanghai Advanced Research Institute National Mobile Communications Research Laboratory Southeast University 201210 China Department of Information Engineering Chinese University of Hong Kong Hong Kong999077 Hong Kong School of Computer Science Wuhan University 430072 China State Key Laboratory of Integrated Service Networks Xidian University 710075 China College of Electronic Science and Engineering in NUPT 210003 China Shanghai Advanced Research Institute Chinese Academic of Science 201210 China Key Lab of Wireless Sensor Network and Communications Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences 201210 China

In this paper, we will investigate the energy efficient power loading problem in multipleinput multiple-output singular value decomposition (MIMO-SVD) architecture. Most existing power loading schemes are developed on the assumption that a scheduler possesses perfect channel state information (CSI). However, in practice, perfect CSI is not always available. In this paper, we propose an energy-efficient power loading scheme for MIMO system under imperfect CSI, taking into account the effects of channel estimation error (CEE). Specifically, we propose two algorithms to maximise the system energy efficiency. One is a global method which can achieve the global optimal solution with high computational complexity;the other is a suboptimal method which can obtain the approximate optimal solution with lower computational complexity. Simulation results validate the effectiveness and robustness of our proposed power loading scheme. Copyright © 2015 Inderscience Enterprises Ltd.

关键词： MIMO systems

来源：评论

学校读者我要写书评

暂无评论

RNA secondary structure prediction based on density-based clustering

引用

ICIC Express Letters 2015年第7期9卷 1965-1970页

作者： Wang, Changwu Wang, Xiuqin Wang, Baowen Liu, Wenyuan Wei, Zhenzhen Li, Yongqiang School of Information Science and Engineering Yanshan University No. 438 Hebei Ave Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave Qinhuangdao China Department of Information The First Hospital of Qinhuangdao No. 258 Hebei Ave Qinhuangdao China

The ribonucleic acid (RNA) secondary structure prediction has designed to characterize the ensemble of structures, instead of only computing the minimum free energy structure. Clustering methods are brought to aid in the characterization of the structure ensemble. These methods group the structures into a small number of clusters. A representative structure for each cluster is computed to characterize the central tendency for the structures in each cluster and used to predict the true secondary structure. This paper introduces a density based clustering with extensible radius dubbed ER-DBSCAN for handling varying density clustering. The basic idea of ER-DBSCAN is to use different values of radius for different densities. It starts from the highest density object towards the lowest density object, and the radius of the cluster is automatically adjusted during cluster expansion according to the density distribution and density variation. Our results indicate that ER-DBSCAN can detect and handle clusters of varying density, and cluster RNA secondary structures effectively. © 2015, ISSN 1881-803X.

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

Phase detection based range estimation with a dual-band robust Chinese remainder theorem

引用

Science China(information Sciences) 2014年第2期57卷 18-26页

作者： YANG Bin WANG WenJie XIA XiangGen YIN QinYe Ministry of Education (MOE) Key Laboratory for Intelligent Networks and Network Security School of Electronics and Information EngineeringXi’an Jiaotong University Department of Electrical and Computer Engineering University of Delaware

Range estimation with multifrequency phases is a common practice in localization *** challenge of this method is the phase *** Chinese remainder theorem(CRT)based phase unwrapping algorithms have been proposed to solve the problem,where the wavelengths of the multifrequency signals need to be pair-wisely co-prime after they are divided by their greatest common divisor(gcd).This condition may limit the application in *** this paper,a novel way based on a dual-band robust CRT is presented to reconstruct the distance from dual-band wrapped phases,where the pair-wisely co-prime condition is not necessarily *** more wrapped phases are involved to reconstruct the distance,the method can significantly enlarge the reconstruction range compared to the single band solution.

关键词： range estimation Chinese remainder theorem(CRT) robustness dual band

来源：评论

学校读者我要写书评

暂无评论

Tracking multiple-person using sparse stereo information

International Journal of Signal Processing, Image Processing...

引用

International Journal of Signal Processing, Image Processing and Pattern Recognition 2015年第9期8卷 101-120页

作者： Hu, Keli Gu, Yuzhang Shen, Shigen Zhang, Cheng Zhan, Yunlong Department of Computer Science and Engineering Shaoxing University Shaoxing Zhejiang China Key Laboratory of Wireless Sensor Network & Communication Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences Shanghai China

In this study, we address the problem of multi-person detection and tracking in challenging scenes using sparse stereo information. In each frame, only a sparse set of object feature points are extracted. All these feature points are then projected onto a plan-view map, and grouped into several clusters by employing the biometric information, the optical flow information of object feature points, as well as the width of a person. By producing clusters, the location of a possible person can be determined. In addition, a Modified Joint Probabilistic Data Association Filter (MJPDAF) is proposed for improving the performance of measurements association during the people tracking process. Compared to the traditional JPDAF, the methods for the construction of the validation matrix and the calculation of association probabilities are improved. Experiments on challenging datasets demonstrate that the proposed algorithm is robust for people detection and tracking through fixed stereo vision. ©, 2015 SERSC.

关键词： Optical flows

来源：评论

学校读者我要写书评

暂无评论

Make your webpage carry abundant secret information unawarely

Make your webpage carry abundant secret information unawarel...

引用

15th IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, EUC 2013

作者： Guo, Xiaojun Cheng, Guang Zhu, Chengang Zhou, Aiping Pan, Wubin Truong, Dinhtu School of Computer Science and Engineering Southeast University Nanjing 210096 China School of Information Engineering Tibet Nationalities Institute Xianyang 712082 China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing 210096 China

ISBN: (纸本)9780769550886

How to embed more secret message into web page with keeping good imperceptibility simultaneously is a trade-off problem for information hiding schemes. This paper presents a novel web page information hiding method based on three inherent features of current web page's HTML Code matrix. This method firstly exploits chaotic transform to deal with secret message, then embeds each bit of secret message into cover web page according to the random odevity of character amount contained by each row(column) in cover web page's HTML code matrix. Its process is very simple to understand and easy to implement. It can improve the largest embedded capacity (LEC) of cover web page greatly with keeping good imperceptibility at the same time. We test our approach on two test data sets which include 1000 web pages in total. The experiment results show that the max LECs for these two data sets are up to 11291 bits and 13545 bits respectively. The average LECs for two data sets has improvement of 80.2% and 24% more than that of other web page information hiding method. © 2013 IEEE.

关键词： HTML

来源：评论

学校读者我要写书评

暂无评论

Inference rules based on XML functional dependency and XML multi-valued dependency

Inference rules based on XML functional dependency and XML m...

引用

2014 International Conference on Future information Engineering and Manufacturing Science(FIEMS 2014)

作者： Zhongping Zhang Shanshan Shi The School of Information Science and Engineering Yanshan University The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province

ISBN: (纸本)9781138026445

There not only exists the relation of the functional dependency and multi-valued dependency in XML data constraint,but also exists the relation of data dependency obtained only from a certain existing relationship instance that is *** reducing data redundancy,in this paper,the concepts of XML functional dependency and XML multi-valued dependency based on the path expression in the Document Type Definition are *** then the inference rules on the condition of the coexistence of functional dependency and multi-valued dependency in XML are ***,the validity and completeness of the inference rules are *** above-mentioned fundamentally solves the problems of implication of functional dependency and multi-valued dependency in XML data,laying a theoretical foundation for XML database design.

关键词： Extensible Markup Language inference rules functional dependency multi-valued dependency

来源：评论

学校读者我要写书评

暂无评论

Inuence maximization algorithm based on genetic algorithm

引用

Journal of Computational information Systems 2014年第21期10卷 9255-9262页

作者： Guo, Jingfeng Liu, Yuanying Shen, Jiali Wei, Zhenzhen Lv, Jiaguo College of Information Science and Engineering Yanshan University Qinhuangda China College of Information Technology Hebei University of Economics and Business Shijiazhuang China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

The inuence maximization problem is defined as providing a given initial integer k, mining top-k inuential nodes from a social network such that the spread of inuence in the network is maximized. Some existing studies are based on Greedy algorithm, but their time complexity is very high. In this paper, a different method based on Genetic Algorithms, denoted as MAGA is proposed. In the MAGA algorithm, the set of k nodes is seen as a candidate solution, and the expected inuence value as fitness. Use the genetic algorithm to get the optimal solution. Experiments show that the algorithm achieved a balance in inuence spread and running time.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Real-time simulation of foam and sprays based on the Weber number

引用

Journal of Computational information Systems 2014年第7期10卷 2829-2836页

作者： Zhang, Lihui Zhang, Chao Li, Ying Lv, Mengya Tang, Yong The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province The College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China Department of Information Engineering Environmental Management College of China Qinhuangdao 066004 China

In this paper, we propose a method based on the Weber number to uniformly model and simulate the foam and sprays generated by the fluid motion. We use the SPH to construct the fluid and calculate the Weber number of each particle. The fluid particles are divided into foam particles, transition particles and water particles by comparing their Weber number with a given critical value. These particles are rendered independently. For the solid-liquid interaction in fluid, we use SPH particles to mark the solid shape, and correct the changed solid particle position using a rotating equation. Finally, a more precise fluid surface illumination model is proposed, and the Fresnel reflection coefficient of this model can be gotten by the Snell law. Experiment results show that our method achieve real-time performance and the visual effect is desirable. © 2014 Binary information Press.

关键词： Hydrodynamics

来源：评论

学校读者我要写书评

暂无评论

The research of the recommendation algorithm in online learning

International Journal of Multimedia and Ubiquitous Engineeri...

引用

International Journal of Multimedia and Ubiquitous Engineering 2015年第4期10卷 71-80页

作者： Yu, Ruiguo Cai, Zhiyong Du, Xiuping He, Muwen Wang, Zan Yang, Binlan Chang, Peng School of Computer Science and Technology Tianjin University Tianjin China Tianjin Key Laboratory of Cognitive Computing and Application Tianjin China School of Education Tianjin University Tianjin China School of Computer and Software Tianjin University Tianjin China Information and Network Center Tianjin University Tianjin China

Recommendation algorithm is a kind of method in information filtering and has been widely applied on Internet. Collaborative filtering is widely used in the recommendation systems and has turned out to be successful. With the growth of the resources, it is difficult for users to find learning resources that suit for themselves. The recommendation algorithm is required to analyze the behavior of the users and then recommend object of learning. Online judge is a kind of the online learning. People can evaluate their programming ability through online judge. The performance of the different recommendation algorithms is analyzed in this paper and it is proposed that the item-based collaborative filtering recommendation algorithms should be applied into the online learning system. Based on the algorithm, we propose that by pre-processing the data and using user data that have solve large number of problems, we can get a better recommendation result. © 2015 SERSC.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Webshell detection techniques in web applications 5

Webshell detection techniques in web applications

引用

5th International Conference on Computing Communication and networking Technologies, ICCCNT 2014

作者： Dinh Tu, Truong Guang, Cheng Xiaojun, Guo Wubin, Pan School of Computer Science and Engineering Southeast University Nanjing210096 China Department of Information Technology Tuyhoa Industrial College Phuyen620900 Viet Nam Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

ISBN: (纸本)9781479926961

With widely adoption of online services, malicious web sites have become a malignant tumor of the Internet. Through system vulnerabilities, attackers can upload malicious files (which are also called webshells) to web server to create a backdoor for hackers' further attacks. Therefore, finding and detecting webshell inside web application source code are crucial to secure websites. In this paper, we propose a novel method based on the optimal threshold values to identify files that contain malicious codes from web applications. Our detection system will scan and look for malicious codes inside each file of the web application, and automatically give a list of suspicious files and a detail log analysis table of each suspicious file for administrators to check further. The Experimental results show that our approach is applicable to identify webshell more efficient than some other approaches. © 2014 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：