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

International Conference on Image, Vision and Computing (ICIVC)

作者： Zhe Luo You Yu Daijun Zhang Shijie Feng Huapeng Yu Yongxin Chang Wei Shen School of Electrical Engineering and Information Southwest Petroleum University Chengdu China College of Environment and Ecology Chongqing University Big Data Application Center of Ecology and Environment of Chongqing Chongqing China College of Environment and Ecology Chongqing University State Key Laboratory of Coal Mine Disaster Dynamics and Control Chongqing University Chongqing China College of Information Science and Engineering Chengdu University Chengdu China Chongqing Zhixing Shulian Intelligent Technology Co. Ltd Chongqing China

ISBN: (数字)9781728166612

ISBN: (纸本)9781728112350

Conditional Random Field is a discriminative model for time series data. In this paper, we propose an improved CRF and apply it to the task of air quality inference. Different from the classical CRF, our linear chain CRF is a supervised learning based on the deep convolution neural network, which has a strong learning ability and fast processing speed for the engineering big data. Specifically, we model the state feature function and the state transition feature function with deep convolutional neural network. The parameter space can store more feature expressions learned from a large number of data. For the state transition feature function of linear conditional random field, we add the influence of input sequence on this function. Through the modelling and learning both vertex features and edge features from data, we obtain a more powerful and more efficient CRF. Experiments on natural language and air quality data show our CRF can achieve higher accuracy.

关键词： Air quality Convolution Neural networks Indexes Electronic mail data models Biological system modeling

来源：评论

学校读者我要写书评

暂无评论

LAP-Net: Level-Aware Progressive Network for Image Dehazing

LAP-Net: Level-Aware Progressive Network for Image Dehazing

引用

International Conference on Computer Vision (ICCV)

作者： Yunan Li Qiguang Miao Wanli Ouyang Zhenxin Ma Huijuan Fang Chao Dong Yining Quan School of Computer Science and Technology Xidian Univeristy China Xi’an Key Laboratory of Big Data and Intelligent Vision China SenseTime Computer Vision Research Group The University of Sydney Australia SChinese Academy of Science Shenzhen Institutes of Advanced Technology China

ISBN: (数字)9781728148038

ISBN: (纸本)9781728148045

In this paper, we propose a level-aware progressive network (LAP-Net) for single image dehazing. Unlike previous multi-stage algorithms that generally learn in a coarse-to-fine fashion, each stage of LAP-Net learns different levels of haze with different supervision. Then the network can progressively learn the gradually aggravating haze. With this design, each stage can focus on a region with specific haze level and restore clear details. To effectively fuse the results of varying haze levels at different stages, we develop an adaptive integration strategy to yield the final dehazed image. This strategy is achieved by a hierarchical integration scheme, which is in cooperation with the memory network and the domain knowledge of dehazing to highlight the best-restored regions of each stage. Extensive experiments on both real-world images and two dehazing benchmarks validate the effectiveness of our proposed method.

关键词： Image restoration Atmospheric modeling Scattering Entropy Degradation Cameras Fuses

来源：评论

学校读者我要写书评

暂无评论

Genome Sequences Provide Insights into the Reticulate Origin and Unique Traits of Woody Bamboos

引用

Molecular Plant 2019年第10期12卷 1353-1365页

作者： Zhen-Hua Guo Peng-Fei Ma Guo-Qian Yang Jin-Yong Hu Yun-Long Liu En-Hua Xia Mi-Cai Zhong Lei Zhao Gui-Ling Sun Yu-Xing Xu You-Jie Zhao Yi-Chi Zhang Yu-Xiao Zhang Xue-Mei Zhang Meng-Yuan Zhou Ying Guo Cen Guo Jing-Xia Liu Xia-Ying Ye Yun-Mei Chen Yang Yang Bin Han Choun-Sea Lin Ying Lu De-Zhu Li Germplasm Bank of Wild Species Kunming Institute of BotanyChinese Academy of SciencesKunmingYunnan 650201China Key Laboratory for Plant Diversity and Biogeography in East Asia Kunming Institute of BotanyChinese Academy of SciencesKunmingYunnan 650201China State Key Laboratory of Tea Plant Biology and Utilization Anhui Agricultural UniversityHefeiAnhui 230036China Kunming College of Life Science University of Chinese Academy of SciencesKunmingYunnan 650201China lnstitute of Plant Stress Biology State Key Laboratory of Cotton BiologyDepartment of BiologyHenan UniversityKaifengHenan 475001China College of Big Data and Intelligent Engineering Southwest Forestry UniversityKunmingYunnan 650224China Yunnan Academy of Biodiversity Southwest Forestry UniversityKunmingYunnan 650224China National Center for Gene Research Shanghai Institute of Plant Physiology and EcologyShanghai Institutes for Biological SciencesChinese Academy of SciencesShanghai 200032China Agricultural Biotechnology Research Center Academia SinicaTaipei College of Fisheries and Life Science Shanghai Ocean UniversityShanghai 201306China

Polyploidization is a major driver of speciation and its importance to plant evolution has been well *** comprise one diploid herbaceous and three polyploid woody lineages,and are members of the only major subfamily in grasses that diversified in forests,with the woody members having a tree-like lignified *** this study,we generated four draft genome assemblies of major bamboo lineages with three different ploidy levels(diploid,tetraploid,and hexaploid).We also constructed a high-density genetic linkage map for a hexaploid species of bamboo,and used a linkage-map-based strategy for genome assembly and identification of subgenomes in *** phylogenomic analyses using a large dataset of syntenic genes with expected copies based on ploidy levels revealed that woody bamboos originated subsequent to the divergence of the herbaceous bamboo lineage,and experienced complex reticulate evolution through three independent allopolyploid events involving four extinct diploid ancestors.A shared but distinct subgenome was identified in all polyploid forms,and the progenitor of this subgenome could have been critical in ancient polyploidizations and the origin of woody *** genetic clues to the unique flowering behavior and woody trait in bamboos were also *** together,our study provides significant insights into ancient reticulate evolution at the subgenome level in the absence of extant donor species,and offers a potential model scenario for broad-scale study of angiosperm origination by allopolyploidization.

关键词： Bambusoideae polyploidization comparative genomics subgenome evolution flowering

来源：评论

学校读者我要写书评

暂无评论

Prediction Research on the Energy Consumption of Public Building Based on MLR-BP Neural Network

Prediction Research on the Energy Consumption of Public Buil...

引用

Chinese Automation Congress (CAC)

作者： Jingjian Yang Yuning Amy Xie Hongyan Ma College of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China The Madeira School McLean VA United States Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing University of Civil Engineering and Architecture Beijing China

Accompanying the constant development of data mining technology and neural network, the application of computer technology in energy consumption prediction of large public buildings is the trend of green buildings and intelligent life in the field of engineering. In this paper, a new energy consumption prediction algorithm based on MLR-BP is proposed, which solves the issue of current energy consumption algorithm: the massive amount of calculation and the low prediction accuracy. Firstly, factors that affect building energy consumption are categorized as external factors (meteorological factors) and internal factors. In addition, the multiple linear regression is used to model the external factors, and the influencing factors with high correlation are screened out. Then, the selected external factors and internal factors are combined into the training of BP neural network to obtain a new energy consumption prediction model. The simulation results show that in comparison with the BP neural network, the proposed prediction algorithm in this paper can predict the building energy consumption more accurately.

关键词： Energy consumption Buildings Neural networks Predictive models Temperature Linear regression Mathematical model

来源：评论

学校读者我要写书评

暂无评论

A Method of Searching for Optimal Coalition Structure for Solving Resource Scheduling Problem of Overall Load Balancing in Edge Computing Environments

引用

Journal of Physics: Conference Series 2020年第3期1550卷

作者： Hu Yanan Li Chunsheng Zhang Kejia School of Computer & Information Technology Northeast Petroleum University Daqing 163318 (PR China) Heilongjiang Provincial Key Laboratory of Oil Big data & Intelligent Analysis Daqing 163318 (PR China)

The cooperative computing resource scheduling problem in the distributed computing environment is usually transformed into the problem about how to find the optimal coalition structure. However, affected by factors such as high node density and large number of concurrent tasks in edge computing environments, it is difficult to formulate resource scheduling schemes for overall load balancing in a large strategic space by traditional methods. In order to solve this problem, we proposed a method of searching for optimal coalition structure based on discrete particle swarm optimization (DPSO). Firstly, we converted the resource scheduling problem of edge computing into an optimization problem model, constructed a new structure of coalition structure to express the resource scheduling scheme, and gave key elements such as optimization objectives, decision variables, and constraint conditions. Secondly, we improved DPSO and designed M-ary discrete particle swarm optimization (MDPSO): improved particle state determination method for adapting to the new expression of the coalition structure, and proposed a power series-based inertia weight computing method to improve the optimization speed and the optimal solution quality. Finally, we simulated real application scenarios and designed comparative experiments on the optimization speed, the optimal solution quality, stability, etc., which verifies that the method proposed in this paper has obvious advantages in solving the resource scheduling problem of overall load balancing in edge computing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DUE Distribution and Pairing in D2D Communication

DUE Distribution and Pairing in D2D Communication

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Weifeng Lu Xiaoqiang Ren Jia Xu Siguang Chen Lijun Yang Jian Xu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China College of IoT Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China

The D2D (Device-to-Device) communication has been very popular as it is a promising and low-cost solution to reduce the burden on the cellular network. However, there are rare concerns about the distribution and pairing of DUEs(D2D user equipments), which have a significant impact on QoS (Quality of Service) of D2D communication. In this paper, we propose a novel algorithm based on the coalitional game to optimally adjust the distribution of DUEs. The proposed algorithm aims to form the optimal coalition structure, which achieves a balance between the throughput and power consumption of each coalition, obtaining the enhanced QoS of D2D. We show that our algorithm is superior to the benchmark models in terms of the throughput and energy efficiency of the DUE coalition. To further improve the QoS, we also propose a method to predict and maximize the pairing probability of DUEs. The proposed prediction method adopts the Logistic Regression to model the global pairing probability according to the communication parameters of DUEs. Experimental results show that the proposed prediction method is significantly superior to the benchmark methods in terms of prediction accuracy. In addition, the pairing probability maximization algorithm proposed also significantly improves the pairing probability.

关键词： Device-to-device communication Throughput Power demand Fading channels Games Quality of service Time division multiple access

来源：评论

学校读者我要写书评

暂无评论

Adaptive Teacher-and-Student Model for Heterogeneous Domain Adaptation

Adaptive Teacher-and-Student Model for Heterogeneous Domain ...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yunyun Wang Xuzhang Chen Songcan Chen Hui Xue College of Computer Science Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts & Telecommunications Nanjing China College of Computer Science & Technology/AI MIIT Key Laboratory of Pattern Analysis and Machine Intelligence Nanjing University of Aeronautics & Astronautics Nanjing China College of Computer Science and Engineering Southeast University Nanjing China

In heterogeneous domain adaptation (HDA), since the feature spaces of the source and target domains are different, knowledge transfer from the source to the target domain is really challenging. How to align the different feature spaces and then adaptively transfer the related knowledge is critical for HDA. In this paper, we develop an adaptive teacher-and-student model for heterogeneous domain adaptation (AtsHDA). In AtsHDA, the source domain as a teacher and the target domain as a student are aligned or co-adapted to each other first, so that their correlation can be maximized. Then the target domain adaptively learns from the source domain. Specifically, there is a balance between the learning by the target domain itself and the instruction from the source domain. That is, when the guidance from the source domain is helpful for learning, the learning of target classifier emphasizes the instruction of source knowledge, and considers its own knowledge more, otherwise. Further, an ensemble method is designed to decide such a balance. Finally, empirical results show that AtsHDA can achieve competitive results compared with the state-of-arts.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bidirectional LSTM-CRF for biomedical named entity recognition 14

Bidirectional LSTM-CRF for biomedical named entity recogniti...

引用

14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2018

作者： Yang, Xuemin Gao, Zhihong Li, Yongmin Pan, Chuandi Yang, Ronggen Gong, Lejun Yang, Geng Jiangsu Key Laboratory of Big Data Security Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210003 China Zhejiang Engineering Research Center of Intelligence Medicine Wenzhou325035 China Faculty Intelligent Science and Control Engineering Jinling Institute of Technology Nanjing211169 China

ISBN: (纸本)9781538680971

Bio-medical entity recognition extracts significant entities, for instance cells, proteins and genes, which is an arduous task in an automatic system that mine knowledge in bioinformatics texts. In this thesis, we utilized a bidirectional long short-term memory (Bi-LSTM) combined with conditional random fields (CRFs) approach to automatically obtain word representation, obliterated the need for a marvelous number of feature engineering tasks. The consequences of this experiment represent the word representation method can effectually acquire potential semantic information. Without relying on any artificial features, the result on the test dataset obtained 76.81 % F-score. Therefore, the proposed method is expected to advance biomedical text mining in bioinformatics entity recognition. © 2018 IEEE.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Efficient EK-means: Extended K-means Clustering for Categorical data with High Processing Speed

引用

Journal of Physics: Conference Series 2020年第1期1584卷

作者： Chen Xi Peng Shuo HunanProvincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of computer and communication engineering Changsha University of Science&technology No. 960 Wanjiali South Road Hunan Province China

The typical representative of the hard clustering algorithm, K-means, is one of the fastest processing algorithms with good scalability. However, it cannot deal with categorical attributes, which is one of the important indicators to measure the pros and cons. Due to the lack of processing capabilities on categorical attributes, k-means has a large limit on data processing capabilities. This paper proposes a clustering algorithm extends from K-means. This algorithm introduces the concept of a Pseudo-mean distance calculation formula and a counting-table so that categorical attributes can be processed while reducing the time cost as much as possible. Experimental results illustrate the proposed Pseudo-means can extend the processing range of k-means to category-type data, and the counting table also effectively reduces the time cost.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Numerical analysis of the magnetic field impact on hydrothermal characteristics of a microchannel heatsink with Fe 3 O 4 ferrofluid and various pin-fin shapes” [J. Magn. Magn. Mater. 585 (2023) 171102]

引用

Journal of Magnetism and Magnetic Materials 2024年 610卷

作者： Tao Hai Kamal Sharma Riyam K. Marjan Babak Farhang Mohamed H. Mahmoud Hassan Fouad Walid El-Shafai School of Computer and Information Qiannan Normal University for Nationalities Duyun Guizhou 558000 China School of Electronics and Information Engineering Ankang University China State Key Laboratory of Public Big Data Guizhou University Guizhou Guiyang 550025 China Institute of Engineering and Technology GLA University Mathura UP 281406 India Department of Intelligent Medical Systems Al-Mustaqbal University College Babylon 51001 Iraq Department of Energy Technology Aalborg University Denmark Department of Biochemistry College of Science King Saud University Riyadh Saudi Arabia Biomedical Engineering Department Faculty of Engineering Helwan University Cairo P.O. Box 11795 Egypt Department Electronics and Electrical Communications Engineering Faculty of Electronic Engineering Menoufia University Menouf 32952 Egypt

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：