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

WSA 2015;19th International ITG Workshop on Smart Antennas

作者： Ibo Ngebani Yabo Li Xiang-Gen Xia Minjian Zhao Joseph Chuma Yunlong Cai Department of Information Science and Electrical Engineering Zhejiang Provincial Key Laboratory of Information Network Technology Zhejiang University Department of Electrical and Computer Engineering University of Delaware

Vector orthogonal frequency division multiplexing (V-OFDM) for single transmit antenna systems is a generalization of OFDM where single-carrier frequency domain equalization (SC-FDE) and OFDM are just two special cases. Phase noise in a V-OFDM system leads to a common vector block phase error (CVBPE) as well as an inter vector block carrier interference (IVBCI) effect. Severe performance degradation results if these two effects are not estimated and compensated for. In this paper blind and semi-blind phase noise estimation and compensation in a V-OFDM system is investigated by using the expectation maximization (EM) algorithm. This is motivated by the fact that conventional frequency domain phase noise suppression schemes based on pilot-aided CVBPE estimation and compensation are not spectrally efficient as the vector block size is increased. Two novel algorithms are proposed, one estimates the CVBPE only and the other estimates the entire phase noise sequence in the time-domain. Simulations show that with the proposed algorithms V-OFDM can outperform OFDM system with conventional data aided or soft information aided phase noise CPE correction.

关键词： BCJR CVBPE EM IVBCI ML LMMSE OFDM Phase Noise SC-FDE Vector OFDM Phase noise Orthogonal frequency division multiplexing computer Programming Languages compensated auxiliary phase

来源：评论

学校读者我要写书评

暂无评论

High-Speed Joint Learning of Action Units in Social Interaction Analysis

High-Speed Joint Learning of Action Units in Social Interact...

引用

第七届社会计算会议

作者： Feng Xu Junping Zhang James Z. Wang Shanghai Key Laboratory of Intelligent Information Processing and the School of Computer Science Fud College of Information Sciences and Technology The Pennsylvania State UniversityUniversity ParkPA

As an important category of social communication,facial expressions provide abundant social and emotional ***,it has been a challenge for computer systems to provide real time accurate recognition of facial expressions from multimedia content and make the analysis *** address these issues,we propose a sparse tagging-like approach to jointly learn Action Units for facial expressions recognition,which can be utilized for social interaction ***,we regard the recognition of the combination of Action Units as tagging *** this approach,the computational complexity is substantially reduced because only matrix multiplications are *** order to make the analysis interpretable,we introduce a sparse term into our approach to reinforce the sparseness of the combination of Action *** in four benchmark datasets demonstrate that,compared with existing algorithms,our method achieves much faster speed,and higher interpretability and robustness,while yielding a matching accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Algorithms for computing cluster dissimilarity between rooted phylogenetic trees

引用

Open Cybernetics and Systemics Journal 2015年 9卷 2218-2223页

作者： Shuguang, Li Zhihui, Liu Key Laboratory of Intelligent Information Processing in Universities of Shandong Shandong Institute of Business and Technology Yantai264005 China College of Computer Science and Technology Shandong Institute of Business and Technology Yantai264005 China

Phylogenetic trees represent the historical evolutionary relationships between different species or organisms. Creating and maintaining a repository of phylogenetic trees is one of the major objectives of molecular evolution studies. One way of mining phylogenetic information databases would be to compare the trees by using a tree comparison measure. Presented here are a new dissimilarity measure for comparing rooted trees and three algorithms to efficiently compute it. This new measure operates on clusters of compared trees as in the case of standard Robinson-Foulds distance, but extracts more subtle differences between clusters, and thus may offer better discrimination than the Robinson-Foulds distance. © Shuguang and Zhihui;Licensee Bentham Open.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Reform and exploration of college computer experiment teaching

Reform and exploration of college computer experiment teachi...

引用

2014 International Conference on information Engineering and Education Science

作者： Yanrong Shi School of Computer Science and Technology Shandong Institute of Business and TechnologyYantaiChina Key Laboratory of Intelligent Information Processing in Universities of ShandongShandong Institute of Business and Technology

The computer experiment teaching is a necessary step to verify the theory of classroom teaching,is an important way to cultivate students' practical ability,innovation ability and team spirit of *** at the existing problems in the computer experiment teaching,we carried out to study and practice the teaching reform of computer experiments from several aspects,and achieved certain results.

关键词： computer experiment teaching College teaching reform Different levels

来源：评论

学校读者我要写书评

暂无评论

An improved social force evacuation model with grouping and guiding

引用

Journal of Computational information Systems 2015年第20期11卷 7553-7562页

作者： Lv, Yuanyang Liu, Hong Lu, Dianjie School of Information Science and Engineering Shandong Normal University Ji'nan China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Ji'nan China

Crowd evacuation simulation is of great significance for strategy design in emergency, resulting in serious injuries and casualties. A majority of existing evacuation models overlooked the interactions and influences between pedestrians. Therefore, a crowd evacuation model based on grouping and guiding was come up with, which is based on an improved social force model. The improved model optimized the trend selecting strategy of movement and added a force called relationship attractive force. The movement is determined by pedestrian's trend and composite force. According to the results of experiments, this proposed model can realize that pedestrians having intimate relationships with each other would get together gradually in process of crowd evacuation and made the effects more realistically. Copyright © 2015 Binary information Press.

关键词： Crowd evacuation Group partition Social force model Social relationship

来源：评论

学校读者我要写书评

暂无评论

Boundary feedback control of open canals with a Riemann invariants approach

Boundary feedback control of open canals with a Riemann inva...

引用

作者： Cen, Lihui Xi, Yugeng Li, Dewei Cen, Yigang Department of Control Engineering Central South University Changsha Hunan Province China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai China Department of Automation Shanghai Jiaotong University Shanghai200240 China School of Computer and Information Technology Beijing Jiaotong University Beijing China

This paper proposes a boundary feedback control design for open canal networks using the linearization of boundary conditions. For open canal networks with any types of cross-sections, which can be modelled by the Saint-Venant equations, the characteristic form in terms of Riemann invariants has been established. Under this established characteristic form, the stabilizing boundary control law has been developed by linearizing the boundary conditions for both a single reach and the open-channel network composed by multi-reaches in a cascade. The design of the boundary feedback control laws for both a single canal and the cascaded networks is illustrated in a unified framework, which extends the results in the literature. © The Author(s) 2014.

关键词： Boundary conditions

来源：评论

学校读者我要写书评

暂无评论

LTFML: Multi-label learning based on label typical features

引用

Journal of Computational information Systems 2015年第4期11卷 1497-1504页

作者： Zheng, Xiyuan Zhang, Huaxiang Fang, Xiaonan Meng, Lili School of Information Science and Engineering Shandong Normal University Jinan China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan China Jinan China

In recent years, multi-label learning is becoming a new research hot spot. In this paper, we proposed a multi-label learning method called LTFML based on the idea of trying to determine the typical features for each class label. First, LTFML choose those samples with some specific class label from the multilabel data set and cluster these selected samples. We use these clustering centers gained by above step as typical features which can represent effectively this class label. Then the distances between each sample and these clustering centers are used to represent each sample and weighted according to the standard deviations of each clustering cluster. Finally, a set of SVM classifiers are used to estimate the class label vector of unseen instance. Experimental results show that LTFML can have a very good performance over the well-known multi-label learning algorithms. 1553-9105/Copyright © 2015 Binary information Press

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

A Data Hiding Scheme Based on Lagrange Interpolation Algorithm and Multi-clouds

A Data Hiding Scheme Based on Lagrange Interpolation Algorit...

引用

International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)

作者： Yu Jin Yadan Wang Wei Xia Li Deng Heng He Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial Wuhan China Department of Computer Science and Technology Wuhan University of Science and Technology

The use of cloud storage services has increased rapidly in many organizations. However, the security of data stored in the cloud still remains major concerns. Due to risks of service availability failure and the possibility of malicious insiders in the single cloud, researches about "multi-clouds" have emerged recently. Recent researches that are related to multi-clouds have some limitations. For instance, Redundant Array of Cloud Storage (RACS) does not ensure data confidentiality. The performance of system is low in DEPSKY and so on. This paper presents a data hiding scheme that is based on Lagrange interpolation algorithm and multi-clouds. This scheme addresses data availability, data confidentiality and vendor lock-in issue in cloud storage services through the erasure codes and Lagrange interpolation algorithm instead of encryption to store data on diverse clouds. The performance analysis was done through experiences. We observed that our scheme improved the performance for the response times of data uploaded and downloaded.

关键词： Cloud computing Interpolation Reed-Solomon codes Encoding Encryption

来源：评论

学校读者我要写书评

暂无评论

Multigranulation information fusion: A dempster-shafer evidence theory based clustering ensemble method

Multigranulation information fusion: A dempster-shafer evide...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Fei-Jiang Li Yu-Hua Qian Jie-Ting Wang Ji-Ye Liang School of Computer and Information Technology Shanxi University Taiyuan Shanxi China Chinese Information Processing of Ministry of Education Key Laboratory of Computational Intelligence Taiyuan Shanxi China

ISBN: (纸本)9781467372220

As an important reflection of human cognitive ability, the multi-granulation analysis gets more reasonable solution of a problem in comparison to the single granulation. Clustering analysis is an active area of machine learning and a fundamental technique of information granulation. By using different clustering algorithms and different parameters of an algorithm, a data set can be granulated into multiple granular spaces. Clustering ensemble with these granular spaces is an effective strategy of multigranulation information fusion. The existing algorithms of clustering ensemble can be categorized into three types: feature-based method, combinatorial method and graph-based method. Given the fact that every type of methods has their own advantages and disadvantages, combining their advantages will obtain better granulation results. Based on this consideration, this paper introduces a Dempster-Shafer evidence theory based clustering ensemble method that combines advantages of combinatorial method and graph-based method. In this strategy, the definition of mass functions considers neighbors of an object using the graph binarization and the final clustering ensemble result is generated by applying the Dempster's combination rule. The form of the Dempster's combination rule makes the algorithm conforming to the pattern of combinatorial method. Experimental results show that the proposed method yields better performance in comparison with other seven clustering ensemble methods conducted on fourteen numerical real-world data sets from the UCI Machine Learning Repository.

关键词： Clustering ensemble Dempster-Shafer evidence theory information fusion Multigranulation information fusion combinatorial method Evidence Theory Dempster and Shafer's theory Cluster Analysis Clustering algorithms granulation

来源：评论

学校读者我要写书评

暂无评论

XGRouter: high-quality global router in X-architecture with particle swarm optimization

引用

Frontiers of computer Science 2015年

作者： Liu, Genggeng Guo, Wenzhong Li, Rongrong Niu, Yuzhen Chen, Guolong College of Mathematics and Computer Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

This paper presents a high-quality very large scale integration (VLSI) global router in X-architecture, called XGRouter, that heavily relies on integer linear programming (ILP) techniques, partition strategy and particle swarm optimization (PSO). A new ILP formulation, which can achieve more uniform routing solution than other formulations and can be effectively solved by the proposed PSO is proposed. To effectively use the new ILP formulation, a partition strategy that decomposes a large-sized problem into some small-sized sub-problems is adopted and the routing region is extended progressively from the most congested region. In the post-processing stage of XGRouter, maze routing based on new routing edge cost is designed to further optimize the total wire length and mantain the congestion uniformity. To our best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global routing problem in X-architecture. Experimental results show that XGRouter can produce solutions of higher quality than other global routers. And, like several state-of-the-art global routers, XGRouter has no overflow. © 2015 Higher Education Press and Springer-Verlag Berlin Heidelberg

关键词： VLSI circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：