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

Research on community detection algorithm based on modularity maximum

ICIC Express Letters 2016年第12期10卷 2995-3003页

作者： Chen, Jing Wan, Yun College of Information Science and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province No. 438 Hebei Avenue Qinhuangdao066004 China

It is well known that the drawbacks of label propagation algorithm are high randomness, weak robustness and easy to form monster community. Many improved methods are proposed constantly in order to avoid these problems. However, the related label propagation algorithm is seldom concerned with the stability of community structure and the results of community detection. In order to obtain the high value communities, modularity and community structure are involved in detecting communities. In this paper, the algorithm CDMMCS (Community Detection based on Modularity Maximum and Community Structure) is proposed. The main idea is based on label propagation, but CDMMCS begins with some small communities, and the process of label updating is in consideration of the modularity maximum. When the label stops propagating, the communities with the same label are merged. Check the community structure of merged communities, and perform different operations according to different community structures. Experiments show that CDMMCS successfully detects communities with higher modularity values than LPA (Label Propagation Algorithm) and LPAm+ in some realworld networks. And the running time of CDMMCS is less than LPAm+. © 2016 ICIC International.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

Feature Extraction and Matching of 3D Face Model Based on Facial Landmark Detection

Feature Extraction and Matching of 3D Face Model Based on Fa...

引用

2020 International Conference on virtual Reality and Visualization, ICVRV 2020

作者： Zhu, Yunrui Luo, Xun Zuniga, Claudia Lozano-Garzon, Carlos Alomia, Gustavo School of Computer Science and Engineering Tianjin University of Technology Tianjin China State Key Laboratory of Virtual Reality Technology and Systems Beihang University Beijing China Faculty of Engineering Santiago Cali University Cali Colombia Los Andes University Department of System Engineering and Computation Bogota Colombia

ISBN: (纸本)9780738142524

Building a high-quality 3D face model is one of the important issues in computer graphics. High-fidelity 3D face model can be obtained through 3D reconstruction methods from measured data, but the reconstructed models are often flawed with missing measurement data. In order to improve the usability and robustness of the 3D face models, repair and optimization of the face model are critically important. The traditional solutions rely on geometric heuristics to complete repairing work. Considering the characteristics of the face, it is possible to utilize the semantic information to improve the quality of repairing process for the three-dimensional face models, thereby improving the accuracy of the repaired models. In this paper, we combine artificial intelligence and computer graphics methods, and proposes a feature extraction and matching of 3D face model method based on facial landmark detection. Our method combines the facial feature recognition algorithm of 2D facial image and the mapping relationship of 3D face mesh model, and realizes the function of semanticsegmentation and extraction of the 3D face model features. It can be used for the next step of 3D face mesh repair research. © 2020 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

TACS: A Transparent Application Bandwidth Management system

TACS: A Transparent Application Bandwidth Management System

引用

International Conference on computer and Information technology (CIT)

作者： Xianqin Chen Xiang Long Xiaopeng Gao Junjie Ma State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Technology Beijing Aeronautics and Astronautics University Beijing China

With the rapid advance of computer and network technology, more and more applications are deployed in the customer-side network. These applications require different quality of service (QoS), but have to share a few bandwidth limited Internet connections. Owing to the IP network's best-effort delivery mechanism, the QoS requirements are hard to be satisfied. There have been plenty of QoS solutions in research and industry areas, however, few of them are easy to understand or to deploy. Therefore, we provide a solution, based on a simple and clear model, has the ability of transparently deployed at the inner side of customer's gateway device and controlled in the application-oriented way. We also introduce a straightforward QoS policy definition language to allow user to create QoS rules for various applications. We conduct the evaluation of our prototype system running upon mid-end industrial personal computer under both the lab test-bed and the practical network. In the lab test, our system achieves 200Mbps throughput, in the practical field test, our system successfully manages a 100Mbps Internet link for over 3000 active users.

关键词： Bandwidth Quality of service Application software system testing computer networks Web and internet services Prototypes computer industry Electrical equipment industry Microcomputers

来源：评论

学校读者我要写书评

暂无评论

Modeling detailed cloud scene from multi-source images 26

Modeling detailed cloud scene from multi-source images

引用

26th Pacific Conference on computer Graphics and Applications, Pacific Graphics 2018

作者： Cen, Yunchi Liang, Xiaohui Chen, Junping Yang, Bailin Li, Frederick W.B. State Key Laboratory of Virtual Reality Technology and System Beihang University Beijing100191 China School of Computer Science and Information Engineering Zhejiang Gongshang University Hangzhou310018 China Department of Computer Science University of Durham DurhamDH1 3LE United Kingdom

ISBN: (纸本)9783038680734

Realistic cloud is essential for enhancing the quality of computer graphics applications, such as flight simulation. Data-driven method is an effective way in cloud modeling, but existing methods typically only utilize one data source as input. For example, natural images are usually used to model small-scale cloud with details, and satellite images and WRF data are used to model large scale cloud without details. To construct large-scale cloud scene with details, we propose a novel method to extract relevant cloud information from both satellite and natural images. Experiments show our method can produce more detailed cloud scene comparing with existing methods. © 2018 The Author(s).

关键词： Flight simulators

来源：评论

学校读者我要写书评

暂无评论

A Practical Cloud API Complementary Recommendation Service for Mashup Creation

A Practical Cloud API Complementary Recommendation Service f...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Xiaowei Liu Wenhui Chen Mengmeng Sun Yali Si Zhen Chen School of Information Science and Engineering Yanshan University Qinhuangdao China School of Computer Science and Engineering Changshu Institute of Technology Changshu China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

With the popularity of the service-oriented development paradigm in the cloud era, numerous cloud APIs have been developed. The continuous proliferation of cloud APIs has submerged developers in a sea of options, bringing the need for cloud API recommendation techniques. Most existing cloud API recommendation methods focus on theoretical studies and neglect practical applications. As a result, these methods face several challenges, such as covering recommendation scenarios, generating real-time responses, and handling concurrent requests. In this paper, we propose and implement a practical cloud API complementary recommendation service for mashup creation. To address the above challenges, we first propose a cloud API complementary recommendation framework named FICR, which exploits feature interactions to mine implicit complementarity and models complementarity from the mashup side and the target cloud API side for scenario coverage. Then, we conduct performance optimization via precoding and batch size tuning to optimize FICR for real-time responses. Finally, we design a minimum-connection load balancing algorithm with resource early warning and build a distributed system for concurrent requests. Experiments conducted on real-world datasets show that FICR outperforms state-of-the-art baseline models in complementary recommendation scenarios, and demonstrate that the implemented service meets the real-time and concurrency requirements. The service will serve as a practical tool to help developers during mashup creation.

关键词： Concurrent computing Federated learning Mashups Precoding Load management Real-time systems Tuning

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm for detecting community structure based on node similarity

引用

Journal of Computational Information systems 2014年第9期10卷 3805-3813页

作者： Guo, Jingfeng Wei, Aiying Lv, Jiaguo Liu, Zhen College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China College of Information Science and Engineering Zaozhuang University Zaozhuang 277100 China

Detecting community structure based on node similarity cost lower time complexity, but they ignore the indirect relationships of nodes. We proposed an improved algorithm for detecting community structure based on node similarity (AINS). The algorithm presents a neighbor subgraph model based on akincore node pair, considering the direct and indirect relations between nodes. It introduced node indirect similarity to solve the problem which only pay attention to direct relationships, ensuring that the results meet the common definition of community structure (the number of edges between community is greater than that within community). The experimental results show that the AINS algorithm can obtain better community classification result effectively. © 2014 Binary Information Press.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

On reducing both shift and capture power for sean-based testing

On reducing both shift and capture power for sean-based test...

引用

2008 Asia and South Pacific Design Automation Conference, ASP-DAC

作者： Li, Jia Xu, Qiang Hu, Yu Li, Xiaowei Key Laboratory of Computer System and Architecture ICT Chinese Academy of Sciences Beijing 100080 China Graduate University Chinese Academy of Sciences Beijing 100080 China Dept. of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Center for Intelligent System and Biomimetics Institute of Advanced Integration Technology CAS/CUHK Shenzhen 518067 China

ISBN: (纸本)9781424419227

Power consumption in scan-based testing is a major concern nowadays. In this paper, we present a new X-filling technique to reduce both shift power and capture power during scan tests, namely LSC-filling. The basic idea is to use as few as possible X-bits to keep the capture power under the peak power limit of the circuit under test (CUT), while using the remaining X-bits to reduce the shift power to cut down the CUT's average power consumption during scan tests as much as possible. In addition, by carefully selecting the X-filling order, our X-filling technique is able to achieve lower capture power when compared to existing methods. Experimental results on ISCAS'89 benchmark circuits show the effectiveness of the proposed methodology. ©2008 IEEE.

关键词： Filling

来源：评论

学校读者我要写书评

暂无评论

ACCELERATE SMOOTHED PARTICLE HYDRODYNAMICS USING GPU

ACCELERATE SMOOTHED PARTICLE HYDRODYNAMICS USING GPU

引用

2010 IEEE Youth Conference on Information,Computing and Telecommunications(2010 IEEE青年信息、计算和通信技术大会)

作者： Xiaopeng Gao Zhiqiang Wang Han Wan Xiang Long State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beihang University 100191 Beijing China

Physic-based fluid simulation is used extensively nowadays;however the traditional serial algorithm can’t satisfy the realtime requirement due to its complexity and computeintensive. The development of modern GPU makes this possible. In this paper, a Smoothed Particle Hydrodynamics (SPH) method for incompressible fluid was implemented using CUDA on GPU. Since the algorithm was executed on the GPU entirely, the method can take full advantage of massive computational power of modern graphics hardware. The experiment results show that our GPU based SPH implementation can achieve the rate of 89 frames per second in the simulation of 102K particles and gain nearly 140x speedups compared with the serial algorithm.

关键词： CUDA fluid simulation Smoothed Particle Hydrodynamics GPU acceleration

来源：评论

学校读者我要写书评

暂无评论

Imperceptible and Sparse Adversarial Attacks via a Dual-Population-Based Constrained Evolutionary Algorithm

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第2期4卷 268-281页

作者： Tian, Ye Pan, Jingwen Yang, Shangshang Zhang, Xingyi He, Shuping Jin, Yaochu Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Hefei230601 China Hefei Comprehensive National Science Center Institute of Artificial Intelligence Hefei230088 China Anhui University School of Computer Science and Technology Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Hefei230601 China Anhui University Anhui Engineering Laboratory of Human-Robot Integration System and Intelligent Equipment School of Electrical Engineering and Automation Hefei230601 China Bielefeld University Faculty of Technology Bielefeld33619 Germany

The sparse adversarial attack has attracted increasing attention due to the merit of a low attack cost via changing a small number of pixels. However, the generated adversarial examples are easily detected in vision since the perturbation to each pixel is relatively large. To achieve imperceptible and sparse adversarial attacks, this article formulates a bi-objective constrained optimization problem, simultaneously minimizing the 0 and 2 distances to the original image, and proposes a dual-population-based constrained evolutionary algorithm to solve it. The proposed method solves the optimization problem by evolving two populations, where one population is responsible for finding feasible solutions (i.e., successful attacks) and the other one is to minimize both the 0 and 2 distances. Moreover, a population initialization strategy and two genetic operators are customized to accelerate the convergence speed. Experimental results indicate that the proposed method can achieve high success rates with low attack costs, and strikes a better balance between the 0 and 2 distances than state-of-the-art methods. © 2020 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

A novel algorithm for outlier mining in the internet of things

引用

ICIC Express Letters 2013年第1期7卷 215-219页

作者： Chen, Wei Liu, Yongshan Zhang, Yang College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province No. 438 Hebei Ave. Qinhuangdao 066004 China

Most of the traditional outlier mining algorithms are not suitable for high dimensional datasets. However, the dimensionality of the dataset in the field of the Internet of Things is high. Therefore, Hypergraph-based Outlier Mining (HOM) algorithm is proposed to solve the problem. Two different hypergraph models are constructed in the HOM algorithm. One is itemset hypergraph. One-itemset in transaction database is itemset hypergraph's vertices, and the transactions are itemset hypergraph's hyperedges. The other one is transaction hypergraph. The transactions are its vertices, and frequent itemsets are the hyperedges. The outliers are found by hypergraph partitioning. Experiments show that HOM algorithm can effectively find the outliers in high dimensional space. ©2013 ICIC International.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：