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

作者： Hu, D. Hu, J. Education Ministry's Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications China Jiangsu Province's Key Lab of Image Procession and Image Communications Nanjing University of Posts and Telecommunications China

ISBN: (纸本)9781845648282

Nonparametric model is one of the popular ones for background modeling for its ability to adapt to changes quickly in dynamic environment and enable very sensitive detection of moving objects. However, the method is too complex and computationally inefficient to real-time application. In this paper, a fast and efficient scheme for moving object detection by nonparametric background modeling was proposed, whereas the background was modeled combining clustering theory to eliminate the large amount of redundant information and noise pixels in background modeling stage. Moreover, adaptive background and temporal differencing was used to filter out unchanged background pixels, thus enabling an additional reduction in computational requirements and improving the detection results. Besides, RGB color components were substituted by chromaticity coordinates to suppress shadow effects. Experimental results demonstrated the effectiveness of the proposed algorithm. © 2014 WIT Press.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Clustering facilitated web services discovery model based on supervised term weighting and adaptive metric learning

引用

International Journal of Web Engineering and technology 2013年第1期8卷 58-80页

作者： Chen, Lei Yang, Geng Zhu, Wei Zhang, Yingzhou Yang, Zhen College of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Nanjing 210003 China

With the explosive growth of web services, the research on how to rapidly find the desired services becomes increasingly important and challenging. In this paper, we focus on non-semantic web services discovery and present an efficient clustering facilitated web services discovery model (CFWSFinder). Compared with the existing models, CFWSFinder has several characteristics. First, in services representing process, CFWSFinder imports WordNet and latent semantics index to represent non-semantic web services as the low-dimensional compact semantic feature vectors;Second, in services clustering process, CFWSFinder employs a modified Kernel batch self-organising map (KBSOM) neural network to minimise the services discovery duration;Third and most importantly, in services matching process, by using the category label information achieved from services clustering process, CFWSFinder can adopt supervised term weighting scheme and adaptive metric learning method to ameliorate the services discovery precision. Finally, experimental results performed on the real-world web services collection demonstrate the feasibility of the CFWSFinder. Copyright © 2013 Inderscience Enterprises Ltd.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

A trust information search model based on simulated annealing in P2P network

引用

Information technology Journal 2013年第15期12卷 3289-3293页

作者： Xu, He Huang, Han-Chen Wang, Ruchuan College of Computer Nanjing University of Posts and Telecommunications Jiangsu Nanjing 210003 China Jiangsu High Technology Research Key Laboratory Wireless Sensor Networks Jiangsu Nanjing 210003 China Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Jiangsu Province Nanjing 210003 China Department of Leisure Management Yu Da University Miaoli 36143 Taiwan

Trust information search algorithm is one of the most important components of P2P trust model. Considering the large number of nodes and the wide range of information each node contains in P2P network, efficient search algorithm can improve the network efficiency and attract more users to join P2P network. Moreover, efficient search algorithm can also let each node in the network know the current state of the network in time. This study designs an SABS (Simulated Annealing Based Search) model based on Simulated Annealing (SA) to search the trust information in P2P network. Simulation results show that this model can obtain the optimal path and the shortest distance of the network with appropriate parameter values. © 2013 Asian network for Scientific Information.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Compressive fault-tolerance network coding

Compressive fault-tolerance network coding

引用

2013 IEEE International Conference on Signal Processing, communications and Computing, ICSPCC 2013

作者： Chen, Siguang Wu, Meng Key Lab of Broadband Wireless Communication and Sensor Network Technology of Ministry of Education Nanjing University of Posts and Telecommunications Nanjing China College of Telecommunications and Information Engineering Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781479910274

Because many signals are correlated over temporal domain, this paper proposes a compressive fault telorance network coding scheme for exploring the temporal correlation of signals. This scheme overcomes the drawbacks of network coding theory by injecting the compressed sensing theory into network coding, i.e., the scheme possesses well compression gain. Meanwhile, it can tolerate finite errors and reconstruct the original information with low distortion when the rank of error matrix (induced by errors) is lying in a reasonable bound. Finally, the performance analysis shows that the compressed sensing-based network coding scheme outperforms the conventional network coding scheme with significant improvement in robustness and performance. © 2013 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Distributed beamforming designs to improve physical layer security in wireless relay networks

引用

EURASIP Journal on Advances in Signal Processing 2014年第1期2014卷 1-1页

作者： Mujun Qian Chen Liu Youhua Fu The Key Lab of Broadband Wireless Communication and Sensor Network Technology (Ministry of Education) Nanjing University of Posts and Telecommunications Nanjing Jiangsu China National Mobile Communications Research Laboratory Southeast University Nanjing Jiangsu China

来源：评论

学校读者我要写书评

暂无评论

Average Level Crossing Rate and Fading Duration of Multiuser Single Relay Cooperation wireless Uplinks

引用

China communications 2013年第4期10卷 135-143页

作者：贾向东杨龙祥朱洪波 Wireless Communications Key Laboratory of Jiangsu Province Nanjing University of Posts and Telecommunications Key Laboratory of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education College of Computer Science and Engineering Northwest Normal University

We investigate the average Level Crossing Rate （LCR） and Average Fading Duration （AFD） of multiuser single relay co- operation wireless uplinks over independent and non-identically distributed （***.d） Ray- leigh fading channels. We first present the statistical analyses of the first-hop equivalent envelope. Then, we investigate the LCR and AFD of an equivalent end-to-end envelope, and present the closed-form solutions to LCR and AFD, which are given with integral forms. Finally, we derive the Laplace approximations of LCR and AFD as well as the upper and lower bounds. The numerical results of LCR show that the upper bound is tight. For multi user systems with different number of mobile users, the analyses indicate that the LCRs are approximately the same at the low level of the envelope. envelope However, there are at the high level of the reasonable differences among the curves of LCRs. Due to that fact that AFD is the inverse function of LCR, the results for AFD are the opposite.

关键词： wireless communications multiuseruplinks level crossing rate average fadingduration

来源：评论

学校读者我要写书评

暂无评论

AN ID-based online/offline signature scheme without random oracles for wireless sensor networks

AN ID-based online/offline signature scheme without random o...

引用

作者： Wang, Zhiwei Chen, Wei College of Computer Nanjing University of Posts and Telecommunications Ministry of Education Jiangsu Province Nanjing 210003 Jiangsu China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing 210003 Jiangsu China Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Jiangsu Province Nanjing 210003 Jiangsu China

Online/offline signature schemes allow one to quickly compute a digital signature from a precomputed coupon. In this paper, we present an ID-based online/offline signature for wireless sensor networks (WSNs), which is based on Hohenberger' RSA signature (Crypto 09). We argue that due to significant reduction in costs of computation and storage, our scheme is particularly suitable for the WSNs environment with severely constrained resources. Our scheme can be proved secure under the factoring assumption without random oracles. © 2012 Springer-Verlag London Limited.

关键词： wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient multi-hop routing algorithm based on LEACH

Energy-efficient multi-hop routing algorithm based on LEACH

引用

6th China Conference of wireless sensor networks, CWSN 2012

作者： Yang, He Xu, Jia Wang, Ruchuan Qian, Liyang College of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing University of Posts and Telecommunications Nanjing 210003 China Key Lab. of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing University of Posts and Telecommunications Nanjing 210003 China

ISBN: (纸本)9783642362514

In order to reduce network energy consumption and prolong the lifetime of wireless sensor networks, this paper improves the LEACH to an energy efficient multi-hop routing algorithm. LEACH in the cluster creation, data transmission, the update phase of the cluster was modified in proposed algorithm. The algorithm updates the cluster head reasonably and adjusts the structure of the cluster to reduce the energy consumption in cluster establishment phrase. In data transmission, it lowers energy consumption by inter-cluster and intra-cluster multi-hop transmission. The simulation runs the algorithm on NS2. The results show that the new algorithm's effectiveness in reducing energy consumption by comparing it with LEACH, LEACH-C,DEEUC. © 2013 Springer-Verlag.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Mobile agent based coding aware multipath routing for wireless sensor network

Mobile agent based coding aware multipath routing for wirele...

引用

6th China Conference of wireless sensor networks, CWSN 2012

作者： Shao, Xing Wang, Ruchuan Lin, Qiaomin Huang, Haiping College of Computer Nanjing University of Posts and Telecommunications XinMoFan Road.66 210003 Nanjing China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks XinMoFan Road.66 210003 Nanjing China Key Lab. of Broadband Wireless Communication and Sensor Network Technology XinMoFan Road.66 210003 Nanjing China

ISBN: (纸本)9783642362514

This paper presents an Mobile Agent based Coding Aware Routing (MA-CAMR) for wireless sensor network, which exploits mobile agent to discovery the routing and coding opportunities, reducing complexity of node design. Besides, the general network coding condition of two cross flows is proposed for coding opportunity discovery. In addition, a novel routing metric, Coding and Energy Aware Routing Metric (CEARM) is proposed, which considers the coding gain, the load and energy of node. MA-CAMR exploits multipath routing and CEARM to balance the network load and energy consumption. Simulation results demonstrate that MA-CAMR could balance network load and energy consumption, reduce energy consumption, and prolong network lifetime. © 2013 Springer-Verlag.

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

Printing detecting algorithm basing on maximum degree of recognition

引用

Telkomnika - Indonesian Journal of Electrical Engineering 2013年第4期11卷 2124-2130页

作者： Zhang, Hu Guo, Feng Key Lab. of Broadband wireless communications and Sensor networks Wuhan University of Technology Wuhan Hubei China

In modern packaging, printing industry, due to effects of the properties of the strip itself and the ambient light, strip background color and the color of the printing line, the low contrast boundaries of the strip on both sides and so on, the traditional digital qualitative detection and control to the correction system does not meet the comprehensive requirements. This paper aims to study the detection of a continuous line, discontinuous line and color dividing line on the strip, and because of low contrast between background color and dividing line, we proposed an innovative solution and implementation. This article discusses a new algorithm basing on maximum degree of recognition and optimal light source search algorithm, and we simulated this in MATlab, finally, we completed the physical testing of the overall system ©2013 Universitas Ahmad Dahlan.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：