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

IEEE International Conference on big data and Cloud Computing (BdCloud)

作者： Shiyu Wang Shengbing Zhang Jihe Wang Libo Chang Liangyou Feng Xiaoya Fan Engineering Research Center of Embedded System Integration Ministry of Education School of Computer Science Northwestern Polytechnical University Xian China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science Northwestern Polytechnical University Xian China

As the latest generation of digital video coding standard, HEVC has technically optimized multiple modules such as related frame prediction, block processing and entropy coding in the frequency coding and decoding framework. However, flexible and efficient coding algorithms make the amount of calculation in the video decoding and reconstruction process increase dramatically. The energy efficiency of traditional processors is limited, and the decoding calculation process is difficult to meet the current needs of ultra-high-definition video playback. For the most important and time-consuming bitstream analysis and entropy decoding part of the HEVC decoding process, a new hardware architecture strategy is provided, which can effectively improve the HEVC decoding performance. In this paper, the designed data access module, bitstream analysis and entropy decoding unit are simulated and verified. Build an FPGA verification platform, and use the main tier standard test sequence to simulate and verify the designed hardware acceleration architecture. The experimental results show that the hardware architecture of bitstream analysis and entropy decoding designed in this paper can reach the functions and performance indicators specified by the HEVC standard Level-4 main tier, and the bitstream analysis acceleration effect is good. This thesis aims at the current HEVC decoding calculation characteristics, and through the design of hardware architecture verification, it provides new solutions and hardware architecture ideas for subsequent HEVC encoding and decoding performance optimization.

关键词： Analytical models Program processors Video sequences Bit rate Syntactics Prediction algorithms Entropy

来源：评论

学校读者我要写书评

暂无评论

Finedge: A Dynamic Cost-Efficient Edge Resource Management Platform for NFV Network

Finedge: A Dynamic Cost-Efficient Edge Resource Management P...

引用

International Workshop on Quality of Service

作者： Miao Li Qixia Zhang Fangming Liu National Engineering Research Center for Big Data Technology and System Key Laboratory of Services Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (数字)9781728168876

ISBN: (纸本)9781728168883

With the evolution of network function virtualization (NFV) and edge computing, software-based network functions (NFs) can be deployed on closer-to-end-user edge servers to support a broad range of new services with high bandwidth and low latency. However, due to the resource limitation, strict QoS requirements and real-time flow fluctuations in edge network, existing cloud-based resource management strategy in NFV platforms is inefficient to be applied to the edge. Thus, we propose Finedge, a dynamic, fine-grained and cost-efficient edge resource management platform for NFV network. First, we conduct empirical experiments to find out the effect of NFs' resource allocation and their flow-level characteristics on performance. Then, by jointly considering these factors and QoS requirements (e.g., latency and packet loss rate), Finedge can automatically assign the most suitable CPU core and tune the most cost-efficient CPU quota to each NF. Finedge is also implemented with some key strategies including real-time flow monitoring, elastic resource scaling up and down, and also flexible NF migration among cores. Through extensive evaluations, we validate that Finedge can efficiently handle heterogeneous flows with the lowest CPU quota and the highest SLA satisfaction rate as compared with the default OS scheduler and other state-of-the-art resource management schemes.

关键词： Resource management Noise measurement Packet loss Servers Throughput Quality of service

来源：评论

学校读者我要写书评

暂无评论

Heat to Power: Thermal Energy Harvesting and Recycling for Warm Water-Cooled datacenters

Heat to Power: Thermal Energy Harvesting and Recycling for W...

引用

Annual International Symposium on Computer Architecture, ISCA

作者： Xinhui Zhu Weixiang Jiang Fangming Liu Qixia Zhang Li Pan Qiong Chen Ziyang Jia National Engineering Research Center for Big Data Technology and System Key Laboratory of Services Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (数字)9781728146614

ISBN: (纸本)9781728146621

Warm water cooling has been regarded as a promising method to improve the energy efficiency of water-cooled datacenters. In warm water-cooling systems, hot spots occur as a common problem where the hybrid cooling architecture integrating thermoelectric coolers (TECs) emerges as a new remedy. Equipped with this architecture, the inlet water temperature can be raised higher, which provides more opportunities for heat recycling. However, currently, the heat absorbed from the server components is ejected directly into the water without being recycled, which leads to energy wasting. In order to further improve the energy efficiency, we propose Heat to Power (H2P), an economical and energy-recycling warm water cooling architecture, where thermoelectric generators (TEGs) harvest thermal energy from the “used” warm water and generate electricity for reusing in datacenters. Specifically, we propose some efficient optimization methods, including an economical water circulation design, fine-grained adjustments of the cooling setting and dynamic workload scheduling for increasing the power generated by TEGs. We evaluate H2P based on a real hardware prototype and cluster traces from Google and Alibaba. Experiment results show that TEGs equipped with our optimization methods can averagely generate 4.349 W, 4.203 W, and 3.979 W (4.177 W averagely) electricity on one CPU under the drastic, irregular and common workload traces, respectively. The power reusing efficiency (PRE) can reach 12.8%~16.2% (14.23% averagely) and the total cost of ownership (TCO) of datacenters can be reduced by up to 0.57%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SCDetector: Software Functional Clone Detection Based on Semantic Tokens Analysis

SCDetector: Software Functional Clone Detection Based on Sem...

引用

IEEE International Conference on Automated Software engineering (ASE)

作者： Yueming Wu Deqing Zou Shihan Dou Siru Yang Wei Yang Feng Cheng Hong Liang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security HUST Wuhan China Shenzhen HUST Research Institute Shenzhen China School of Cyber Science and Engineering HUST Wuhan China School of Computer Science and Technology HUST Wuhan China University of Texas at Dallas United States

ISBN: (数字)9781450367684

ISBN: (纸本)9781728172811

Code clone detection is to find out code fragments with similar functionalities, which has been more and more important in software engineering. Many approaches have been proposed to detect code clones, in which token-based methods are the most scalable but cannot handle semantic clones because of the lack of consideration of program semantics. To address the issue, researchers conduct program analysis to distill the program semantics into a graph representation and detect clones by matching the graphs. However, such approaches suffer from low scalability since graph matching is typically time-consuming. In this paper, we propose SCDetector to combine the scalability of token-based methods with the accuracy of graph-based methods for software functional clone detection. Given a function source code, we first extract the control flow graph by static analysis. Instead of using traditional heavyweight graph matching, we treat the graph as a social network and apply social-network-centrality analysis to dig out the centrality of each basic block. Then we assign the centrality to each token in a basic block and sum the centrality ofthe same token in different basic blocks. By this, a graph is turned into certain tokens with graph details (i.e., centrality), called semantic tokens. Finally, these semantic tokens are fed into a Siamese architecture neural network to train a code clone detector. We evaluate SCDetector on two large datasets of functionally similar code. Experimental results indicate that our system is superior to four state-of-the-art methods (i.e., SourcererCC, Deckard, RtvNN, and ASTNN) and the time cost of SCDetector is 14 times less than a traditional graph-based method (i.e., CCSharp) on detecting semantic clones.

关键词： Scalability Semantics Cloning Detectors Transforms Static analysis Software engineering

来源：评论

学校读者我要写书评

暂无评论

V³H: View Variation and View Heredity for Incomplete Multiview Clustering

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2020年第3期1卷 233-247页

作者： Fang, Xiang Hu, Yuchong Zhou, Pan Wu, Dapeng Oliver The School of Computer Science and Technology Key Laboratory of Information Storage System Ministry of Education of China Huazhong University of Science and Technology Wuhan 430074 China The Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China The Department of Electrical and Computer Engineering University of Florida Gainesville 32611 FL United States

Real data often appear in the form of multiple incomplete views. Incomplete multiview clustering is an effective method to integrate these incomplete views. Previous methods only learn the consistent information between different views and ignore the unique information of each view, which limits their clustering performance and generalizations. To overcome this limitation, we propose a novel View Variation and View Heredity approach (V³H). Inspired by the variation and the heredity in genetics, V³H first decomposes each subspace into a variation matrix for the corresponding view and a heredity matrix for all the views to represent the unique information and the consistent information respectively. Then, by aligning different views based on their cluster indicator matrices, V³H integrates the unique information from different views to improve the clustering performance. Finally, with the help of the adjustable low-rank representation based on the heredity matrix, V³H recovers the underlying true data structure to reduce the influence of the large incompleteness. More importantly, V³H presents possibly the first work to introduce genetics to clustering algorithms for learning simultaneously the consistent information and the unique information from incomplete multiview data. Extensive experimental results on fifteen benchmark datasets validate its superiority over other state-of-the-arts. Impact Statement—Incomplete multiview clustering is a popular technology to cluster incomplete datasets from multiple sources. The technology is becoming more significant due to the absence of the expensive requirement of labeling these datasets. However, previous algorithms cannot fully learn the information of each view. Inspired by variation and heredity in genetics, our proposed algorithm V³H fully learns the information of each view. Compared with the state-of-the-art algorithms, V³H improves clustering

关键词： Incomplete multiview clustering view heredity view variation

来源：评论

学校读者我要写书评

暂无评论

A Review of the Evolutionary Algorithm Based VRP Problem

A Review of the Evolutionary Algorithm Based VRP Problem

引用

Chinese Control Conference (CCC)

作者： Lili Pan Bing Hu Zhe Sun Lei Xu Guangfu Gong Xiangpeng Xie Zhixin Sun Post Industry Technology Research and Development Center of the State Posts Bureau (Internet of Things Technology) Nanjing University of Posts and Telecommunications Nanjing P. R. China Post Big Data Technology and Application Engineering Research Center of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing P. R. China Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing University of Posts and Telecommunications Nanjing P. R. China Anhui Yougu Express Intelligent Technology Co. LTD Nanling Anhui P. R. China

The problem of vehicle routing planning (VRP) has far-reaching influence, and is widely used in vehicle scheduling, industrial production, transportation, logistics and distribution. The study of VRP and its associated derivations has grown significantly in recent years. So, starting with the fundamental VRP, this paper categorizes the VRP based on its traits and real-world applications. It then in-depth analyses the capacity constrained VRP, time window VRP, batched delivery VRP, dynamic VRP, and stochastic demand VRP, and provides an update on each type of VRP's research. Additionally, a summary of the VRP problem-solving methods is provided. The study of evolutionary algorithms is the main topic of this paper, and the fundamental solution method is provided in accordance with the development of the algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep learning-based computational method for soft matter dynamics: Deep Onsager-Machlup method

arXiv

引用

arXiv 2023年

作者： Li, Zhihao Zou, Boyi Wang, Haiqin Su, Jian Wang, Dong Xu, Xinpeng Department of Civil Engineering Shantou University 243 Daxue Road Guangdong Shantou515063 China Department of Physics MATEC Key Lab Guangdong Technion - Israel Institute of Technology 241 Daxue Road Guangdong Shantou515063 China School of Science and Engineering The Chinese University of Hong Kong Guangdong Shenzhen518172 China Shenzhen International Center for Industrial and Applied Mathematics Shenzhen Research Institute of Big Data Guangdong Shenzhen518172 China Technion – Israel Institute of Technology Haifa32000 Israel

A deep learning-based computational method has been proposed for soft matter dynamics – the deep Onsager-Machlup method (DOMM), which combines the brute forces of deep neural networks (DNNs) with the fundamental physics principle – Onsager-Machlup variational principle (OMVP). In the DOMM, the trial solution to the dynamics is constructed by DNNs that allow us to explore a rich and complex set of admissible functions. It outperforms the Ritz-type variational method where one has to impose carefully-chosen trial functions. This capability endows the DOMM with the potential to solve rather complex problems in soft matter dynamics that involve multiple physics with multiple slow variables, multiple scales, and multiple dissipative processes. Actually, the DOMM can be regarded as an extension of the deep Ritz method constructed using variational formulations of physics models to solve static problems in physics as discussed in our former work [Wang et al, Soft Matter, 2022, 18, 6015-6031]. In this work, as the first step, we focus on the validation of the DOMM as a useful computational method by using it to solve several typical soft matter dynamic problems: particle diffusion in dilute solutions, and two-phase dynamics with and without hydrodynamics. The predicted results agree very well with the analytical solution or numerical solution from traditional computational methods. These results show the accuracy and convergence of DOMM and justify it as an alternative computational method for solving soft matter dynamics. © 2023, CC BY-NC-ND.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

Soil Quality Evaluation for Cotton Fields in Arid Region Based On Graph Convolution Network

SSRN

引用

SSRN 2023年

作者： Fan, Xianglong Lv, Xin Zhang, Lifu Gao, Pan Zhang, Ze Duan, Long Cang, Hao Zhang, MengLi Zhang, Qiang Key Laboratory of Oasis Ecological Agriculture of Xinjiang Production and Construction Corps Agricultural College Shihezi University Shihezi Xinjiang832003 China National and Local Joint Engineering Research Center for Agricultural Big Data of Xinjiang Production and Construction Corps Agricultural College Shihezi University Shihezi Xinjiang832003 China Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China College of Information Science and Technology Shihezi University Shihezi Xinjiang832003 China

Accurate soil quality evaluation is an important prerequisite for improving soil management system and remediating soil pollution. However, traditional soil quality evaluation methods are cumbersome to calculate, low-efficient, and low-accurate, which often lead to large deviations in the evaluation results. This study aims to provide a new and accurate soil quality evaluation method based on graph convolution network (GCN).In this study, soil organic matter (SOM), alkaline hydrolyzable nitrogen (AN), available potassium (AK), salinity, and heavy metals (iron (Fe), copper (Cu), manganese (Mn), and zinc (Zn)) were determined and evaluated using the soil quality index (SQI). Then, the graph convolution network (GCN) was first introduced in soil quality evaluation to construct an evaluation model, and its evaluation results were compared with those of the SQI. Finally, the spatial distribution of the evaluation results of GCN model was displayed. The results showed that soil salinity had the largest coefficient of variation (86%), followed by soil heavy metals (67%) and nutrients (30.3%). That is, soil salinity had an obvious spatial heterogeneity. Heavy metals had significantly positive correlations and high homology, especially Cu and Zn. Soil nutrient contents gradually decreased from west to east in the study area, which was contrary to the change trend of soil salinity. The spatial variations of soil heavy metal contents were similar. The soil salinization and heavy metal pollution were at a low level in this area, and the soil nutrients and soil quality were at a high level. The evaluation accuracy of GCN model for soil salinity/heavy metals, soil nutrients, and soil quality were 0.91, 0.84, and 0.90, respectively. Therefore, the GCN model has a high accuracy and is feasible to be applied in soil quality evaluation. This study provides a new, simple, and highly accurate method for soil quality evaluation. © 2023, The Authors. All rights reserved.

关键词： Heavy metals

来源：评论

学校读者我要写书评

暂无评论

A Locality-Aware Energy-Efficient Accelerator for Graph Mining Applications

A Locality-Aware Energy-Efficient Accelerator for Graph Mini...

引用

IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： Pengcheng Yao Long Zheng Zhen Zeng Yu Huang Chuangyi Gui Xiaofei Liao Hai Jin Jingling Xue National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science and Engineering UNSW Sydney Australia

ISBN: (数字)9781728173832

ISBN: (纸本)9781728173849

Graph mining is becoming increasingly important due to the ever-increasing demands on analyzing complex structures in graphs. Existing graph accelerators typically hold most of the randomly-accessed data in an on-chip memory to avoid off-chip communications. However, graph mining exhibits substantial random accesses from not only vertex dimension but also edge dimension (with the latter being excessively more complex than the former), leading to significant degradations in terms of both performance and energy *** observe that the most random memory requests arising in graph mining come from accessing a small fraction of valuable (vertex and edge) data when handling real-world graphs. To exploit this extension locality with maximum parallelism, we architect GRAMER, the first graph mining accelerator. GRAMER contains a specialized memory hierarchy, where the valuable data (precisely identified through a cost-efficient heuristic) is permanently resident in a high-priority memory while others are maintained in a cache-like memory under a lightweight replacement policy. The specific pipelined processing units are carefully designed to maximize computational parallelism. GRAMER is also equipped with a work-stealing mechanism to reduce load imbalance. We have implemented GRAMER on a Xilinx Alveo U250 accelerator card. Compared with two state-of-the-art CPU-based graph mining systems, Fractal and RStream, running on a 14-core Intel E5-2680 v4 processor, GRAMER achieves not only considerable speedups (1.11 × ~ 129.95 ) but also significant energy savings (5.79 × ~ 678.34×)

关键词： Memory management Parallel processing Feature extraction Energy efficiency Fractals system-on-chip data mining

来源：评论

学校读者我要写书评

暂无评论

A Survey of Stochastic Computing in Energy-Efficient DNNs On-Edge

A Survey of Stochastic Computing in Energy-Efficient DNNs On...

引用

IEEE International Conference on big data and Cloud Computing (BdCloud)

作者： Danghui Wang Zhaoqing Wang Linfan Yu Ying Wu Jiaqi Yang Kuizhi Mei Jihe Wang Northwestern Polytechnical University National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Xi'an China Northwestern Polytechnical University Engineering Research Center of Embedded System Integration Ministry of Education Xi'an China Faculty of Electronic and Information Engineering Xi'an Jiaotong University Xi'an China

In recent years, "edge intelligent computing power deployment" has become a key and difficult problem in key areas such as system structure and artificial intelligence. Some independent decision-making scenario requires the edge devices to have the ability to handle high energy efficient and high throughput tasks. However, restricted by the traditional accurate computing mode and memory-computation separation structure, the edge devices often fail to provide the computing power guarantee of high throughput and high energy efficiency, which seriously hinders the edge intelligent deployment. This paper summarizes the new computing model integrating memory and computation of deploying stochastic circuits around memory, and constructs an edge intelligent system taking stochastic computing as a core from three levels of microstructure of circuit, architecture of near-memory stochastic computing and system-level software/hardware cooptimization. It strives to break through the power consumption and performant bottleneck of traditional computing model, and greatly improves the deploying ability of complex intelligent computing on edge equipment.

关键词： Power demand Computational modeling Architecture Stochastic processes Computer architecture Throughput Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：