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

International Joint Conference on Neural Networks (IJCNN)

作者： Xiaoyang Li Zhenyu Yang Zhijun Li Yiwen Li Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Emotion Recognition in Conversations (ERC) is a widely applicable task, whether in emotional chatbots or recommender systems for dialog scenarios. The ability of systems to accurately identify human emotions is a crucial component in ERC success. In everyday conversations, a speaker’s emotional expression is closely tied to their individual characteristics and personality traits. Furthermore, individuals exhibit significant variations in their expressions of the same emotion. Traditional methods for ERC often overlook these personality differences and dynamic changes, leading to unreliable results. To address this issue, we propose a conversation emotion recognition model based on dynamic modeling of speaker’s personality (ERC DMSP). In our approach, to extract a speaker’s personality profile, we design a personality capture module to model the personalities of individuals based on their historical utterances. Moreover, a bidirectional influence exists between a speaker’s personality tendencies and their linguistic behavior. The speaker’s personality profile is thus continually updated based on the ongoing dialog. Additionally, since the personalities of other speakers in the conversation can also affect the form and intensity of a speaker’s emotional expression, we construct a conversation emotion representation utilizing group personality traits. We then comprehensively incorporate the speaker’s personality into the emotion representation of each utterance at both the group and individual levels through the personality engagement module. Throughout this process, the representation of dialog and the speaker’s personality undergo hierarchical updates, leading to more accurate conversation emotion recognition. We conducted extensive experiments on four commonly used public benchmark datasets for ERC to evaluate the effectiveness of our proposed ERC DMSP model. The results demonstrate its efficacy, as it exhibits a significant improvement over other methods in popular

关键词： Measurement Emotion recognition Accuracy Codes Neural networks Oral communication Color

来源：评论

学校读者我要写书评

暂无评论

Robust frequent directions with application in online learning

arXiv

引用

arXiv 2017年

作者： Luo, Luo Chen, Cheng Zhang, Zhihua Li, Wu-Jun Zhang, Tong Department of Computer Science and Engineering Shanghai Jiao Tong University 800 Dongchuan Road Shanghai200240 China National Engineering Lab for Big Data Analysis and Applications School of Mathematical Sciences Peking University 5 Yiheyuan Road Beijing100871 China National Key Laboratory for Novel Software Technology Collaborative Innovation Center of Novel Software Technology and Industrialization Department of Computer Science and Technology Nanjing University 163 Xianlin Avenue Nanjing210023 China Computer Science & Mathematics Hong Kong University of Science and Technology Hong Kong

The frequent directions (FD) technique is a deterministic approach for online sketching that has many applications in machine learning. The conventional FD is a heuristic procedure that often outputs rank deficient matrices. To overcome the rank deficiency problem, we propose a new sketching strategy called robust frequent directions (RFD) by introducing a regularization term. RFD can be derived from an optimization problem. It updates the sketch matrix and the regularization term adaptively and jointly. RFD reduces the approximation error of FD without increasing the computational cost. We also apply RFD to online learning and propose an effective hyperparameter-free online Newton algorithm. We derive a regret bound for our online Newton algorithm based on RFD, which guarantees the robustness of the algorithm. The experimental studies demonstrate that the proposed method outperforms state-of-the-art second order online learning algorithms. Copyright © 2017, The Authors. All rights reserved.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

iGniter: Interference-Aware GPU Resource Provisioning for Predictable DNN Inference in the Cloud

arXiv

引用

arXiv 2022年

作者： Xu, Fei Xu, Jianian Chen, Jiabin Chen, Li Shang, Ruitao Zhou, Zhi Liu, Fangming The Shanghai Key Laboratory of Multidimensional Information Processing School of Computer Science and Technology East China Normal University 3663 N. Zhongshan Road Shanghai200062 China The School of Computing and Informatics University of Louisiana at Lafayette 301 East Lewis Street LafayetteLA70504 United States The Guangdong Key Laboratory of Big Data Analysis and Processing School of Computer Science and Engineering Sun Yat-sen University 132 E. Waihuan Road Guangzhou510006 China The National Engineering Research Center for Big Data Technology and System The Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology 1037 Luoyu Road Wuhan430074 China

GPUs are essential to accelerating the latency-sensitive deep neural network (DNN) inference workloads in cloud datacenters. To fully utilize GPU resources, spatial sharing of GPUs among co-located DNN inference workloads becomes increasingly compelling. However, GPU sharing inevitably brings severe performance interference among co-located inference workloads, as motivated by an empirical measurement study of DNN inference on EC2 GPU instances. While existing works on guaranteeing inference performance service level objectives (SLOs) focus on either temporal sharing of GPUs or reactive GPU resource scaling and inference migration techniques, how to proactively mitigate such severe performance interference has received comparatively little attention. In this paper, we propose iGniter, an interference-aware GPU resource provisioning framework for cost-efficiently achieving predictable DNN inference in the cloud. iGniter is comprised of two key components: (1) a lightweight DNN inference performance model, which leverages the system and workload metrics that are practically accessible to capture the performance interference;(2) A cost-efficient GPU resource provisioning strategy that jointly optimizes the GPU resource allocation and adaptive batching based on our inference performance model, with the aim of achieving predictable performance of DNN inference workloads. We implement a prototype of iGniter based on the NVIDIA Triton inference server hosted on EC2 GPU instances. Extensive prototype experiments on four representative DNN models and datasets demonstrate that iGniter can guarantee the performance SLOs of DNN inference workloads with practically acceptable runtime overhead, while saving the monetary cost by up to 25% in comparison to the state-of-the-art GPU resource provisioning strategies. Copyright © 2022, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

COVID-19大流行期间流感活动呈“断崖式”下降——佩戴口罩、人员流动变化及SARS-CoV-2干扰的作用

引用

engineering 2023年第2期21卷 195-202,M0008页

作者：韩莎莎张婷吕岩赖圣杰戴佩希郑建东杨维中周晓华冯录召 Beijing International Center for Mathematical Research Peking UniversityBeijing 100871China Harvard Medical School Harvard UniversityBostonMA 02115USA School of Population Medicine and Public Health Chinese Academy of Medical Sciences&Peking Union Medical CollegeBeijing 100730China Academy for Advanced Interdisciplinary Studies Peking UniversityBeijing 100871China WorldPop School of Geography and Environmental ScienceUniversity of SouthamptonSouthampton SO171BJUK Division for Infectious Diseases Chinese Center for Disease Control and PreventionBeijing 102206China Department of Epidemiology and Biostatistics School of Public HealthPeking UniversityBeijing 100871China National Engineering Laboratory of Big Data Analysis and Applied Technology Peking UniversityBeijing 100871China

一般情况下,每年冬季是季节性流感高发季节,但在当前2019冠状病毒病(COVID-19)大流行期间,全球季节性流感活动呈“断崖式”下降。为应对即将到来的流感季节,亟需弄清这种前所未有的流感低水平流行的原因。本文中,我们探索了一种国家特... 详细信息

一般情况下,每年冬季是季节性流感高发季节,但在当前2019冠状病毒病(COVID-19)大流行期间,全球季节性流感活动呈“断崖式”下降。为应对即将到来的流感季节,亟需弄清这种前所未有的流感低水平流行的原因。本文中,我们探索了一种国家特异性推理模型,利用该模型估计中国、英国和美国这三个国家中佩戴口罩、人员流动变化(国际和国内)以及严重急性呼吸综合征冠状病毒2型(SARS-CoV-2)干扰的影响。结果发现,在这些地区增加一周佩戴口罩的干预措施,流感活动可减少11.3%~35.2%。实施一周的限制人员流动措施对国际(1.7%~6.5%)和国内社区(1.6%~2.8%)的影响较小。2020年至2021年,仅佩戴口罩这一项干预措施就可使阳性率下降13.3%至19.8%。仅人员流动变化可使阳性率降低5.2%至14.0%,其中79.8%~98.2%归因于国际旅行限制。SARS-CoV-2干扰仅在2019年至2020年具有统计学显著效应。中国北方地区及英国的阳性百分比分别降低7.6%(2.4~14.4)和10.2%(7.2~13.6)。探索所得出的结果对了解非药物干预措施和其他呼吸系统疾病背景下的流感演变有一定意义,有助于制定卫生政策,并可为公共卫生措施的个性化设计提供信息。

关键词：卫生政策非药物干预呼吸系统疾病流行期间季节性流感流动变化个性化设计模型估计

来源：评论

学校读者我要写书评

暂无评论

Model-enhanced vector index 23

Model-enhanced vector index

引用

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

作者： Hailin Zhang Yujing Wang Qi Chen Ruiheng Chang Ting Zhang Ziming Miao Yingyan Hou Yang Ding Xupeng Miao Haonan Wang Bochen Pang Yuefeng Zhan Hao Sun Weiwei Deng Qi Zhang Fan Yang Xing Xie Mao Yang Bin Cui School of Computer Science & Key Lab of High Confidence Software Technologies Peking University and Microsoft Microsoft Microsoft and Aerospace Information Research Institute & Key Laboratory of Target Cognition and Application Technology Chinese Academy of Sciences Microsoft and Institute of Information Engineering Chinese Academy of Sciences Carnegie Mellon University National University of Singapore School of Computer Science & Key Lab of High Confidence Software Technologies Peking University and National Engineering Laboratory for Big Data Analysis and Applications Peking University

Embedding-based retrieval methods construct vector indices to search for document representations that are most similar to the query representations. They are widely used in document retrieval due to low latency and decent recall performance. Recent research indicates that deep retrieval solutions offer better model quality, but are hindered by unacceptable serving latency and the inability to support document updates. In this paper, we aim to enhance the vector index with end-to-end deep generative models, leveraging the differentiable advantages of deep retrieval models while maintaining desirable serving efficiency. We propose Model-enhanced Vector Index (MEVI), a differentiable model-enhanced index empowered by a twin-tower representation model. MEVI leverages a Residual Quantization (RQ) codebook to bridge the sequence-to-sequence deep retrieval and embedding-based models. To substantially reduce the inference time, instead of decoding the unique document ids in long sequential steps, we first generate some semantic virtual cluster ids of candidate documents in a small number of steps, and then leverage the well-adapted embedding vectors to further perform a fine-grained search for the relevant documents in the candidate virtual clusters. We empirically show that our model achieves better performance on the commonly used academic benchmarks MSMARCO Passage and Natural Questions, with comparable serving latency to dense retrieval solutions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

How Does Knowledge Graph Embedding Extrapolate to Unseen data: A Semantic Evidence View

arXiv

引用

arXiv 2021年

作者： Li, Ren Cao, Yanan Zhu, Qiannan Bi, Guanqun Fang, Fang Liu, Yi Li, Qian Institute of Information Engineering Chinese Academy of Sciences China School of Cyber Security University of Chinese Academy of Sciences China Gaoling School of Artificial Intelligence Renmin University of China China Beijing Key Laboratory of Big Data Management and Analysis Methods China National Computer Network Emergency Response Technical Team Coordination Center of China China University of Technology Sydney Australia

Knowledge Graph Embedding (KGE) aims to learn representations for entities and relations. Most KGE models have gained great success, especially on extrapolation scenarios. Specifically, given an unseen triple (h, r, t), a trained model can still correctly predict t from (h, r,?), or h from (?, r, t), such extrapolation ability is impressive. However, most existing KGE works focus on the design of delicate triple modeling function, which mainly tells us how to measure the plausibility of observed triples, but offers limited explanation of why the methods can extrapolate to unseen data, and what are the important factors to help KGE extrapolate. Therefore in this work, we attempt to study the KGE extrapolation of two problems: 1. How does KGE extrapolate to unseen data? 2. How to design the KGE model with better extrapolation ability? For the problem 1, we first discuss the impact factors for extrapolation and from relation, entity and triple level respectively, propose three Semantic Evidences (SEs), which can be observed from train set and provide important semantic information for extrapolation. Then we verify the effectiveness of SEs through extensive experiments on several typical KGE methods. For the problem 2, to make better use of the three levels of SE, we propose a novel GNN-based KGE model, called Semantic Evidence aware Graph Neural Network (SE-GNN). In SE-GNN, each level of SE is modeled explicitly by the corresponding neighbor pattern, and merged sufficiently by the multi-layer aggregation, which contributes to obtaining more extrapolative knowledge representation. Finally, through extensive experiments on FB15k-237 and WN18RR datasets, we show that SE-GNN achieves state-of-the-art performance on Knowledge Graph Completion task and performs a better extrapolation ability. Our code is available at https://***/renli1024/SE-GNN. Copyright © 2021, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Cross-domain Human Parsing via Adversarial Feature and Label Adaptation

arXiv

引用

arXiv 2018年

作者： Liu, Si Sun, Yao Zhu, Defa Ren, Guanghui Chen, Yu Feng, Jiashi Han, Jizhong Institute of Information Engineering Chinese Academy of Sciences *** Department of Ece National University of Singapore Jiangsu Key Laboratory of Big Data Analysis Technology/B-DAT Nanjing University of Information Science and Technology Collab. Innov. Ctr. of Atmosph. Environ. and Equip. Technol. Nanjing Univ. of Info. Sci. and Technol. Nanjing China

Human parsing has been extensively studied recently (Yamaguchi et al. 2012;Xia et al. 2017) due to its wide applications in many important scenarios. Mainstream fashion parsing models (i.e., parsers) focus on parsing the high-resolution and clean images. However, directly applying the parsers trained on benchmarks of high-quality samples to a particular application scenario in the wild, e.g., a canteen, airport or workplace, often gives non-satisfactory performance due to domain shift. In this paper, we explore a new and challenging cross-domain human parsing problem: Taking the benchmark dataset with extensive pixel-wise labeling as the source domain, how to obtain a satisfactory parser on a new target domain without requiring any additional manual labeling? To this end, we propose a novel and efficient crossdomain human parsing model to bridge the cross-domain differences in terms of visual appearance and environment conditions and fully exploit commonalities across domains. Our proposed model explicitly learns a feature compensation network, which is specialized for mitigating the cross-domain differences. A discriminative feature adversarial network is introduced to supervise the feature compensation to effectively reduces the discrepancy between feature distributions of two domains. Besides, our proposed model also introduces a structured label adversarial network to guide the parsing results of the target domain to follow the high-order relationships of the structured labels shared across domains. The proposed framework is end-to-end trainable, practical and scalable in real applications. Extensive experiments are conducted where LIP dataset is the source domain and 4 different datasets including surveillance videos, movies and runway shows without any annotations, are evaluated as target domains. The results consistently confirm data efficiency and performance advantages of the proposed method for the challenging cross-domain human parsing problem. Copyright

关键词： Security systems

来源：评论

学校读者我要写书评

暂无评论

A Wavelet-CNN-LSTM Model for Tailings Pond Risk Prediction

arXiv

引用

arXiv 2020年

作者： Yang, Jun Li, Qing Sun, Yixuan Wang, Wei Li, Linchao Wang, Xuwei Jia, Shengyao Tong, Renyuan National and Local Joint Engineering research center for Disaster Monitoring Technologies and Instruments China Jiliang University Hangzhou310051 China Zhejiang Provincial Key Laboratory of Intelligent Manufacturing Quality Big Data Traceability Analysis and Application China Jiliang University Hangzhou310051 China Zhejiang PeckerAI Technology. Ltd Hangzhou310018 China College of Computer Science and Technology Zhejiang University Hangzhou310027 China

Tailings ponds are places for storing industrial waste. The saturation line is the key factor of quantifying the safety of tailings pond. Existing saturation line time-series prediction methods are mainly based on statistical models or shallow machine learning models. Although these models aim to capture the time dependence of the sequence data, the channel and temporal are even unavailable in principle. In this paper, we presents a two-stage forecasting method, which embeds the channel and temporal attention into a hybrid CNN-LSTM model to predict the saturation line. In the first stage, the discrete wavelet transform (DWT) is applied to capture the refined sequence information. In the second stage, the CNN-LSTM model is utilized to learn the basic spatial and temporal features in the time series. Furthermore, the channel and temporal attention model are embedded into CNN-LSTM model to enhance the feature extracting ability in channel and temporal dimension. Consequently, our proposed model is shown to outperform classic models on five real-world datasets. Copyright © 2020, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis of time irreversibility and amplitude irreversibility based on joint permutation

arXiv

引用

arXiv 2022年

作者： Yao, Wenpo Yao, Wenli Xu, Rongshuang Wang, Jun School of Geographic and Biologic Information Smart Health Big Data Analysis and Location Services Engineering Lab of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing210023 China Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence Fudan University Ministry of Education China Department of Hydraulic Engineering School of Civil Engineering Tsinghua University Beijing100084 China School of Applied Meteorology Nanjing University of Information Science & Technology Nanjing210044 China

Although time irreversibility (TIR) and amplitude irreversibility (AIR) are relevant concepts for nonequilibrium analysis, their association has received little attention. This paper conducts a systematic comparative analysis of the relationship between TIR and AIR based on statistical descriptions and numerical simulations. To simplify the quantification of TIR and AIR, the amplitude permutation and global information of the associated vector are combined to produce a joint probability estimation. Chaotic logistic, Henon, and Lorenz series are generated to evaluate TIR and AIR according to surrogate theory, and the distributions of joint permutations for these model series are measured to compare the degree of TIR and AIR. The joint permutation TIR and AIR are then used to investigate nonequilibrium pathological features in epileptic electroencephalography data. Test results suggest that epileptic brain electrical activities, particular those during the onset of seizure, manifest higher nonequilibrium characteristics. According to the statistical definitions and targeted pairs of joint permutations in the chaotic model data, TIR and AIR are fundamentally different nonequilibrium descriptors from time- and amplitude-reversibility, respectively, and thus require different forms of numerical analysis. At the same time, TIR and AIR both provide measures for fluctuation theorems associated with nonequilibrium processes, and have similar probabilistic differences in the pairs of joint permutations and consistent outcomes when used to analyze both the model series and real-world signals. Overall, comparative analysis of TIR and AIR contributes to our understanding of nonequilibrium features and broadens the scope of quantitative nonequilibrium measures. Additionally, the construction of joint permutations contributes to the development of symbolic time series analysis. Copyright © 2022, The Authors. All rights reserved.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

A Nontrivial Interplay between Triadic Closure, Preferential, and Anti-Preferential Attachment: New Insights from Online data

arXiv

引用

arXiv 2022年

作者： Kozitsin, Ivan V. Sayfulin, Eduard R. Goiko, Vyacheslav L. Laboratory of Active Systems V. A. Trapeznikov Institute of Control Sciences Russian Academy of Sciences 65 Profsoyuznaya street Moscow117997 Russia Department of Higher Mathematics Moscow Institute of Physics and Technology 9 Institutskiy per. Moscow Region Dolgoprudny141701 Russia The Center of Applied Big Data Analysis National Research Tomsk State University 36 Lenina Street Tomsk634050 Russia

This paper presents an analysis of a temporal network that describes the social connections of a large-scale (~30,000) sample of online social network users, inhabitants of a fixed city. We tested how the main network formation determinants - transitivity, preferential attachment, and social selection - contribute to network evolution. Among other things, we found that opinion social selection does affect tie appearing whereas its impact on tie removing is rather unclear. We report that transitivity displayed the strongest effect on network dynamics. Surprisingly, a closer look revealed an intriguing and complex interplay between the transitivity, preferential attachment, and anti-preferential attachment mechanisms. For a given pair of unconnected nodes, if they have no mutual connections, then the probability of tie creation goes up with the total number of nodes' friends - that is exactly what the preferential attachment mechanism is assumed to do. Instead, if the nodes have at least one common friend, then the highest probability of tie appearing is achieved if both the nodes have only a few friends - a phenomenon that is called anti-preferential attachment. We attempted to explain this finding by appealing to the notions of social communities and leaders. Copyright © 2022, The Authors. All rights reserved.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：