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

Metal-organic-gel method derived (TiZrNbTa)C high-entropy nanopowders and ceramics with high performance

Ceramics International 2025年

作者： Didi Cao Meiling Yu Qizheng Dong Lin Zhao Peng Wang Hongkang Wei Zhiyang Lv Xunyan Tan Jian Gu Yinsheng Li Zhipeng Xie Chang-an Wang Jiangxi Key Laboratory of Advanced Ceramic Materials School of Materials Science and Engineering Jingdezhen Ceramic University Jingdezhen 333403 China College of Materials Science and Engineering Nanjing Tech University Nanjing 211816 China Zhejiang Key Laboratory of Data-Driven High-Safety Energy Materials and Applications Ningbo Key Laboratory of Special Energy Materials and Chemistry Ningbo Institute of Materials Technology and Engineering Chinese Academy of Sciences Ningbo 315201 China State Key Lab of New Ceramics and Fine Processing School of Materials Science and Engineering Tsinghua University Beijing 100084 China

Multi-component high-entropy carbide ceramics have emerged as a promising class of materials due to their exceptional mechanical performance, thermal stability, and chemical corrosion resistance. In this study, we employed pyromellitic acid as the carbon source and developed a metal-organic-gel method to synthesize (TiZrNbTa)C high-entropy precursors. Through carbothermal reduction at relatively low temperature of 1500°C, homogeneous single-phase face-centered cubic solid solution were obtained successfully. Subsequently, the carbide ceramics were fabricated using SPS. Characterization results demonstrate that the synthesized powders exhibit quasi-spherical morphology with uniform particle size distribution and average diameter of 57 nm. The SPS-sintered (TiZrNbTa)C high-entropy ceramics demonstrate remarkable performance, achieving relative density as high as 99.8% with uniform microstructure and particle size of 0.44 ± 0.1 μm. The material exhibited outstanding mechanical performance, with Vickers hardness and fracture toughness reaching 21.82 ± 1.5 GPa and 4.565 ± 0.5 MPa·m 1/2 , respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Feature re-learning with data augmentation for video relevance prediction

arXiv

引用

arXiv 2020年

作者： Dong, Jianfeng Wang, Xun Zhang, Leimin Xu, Chaoxi Yang, Gang Li, Xirong College of Computer and Information Engineering Zhejiang Gongshang University Hangzhou310035 China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China AI & Media Computing Lab School of Information Renmin University of China Beijing100872 China

Predicting the relevance between two given videos with respect to their visual content is a key component for content-based video recommendation and retrieval. Thanks to the increasing availability of pre-trained image and video convolutional neural network models, deep visual features are widely used for video content representation. However, as how two videos are relevant is task-dependent, such off-the-shelf features are not always optimal for all tasks. Moreover, due to varied concerns including copyright, privacy and security, one might have access to only pre-computed video features rather than original videos. We propose in this paper feature re-learning for improving video relevance prediction, with no need of revisiting the original video content. In particular, re-learning is realized by projecting a given deep feature into a new space by an affine transformation. We optimize the re-learning process by a novel negative-enhanced triplet ranking loss. In order to generate more training data, we propose a new data augmentation strategy which works directly on frame-level and video-level features. Extensive experiments in the context of the Hulu Content-based Video Relevance Prediction Challenge 2018 justify the effectiveness of the proposed method and its state-of-the-art performance for content-based video relevance prediction. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

data augmentation in microscopic images for material data mining

引用

npj Computational Materials 2020年第1期6卷 601-609页

作者： Boyuan Ma Xiaoyan Wei Chuni Liu Xiaojuan Ban Haiyou Huang Hao Wang Weihua Xue Stephen Wu Mingfei Gao Qing Shen Michele Mukeshimana Adnan Omer Abuassba Haokai Shen Yanjing Su Beijing Advanced Innovation Center for Materials Genome Engineering University of Science and Technology BeijingBeijing 100083China School of Computer and Communication Engineering University of Science and Technology BeijingBeijing 100083China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing 100083China Institute for Advanced Materials and Technology University of Science and Technology BeijingBeijing 100083China School of Materials Science and Engineering University of Science and Technology BeijingBeijing 100083China School of Materials Science and Technology Liaoning Technical UniversityLiaoning 114051China The Institute of Statistical Mathematics Research Organization of Information and SystemsTachikawaTokyo 190-8562Japan National Intellectual Property Administration Beijing 100088China Faculty of Engineering Sciences University of BurundiBujumburaBurundi Faculty of Engineering and Technology Palestine Technical University–KadoorieTulkaremPalestine College of Information Science and Engineering China University of PetroleumBeijingChina Key Lab of Petroleum Data Mining China University of PetroleumBeijingChina

Recent progress in material data mining has been driven by high-capacity models trained on large ***,collecting experimental data(real data)has been extremely costly owing to the amount of human effort and expertise ***,we develop a novel transfer learning strategy to address problems of small or insufficient *** strategy realizes the fusion of real and simulated data and the augmentation of training data in a data mining *** a specific task of grain instance image segmentation,this strategy aims to generate synthetic data by fusing the images obtained from simulating the physical mechanism of grain formation and the“image style”information in real *** results show that the model trained with the acquired synthetic data and only 35%of the real data can already achieve competitive segmentation performance of a model trained on all of the real *** the time required to perform grain simulation and to generate synthetic data are almost negligible as compared to the effort for obtaining real data,our proposed strategy is able to exploit the strong prediction power of deep learning without significantly increasing the experimental burden of training data preparation.

关键词： mining instance competitive

来源：评论

学校读者我要写书评

暂无评论

Threshold and Deadline Effect in Crowdfunding 7

Threshold and Deadline Effect in Crowdfunding

引用

7th International Conference on Information Technology and Quantitative Management (ITQM) - Information Technology and Quantitative Management Based on Artificial Intelligence

作者： Song, Yan Tian, Xin Luo, Chunlin Chinese Acad Sci Res Ctr Fictitious Econ & Data Sci Beijing 100190 Peoples R China Univ Chinese Acad Sci Sch Econ & Management Beijing 100190 Peoples R China Chinese Acad Sci Key Lab Big Data Min & Knowledge Management Beijing 100190 Peoples R China Jiangxi Univ Finance & Econ Sch Informat Technol Nanchang 330013 Jiangxi Peoples R China

The deadline effect and threshold effect are common in product development and group buying. We consider these two effects also exist in crowdfunding, affecting the crowdfunding performance in the future. We conduct an empirical study using a dataset from *** to examine these two effects and their interactive relationship on the following crowdfunding performance. We find the threshold effect exists in crowdfunding and has a positive influence on the following contribution behaviour. The deadline effect also can stimulate the crowdfunding behaviour via limited fundraising time. Furthermore, we find the threshold effect and deadline effect are complements that increase the amount pledged. (C) 2020 The Authors. Published by Elsevier B.V.

关键词： crowdfunding performance threshold effect deadline effect interactive effect

来源：评论

学校读者我要写书评

暂无评论

Structure-aware random fourier kernel for graphs 21

Structure-aware random fourier kernel for graphs

引用

Proceedings of the 35th International Conference on Neural Information Processing Systems

作者： Jinyuan Fang Qiang Zhang Zaiqiao Meng Shangsong Liang School of Computer Science and Engineering Sun Yat-sen University China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Hangzhou Innovation Center Zhejiang University China and College of Computer Science and Technology Zhejiang University China and AZFT Knowledge Engine Lab China School of Computing Science University of Glasgow United Kingdom and Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates School of Computer Science and Engineering Sun Yat-sen University China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China and Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates

ISBN: (纸本)9781713845393

Gaussian Processes (GPs) define distributions over functions and their generalization capabilities depend heavily on the choice of kernels. In this paper, we propose a novel structure-aware random Fourier (SRF) kernel for GPs that brings several benefits when modeling graph-structured data. First, SRF kernel is defined with a spectral distribution based on the Fourier duality given by the Bochner's theorem, transforming the kernel learning problem to a distribution inference problem. Second, SRF kernel admits a random Fourier feature formulation that makes the kernel scalable for optimization. Third, SRF kernel enables to leverage geometric structures by taking subgraphs as inputs. To effectively optimize GPs with SRF kernel, we develop a variational EM algorithm, which alternates between an inference procedure (E-step) and a learning procedure (M-step). Experimental results on five real-world datasets show that our model can achieve state-of-the-art performance in two typical graph learning tasks, i.e., object classification and link prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

XTQA: Span-Level Explanations for Textbook Question Answering

arXiv

引用

arXiv 2020年

作者： Ma, Jie Chai, Qi Liu, Jun Yin, Qingyu Wang, Pinghui Zheng, Qinghua Ministry of Education of Key Lab for Intelligent Networks and Network Security School of Cyber Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering The School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China Amazon United States

Textbook Question Answering (TQA) is the task of correctly answering diagram or non-diagram questions given large multi-modal contexts consisting of abundant essays and diagrams. In real-world scenarios, an explainable TQA system plays a key role in deepening humans’ understanding of learned knowledge. However, there is no work to investigate how to provide explanations currently. To address this issue, we devise a novel architecture towards span-level eXplanations for TQA (XTQA). In this paper, spans are the combinations of sentences within a paragraph. The key idea is to consider the entire textual context of a lesson as candidate evidence, and then use our proposed coarse-to-fine grained Explanation Extracting (EE) algorithm to narrow down the evidence scope and extract the span-level explanations with varying lengths for answering different questions. The EE algorithm can also be integrated into other TQA methods to make them explainable and improve the TQA performance. Experimental results show that XTQA obtains the best overall explanation result (mIoU) of 52.38% on the first 300 questions of CK12-QA test splits, demonstrating the explainability of our method (non-diagram: 150 and diagram: 150). The results also show that XTQA achieves the best TQA performance of 36.46% and 36.95% on the aforementioned splits respectively. We have released our code in https://***/dr-majie/*** Codes 68T07 Copyright © 2020, The Authors. All rights reserved.

关键词： Textbooks

来源：评论

学校读者我要写书评

暂无评论

Learning Two-Stream CNN for Multi-Modal Age-related Macular Degeneration Categorization

arXiv

引用

arXiv 2020年

作者： Wang, Weisen Li, Xirong Xu, Zhiyan Yu, Weihong Zhao, Jianchun Ding, Dayong Chen, Youxin The MoE Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing100872 China Aimc Lab School of Information Renmin University of China Beijing100872 China Vistel Ai Lab Visionary Intelligence Ltd. Beijing100872 China The Key Lab of Ocular Fundus Disease Chinese Academy of Medical Sciences Dept. of Ophthalmology Peking Union Medical College Hospital Beijing100730 China

This paper tackles automated categorization of Agerelated Macular Degeneration (AMD), a common macular disease among people over 50. Previous research efforts mainly focus on AMD categorization with a single-modal input, let it be a color fundus photograph (CFP) or an OCT B-scan image. By contrast, we consider AMD categorization given a multi-modal input, a direction that is clinically meaningful yet mostly unexplored. Contrary to the prior art that takes a traditional approach of feature extraction plus classifier training that cannot be jointly optimized, we opt for end-to-end multi-modal Convolutional Neural Networks (MM-CNN). Our MM-CNN is instantiated by a two-stream CNN, with spatially-invariant fusion to combine information from the CFP and OCT streams. In order to visually interpret the contribution of the individual modalities to the final prediction, we extend the class activation mapping (CAM) technique to the multi-modal scenario. For effective training of MM-CNN, we develop two data augmentation methods. One is GAN-based CFP/OCT image synthesis, with our novel use of CAMs as conditional input of a high-resolution image-to-image translation GAN. The other method is Loose Pairing, which pairs a CFP image and an OCT image on the basis of their classes instead of eye identities. Experiments on a clinical dataset consisting of 1,094 CFP images and 1,289 OCT images acquired from 1,093 distinct eyes show that the proposed solution obtains better F1 and Accuracy than multiple baselines for multimodal AMD categorization. Code and data are available at https://***/li-xirong/mmc-amd. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Poisoning attack against estimating from pairwise comparisons

arXiv

引用

arXiv 2021年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Big Data Mining and Knowledge Management The School of Economics and Management University of Chinese Academy of Sciences Beijing100049 China

As pairwise ranking becomes broadly employed for elections, sports competitions, recommendation, information retrieval and so on, attackers have strong motivation and incentives to manipulate or disrupt the ranking list. They could inject malicious comparisons into the training data to fool the target ranking algorithm. Such a technique is called "poisoning attack" in regression and classification tasks. In this paper, to the best of our knowledge, we initiate the first systematic investigation of data poisoning attack on the pairwise ranking algorithms, which can be generally formalized as the dynamic and static games between the ranker and the attacker, and can be modeled as certain kinds of integer programming problems mathematically. To break the computational hurdle of the underlying integer programming problems, we reformulate them into the distributionally robust optimization (DRO) problems, which are computational tractable. Based on such DRO formulations, we propose two efficient poisoning attack algorithms and establish the associated theoretical guarantees including the existence of Nash equilibrium and the generalization ability bounds. The effectiveness of the suggested poisoning attack strategies is demonstrated by a series of toy simulations and several real data experiments. These experimental results show that the proposed methods can significantly reduce the performance of the ranker in the sense that the correlation between the true ranking list and the aggregated results with toxic data can be decreased dramatically. © 2021, CC BY-NC-ND.

关键词： Toys

来源：评论

学校读者我要写书评

暂无评论

Triplet Deep Subspace Clustering via Self-Supervised data Augmentation

Triplet Deep Subspace Clustering via Self-Supervised Data Au...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Xianzhen Li Haijun Zhang Yi Yang Shuicheng Yan Meng Wang School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China School of Computer Science and Technology Soochow University Suzhou China Harbin Institute of Technology (Shenzhen) Shenzhen China Centre for Artificial Intelligence University of Technology Sydney Sydney NSW Australia Sea AI Lab (SAIL) & National University of Singapore Singapore

ISBN: (纸本)9781665423991

Deep subspace clustering (DSC) with the auto-encoder and self-expression layer is of great concern due to encouraging performance. However, existing methods usually adopt a “single-task” strategy based on a single dataset, without considering other related tasks or data. As such, they cannot discover other useful information to improve the clustering task. Besides, the local structure preservation of the latent codes in mapping is usually ignored. In this paper, we therefore present an effective “multi-task” strategy via the self-supervised data augmentation, and propose a new end-to-end trainable Triplet Deep Subspace Clustering Network (TDSC-net). Specifically, TDSC-net firstly generates triplet data (i.e., anchor, positive and negative data) from input data by a spectral clustering module and a self-supervised data augmentation module. This can enable it to inherit the merits of self-supervised learning and multitask learning implicitly. After that, TDSC-net builds a triplet deep autoencoder network with a self-expression layer, which takes the triplet data as input, where they share the common network layers (i.e., autoencoder and self-expression layers) over the triple tasks for complementary learning and mutual supervision. A triplet loss is also included to retain the local information of deep latent codes, which will also benefit the self-expression. Furthermore, TDSC-net separates the self-expression layer from decoding process to improve the efficiency of reconstruction. Extensive results on several public datasets demonstrate the effectiveness of our triplet-task DSC strategy.

关键词： Codes Conferences Multitasking Decoding data mining Task analysis

来源：评论

学校读者我要写书评

暂无评论

A Markov Traffic Model for Signalized Traffic Networks Based on Bayesian Estimation

引用

IFAC-PapersOnLine 2020年第2期53卷 15029-15034页

作者： S.Y. Liu S. Lin Y.B. Wang B. De Schutter W.H.K. Lam School of Computer Science and Technology University of Chinese Academy of Sciences Beijing 100089 China Key Lab of Big Data Mining and Knowledge Management Chinese Academy of Sciences College of Civil Engineering and Architecture Zhejiang University PR China Delft Center for Systems and Control Delft University of Technology The Netherlands Department of Civil and Structural Engineering The Hong Kong Polytechnic University Hong Kong SAR China

In order to better understand the stochastic dynamic features of signalized traffic networks, we propose a Markov traffic model to simulate the dynamics of traffic link flow density for signalized urban traffic networks with demand uncertainty. In this model, we have four different state modes for the link according to different congestion levels of the link. Each link can only be in one of the four link state modes at any time, and the transition probability from one state to the other state is estimated by Bayesian estimation based on the distributions of the dynamic traffic flow densities, and the posterior probabilities. Therefore, we use a first-order Markov Chain Model to describe the dynamics of the traffic flow evolution process. We illustrate our approach for a small traffic network. Compared with the data from the microscopic traffic simulator SUMO, the proposed model can estimate the link traffic densities accurately and can give a reliable estimation of the uncertainties in the dynamic process of signalized traffic networks.

关键词： Markov traffic model Traffic signals Bayesian Urban traffic network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：