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

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Bin Mao Naiyang Guan Dacheng Tao Xuhui Huang Zhigang Luo College of Science National University of Defense Technology Changsha China College of Computer National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory Changsha China Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha China Faculty of Engineering and Information Technology University of Technology Sydney Sydney NSW Australia

Non-negative matrix factorization (NMF) is an efficient dimension reduction method and plays an important role in many pattern recognition and computer vision tasks. However, conventional NMF methods are not robust since the objective functions are sensitive to outliers and do not consider the geometric structure in datasets. In this paper, we proposed a correntropy graph regularized NMF (CGNMF) to overcome the aforementioned problems. CGNMF maximizes the correntropy between data matrix and its reconstruction to filter out the noises of large magnitudes, and expects the coefficients to preserve the intrinsic geometric structure of data. We also proposed a modified version of our CGNMF which construct the adjacent graph by using sparse representation to enhance its reliability. Experimental results on popular image datasets confirm the effectiveness of CGNMF.

关键词： Robustness Vectors Clustering algorithms Mutual information Measurement computer integrated manufacturing

来源：评论

学校读者我要写书评

暂无评论

科学研究的第五范式——以智能驱动的材料设计为例

引用

Engineering 2023年第5期24卷 126-137,I0003,I0004页

作者： Can Leng Zhuo Tang Yi-Ge Zhou Zean Tian Wei-Qing Huang Jie Liu Keqin Li Kenli Li Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense TechnologyChangsha 410073China Laboratory of Software Engineering for Complex Systems National University of Defense TechnologyChangsha 410073China National Supercomputing Center in Changsha Changsha 410082China College of Computer Science and Electronic Engineering Hunan UniversityChangsha 410082China Institute of Chemical Biology and Nanomedicine State Key Laboratory of Chemo/Biosensing and ChemometricsCollege of Chemistry and Chemical EngineeringHunan UniversityChangsha 410082China Department of Applied Physics School of Physics and ElectronicsHunan UniversityChangsha 410082China Department of Computer Science State University of New YorkNew PaltzNY 12561USA

科学正在进入一个新时代——第五范式——它被认为是知识整合到不同领域的主要特征,是基于无所不在的机器学习系统的计算社区中智能驱动的工作。在此,我们通过在天河一号超级计算机系统上构建的催化材料专门设计的典型平台案例,生动地... 详细信息

科学正在进入一个新时代——第五范式——它被认为是知识整合到不同领域的主要特征,是基于无所不在的机器学习系统的计算社区中智能驱动的工作。在此,我们通过在天河一号超级计算机系统上构建的催化材料专门设计的典型平台案例,生动地阐明了第五范式的本质,旨在促进第五范式在其他领域的培养。第五范式平台主要包括模型自动构建(原始数据提取)、指纹自动构建(神经网络特征选择)以及跨学科知识串联的重复迭代(“火山图”)。与分解一起进行的是对迭代中实现的体系结构的性能评估。通过讨论,第五范式的智能驱动平台可以极大地简化和改进研究中极其繁琐和具有挑战性的工作,并通过补偿机器学习中缺少样本和替代一些由于计算资源不足而导致的数值计算来实现数值计算与机器学习之间的相互反馈,从而加速探索过程。在数据驱动的学科中,跨学科专家的协同作用和对动态数据需求的急剧增长仍然是一个挑战。我们相信,对第五范式平台的一瞥可以为其在其他领域的应用铺平道路。

关键词：机器学习自动构建天河一号数据驱动神经网络动态数据知识整合科学研究

来源：评论

学校读者我要写书评

暂无评论

Enhancing 2D Representation via Adjacent Views for 3D Shape Retrieval

Enhancing 2D Representation via Adjacent Views for 3D Shape ...

引用

International Conference on computer Vision (ICCV)

作者： Cheng Xu Zhaoqun Li Qiang Qiu Biao Leng Jingfei Jiang School of Computer Science & Engineering Beihang University Duke University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University State Key Laboratory of Virtual Reality Technology and Systems Beihang University National Laboratory for Parallel and Distributed Processing National University of Defense Technology

ISBN: (数字)9781728148038

ISBN: (纸本)9781728148045

Multi-view shape descriptors obtained from various 2D images are commonly adopted in 3D shape retrieval. One major challenge is that significant shape information are discarded during 2D view rendering through projection. In this paper, we propose a convolutional neural network based method, CenterNet, to enhance each individual 2D view using its neighboring ones. By exploiting cross-view correlations, CenterNet learns how adjacent views can be maximally incorporated for an enhanced 2D representation to effectively describe shapes. We observe that a very small amount of, e.g., six, enhanced 2D views, are already sufficient for a panoramic shape description. Thus, by simply aggregating features from six enhanced 2D views, we arrive at a highly compact yet discriminative shape descriptor. The proposed shape descriptor significantly outperforms state-of-the-art 3D shape retrieval methods on the ModelNet and ShapeNetCore55 benchmarks, and also exhibits robustness against object occlusion.

关键词： Shape Three-dimensional displays Correlation Two dimensional displays Feature extraction Solid modeling Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Optimistic data consistency maintenance method based on data dependence

引用

Jisuanji Xuebao/Chinese Journal of computers 2008年第5期31卷 741-753页

作者： Zhou, Jing Wang, Yi-Jie Li, Si-Kun National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

This paper proposes an optimistic data consistency method according to the question about data dependence in data consistency. In the method, data object is partitioned into data blocks by fixed size as the basic unit of data management. Updates are compressed by Bloom filter technique and propagated in double-path. Negotiation algorithms detect and reconcile update conflicts, and dynamic data management algorithms accommodate dynamic data processing. The results of the performance evaluation show that it is an efficient method to achieve consistency, good dynamic property, and strong robustness when choosing the size of data block appropriately. At the same time, a feasible way is put forward on how to choose appropriate data block size.

关键词： Data processing

来源：评论

学校读者我要写书评

暂无评论

Maximizing the information diffusion opportunity in the cyber-physical network

Maximizing the information diffusion opportunity in the cybe...

引用

International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE)

作者： Hongliang Lu Xuan Dong Wenxiang Li Saohe Lv Xiaodong Wang Wei Chen Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Hunan China School of Information Science and Engineering Wuhan University of Science and Technology Wuhan China Engineering Research Center for Metallurgical Automation and Detecting Technology of Ministry of Education Wuhan University of Science and Technology Wuhan China

ISBN: (纸本)9781479982172

Our daily life is changing by the smart objects, such as smart watches, smart phones etc. They make the cyber world and the physical world integrated by their abundant abilities of sensing, communication and computation etc. Focusing on a wide range of the integrated network, a statistical based strategy was introduced to get a special kind of link between objects, the statistical probability communication link. To get a maximized information spread probability for grouped people, this paper introduced a distributed, yet efficient algorithm naming DMPID algorithm, for finding a sub-network to spread people oriented inforamtion. The DMPID algorithm take the size of the selection and the information spread probability into account, and made a balance between the two parameters. Extended simulation showed that the DMPID algorithm performs well in different distributed networks.

关键词： distributed algorithms probability statistical analysis telecommunication networks DMPID algorithm cyber world cyber-physical network distributed maximizing probability of information diffusion information diffusion opportunity information spread probability statistical probability communication link

来源：评论

学校读者我要写书评

暂无评论

Feature and Performance Comparison of FaaS Platforms

Feature and Performance Comparison of FaaS Platforms

引用

IEEE International Conference on Software Engineering and Service sciences (ICSESS)

作者： Penghui Ma Peichang Shi Guodong Yi National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China Key Laboratory of Software Engineering for Complex Systems College of Computer Science National University of Defense Technology Changsha China Xiangjiang Lab Changsha China School of Advanced Interdisciplinary Studies Hunan University Of Technology and Business Changsha China

With serverless computing offering more efficient and cost-effective application deployment, the diversity of serverless platforms presents challenges to users, including platform lock-in and costly migration. Moreover, due to the black box nature of function computing, traditional performance benchmarking methods are not applicable, necessitating new studies. This article presents a detailed comparison of six major public cloud function computing platforms and introduces a benchmarking framework for function computing performance. This framework aims to help users make comprehensive comparisons and select the most suitable platform for their specific needs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Overlapping community detection via link partition of asymmetric weighted graph

Overlapping community detection via link partition of asymme...

引用

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Wenju Zhang Naiyang Guan Xuhui Huang Zhigang Luo Jianwu Li Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan P.R. China 410073 National University of Defense Technology Changsha Hunan CN Beijing Institute of Technology Beijing Beijing CN

Link partition clusters edges of a complex network to discover its overlapping communities. Due to Its effectiveness, link partition has attracted much attentions from the network science community. However, since link partition assigns each edge of a network to unique community, it cannot detect the disjoint communities. To overcome this deficiency, this paper proposes a link partition on asymmetric weighted graph (LPAWG) method for detecting overlapping communities. Particularly, LPAWG divides each edge into two parts to distinguish the roles of connected nodes. This strategy biases edges to a specific node and helps assigning each node to its affiliated community. Since LPAWG introduces more edges than those in the original network, it cannot efficiently detect communities from some networks with relative large amount of edges. We therefore aggregate the line graph of LPAWG to shrink its scale. Experimental results of community detection on both synthetic datasets and the realworld networks show the effectiveness of LPAWG comparing with the representative methods.

关键词： Communities Image edge detection Partitioning algorithms Benchmark testing Acceleration Educational institutions Complex networks

来源：评论

学校读者我要写书评

暂无评论

Optimistic data consistency maintenance method based on key-attributes

引用

Ruan Jian Xue Bao/Journal of Software 2008年第8期19卷 2114-2126页

作者： Zhou, Jing Wang, Yi-Jie Li, Si-Kun National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

The features of simple description, small updates item and weak dependence are the main characteristics of updates of key-attributes in P2P systems. Accordingly, an optimistic data consistency maintenance method based on key-attributes is proposed. In the method, the update of key-attributes is separated from user update requests. Key-Updates are propagated by latency-overlay update propagation model, that is, updates are always propagated to the nodes having maximum or minimum latency, and assured and uncertain propagation paths of updates are all taken into account. Based on classifying key-update conflicts, a double-level reconciling mechanism including buffer preprocessing and update-log processing is applied to detect and reconcile conflicts, and then conflicts are solved by policies as last-writer-win and divide-and-rule. Lastly, update-log management method and maintenance method brought by node failure and network partitioning are discussed for the above is deployed based on the information storied in update-log. Delaying key-attributes updates cannot occur by the optimistic disposal method, and then it cannot depress efficiency of resource location based on key-attributes, which adapts well to P2P systems for Internet. The simulation results show that it is an effective optimistic data consistency maintenance method, achieving good consistency overhead, resource location and resource access overhead, and having strong robustness.

关键词： Maintenance

来源：评论

学校读者我要写书评

暂无评论

Symmetric Non-negative Matrix Factorization Based Link Partition Method for Overlapping Community Detection

Symmetric Non-negative Matrix Factorization Based Link Parti...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Xiang Zhang Naiyang Guan Wenju Zhang Xuhui Huang Shuyi Wu Zhigang Luo Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Hunan P.R. China Institute of Software College of Computer National University of Defense Technology Hunan P.R. China Department of Computer Science and Technology College of Computer National University of Defense Technology Hunan P.R. China

ISBN: (纸本)9781479986989

Partitioning links rather than nodes is effective in overlapping community detection (OCD) on complex networks. However, it consumes high CPU and memory overheads because the volume of links is huge especially when the network is rather complex. In this paper, we proposes a symmetric non-negative matrix factorization (SNMF) based link partition method called SNMF-Link to overcome this deficiency. In particular, SNMF-Link represents data in a lower-dimensional space spanned by the node-link incidence matrix. By solving a lighter SNMF problem, SNMF-Link learns the clustering indicators of each links. Since traditional multiplicative update rule (MUR) based optimization algorithm for SNMF suffers from slow convergence, we applied the augmented Lagrangian method (ALM) to efficiently optimize SNMF. Experimental results show that SNMF-Link is much more efficient than the representative clustering algorithms without reducing the OCD performance.

关键词： Symmetric matrices Convergence Optimization Partitioning algorithms Chlorine Complex networks Image edge detection

来源：评论

学校读者我要写书评

暂无评论

Intention oriented itinerary recommendation by bridging physical trajectories and online social networks

引用

Ruan Jian Xue Bao/Journal of Software 2012年第SUPPL.期23卷 159-168页

作者： Meng, Xiang-Xu Wang, Xiao-Dong Zhou, Xing-Ming National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha 410073 China

Human itineraries are often initiated by some general intentions and will be optimized after considering all kinds of constraints and available information. This paper proposes a category-based itinerary recommendation framework to help the user transfer from intentions to itinerary planning, which join physical trajectories and information of location based social networks. The main contributions are: (1) Build the category based activity scheduling model;(2) Design and implement the category tree based POI (point or interest) query strategy and algorithm;(3) Propose the Voronoi graph based GPS trajectory analysis method to build traffic information networks;(4) Combine social networks with traffic information networks to implement category based recommendation by ant colony algorithm. The study conducts experiments on datasets from FourSquare and GeoLife project. A test on satisfaction of recommended items is also performed. Results show that the satisfaction reaches 80% in average.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：