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

International Conference on Data Intelligence and Security (ICDIS)

作者： Nannan Lu Wenjian Luo Li Ni Hao Jiang Weiping Ding Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei China Centre for Artificial Intelligence University of Technology Sydney Broadway NSW Australia

ISBN: (纸本)9781538657638

In many real-world networks, a node often belongs to multiple communities. Therefore, overlapping community detection is an important task in social network analysis. CDFR is an efficient algorithm recently proposed for non-overlapping community detection. In this paper, CDFR is extended for overlapping community detection, and the extended algorithm is called as OCDFR. In OCDFR, CDFR is first called to obtain a non-overlapping community partition. Then, find the kth NGC (k=1, 2, 3,...) node for each node, and record the fuzzy relations between them. Based on the fuzzy relation between a node and its kth NGC, five decision methods are proposed to determine whether it can join the communities to which its kth NGC belongs. Experimental results on real-world networks and synthetic networks demonstrate that OCDFR is effective and highly competitive.

关键词： Heuristic algorithms Social network services Partitioning algorithms Clustering algorithms Nickel Complex networks Security

来源：评论

学校读者我要写书评

暂无评论

An immune based algorithm for Chinese network short text clustering

引用

Zidonghua Xuebao/ Acta Automatica Sinica 2009年第7期35卷 896-902页

作者： He, Tao Cao, Xian-Bin Tan, Hui School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Key Laboratory of Software in Computing and Communication Anhui Province Hefei 230027 China School of Computer Science and Technology Harbin Institute of Technology Harbin 150001 China

Network short text clustering is a major technology in network content security. Since Chinese network short text is less of keywords and full of anomalous writings, the traditional text clustering method is not directly suitable for network short text clustering. This paper presents an immune network regulation based method to cluster Chinese network short texts. First, Chinese N-gram chunks are extracted and transformed to Chinese pinyin to form the feature representation to each Chinese network short text, so as to relieve these two characteristics' bad influence on the clustering performance. Then, the network short text set is constructed as a dynamic network and an immune network learning mechanism is used to learn the similarity among short texts and therefore to gain a better clustering result. Experiments show our method can get better performance in Chinese network short text clustering, compared with traditional method such as K-means. © 2009 Acta Automatica Sinica. All rights reserved.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Link-weighted and distance-constrained channel assignment in single-radio wireless mesh networks

Link-weighted and distance-constrained channel assignment in...

引用

Conference on Local Computer Networks (LCN)

作者： Junfeng Jin Baohua Zhao Hao Zhou School of Computer Science University of Science and Technology Hefei Anhui China Province Key Laboratory of Software in Computing and Communication Hefei Anhui China School of Computer Science University of Science and Technology of China Hefei Anhui

In this work, we study a link-weighted and distance-constrained channel assignment problem in multi-channel mesh networks with stationary router nodes, such as community wireless networks. A good channel assignment is given as the one which can minimize interference of each link from its neighboring links and subsequently improve the network throughput. In response to it, we introduce an interference metric, namely, min-max i-value of an edge (MMIE), to explicitly accounts for interference among links that are at distance one. In addition, we further show that the link-weighted and distance-constrained channel assignment problem with respect to the interference metric is NP-hard in computation. This guides us to propose a new heuristic channel assignment algorithm called LD-CA algorithm. We study the performance of our algorithm by implementing it in a wireless simulation environment consisting of 25 nodes, each equipped with one 802.11 wireless card. The ns-2 simulation results show that in a multi-channel environment, the LD-CA algorithm significantly outperforms previously proposed channel assignment schemes by minimizing MMIE of all links.

关键词： Wireless mesh networks Interference Mesh networks Throughput Spread spectrum communication Laboratories Computational modeling Switches Conferences Computer network management

来源：评论

学校读者我要写书评

暂无评论

A Lightweight OS-Level Virtualization Architecture Based on Android

A Lightweight OS-Level Virtualization Architecture Based on ...

引用

2017 2nd International Conference on Computer, Network Security and communication engineering(CNSCE2017)

作者： Bo-wen LIU Nai-jie GU De-he GU School of Computer Science and Technology University of Science and Technology of China Institute of Advanced Technology University of Science and Technology of China Anhui Province Key Laboratory of Computing and Communication Software

All kinds of intelligent terminal equipment emerge in endlessly and grow explosively. Typical devices, such as smartphones and tablets, are becoming more and more popular, furthermore, intelligent equipment market share has more than that on PCs. And on mobile devices area, the demand for virtualization technology is gradually increasing. As an important branch of computer technology development, operating system level virtualization is becoming a hot spot of current research due to its low overhead and the advantages of lightweight. In this paper, based on the Android system on mobile devices, implement a prototype which can run multiple virtual system instances on only an Android OS by modifying the namespace mechanism in the Linux kernel to and expand into driver namespace mechanism. In addition, put forward a model called the active-inactive model guaranteeing the process if and only if in the active namespace to operate the device drivers, which was designed and implemented a new scheme of operating system level virtualization.

关键词： Virtualization Android Namespace

来源：评论

学校读者我要写书评

暂无评论

Scheduling Model for Cognitive Radio

Scheduling Model for Cognitive Radio

引用

3rd International Conference on Cognitive Radio Oriented Wireless Networks and communications (CrownCom 2008)

作者： Ping Zhu Jinglong Li Xufa Wang Department of Computer Science and Technology Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China Department of Computer Science and Technology University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781424423019

The priority queue model divides CR (cognitive radio) system users into primary user and secondary user. The primary user has preemptive priority over secondary user, while the same priority level users are FIFO served. This paper models the CR system based on scheduling technology. The secondary users are further divided into different priority levels. A hybrid priority dynamic policy, which indicates primary user's preemptive priority and secondary user's nonpreemptive priority, is developed to reduce spectrum switch overhead during spectrum leasing process. Theoretical analyzing shows that hybrid priority reduces the spectrum switch overhead and the hybrid priority improvement is a non-negative mono-increasing function of priority level. Based on the proposed policy, CR scheduling model is built and CR scheduling rule is provided and proved. Experimental comparison between CR scheduling and priority queue shows that CR scheduling gets a smaller weighted staying time sum than priority queue and the improvement increases as system becomes more congested.

关键词： Cognitive radio Priority queue CR schedule

来源：评论

学校读者我要写书评

暂无评论

Self-Supervised Teaching and Learning of Representations on Graphs 23

Self-Supervised Teaching and Learning of Representations on ...

引用

2023 World Wide Web Conference, WWW 2023

作者： Wan, Liangtian Fu, Zhenqiang Sun, Lu Wang, Xianpeng Xu, Gang Yan, Xiaoran Xia, Feng Key Laboratory for Ubiquitous Network Service Software of Liaoning Province School of Software Dalian University of Technology Dalian China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian China State Key Laboratory of Marine Resource Utilization in South China Sea School of Information and Communication Engineering Hainan University Haikou China State Key Laboratory of Millimeter Waves School of Information Science and Engineering Southeast University Nanjing China Research Center of Big Data Intelligence Research Institute of Artificial Intelligence Zhejiang Lab Hangzhou China School of Computing Technologies Rmit University Melbourne Australia

ISBN: (纸本)9781450394161

Recent years have witnessed significant advances in graph contrastive learning (GCL), while most GCL models use graph neural networks as encoders based on supervised learning. In this work, we propose a novel graph learning model called GraphTL, which explores self-supervised teaching and learning of representations on graphs. One critical objective of GCL is to retain original graph information. For this purpose, we design an encoder based on the idea of unsupervised dimensionality reduction of locally linear embedding (LLE). Specifically, we map one iteration of the LLE to one layer of the network. To guide the encoder to better retain the original graph information, we propose an unbalanced contrastive model consisting of two views, which are the learning view and the teaching view, respectively. Furthermore, we consider the nodes that are identical in muti-views as positive node pairs, and design the node similarity scorer so that the model can select positive samples of a target node. Extensive experiments have been conducted over multiple datasets to evaluate the performance of GraphTL in comparison with baseline models. Results demonstrate that GraphTL can reduce distances between similar nodes while preserving network topological and feature information, yielding better performance in node classification. © 2023 ACM.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Unifying and Improving Graph Convolutional Neural Networks with Wavelet Denoising Filters 23

Unifying and Improving Graph Convolutional Neural Networks w...

引用

2023 World Wide Web Conference, WWW 2023

作者： Wan, Liangtian Li, Xiaona Han, Huijin Yan, Xiaoran Sun, Lu Ning, Zhaolong Xia, Feng Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology Dalian China Research Center of Big Data Intelligence Research Institute of Artificial Intelligence Zhejiang Lab Hangzhou China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian China School of Communication and Information Engineering Chongqing University of Posts and Telecommunications Chongqing China School of Computing Technologies Rmit University Melbourne Australia

ISBN: (纸本)9781450394161

Graph convolutional neural network (GCN) is a powerful deep learning framework for network data. However, variants of graph neural architectures can lead to drastically different performance on different tasks. Model comparison calls for a unifying framework with interpretability and principled experimental procedures. Based on the theories from graph signal processing (GSP), we show that GCN's capability is fundamentally limited by the uncertainty principle, and wavelets provide a controllable trade-off between local and global information. We adapt wavelet denoising filters to the graph domain, unifying popular variants of GCN under a common interpretable mathematical framework. Furthermore, we propose WaveThresh and WaveShrink which are novel GCN models based on proven denoising filters from the signal processing literature. Empirically, we evaluate our models and other popular GCNs under a more principled procedure and analyze how trade-offs between local and global graph signals can lead to better performance in different datasets. © 2023 ACM.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Estimating properties of chaotic system based on S-NURBS resampling method

Estimating properties of chaotic system based on S-NURBS res...

引用

International Conference on Measurement, Information and Control (MIC)

作者： Chenxi Shao Qingqing Liu Tingting Wang Binghong Wang Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei China Computer Science and Technology Department University of Science and Technology of China Hefei China

ISBN: (纸本)9781479913916

Physical properties of the chaotic system play important roles on studying the innate character and deciding the practical predictability of the dynamics. For a short piece of undersampled chaotic signals, it is very hard to abstract the physical properties of the signal source from the sequence. In this paper, we model this type of data with global S-NURBS method to reconstruct a smooth trajectory and resample the trajectory to get enough series. In this way, the problem of estimating the physical properties from small undersampled data is turned to the work of calculating the properties of the resampled time series. The new interpolation method is named as S-NURBS resampling method, and the simulation experiment demonstrates that the new method has a good performance in studying physical systems from the observed time series.

关键词： Time series analysis Interpolation Trajectory Chaos Splines (mathematics) Surface topography Surface reconstruction

来源：评论

学校读者我要写书评

暂无评论

Realistic and real-time simulation of water

Realistic and real-time simulation of water

引用

International Conference on Computer Science and Information Technology (CSIT)

作者： Xian Wu Lan-fang Dong De-tang Lu University of Science and Technology of China Hefei Anhui CN Anhui Province Key Lab of Software in Computing and Communication Hefei China Institute of Engineering and Science Software University of Science and Technology Hefei China Institute of Engineering and Science Software University of Science and Technology of China Hefei China

A modified physics-based method is adopted to control the water waves, and the discretization of the governing 2D N-S equation is taken as the interaction between the variables in spaces, based on the idea of spreading though the neighboring regions. Meshing model of the water surface is based on a terrain LOD scheme called Tiled Quad-tree. With that the region of water surface can be extended unboundedly. A new controlling strategy is used, that the driving parameters of the water movement is taken separately, so it's easy to change parameters in real time while generating various water waves. Reflection and refraction of rays in water is simulated to improve the visual impression. It is shown that these methods can efficiently produce realistic movement of various water waves in real-time.

关键词： Computational modeling Navier-Stokes equations Animation Layout Automatic control Computer graphics Fluid dynamics Shape control communications technology Control system synthesis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：