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

Multi-objective Deployment of WSNs in Underground Sheltered Space 19th

Multi-objective Deployment of WSNs in Underground Sheltere...

19th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2023

作者： Wan, Liangtian Wang, Caiyun Sun, Lu Chen, Boyu Zheng, Jibin Wang, Xianpeng Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology Dalian116620 China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian116026 China School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing China National Laboratory of Radar Signal Processing Xidian University Xi’an710071 China State Key Laboratory of Marine Resource Utilization in South China Sea and School of Information and Communication Engineering Hainan University Haikou570228 China

ISBN: (纸本)9783031651250

Given the increasing population, the underground spaces are widely used. The existing research on wireless sensor networks (WSNs) development has mainly focused on overground space;also, the existing work was based on an ideal deployment environment and simple sensor behaviour. As a consequence, they do not satisfy requirements for practical 3D environment. The 3D wireless sensor networks (WSNs) deployment has new difficulties in the underground space. The signal transmission is impacted by obstacles in the underground space. Thus, we propose a geometry-based 3D signal propagation model to calculate the signal path loss caused by obstacles. Then, taking both coverage and connectivity into account, we transform the WSNs deployment problem into a multi-objective optimization problem (MOP). Finally, we compare some state-of-the-art multi-objective evolutionary algorithms (MOEAs) for the WSNs deployment problem in underground sheltered space. By the experimental results, we optimize the multiobjective deployment problem of the WSNs in the underground sheltered space. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2024.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Analysis and Design of Mobile Model for DTN

引用

Chinese Journal of Electronics 2023年第4期18卷 635-638页

作者： Zhiting Lin Yugui Qu Yusheng Ji Baohua Zhao Department of Computer Science University of Science and Technology of China Hefei China Province Key Laboratory of Software in Computing and Communication Hefei China Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Japan

Delay tolerant networks may become unexpectedly partitioned due to node mobility or variation in signal strength. However, most widely used models in some relative works are generally very simplistic. In order to exploit intelligent forwarding algorithms, a novel nodal mobile model of delay tolerant networks is presented to map reality with more accuracy. And several approaches are introduced to analyze the network structure, such as n-cliques, n-clans, degree, closeness and betweenness. Our research results showed that the centralizations became smaller when the wireless connections were concerned. It meant that quite a number of nodes became potential relays because of the new structure of networks.

关键词： Wireless communication Analytical models Wireless sensor networks Protocols Social networking (online) Sensitivity analysis Social network theory

来源：评论

学校读者我要写书评

暂无评论

A hybrid active contour model with local Gaussian distribution fitting energy for image segmentation

引用

Journal of Information and Computational Science 2015年第17期12卷 6515-6523页

作者： Zhang, Runru Huang, Zhangjin Gu, Naijie School of Computer Science and Technology University of Science and Technology of China Hefei China Anhui Province Key Laboratory of Computing and Communication Software Hefei China Institute of Advanced Technology University of Science and Technology of China Hefei China

Active contour models have been widely applied in image segmentation with promising results. However, many of them fail to segment images successfully due to intensity inhomogeneity. To address this problem, we propose a hybrid region-based active contour model which fully utilizes local intensity information. This model develops a localized active contour framework and incorporates a local Gaussian distribution fitting energy. In order to increase both the computational efficiency and stability of the proposed model, a multi-resolution strategy is employed and the active contour is evolved in a reinitialization-free way. Extensive experiments demonstrate that our model is effective and efficient in segmenting images with intensity inhomogeneity, and outperforms several state-of-the-art algorithms. © 2015 by Binary Information Press.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Distributed Feature Reduction Signal Sorting Algorithm

Distributed Feature Reduction Signal Sorting Algorithm

引用

International Conference on Guidance, Navigation and Control, ICGNC 2022

作者： Wan, Liangtian Wang, Jinjing Sun, Lu Wang, Xianpeng Lu, Cunbo Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology Dalian116620 China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian116026 China School of Information and Communication Engineering Hainan University Haikou570228 China Information Science Academy China Electronics Technology Group Corporation Beijing100098 China

ISBN: (纸本)9789811966125

With the development of science and technology, modern war has changed from traditional mechanized war to electronic war. Electronic warfare has become the mainstream combat mode in modern war. At present, the electromagnetic environment is very chaotic and complex, the pulse density increases rapidly, and the pulse modulation mode is complex and changeable. In order to deal with the low efficiency of traditional methods in complex electromagnetic environment, a distributed feature reduction signal sorting method is proposed. Firstly, attribute entropy regularization is added to the objective function, and different weights are given to different features. Secondly, the feature reduction process is added to select which dimension of features to be discarded by setting the threshold. Each iteration of the algorithm will update the membership matrix, cluster center and feature weight matrix until the termination conditions is satisfied. Simulation results show that the algorithm can reduce the number of iterations and time, and improve the accuracy of radar signal sorting results by reducing the number of features. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Reduction

来源：评论

学校读者我要写书评

暂无评论

Performance research and optimization on CPython's interpreter

Performance research and optimization on CPython's interpret...

引用

Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： Huaxiong Cao Naijie Gu Kaixin Ren Yi Li Anhui Province Key Laboratory of Computing and Communication Software Department of Computer Science and Technology University of Science and Technology of China Institute of Advanced Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9781479967476

In this paper, the performance research on CPython's latest interpreter is presented, concluding that bytecode dispatching takes about 25 percent of total execution time on average. Based on this observation, a novel bytecode dispatching mechanism is proposed to reduce the time spent on this phase to a minimum. With this mechanism, the blocks associated with each kind of bytecodes are rewritten in hand-tuned assembly, their opcodes are renumbered, and their memory spaces are rescheduled. With these preparations, this new bytecode dispatching mechanism replaces the time-consuming memory reading operations with rapid operations on registers. This mechanism is implemented in CPython-3.3.0. Experiments on lots of benchmarks demonstrate its correctness and efficiency. The comparison between original CPython and optimized CPython shows that this new mechanism achieves about 8.5 percent performance improvement on average. For some particular benchmarks, the maximum improvement is up to 18 percentages.

关键词： Dispatching Benchmark testing Binary codes Switches Optimization Registers Instruction sets

来源：评论

学校读者我要写书评

暂无评论

Joint Sink Mobility and Data Diffusion for Lifetime Optimization in Wireless Sensor Networks

Joint Sink Mobility and Data Diffusion for Lifetime Optimiza...

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Yu Gu Hengchang Liu Fei Song Baohua Zhao Department of Computer Science Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China Department of Computer Science University of Virginia Charlottesville VA USA

In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularly challenging since we need to consider both mobility scheme and storage constraint. Previous works suggest to use a simple single-hop routing model in which source nodes can only communication with the sink node directly in those mobile networks. However, we notice that this statement is unsuitable for sensor networks with storage constraint because we prove it is a NP-complete problem under single-hop routing model by reducing the traveling salesman problem (TSP) to it in polynomial time. Hence, we try a different way. First we analyze this problem and give a lifetime upperbound, so whether this upperbound is tight is what we concern mostly. Thus, we first construct a 2-approximation O(n 2 ) algorithm to solve the TSP problem, then a novel data diffusion mechanism is built to achieve this upperbound. We prove that under some reasonable assumptions, our algorithm can output this optimal lifetime.

关键词： Wireless sensor networks Routing Computer networks Constraint optimization Computer science Mobile communication NP-complete problem Traveling salesman problems Polynomials Monitoring

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for Semantic Segmentation on Lidar Point Clouds 19th

A Novel Method for Semantic Segmentation on Lidar Point Clou...

引用

19th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2023

作者： Wang, Fei Wan, Liangtian Zhu, Yan Sun, Lu Zhao, Xiaowei Zheng, Jianbo Wang, Xianpeng Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology Dalian116620 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Guangdong Shenzhen518172 China Guangdong-Hong Kong-Macao Joint Laboratory for Emotional Intelligence and Pervasive Computing Shenzhen MSU-BIT University Guangdong Shenzhen518172 China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian116026 China School of Information and Communication Engineering Hainan University Haikou570228 China

ISBN: (纸本)9783031651250

Autonomous driving relies on multiple sensors, such as lidar and cameras, to perceive the surrounding environment and the vehicle’s own position. Among them, lidar point cloud segmentation is a crucial and challenging task for 3D scene understanding. In this paper, we propose a novel deep learning method RPNet for lidar point cloud segmentation that combines range image-based segmentation and point based segmentation. Our method extracts point cloud features from range images and predicts 3D point cloud labels from point clouds. The segmentation results of both branches are fused to improve accuracy. We evaluate our method on the Semantic KITTI dataset and show that it outperforms other fusion algorithms in terms of effectiveness and robustness. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2024.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

An Energy-Aware Coverage Based Node Scheduling Scheme for Wireless Sensor Networks

An Energy-Aware Coverage Based Node Scheduling Scheme for Wi...

引用

The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)

作者： Jinxia Liu Naijie Gu Songsong He Dept. of Computer Science and Technology University of Science and Technology of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei Anhui 230027 China

A fundamental issue in wireless sensor network is to extend network lifetime while maintaining network coverage and connectivity. Protection for sensors themselves is another important concern. An Energyaware Coverage based Node Scheduling scheme (ECNS) is proposed to provide protection for sensors and guarantees network connectivity and desired coverage level. ECNS enables each node to decide whether it is eligible to turn off to conserve energy through local information exchange with its neighbors. Simulation results show that ECNS improves network performance with respect to energy conservation, load balance and network lifetime.

关键词： Sensor network coverage network connectivity lifetime node scheduling scheme.

来源：评论

学校读者我要写书评

暂无评论

Directed differential evolution based on directional derivative for numerical optimization problems

Directed differential evolution based on directional derivat...

引用

International Conference on Hybrid Intelligent Systems (HIS)

作者： Jun Zhang Wenjian Luo School of Computer Science and Technology University of Science and Technology Hefei Anhui China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology Hefei Anhui China

Differential Evolution is one kind of Evolutionary Algorithms, which has been successfully applied to solve many optimization problems. In this paper, a directed differential mutation (DDM), which utilizes the directional derivative to decide a suitable search direction and a proper mutation step size, is proposed. It is merged into the classical DE to form a new algorithm, named directed differential evolution (DDE). The performance of the DDE is tested on 23 classical problems for numerical optimization. The experimental results demonstrate that the performance of the DDE outperforms the classical DE on most functions.

关键词： Optimization Vectors Equations Hybrid intelligent systems Algorithms Programming Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

A real-time schedule method for aircraft landing scheduling problem based on cellular automaton 09

A real-time schedule method for aircraft landing scheduling ...

引用

2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09

作者： Shenpeng, Yu Xianbin, Cao Maobin, Hu Wenbo, Du Jun, Zhang Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 86-551-3601545 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230026 China School of Engineering Science University of Science and Technology of China Hefei 230026 86-551-3600127 China School of Electronic and Information Engineering Beihang University Beijing 100083 China

ISBN: (纸本)9781605583266

The Aircraft Landing Scheduling (ALS) problem is a typical hard multi-constraint optimization problem. In real applications, it is not most important to find the best solution but to provide a feasible landing schedule in an acceptable time. We propose a novel approach which can effectively solve the ALS while satisfying the real-time need. It consists of two steps: (i) Use CA to simulate the landing process in the terminal airspace and to find a considerably good landing sequence;(ii) a simple Genetic Algorithm associated with a Relaxation Operator is used to obtain a better result based on the CA result. Experiments have shown that our method is much faster and suitable for real-time ALS problem compared with traditional optimization methods. For all the 13 data sets, the proposed approach can find satisfactory solutions in less than 2 seconds. Copyright 2009 ACM.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：