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

IEEE International Conference on systems, Man, and Cybernetics

作者： Lei Wei Naiyang Guan Xiang Zhang Zhigang Luo Dacheng Tao National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 P.R. China These authors contributed equally to this paper National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 P.R. China Centre for Quantum Computation and Intelligence Systems and Faculty of Engineering and Information Technology University of Technology Sydney Sydney NSW 2007 Australia

ISBN: (纸本)9781479906505

Nonnegative matrix factorization (NMF) decomposes a nonnegative dataset X into two low-rank nonnegative factor matrices, i.e., W and H, by minimizing either Kullback-Leibler (KL) divergence or Euclidean distance between X and WH. NMF has been widely used in pattern recognition, data mining and computer vision because the non-negativity constraints on both W and H usually yield intuitive parts-based representation. However, NMF suffers from two problems: 1) it ignores geometric structure of dataset, and 2) it does not explicitly guarantee partsbased representation on any datasets. In this paper, we propose an orthogonal nonnegative locally linear embedding (ONLLE) method to overcome aforementioned problems. ONLLE assumes that each example embeds in its nearest neighbors and keeps such relationship in the learned subspace to preserve geometric structure of a dataset. For the purpose of learning parts-based representation, ONLLE explicitly incorporates an orthogonality constraint on the learned basis to keep its spatial locality. To optimize ONLLE, we applied an efficient fast gradient descent (FGD) method on Stiefel manifold which accelerates the popular multiplicative update rule (MUR). The experimental results on real-world datasets show that FGD converges much faster than MUR. To evaluate the effectiveness of ONLLE, we conduct both face recognition and image clustering on real-world datasets by comparing with the representative NMF methods.

关键词： Nonnegative matrix factorization Locally linear embedding Fast gradient descent Stiefel manifold Dataset Nonnegative matrix decomposition geometrical construction NMF protocol images embedding Flue gas desulfurization Nearest neighbor Orthogonal

来源：评论

学校读者我要写书评

暂无评论

Eunomia: Scaling Concurrent Search Trees under Contention Using HTM

引用

ACM SIGPLAN Notices 2017年第8期52卷 385-399页

作者： Wang, Xin Zhang, Weihua Wang, Zhaoguo Wei, Ziyun Chen, Haibo Zhao, Wenyun Software School Fudan University China Shanghai Key Laboratory of Data Science Fudan University School of Computer Science Fudan University China Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Computer Science Department New York University United States

While hardware transactional memory (HTM) has recently been adopted to construct efficient concurrent search tree structures, such designs fail to deliver scalable performance under contention. In this paper, we first conduct a detailed analysis on an HTM-based concurrent B+Tree, which uncovers several reasons for excessive HTM aborts induced by both false and true conflicts under contention. Based on the analysis, we advocate Eunomia, a design pattern for search trees which contains several principles to reduce HTM aborts, including splitting HTM regions with version-based concurrency control to reduce HTM working sets, partitioned data layout to reduce false conflicts, proactively detecting and avoiding true conflicts, and adaptive concurrency control. To validate their effectiveness, we apply such designs to construct a scalable concurrent B+Tree using HTM. Evaluation using key-value store benchmarks on a 20-core HTM-capable multi-core machine shows that Eunomia leads to 5X-11X speedup under high contention, while incurring small overhead under low contention. © 2017 ACM.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Generalized matrix multiplication and its object oriented model

引用

Scalable Computing 2014年第2期15卷 187-200页

作者： Ganzha, Maria Paprzycki, Marcin Sedukhin, Stanislav G. Systems Research Institute Polish Academy of Sciences Warsaw and Institute of Informatics University of Gdańsk Gdańsk Poland Systems Research Institute Polish Academy of Sciences Warsaw and Department of Management and Technical Sciences Warsaw Management Academy Warsaw Poland Distributed Parallel Processing Laboratory The University of Aizu Aizuwakamatsu City Fukushima 965-8580 Japan

Since the beginning of the 21st century, we observe rapid changes in the area of, broadly understood, computational sciences. One of interesting effects of these changes is the need for reevaluation of the role of dense matrix multiplication. The aim of this paper is two-fold. First, to summarize developments that point toward a need for reconsidering usefulness of matrix multiplication generalized on the basis of the theory of algebraic semirings. Second, to propose generalized matrix-matrix multiply-and-update (MMU) operation and its object oriented model. © 2014 SCPE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

On the performance of Maestro2 high performance network equipment, using new improvement techniques

On the performance of Maestro2 high performance network equi...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： S. Yamagiwa K. Ferreira L.M. Campos K. Aoki M. Ono K. Wada M. Fukuda L. Sousa PDM&FC Lisboa Portugal Parallel and Distributed Computing Laboratory University of Tsukuba Tsukuba Ibaraki Japan Computing and Software Systems UW1-331 University of Washington Bothell Bothell WA USA IST/INESC Lisboa Portugal

Cluster computers have become the vehicle of choice to build high performance computing environments. To fully exploit the computing power of these environments, one must utilize high performance network and protocol technologies, since the communication patterns of parallel applications running on clusters require low latency and high throughput, not achievable by using off-the-shell network technologies. We have developed a technology to build high performance network equipment, called MaestroS. This paper describes the novel techniques used by Maestro2 to extract maximum performance from the physical medium and studies the impact of software-level parameters. The results obtained clearly show that Maestro2 is a promising technology, presenting very good results both in terms of latency and throughput. The results also show the large impact of software overhead in the overall performance of the system and validate the need for optimized communication libraries for high performance computing.

关键词： High performance computing Delay Throughput Vehicles Computer networks Concurrent computing Protocols Communications technology Application software Communication system software

来源：评论

学校读者我要写书评

暂无评论

Big data collaborative artificial intelligence and high-performance computing to drive physical design of fusion

Big data collaborative artificial intelligence and high-perf...

引用

2022 International Conference on Cloud Computing, Big Data Applications and Software Engineering, CBASE 2022

作者： Liu, Pan Liu, Gongjie Liu, Jie Liu, Chencheng Xiong, Wenbin Tang, Zhangcun Zhou, Yinzhao Wang, Yonggang Yuan, Zhouming Beijng Paratera Technology Corp. Ltd Beijing100000 China National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory Changsha410073 China National University of Defense Technology Laboratory of Software Engineering for Complex Systems Changsha410073 China Central South University of Forestry and Technology Changsha410000 China Nuclear and Radiation Safety Center Mee Beijing100000 China University of Electronic Science and Technology of China Chengdu610000 China Tianfu Innovation Energy Establishment Chengdu610000 China

ISBN: (纸本)9798350396393

Controlled thermonuclear fusion has always been a dream pursued by mankind. However, the physical processes of controlled thermonuclear fusion are complex, requiring numerical simulations with high performance computing, and the amount of data generated by the physical processes on spatial, temporal and temperature scales is too large to be captured, managed, processed and collated in a reasonable time frame by mainstream software tools to achieve more aggressive fusion physical design. The data are too large to be captured, managed, processed, and collated into more aggressive targets for fusion physical design in a reasonable time by mainstream software tools. At the same time, the failure of fusion ignition can be caused by the distortion of various key physical quantities, and only by decomposing the process step by step and clarifying the changes of key physical quantities in the fusion physics process, can an effective mechanism be formed to prevent the distortion of key physical quantities from causing ignition failure in experimental physics. Big data in collaboration with artificial intelligence and high performance computing to drive the physical design of fusion is a novel avenue. By data acquisition with and pre-processing, this allows the creation of small sample libraries and deep learning. With supervised learning function convergence, incorporating solid/fluid computational methods, further network layering and cell expansion, the parameters of the physical model conforming to Lawson's criterion will become experimental physical parameters, and we find the new approach in Data capacity, Model combination approach, Type of material, Calculation speed, Optimisation of design iteration times, etc. are superior to the traditional approach. © 2022 IEEE.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Energy-Efficient Scheduling Algorithm for Sporadic Real-Time Tasks in Multiprocessor systems

An Energy-Efficient Scheduling Algorithm for Sporadic Real-T...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Dong-Song Zhang Fang-Yuan Chen Hong-Hua Li Shi-Yao Jin De-Ke Guo National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China School of Computing Science Simon Fraser University Burnaby BC Canada National Laboratory for Information System Engineering School of Information Systems and Management National University of Defense Technology Changsha China

As the energy consumption of embedded multiprocessor systems becomes increasingly prominent, the real-time energy-efficient scheduling in multiprocessor systems becomes an urgent problem to reduce the system energy consumption while meeting real-time constraints. For a multiprocessor with independent DVFS and DPM at each processor, this paper proposes an energy-efficient real-time scheduling algorithm named LRE-DVFS-EACH, based on LRE-TL which is an optimal real-time scheduling algorithm for sporadic tasks. LRE-DVFS-EACH utilizes the concept of TL plane and the idea of fluid scheduling to dynamically scale the voltage and frequency of processors at the initial time of each TL plane as well as the release time of a sporadic task in each TL plane. Consequently, LRE-DVFS-EACH can obtain a reasonable tradeoff between the real-time constraints and the energy saving. LRE-DVFS-EACH is also adaptive to the change of workload caused by the dynamic release of sporadic tasks, which can obtain more energy savings. The experimental results show that compared with existing algorithms, LRE-DVFS-EACH can not only guarantee the optimal feasibility of sporadic tasks, but also achieve more energy savings in all cases, especially in the case of high workloads.

关键词： Real time systems Scheduling algorithm Time frequency analysis Scheduling Heuristic algorithms Power demand

来源：评论

学校读者我要写书评

暂无评论

Some observations regarding the RBF-FD approximation accuracy dependence on stencil size

arXiv

引用

arXiv 2024年

作者： Kolar-Požun, Andrej Jančič, Mitja Rot, Miha Kosec, Gregor Jožef Stefan Institute Parallel and Distributed Systems Laboratory Jamova 39 Ljubljana1000 Slovenia University of Ljubljana Faculty of Mathematics and Physics Jadranska 19 Ljubljana1000 Slovenia International Postgraduate School Jožef Stefan Jamova 39 Ljubljana1000 Slovenia

When solving partial differential equations on scattered nodes using the Radial Basis Function-generated Finite Difference (RBF-FD) method, one of the parameters that must be chosen is the stencil size. Focusing on Polyharmonic Spline RBFs with monomial augmentation, we observe that it affects the approximation accuracy in a particularly interesting way - the solution error oscillates under increasing stencil size. We find that we can connect this behaviour with the spatial dependence of the signed approximation error. Based on this observation we are able to introduce a numerical quantity that could indicate whether a given stencil size is locally optimal. This work is an extension of our ICCS 2023 conference paper [1]. © 2024, CC BY.

关键词： Finite difference method

来源：评论

学校读者我要写书评

暂无评论

Large-throughput parallel optical interconnection for a distributed parallel computing system

Large-throughput parallel optical interconnection for a dist...

引用

1999 Pacific Rim Conference on Lasers and Electro-Optics, CLEO/Pacific Rim 1999

作者： Nishimura, S. Harasawa, K. Matsudairn, N. Akutsu, S. Sasaki, S. Kudoh, T. RWCP Optical Interconnection Hitachi Laboratory C/o Central Research Lab Hitachi Ltd. 1-280 Higashi-koigakubo Kokubunji-shi Tokyo185-8601 Japan Hitachi Communication Systems Inc. 180 Totsuka-cho Totsuka-ku Yokohama244-0003 Japan RWCP Parallel and Distributed System Architecture Lab. Tsukuba Mitsui Building I6F 1-6-1 Takezono Tsukuba-shi Ibaraki305-0032 Japan

We produced a large-throughput optical interconnection for a distributed parallel computing system. It transmits optical data at a rate of over 800-Mbit/s×10-bit through a 50-m single-mode fiber, using a CMOS MUX... 详细信息

ISBN: (纸本)0780356616

关键词： Single mode fibers

来源：评论

学校读者我要写书评

暂无评论

PPSS: A Privacy-Preserving Supervision Scheme Based on Blockchain

PPSS: A Privacy-Preserving Supervision Scheme Based on Block...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Ming Chen Peichang Shi Xiang Fu Feng Jiang Fei Gao Penghui Ma Jinzhu Kong 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 Kylin Software Co.LTD Changsha China Zhejiang Lab Hangzhou China

In JointCloud Computing, multi-party participation introduces complexity and uncertainty. For all participants in JointCloud Computing, both continuous supervision and necessary privacy protection are required. Traditional supervision methods usually adopt the centralized information interaction mode, which has such defects as collusion of interests, single point of failure, privacy disclosure, etc. Building a decentralized supervision mechanism has become a new research direction. In this paper, we propose PPSS, a privacy-preserving supervision scheme based on blockchain, which decentralizes the supervision of the participants in JointCloud Computing, and combines the “double encryptions” and “threshold encryption” technologies to provide privacy protection. While making full use of the decentralization of the blockchain, a committee is established to carry out the analysis and decision-making tasks in terms of supervision and privacy protection. Experimental results indicate that PPSS can balance performance and security by reasonably configuring the committee.

关键词： Privacy Uncertainty Decision making Buildings Reliability engineering Blockchains Complexity theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：