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

2019 IEEE International Conference on Signal, information and Data processing, ICSIDP 2019

作者： Duan, Chenhui Tang, Linbo Li, Chen Wu, Chen Li, Cheng Zhao, Baojun Radar Research Lab School of Information and Electronics Beijing Institute of Technology Beijing100081 China Beijing Key Laboratory of Embedded Real-Time Information Processing Technology Beijing100081 China School of Computer Science North China University of Technology Beijing100144 China

ISBN: (纸本)9781728123455

With the rapid advancement of optical remote sensing (RS) satellites, RS video has replaced RS image as the main way to obtain information in orbit environment. However, the storage and transmission of on-orbit RS video faces enormous challenges: the contradiction between limited power, space and bandwidth and massive video data volume is becoming increasingly acute. To solve this problem, this paper proposes an effective implementation of spaceborne real-time RS video compression based on CPU+GPU heterogeneous framework. First, we propose a new rate control method based on HEVC for on-orbit RS video compression, which allocates less bitrate for low complexity code blocks (CBs) and more bitrate for high complexity CBs, which can improve the accuracy of rate control algorithm while ensuring compression quality. Then this paper makes full use of the CPU + GPU heterogeneous framework to speed up the whole compression processing. The experimental results show that the proposed compression framework realizes 200x real-time compression of 1080p spaceborne RS video with a PSNR greater than 38.7 dB. © 2019 IEEE.

关键词： Orbits

来源：评论

学校读者我要写书评

暂无评论

A Simple Analysis of Multimodal Data Fusion

A Simple Analysis of Multimodal Data Fusion

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Jiangchang Cheng Yinglong Dai Yao Yuan Hongli Zhu College of Information Science and Engineering Hunan Normal University Changsha China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China College of Liberal Arts and Sciences National University of Defense Technology Changsha China

ISBN: (数字)9781665403924

ISBN: (纸本)9781665403931

Multimodal data fusion has a long research history since audio-visual speech recognition, which is inspired by the McGurk effect. Because of the limited model capacity of the traditional methods, multimodal data fusion researches are not so popular for a period. Recently, the advances of deep learning techniques open up new opportunities for the multimodal data fusion field. However, there is still a great gap in multimodal data processing ability between artificial intelligence and human beings. Many problems in multimodal data processing are still necessary to be researched. In this work, we propose to gain an insight into the information fusion level and apply different information fusion strategy to different situations. We analyze the different situations of the multimodal data fusion process and divide them into two categories, including consistent information fusion and contradictory information fusion. We demonstrate some toy examples of the different cases of the multimodal data fusion process.

关键词： Deep learning Data privacy Toy manufacturing industry Data integration Speech recognition Security History

来源：评论

学校读者我要写书评

暂无评论

Profiling HPC Applications with Low Overhead and High Accuracy

Profiling HPC Applications with Low Overhead and High Accura...

引用

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

作者： Jingyuan Zhao Xin Liu Yao Liu Penglong Jiao Jinshuo Liu Wei Xue School of Data Science & Engineering East China Normal University Shanghai China School of Cyber Science and Engineering Wuhan University Wuhan China National Research Centre of Parallel Computer Engineering and Technology Beijing China Shanghai Key Laboratory of Multidimensional Information Processing East China Normal University Shanghai China Tsinghua University Beijing China

As the parallel scale of HPC applications represented by earth system models becomes larger and the computing cost becomes higher, the performance of HPC applications is increasingly critical. Profiling HPC applications accurately helps to model the applications and find the performance bottlenecks. However, due to the complexity of HPC applications, the diversity of programming languages, the differences of individual programming habits, and multiple architectures, accurate profiling becomes very tough. In this paper, we propose LPerf: a low-overhead and high-accuracy profiler for HPC applications. To reduce the profiling overhead and improve the profiling accuracy, we propose a preprocessing method which can automatically instrument with tunable granularity thus significantly reducing the run-time overhead of profiling, an aggregated caller-callee relationship which is used to locate relationship of functions efficiently, and a profiling-aware method which can precisely calculate running time of functions. The experimental results show that the error rate of profiling reaches 0.02%, and the overhead reaches 1.6%, in the earth system model named CAS-ESM. Compared with the baselines, the precision, accuracy, and overhead of LPerf have reached the state of the art.

关键词： Earth Analytical models Schedules computer languages Costs Error analysis Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Asymptotically optimal codebooks derived from generalised bent functions

arXiv

引用

arXiv 2020年

作者： Wang, Qiuyan Yan, Yang Wu, Chenhuang Zhao, Chun'e School of Computer Science and Technology Tiangong University Tianjin300387 China Provincial Key Laboratory of Applied Mathematics Putian University Putian Fujian351100 China School of Information Technology and Engineering Tianjin University of Technology and Education Tianjin300222 China Provincial Key Laboratory of Applied Mathematics Putian University College of Science China University of Petroleum Qingdao Shandong266555 China

Codebooks are required to have small inner-product correlation in many practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing. In general, it is difficult to construct optimal codebooks. In this paper, two kinds of codebooks are presented and proved to optimally optimal with respect to the welch bound. Additionally, the constructed codebooks in this paper have new parameters. Copyright © 2020, The Authors. All rights reserved.

关键词： Space time codes

来源：评论

学校读者我要写书评

暂无评论

A minimum spanning tree algorithm based on fuzzy weighted distance 5th

A minimum spanning tree algorithm based on fuzzy weighted di...

引用

5th Euro-China Conference on Intelligent Data Analysis and Applications, ECC 2018

作者： Sun, Lu Liang, Yong-quan Fan, Jian-cong Princeton University PrincetonNJ08544 United States College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China Provincial Key Laboratory for Information Technology of Wisdom Mining of Shandong Province Shandong University of Science and Technology Qingdao China Provincial Experimental Teaching Demonstration Center of Computer Shandong University of Science and Technology Qingdao China

ISBN: (纸本)9783030037659

The traditional minimum spanning tree clustering algorithm uses a simple Euclidean distance metric method to calculate the distance between two entities. For the processing of noise data, the similarity can’t be well described. In this regard, first of all, we integrate fuzzy set theory to improve, and propose a method with indeterminacy fuzzy distance measurement. In the distance metric method, fuzzy set theory is introduced to measure the differences between two entities. Moreover, the attributes are fuzzy weighted on this basis, which overcomes the shortcomings of the simple Euclidean distance measurement method. So, it not only has a good tolerance for data noise to solve the misclassification of noise information in the actual data, but also takes into account the difference of distinguishability contribution degree of attributes in classification. Thus, the accuracy of clustering is improved, and it also has significance in practical project application. Then, the proposed distance metric is applied into the traditional MST clustering algorithm. Compared with the traditional MST clustering algorithm and other classical clustering algorithms, the results show that the MST algorithm based on the new distance metric is more effective. © Springer Nature Switzerland AG 2019.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A kind of quaternary sequences of period 2pmqn and their linear complexity

arXiv

引用

arXiv 2020年

作者： Wang, Qiuyan Wu, Chenhuang Yang, Minghui Yan, Yang School of Computer Science and Technology Tiangong University Tianjin300387 China Provincial Key Laboratory of Applied Mathematics Putian University Putian Fujian351100 China School of Computer Science and Engineering University of Electronic Science and Technology of China ChengduSichuan611731 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100195 China School of Information Technology Engineering Tianjin University of Technology and Education Tianjin300222 China

Sequences with high linear complexity have wide applications in cryptography. In this paper, a new class of quaternary sequences over F4 with period 2pmqn is constructed using generalized cyclotomic classes. Results show that the linear complexity of these sequences attains the maximum. Copyright © 2020, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Matching Biomedical Ontologies with Long Short-Term Memory Networks

Matching Biomedical Ontologies with Long Short-Term Memory N...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Chao Jiang Xingsi Xue Intelligent Information Processing Research Center Fujian University of Technology Fuzhou Fujian China School of Computer Science and Mathematics Fujian University of Technology Fuzhou Fujian China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou Fujian China Guangxi Key Laboratory of Automatic Detecting Technology and Instruments Guilin University of Electronic Technology Guilin Guangxi China Fujian Key Lab for Automotive Electronics and Electric Drive Fujian University of Technology Fuzhou Fujian China

ISBN: (数字)9781728162157

ISBN: (纸本)9781728162164

Semantic Web (SW) has attracted the increasing attention of researchers, which facilitates people to link and handle various data. Ontology is the kernel technique of SW, and biomedical ontology is a state-of-art biomedical knowledge modeling technique, which formally defines the biomedical concepts and their relationships. However, the same biomedical concepts in different biomedical ontologies could be defined in various contexts or with different terms, which yields the biomedical ontology heterogeneity problem. It is crucial to find mapping among heterogeneity concepts of different biomedical ontologies for bridging the semantic gaps, which is the so-called biomedical ontology matching. Biomedical ontology matching problem is an open challenge due to the rich semantic meaning and the flexible representation on a biomedical concept. To address this challenging problem, in this work, it is regarded as a binary classification problem, and a Long Short-Term Memory Networks (LSTM)-based ontology matching technique is proposed to solve it. Our proposal improves the quality of the alignment by introducing the char-embedding technique, which takes into account the semantic and context information of concepts. The comparing results with OAEI's participants show the effectiveness of our proposal.

关键词： Ontologies Semantics Logic gates Training Human anatomy Proposals Biomedical measurement

来源：评论

学校读者我要写书评

暂无评论

Identify influential spreaders in asymmetrically interacting multiplex networks

arXiv

引用

arXiv 2021年

作者： Zeng, Qi Liu, Ying Pan, Liming Tang, Ming The School of Computer Science Southwest Petroleum University Chengdu610500 China Big Data Research Center University of Electronic Science and Technology of China Chengdu611731 China The School of Computer Science and Technology Nanjing Normal University Nanjing210023 China School of Physics and Electronic Science East China Normal University Shanghai200241 China Shanghai Key Laboratory of Multidimensional Information Processing East China Normal University Shanghai200241 China

Identifying the most influential spreaders is important to understand and control the spreading process in a network. As many real-world complex systems can be modeled as multilayer networks, the question of identifying important nodes in multilayer network has attracted much attention. Existing studies focus on the multilayer network structure, while neglecting how the structural and dynamical coupling of multiple layers influence the dynamical importance of nodes in the network. Here we investigate on this question in an information-disease coupled spreading dynamics on multiplex networks. Firstly, we explicitly reveal that three interlayer coupling factors, which are the two-layer relative spreading speed, the interlayer coupling strength and the two-layer degree correlation, significantly impact the spreading influence of a node on the contact layer. The suppression effect from the information layer makes the structural centrality on the contact layer fail to predict the spreading influence of nodes in the multiplex network. Then by mapping the coevolving spreading dynamics into percolation process and using the message-passing approach, we propose a method to calculate the size of the disease outbreaks from a single seed node, which can be used to estimate the nodes’ spreading influence in the coevolving dynamics. Our work provides insights on the importance of nodes in the multiplex network and gives a feasible framework to investigate influential spreaders in the asymmetrically coevolving dynamics. Copyright © 2021, The Authors. All rights reserved.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Optimize SPL test cases with adaptive simulated annealing genetic algorithm 19

Optimize SPL test cases with adaptive simulated annealing ge...

引用

2019 ACM Turing Celebration Conference - China, ACM TURC 2019

作者： Yan, Liu Hu, Wenxin Han, Longzhe College of Computer and Software Engineering East China Normal University Shanghai China JiangXi Province Key Laboratory of Water Information Cooperative Sensing and Intelligent Processing Nanchang Institute of Technology Nanchang China

ISBN: (纸本)9781450371582

In Software Product Line (SPL) testing, reduced test suite with high coverage is useful for early features interaction detection. sGA (simplified genetic algorithm) and SAGA(simulated annealing genetic algorithm) can generate high coverage test suite. However, small probability mutations in updating test suite may reduce search efficiency and thus miss better solutions. An improved test cases generation method based on ASAGA (Adaptive simulated annealing genetic algorithm) is proposed. Experiments on SPLOT (Software Product Lines Online Tools) feature models show that the proposed hybrid ASAGA method can ensure local optimization accuracy and achieve smaller-size test suite with higher coverage. © 2019 Association for Computing Machinery.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Parallel architecture design of genetic algorithms on HPC platform 19

Parallel architecture design of genetic algorithms on HPC pl...

引用

2019 ACM Turing Celebration Conference - China, ACM TURC 2019

ISBN: (纸本)9781450371582

In the genetic algorithm for compute-intensive task, the execution time of fitness function increases rapidly. As a result, when the population size or evolution population increases, the convergence speed of the algorithm is very slow. Based on the supercomputer platform, this paper designs and implements a parallel genetic algorithm architecture with dynamic migration strategy. A hybrid parallel genetic algorithm based on "coarse-grained and master-slave" two-level parallel architecture is proposed. The proposed architecture is composed of hybrid parallel programming models. Compared with the traditional genetic algorithm implemented on the simple MPI architecture, the proposed structure achieves better performance. Experiments show that the convergence speed of the algorithm is significantly improved. © 2019 Association for Computing Machinery.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：