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

International Conference on Computer Supported Cooperative Work in Design

作者： Enchao Zhang Weidong Liu Shi Liu Yan Cao College of Computer Science Inner Mongolia University China Institute of Scientific and Technical Information of China China National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Social Computing and Data Processing China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

Intellectual property transactions have shown a strong growth momentum in recent years, but the patent transaction market has been plagued by the matching degree of consumers and sellers, resulting in frequent problems such as low patent transformation efficiency and poor transaction quality. This paper proposes a method of recommending patents to consumers by experts to improve the environment of patent transactions. Through the analysis of the past transaction information of the patent, the effective path information of the target is extracted. The graph neural network is used to describe the characteristics and semantics among experts, patents and consumers, and then capture the potential weight among them through the common attention mechanism, and then dynamically integrate them to predict the occurrence of recommendation behavior. The paper makes reasonable use of social information and expert information in the transaction, which significantly improves the rationality and accuracy of expert recommendation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exploring Patent Transformation Event: Forecasting Patent Transfer Time

Exploring Patent Transformation Event: Forecasting Patent Tr...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Jinchen Huo Weidong Liu Yang Li Yan Cao College of Computer Science Inner Mongolia University China Institute of Scientific and Technical Information of China China National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Social Computing and Data Processing China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

As the largest source of technical information around the world, patents are regarded as an essential crystallization and carrier of knowledge and technological innovation. Patent transformation is conducive not only to enhancing economic efficiency, but also to improving productivity and the rational utilization of resources. There is an imbalance between high patent ownership and low transformation rates. We try to predict the occurrence of transformation events from the patent assignment. However, there are some challenges in predicting patent transformation: (1) how to capture transformation features of patents, especially combined with the transfer time factor. (2) how to predict patent transfer time effectively. To address these challenges, a Patent Transfer Time Forecasting Model (PTTFM) is proposed. The model includes: (1) extraction of time-varying features of patents. (2) the patent transfer time is forecast using a Neural Temporal Point Process. By testing the model on patents under different classifications, the experimental results are obtained to show that the proposed model is applicable to predict the timing of patent assignment within a certain time frame, especially one month. Our work may facilitate patent transformation while interpretability is ensured for transformation events.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhancing person-Job fit for talent recruitment: An ability-aware neural network approach

arXiv

引用

arXiv 2018年

作者： Qin, Chuan Zhu, Hengshu Xu, Tong Zhu, Chen Jiang, Liang Chen, Enhong Xiong, Hui Anhui Province Key Lab of Big Data Analysis and Application University of Science and Technology of China Baidu Talent Intelligence Center Baidu Inc Business Intelligence Lab Baidu Research National Engineering Laboratory of Deep Learning Technology an Application China

The wide spread use of online recruitment services has led to information explosion in the job market. As a result, the recruiters have to seek the intelligent ways for Person-Job Fit, which is the bridge for adapting the right job seekers to the right positions. Existing studies on Person-Job Fit have a focus on measuring the matching degree between the talent qualification and the job requirements mainly based on the manual inspection of human resource experts despite of the subjective, incomplete, and inefficient nature of the human judgement. To this end, in this paper, we propose a novel end-to-end Ability-aware Person-Job Fit Neural Network (APJFNN) model, which has a goal of reducing the dependence on manual labour and can provide better interpretation about the fitting results. The key idea is to exploit the rich information available at abundant historical job application data. Specifically, we propose a word-level semantic representation for both job requirements and job seekers’ experiences based on Recurrent Neural Network (RNN). Along this line, four hierarchical ability-aware attention strategies are designed to measure the different importance of job requirements for semantic representation, as well as measuring the different contribution of each job experience to a specific ability requirement. Finally, extensive experiments on a large-scale real-world data set clearly validate the effectiveness and interpretability of the APJFNN framework compared with several baselines. Copyright © 2018, The Authors. All rights reserved.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

R2-Net: Relation of relation learning network for sentence semantic matching

arXiv

引用

arXiv 2020年

作者： Zhang, Kun Wu, Le Lv, Guangyi Wang, Meng Chen, Enhong Ruan, Shulan School of Computer Science and Information Engineering Hefei University of Technology China Institute of Artificial Intelligence Hefei Comprehensive National Science Center China Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of China China

Sentence semantic matching is one of the fundamental tasks in natural language processing, which requires an agent to determine the semantic relation among input sentences. Recently, deep neural networks have achieved impressive performance in this area, especially BERT. Despite their effectiveness, most of these models treat output labels as meaningless one-hot vectors, underestimating the semantic information and guidance of relations that these labels reveal, especially for tasks with a small number of labels. To address this problem, we propose a Relation of Relation Learning Network (R2-Net) for sentence semantic matching. Specifically, we first employ BERT to encode the input sentences from a global perspective. Then a CNN-based encoder is designed to capture keywords and phrase information from a local perspective. To fully leverage labels for better relation information extraction, we introduce a self-supervised relation of relation classification task for guiding R2-Net to consider more about relations. Meanwhile, a triplet loss is employed to distinguish the intra-class and inter-class relations in a finer granularity. Empirical experiments on two sentence semantic matching tasks demonstrate the superiority of our proposed model. As a byproduct, we have released the codes to facilitate other researches. © 2020, CC BY.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

An Optimized Variational Bayesian Point Set Matching Approach using Coordinate Ascent and Simulated Annealing

An Optimized Variational Bayesian Point Set Matching Approac...

引用

WRC Symposium on Advanced Robotics and Automation (WRC SARA)

作者： Fangjun Luan Shitong Liu Shuai Yuan Shenyang Branch of National Special Computer Engineering Technology Research Center Shenyang China School of Computer Science and Engineering Shenyang Jianzhu University Shenyang China Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang China

ISBN: (数字)9798331506100

ISBN: (纸本)9798331506117

Aiming at the interference problem of outliers in point set matching, we propose an optimized variational Bayesian point set matching algorithm using coordinate ascent and simulated annealing. For the complex terms in the objective function, we introduce the coordinate ascending strategy and use the Monte Carlo integral stochastic approximation and control variable method to directly optimize the parameters. To enhance the generalization ability of the algorithm and avoid falling into the local optimal solution, we use the simulated annealing scheme to optimize the spatial mapping of the point set. Finally, the affine transform point set matching experiment and the non-rigid point set matching experiment represent our algorithm have a good matching effect and high accuracy.

关键词： Monte Carlo methods Annealing Integral equations Simulated annealing Transforms Interference Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Enabling and Scaling the HPCG Benchmark on the Newest Generation Sunway Supercomputer with 42 Million Heterogeneous Cores

Enabling and Scaling the HPCG Benchmark on the Newest Genera...

引用

Supercomputing Conference

作者： Qianchao Zhu Hao Luo Chao Yang Mingshuo Ding Wanwang Yin Xinhui Yuan Center for Data Science Peking University Beijing China School of Mathematical Sciences Peking University Beijing China National Engineering Laboratory for Big Data Analysis and Applications Peking University Beijing China School of Electronic Engineering and Computer Science Peking University Beijing China National Research Center of Parallel Computer Engineering & Technology Beijing China

ISBN: (数字)9781450384421

ISBN: (纸本)9781665483902

We study and evaluate performance optimization techniques for the HPCG benchmark on the newest generation Sunway super-computer. Specifically, a two-level blocking scheme is proposed to expose adequate parallelism in the symmetric Gauss-Seidel kernel while keeping a fast convergence rate, a fine-grained kernel fusion technique is developed to alleviate the bandwidth load on local storage with small capacity, and a low overhead thread collaboration method is presented to efficiently move data between threads and hide its cost with data transfer operations. Test results show that the optimized HPCG code is able to exploit 73.0% of the theoretical memory bandwidth, and scale to over 42 million heterogeneous cores with 95.5% weak-scaling efficiency and 5.91 Pflop/s performance. We also study how the performance can be improved if the specific rules of HPCG are not fully obeyed, and design dependency preserving parallelization and vectorization methods, further boosting performance to 27.6 Pflop/ s.

关键词： Instruction sets High performance computing Memory management Bandwidth Benchmark testing Parallel processing data transfer

来源：评论

学校读者我要写书评

暂无评论

ADVISor: Automatic Visualization Answer for Natural-Language Question on Tabular data

ADVISor: Automatic Visualization Answer for Natural-Language...

引用

Pacific (formerly Asia-Pacific APVIS) Visualization Symposium

作者： Can Liu Yun Han Ruike Jiang Xiaoru Yuan Key Laboratory of Machine Perception (Ministry of Education) and School of EECS Peking University Beijing China National Engineering Laboratory for Big Data Analysis and Application Peking University Beijing China Beijing Engineering Technology Research Center of Virtual Simulation and Visualization Peking University Beijing China

We propose an automatic pipeline to generate visualization with annotations to answer natural-language questions raised by the public on tabular data. With a pre-trained language representation model, the input natural language questions and table headers are first encoded into vectors. According to these vectors, a multi-task end-to-end deep neural network extracts related data areas and corresponding aggregation type. We present the result with carefully designed visualization and annotations for different attribute types and tasks. We conducted a comparison experiment with state-of-the-art works and the best commercial tools. The results show that our method outperforms those works with higher accuracy and more effective visualization.

关键词： Annotations Natural languages Pipelines Neural networks data visualization Tools data mining

来源：评论

学校读者我要写书评

暂无评论

Automatic recognition of depression based on audio and video:A review

引用

World Journal of Psychiatry 2024年第2期14卷 225-233页

作者： Meng-Meng Han Xing-Yun Li Xin-Yu Yi Yun-Shao Zheng Wei-Li Xia Ya-Fei Liu Qing-Xiang Wang Shandong Mental Health Center Shandong UniversityJinan 250014Shandong ProvinceChina Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center(National Supercomputer Center in Jinan)Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353Shandong ProvinceChina Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and TechnologyQilu University of Technology(Shandong Academy of Sciences)Jinan 250353Shandong ProvinceChina Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan 250353Shandong ProvinceChina Department of Ward Two Shandong Mental Health CenterShandong UniversityJinan 250014Shandong ProvinceChina

Depression is a common mental health *** current depression detection methods,specialized physicians often engage in conversations and physiological examinations based on standardized scales as auxiliary measures for depression ***-biological markers-typically classified as verbal or non-verbal and deemed crucial evaluation criteria for depression-have not been effectively *** physicians usually require extensive training and experience to capture changes in these *** in deep learning technology have provided technical support for capturing non-biological *** researchers have proposed automatic depression estimation(ADE)systems based on sounds and videos to assist physicians in capturing these features and conducting depression *** article summarizes commonly used public datasets and recent research on audio-and video-based ADE based on three perspectives:datasets,deficiencies in existing research,and future development directions.

关键词： Depression recognition Deep learning Automatic depression estimation System Audio processing Image processing Feature fusion Future development

来源：评论

学校读者我要写书评

暂无评论

Graph Condensation for Inductive Node Representation Learning

arXiv

引用

arXiv 2023年

作者： Gao, Xinyi Chen, Tong Zang, Yilong Zhang, Wentao Hung Nguyen, Quoc Viet Zheng, Kai Yin, Hongzhi The University of Queensland Brisbane Australia Kaiserslautern Germany Peking University Beijing China National Engineering Laboratory for Big Data Analysis and Applications Beijing China Griffith University Gold Coast Australia University of Electronic Science and Technology of China Chengdu China

Graph neural networks (GNNs) encounter significant computational challenges when handling large-scale graphs, which severely restricts their efficacy across diverse applications. To address this limitation, graph condensation has emerged as a promising technique, which constructs a small synthetic graph for efficiently training GNNs while retaining performance. However, due to the topology structure among nodes, graph condensation is limited to condensing only the observed training nodes and their corresponding structure, thus lacking the ability to effectively handle the unseen data. Consequently, the original large graph is still required in the inference stage to perform message passing to inductive nodes, resulting in substantial computational demands. To overcome this issue, we propose mapping-aware graph condensation (MCond), explicitly learning the one-to-many node mapping from original nodes to synthetic nodes to seamlessly integrate new nodes into the synthetic graph for inductive representation learning. This enables direct information propagation on the synthetic graph, which is much more efficient than on the original large graph. Specifically, MCond employs an alternating optimization scheme with innovative loss terms from transductive and inductive perspectives, facilitating the mutual promotion between graph condensation and node mapping learning. Extensive experiments demonstrate the efficacy of our approach in inductive inference. On the Reddit dataset, MCond achieves up to 121.5× inference speedup and 55.9× reduction in storage requirements compared with counterparts based on the original graph. Copyright © 2023, The Authors. All rights reserved.

关键词： Condensation

来源：评论

学校读者我要写书评

暂无评论

Bayesian Optimization of Double-SAC Robotic Arm Path Planning Using Recent Prioritized Experience Replay

Bayesian Optimization of Double-SAC Robotic Arm Path Plannin...

引用

WRC Symposium on Advanced Robotics and Automation (WRC SARA)

作者： Shuai Yuan Ke Wen Feng Zhang Jianqiang Xiong School of Computer Science and Engineering Shenyang Jianzhu University Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang Branch of National Special Computer Engineering Technology Research Center Shengyang China School of Electrical and Control Engineering Shenyang Jianzhu University Shengyang China

As for the path planning of robotic arms, Deep Reinforcement Learning (DRL) algorithms have recently been developed. However, the high-dimensional action space and state space will result in reward sparsity and low training efficiency of robotic arm path planning. We propose a Bayesian optimization of Double-SAC algorithm using recent priority experience replay to solve these issues. We first propose the sampling method of recent prioritized experience replay (RPER), which combines recent sampling and prioritized experience replay (PER). The interval of experience pool is divided according to the recent sampling method, and sampling is performed according to the sample priority of the interval. Then we adopt a Bayesian optimization method that reduces the variance of the random strategy and improve the quality of the sampled actions. The larger variance is more beneficial for exploring the environment. Smaller variance is advantageous for exploiting good experiences to obtain higher returns. Our approach finds a good balance between exploration and exploitation. We train two Soft Actor Critic (SAC) agents to obtain two independent probability distributions, and a Bayesian optimizer is adopted to combine the two distributions to design a hybrid strategy. The hybrid strategy can output better actions according to the uncertainty estimation of the distribution, and further enhance training efficiency and stability. Finally, simulation tests are performed on the ROS-Gazebo platform, and the simulation results illustrate that the algorithm proposed in this paper converges faster and has a shorter training time than the original algorithm in terms of path planning performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：