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

2011 11th International Conference on Hybrid Intelligent Systems, HIS 2011

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

ISBN: (纸本)9781457721502

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. © 2011 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

An efficient synchronisation protocol for wireless sensor network

An efficient synchronisation protocol for wireless sensor ne...

引用

作者： Huang, Liusheng Xu, Hongli Wan, Yingyu Wu, Junmin Li, Hong Department of Computer Science and Technology University of Science and Technology of China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230027 China

Time synchronisation is a critical topic in wireless sensor networks for its wide applications, such as data fusion, TDMA scheduling and cooperated sleeping, etc. In this paper, we present an Accurate Time Synchronisation (ATS) protocol based on linear least square for sensor networks. Unlike the previous protocols, all nodes aren't synchronised to some reference nodes or sink node, but to a virtual clock. Moreover, each pair of the nodes is synchronised to each other. The main advantages of ATS are simplicity and accuracy. Especially, the variance of the synchronised drift error is less than Dsδ/ 2β 2, where Ds, δ and β are the depth of the network, the maximal variance of the link delay and the sampling interval, respectively. The experiments show that ATS protocol has achieved at least 37% performance enhancement than the previous pairwise algorithm. Copyright © 2007 Inderscience Enterprises Ltd.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Fast searching optimal negative surveys

Fast searching optimal negative surveys

引用

2014 International Conference on Information and Network Security, ICINS 2014

作者： Lu, Yihui Luo, Wenjian Zhao, Dongdong School of Computer Science and Technology University of Science and Technology of China Hefei Anhui230027 China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui230027 China

ISBN: (纸本)9781849199094

In a negative survey, a category which does not agree with the fact of each participant is collected. Hence, data collectors cannot acquire the realistic data of participants, and this can efficiently protect participants' private information and sensitive data. However, existing approaches used to estimate the distribution of positive surveys from negative surveys are not practical and time-consuming. This paper proposed a method in order to acquire practical estimation results with a lower computing cost, namely fastNStoPS. Usually, privacy and utility are used to measure the performances of negative surveys, and they are two conflicting metrics. Users have different demands on privacy (or utility) under different circumstances. The optimal negative surveys are a Pareto font of these two objectives. To demonstrate its practicability, the proposed fastNStoPS method is embedded into a Differential Evolution (DE), which is used to find the optimal negative surveys. The experiment results show that the DE has a much better performance on find the optimal negative surveys, and the computing cost is very low.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Precisely reconstruct porous media model based on synchrotron radiation slice images

Precisely reconstruct porous media model based on synchrotro...

引用

2009 International Conference on Computational Intelligence and software engineering, CiSE 2009

作者： Song, Bo Dong, Lanfang Lu, Detang Anhui Province Key Lab of Software in Computing and Communication School of Computer Science and Technology USTC Hefei China Institute of Engineering and Science Software USTC Hefei China

ISBN: (纸本)9781424445073

In this paper a method for precisely reconstructing porous media three-dimensional model based on slice images is proposed. It first processes the original slice images, then uses 3D seed filling algorithm to find all pores based on the constructed spatial data, finally uses the modified marching cubes algorithm based on bounding box technology to render material skeletons and pores. Associating with the porous media flow specific application, a novel invalid pore removing method is proposed. The final reconstructed model shows that our method can precisely reconstruct the pore network and recover the pore shape. It also can identify the pores which meet spatial scale threshold conditions. Comparison of running time between the original marching cubes algorithm and the modified marching cubes algorithm is given. It shows that due to the bounding box technology the running time of modified marching cubes algorithm is shorten greatly when the pores are far away from each other. ©2009 IEEE.

关键词： Porous materials

来源：评论

学校读者我要写书评

暂无评论

Improved point clouds data simplification algorithm in 3D data processing

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content Technology and its Applications 2012年第20期6卷 679-685页

作者： Haiyan, Wang Hong, Wan School of Computer and Communication Engineering Tianjin University of Technology Tianjin 300384 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300384 China

With the development of computer technology, Reverse engineering (RE) based on 3D data processing has developed greatly. The whole procedure of laser scanning color 3D data from the aspect of 3D data processing includes the pre-processing of point clouds and the surface reconstruction. This paper proposes improved point clouds data simplification algorithm in 3D data processing, it is the adjustment of simplification algorithm under the restriction of color boundary compared to the key simplification algorithms of the pre-processing for color 3D point clouds. The experiment result shows that the proposed algorithm is effective.

关键词： Surface reconstruction

来源：评论

学校读者我要写书评

暂无评论

Multi-layer network embedding on scc-based network with motif

引用

Digital communications and Networks 2024年第3期10卷 546-556页

作者： Lu Sun Xiaona Li Mingyue Zhang Liangtian Wan Yun Lin Xianpeng Wang Gang Xu Department of Communication Engineering Institute of Information Science TechnologyDalian Maritime UniversityDalian116026China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and TelecommunicationsChongqing400065China Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province DUT School of Software Technology&DUT-RU International School of Information Science and EngineeringDalian University of TechnologyDalian 116620China College of Information and Communication Engineering Harbin Engineering UniversityHarbin 150001China School of Information and Communication Engineering Hainan UniversityHaikou 570228China State Key Laboratory of Millimeter Waves School of Information Science and EngineeringSoutheast UniversityNanjing 210096China

Interconnection of all things challenges the traditional communication methods,and Semantic communication and computing(SCC)will become new *** is a challenging task to accurately detect,extract,and represent semantic information in the research of SCC-based *** previous research,researchers usually use convolution to extract the feature information of a graph and perform the corresponding task of node ***,the content of semantic information is quite *** graph convolutional neural networks provide an effective solution for node classification tasks,due to their limitations in representing multiple relational patterns and not recognizing and analyzing higher-order local structures,the extracted feature information is subject to varying degrees of ***,this paper extends from a single-layer topology network to a multi-layer heterogeneous topology *** Bidirectional Encoder Representations from Transformers(BERT)training word vector is introduced to extract the semantic features in the network,and the existing graph neural network is improved by combining the higher-order local feature module of the network model representation network.A multi-layer network embedding algorithm on SCC-based networks with motifs is proposed to complete the task of end-to-end node *** verify the effectiveness of the algorithm on a real multi-layer heterogeneous network.

关键词： Semantic communication and computing Multi-layer network Graph neural network Motif

来源：评论

学校读者我要写书评

暂无评论

Nonlinear characteristics and qualitative analysis of sleep EEG

Nonlinear characteristics and qualitative analysis of sleep ...

引用

2007 1st International Conference on Bioinformatics and Biomedical engineering, ICBBE

作者： Shao, Chenxi Fan, Jinfeng Li, Shaobin Department of Computer Science and Technology USTC Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China Department of Computer Science and Technology USTC Hefei Anhui 230027 China

ISBN: (纸本)1424411203

Correlation dimension (CD) and the largest Lyapunov exponent (LLE), which are two most important nonlinear invariant measures of nonlinear system, are adopted to characterize the complexity and stability of human brain during all sleep stages. In order to And an optimal embedding to reconstruct phase space, the C-C method and Cao's algorithm were thoroughly analyzed and implemented in efficient ways. Additionally, the G-P algorithm and Kantz's algorithm are also implemented for calculation of CD and LLE respectively. Eight normal sleep EEG records are acquired from MIT-BIH sleep-EDF database for this study. The values of CD and LLE for 30s epochs are calculated, and their mean and standard deviation values are evaluated as well. The results indicate that CD and LLE decrease from the waking stage to stages I, II and III-IV, and they have large values during rapid eye movement (REM) sleep stage. Then, a qualitative conclusion may be drawn that during waking stage and REM sleep stage, brain activity has higher complexity and lower stability than during other stages. © 2007 IEEE.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

The g-dominance Relation for Preference-Based Evolutionary Multi-Objective Optimization

The g-dominance Relation for Preference-Based Evolutionary M...

引用

2019 IEEE Congress on Evolutionary Computation, CEC 2019

作者： Luo, Wenjian Shi, Luming Lin, Xin Coello Coello, Carlos A. Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei230027 China Departmento de Sistemas UAM-Azcapotzalco Mexico City Mexico

ISBN: (纸本)9781728121536

In evolutionary multi-objective optimization, the results generated by an evolutionary algorithm usually contain an approximation, as good as possible, of the entire Pareto-optimal front. However, sometimes the number of Pareto-optimal solutions may be so large that the decision maker (DM) is incapable of manipulating or understanding them. Methods for considering only the Pareto-optimal solutions that the DM prefers indeed constitute a hot research topic in the evolutionary computation field. In this paper, we introduce a new dominance relation called hat g-dominance, which is an improved version of the g-dominance relation and can be easily implemented in traditional multi-objective evolutionary algorithms. In this work, the proposed hat g-dominance is implemented in NSGA-II. Our experimental results show the effectiveness of hat g-NSGA-II with respect to the original g-NSGA-II. © 2019 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Improvement of key in ZigBee wireless network

引用

Information Technology Journal 2013年第18期12卷 4593-4596页

作者： Li, Wenjie Cao, Qianqian Liu, Zhuzi Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology School of Computer and Communication Engineering Tianjin University of Technology Tianjin 300384 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology China

Zigbee provides a connection to a variety of wireless devices and solves the problem of the communicating between different protocols. ZigBee can provide wireless communication which is low rate, low complexity, short distance and low cost. Due to the existence of various attacks in the wireless transmission, security becomes a bottleneck for Zigbee applications. In the study, we designed the model based on dynamic key which is sent in Zigbee network and analyzed its performances. © 2013 Asian Network for Scientific Information.

关键词： Zigbee

来源：评论

学校读者我要写书评

暂无评论

Tuning linux's load balancing algorithm for CMT system

Tuning linux's load balancing algorithm for CMT system

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Peng, Jianzhang Gu, Naijie Li, Yehua Xu, Zhang School of Computer Science and Technology University of Science and Technology of China Hefei China Anhui Province Key Laboratory of Computing and Communication Software USTC SICT Joint Laboratory of Network and Communication Hefei China

ISBN: (纸本)9781479916603

Linux 2.6 load balancing algorithm on scheduling domain supports CMP, CMT, SMP, NUMA architecture. For SMT, the algorithm try to assign the new process to the idlest CPU of the idlest core, and if the first CPU of a core is comparati vely idle, it tries to pull moderate amount of tasks from the busiest CPU of the core to balance the system workload periodically. Under certain circumstances, this strategy would cause the system to be more unbalanced. For the above defects, the algorithm can be adjusted in two ways. (1) The idlest CPU of the entire system should be selects for the new process;(2) the idlest CPU of a scheduling domain periodically can move tasks from the scheduling domain to itself. After applying this optimization, the system's performance achieved the highest increase of 8% in hackbench testing on an 8-core 32-thread XLR532 processor. © 2013 IEEE.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：