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

A new coupled-loop antenna for eight-band LTE/WWAN operation in ultra-thin laptop computer

Progress In Electromagnetics Research C 2013年 42卷 229-238页

作者： Zhu, Xianbin Sun, Yufa Key Lab of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230039 China

A new structure of coupled-fed loop antenna con- nected with two branch radiators for eight-band LTE/WWAN (LTE700/GSM850/900/1800/1900/UMTS/LTE2300/2500) operation in the ultra-thin laptop computer is presented. The two branch strips of the antenna are e±cient radiators and contributing multi-resonant modes to greatly enhance the bandwidth of the antenna. The proposed antenna on the top shielding metal wall of the laptop display, with a planar and compact size of 12:5 × 70 × 0:8mm3, is suitable to be embedded inside the casing of the laptop computer. The proposed antenna is fabricated and tested, and good radiation performances are obtained. Compared with the existing published antennas, the volume of the planar antenna is quite small.

关键词： Laptop computers

来源：评论

学校读者我要写书评

暂无评论

A Full-Rate and Low-Detection Complexity Cooperative Transmission Scheme Based on Distributed Space-Time-Frequency Code Design

A Full-Rate and Low-Detection Complexity Cooperative Transmi...

引用

2013 IEEE 4th International Conference on Software Engineering and Service Science

作者： Hongyu Fang Ruzi Li Li Wang Xiaohui Li Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University

ISBN: (纸本)9781467349994

The cooperative transmission schemes based on the amplify and forward（AF） mode have the defect of low transmission rate and the exiting full-rate cooperative transmission schemes based on space-time code design have the defect of high detection ***,this paper makes the best of linear constellation precoding（LCP） technique and cyclic delay diversity（CDD） technique,and adopts the nonorthogonal amplify and forward（NAF） mode,finally proposes a new full-rate wireless cooperative transmission scheme based on space-time-frequency code *** with the cooperative transmission schemes that only pursue the transmission rate or the BER performance,this new scheme can apply to multi-relay scenario,and has the advantages of simple structure,low signal detection complexity that does not increases with the number of relay *** of above makes the real-time data transmission service of high quality come to be possible.

关键词： cooperative space-time-frequency full-rate lowdetection complexity

来源：评论

学校读者我要写书评

暂无评论

Video tracking of human with occlusion based on MeanShift and Kalman filter

Video tracking of human with occlusion based on MeanShift an...

引用

2013 International Conference on Vehicle and Mechanical Engineering and Information Technology, VMEIT 2013

作者： Yuan, Bao Hong Zhang, De Xiang Fu, Kui Zhang, Ling Jun Key Lab. of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China

ISBN: (纸本)9783037858202

In order to accomplish tracking of moving objects requirements, and overcome the defect of occlusion in the process of tracking moving object, this paper presents a method which uses a combination of MeanShift and Kalman filter algorithm. MeanShift object tracking algorithm uses a histogram to describe the color characteristics of an object, and search the location of an image region that the color histogram is closest to the histogram of the object. Histogram similarity is defined in terms of the Bhattacharya coefficient. When the moving object is a large area blocked, the future state of moving object is estimated by Kalman filter. Experimental results verify that the proposed algorithm achieves efficient tracking of moving objects under the confusing situations. © (2013) Trans Tech Publications, Switzerland.

关键词： Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Efficiently Finding Top-K Items from Evolving Distributed Data Streams

Efficiently Finding Top-K Items from Evolving Distributed Da...

引用

International Conference on Semantics, Knowledge and Grid (SKG)

作者： Baoyuan Qi Gang Ma Zhongzhi Shi Wei Wang University of Chinese Academy of Sciences Beijing China Key Lab of Intelligent Information Processing Institute of Computing Technology Cas Beijing China Key Lab. of Intell. Inf. Process. Institute of Computing Technology Chinese Academy of Sciences Beijing CN Beijing Lexo Technologies Co. Ltd. Beijing China

ISBN: (纸本)9781479967162

The problem of efficiently finding top-k frequent items has attracted much attention in recent years. Storage constraints in the processing node and intrinsic evolving feature of the data streams are two main challenges. In this paper, we propose a method to tackle these two challenges based on space-saving and gossip-based algorithms respectively. Our method is implemented on SAMOA, a scalab.e advanced massive online analysis machine learning framework. The experimental results show its effectiveness and scalab.lity.

关键词： Peer-to-peer computing Data mining Distributed databases Protocols Machine learning algorithms Monitoring Radiation detectors

来源：评论

学校读者我要写书评

暂无评论

Social sensing enhanced time estimation for bus service

引用

Concurrency and Computation: Practice and Experience 2015年第15期27卷

作者： Jin Liu Juan Li Xiaohui Cui Xiaoguang Niu Xiaoping Sun Jing Zhou State Key Lab. of Software Engineering Computer School Wuhan University Wuhan China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China International School of Software Wuhan University Wuhan China Computer School Wuhan University Wuhan China Key Lab of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science Communication University of China China

The precise prediction of bus routes or the arrival time of buses for a traveler can enhance the quality of bus service. However, many social factors influence people's preferences for taking buses. These social factors may include heavy traffic cost, traffic congestion, poor air quality and so forth. Existing prediction techniques rarely consider social sensing when predicting the bus arrival time. Accordingly, this paper proposes a social sensing enhanced service for predicting bus routes, which integrates sensing ability and social networks to understand and measure the influence between social events and vehicle velocity. We focus on the analysis of two different attributions: PT service quality attributions PEA s and road condition attributions PRCA s. Both of them synthesize the social sensing in their evaluation of bus routes. PEA represents individual preferences and PRCA represents physical factors that significantly influence vehicle velocity. Bus relevant social events were further categorized into PEA events or PRCA events. PEA s of buses were scored according to the tendency of bus conditions reflected in social events. Furthermore, an artificial neural network prediction model is established to estimate the bus travel time. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： social sensing in-time bus service bus route arrival time estimation

来源：评论

学校读者我要写书评

暂无评论

Video Summarization by Robust Low-Rank Subspace Segmentation

Advances in Intelligent Systems and Computing

引用

Advances in intelligent Systems and computing 2013年 212卷 929-937页

作者： Tu, Zhengzheng Sun, Dengdi Luo, Bin Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039 China School of Computer Science and Technology Anhui University Hefei 230601 China Key Lab of Industrial Image Processing and Analysis of Anhui Province Hefei 230039 China

ISBN: (纸本)9783642375019

Video summarization provides condensed and succinct representations of the content of a video stream. A static storyboard summarization approach based on robust low-rank subspace segmentation is proposed in this paper. Firstly, video frames are represented as multi-dimensional vectors, and then embedded into a group of affine subspaces using low-rank representation according to the content similarity of the frames in the same subspace. Secondly, a series of subspaces are segmented based on the Normalized Cuts algorithm. The video summary is finally generated by choosing key frames from the significant subspaces and ranking these key frames in temporal order. The experimental results demonstrate that the proposed summarization algorithm can produce crucial key frames and effectively reduce the visual content redundancy in summary comparing with the conventional approaches. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Wavelet denoising of SAR images corrupted by speckle noise using cycle spinning

Wavelet denoising of SAR images corrupted by speckle noise u...

引用

2nd International Conference on intelligent Materials, Applied Mechanics and Design Science, IMAMD 2013

作者： Ji, Ming Wei Liu, Yan Li Zhang, De Xiang The Institute of Mechanical and Electrical Engineering of Anhui University of Architecture Hefei 230601 China Key Lab. of Intelligent Computing and Signal Processing Anhui University Hefei 230039 China

ISBN: (纸本)9783037857175

A novel and efficient speckle noise reduction algorithm based on wavelet transform by cycle spinning for removing speckle of unknown variance and minimizing the effect of pseudo-Gibbs phenomena from Synthetic Aperture Radar (SAR) images is proposed. Therefore, we show that the sub-band decompositions of logarithmically transformed SAR images. Then, we process and reconstruct multi-resolution wavelet coefficients by wavelet-threshold using cycle spinning, a technique estimating the true images as the linear average of individual estimates derived from wavelet thresholded translated versions of the noise images. Experimental results show that the proposed de-noising algorithm is possible to achieve an excellent balance between suppresses speckle effectively and weaken as many image Gibbs phenomena as possible. Quantitative and qualitative comparisons of the results obtained by the new method with the results achieved from the other speckle noise reduction techniques demonstrate its higher performance for speckle reduction in SAR images. © (2013) Trans Tech Publications, Switzerland.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Fast and scalab.e lock methods for video coding on many-core architecture” [J. Vis. Commun. Image R. 25(7) (2014) 1758–1762]

引用

Journal of Visual Communication and Image Representation 2015年 27卷 57-57页

作者： Weizhi Xu Hui Yu Dianjie Lu Fenglong Song Da Wang Xiaochun Ye Songwei Pei Dongrui Fan Hongtao Xie Institute of Microelectronics Tsinghua University Beijing China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Information Science and Engineering Shandong Normal University Jinan China Department of Computer Science and Technology Beijing University of Chemical Technology Beijing China Institute of Information Engineering Chinese Academy of Sciences National Engineering Laboratory for Information Security Technologies Beijing China

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Fast and scalab.e lock methods for video coding on many-core architecture” [J. Vis. Commun. 25 (7) (2014) 1758–1762]

引用

Journal of Visual Communication and Image Representation 2015年 26卷 350-350页

来源：评论

学校读者我要写书评

暂无评论

A novel graph-based compact representation of word alignment

A novel graph-based compact representation of word alignment

引用

51st Annual Meeting of the Association for Computational Linguistics, ACL 2013

作者： Liu, Qun Tu, Zhaopeng Lin, Shouxun Centre for Next Generation Locolisation Dublin City University Ireland Key Lab. of Intelligent Info. Processing Institute of Computing Technology CAS China

ISBN: (纸本)9781937284510

In this paper, we propose a novel compact representation called weighted bipartite hypergraph to exploit the fertility model, which plays a critical role in word alignment. However, estimating the probabilities of rules extracted from hypergraphs is an NP-complete problem, which is computationally infeasible. Therefore, we propose a divide-and-conquer strategy by decomposing a hypergraph into a set of independent subhypergraphs. The experiments show that our approach outperforms both 1-best and n-best alignments. © 2013 Association for Computational Linguistics.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：