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

16th ACM International Conference on Computing Frontiers, CF 2019

作者： Cheng, Zhou Wang, Jixiang Qi, Tianmei Zhao, Junfeng Wang, Zhihong Guo, Yi Zhou, Yu Co. Ltd Shanghai China Department of Computer Science and Engineering East China University of Science and Technology Shanghai China Business Intelligence and Visualization Research Center National Engineering Laboratory for Big Data Distribution and Exchange Technologies Shanghai China

ISBN: (纸本)9781450366854

The forecast and analysis of the trend of the RMB exchange rate have been deeply explored by many researchers in the financial field, but the combination of public opinion sentiment data and historical market data to forecast the RMB exchange rate in the short term has been studied little. With the rapid development of the Internet, the influence of public opinion sentiment on the economy and society is increasing. Online public opinion sentiment data not only have an impact on stock prices [1] and commodity prices, but also have a significant impact on foreign exchange (Forex) rates. However, the public opinion data are not applied for the RMB exchange rate forecast, because the impact of public events on the exchange rate is ignored. Besides, the lack of exact temporal sliding window of public opinion ignores its timeliness and sensibility. © 2019 Association for Computing Machinery.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

UCPM: Uncertainty-Guided Cross-Modal Retrieval with Partially Mismatched Pairs

引用

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2025年 PP卷 PP页

作者： Quanxing Zha Xin Liu Yiu-Ming Cheung Shu-Juan Peng Xing Xu Nannan Wang Huaqiao University Department of Computer Science Xiamen 361021 China Key Laboratory of Pattern Recognition and Computer Vision Xiamen 361021 China Huaqiao University Fujian Key Laboratory of Big Data Intelligence and Security Xiamen 361021 China Hong Kong Baptist University Department of Computer Science Hong Kong Huaqiao University Department of Artificial Intelligence Xiamen 361021 China Fujian Province University Key Laboratory of Computer Vision and Machine Learning (Huaqiao University) Xiamen 361021 China University of Electronic Science and Technology of China Center for Future Multimedia School of Computer Science and Engineering Chengdu 610051 China Xidian University State Key Laboratory of Integrated Services Networks Xi’an 710071 China

The manual annotation of perfectly aligned labels for cross-modal retrieval (CMR) is incredibly labor-intensive. As an alternative, the collection of co-occurring data pairs from the Internet is a remarkably cost-effective way, but which, inevitably induces the Partially Mismatched Pairs (PMPs) and therefore significantly degrades the retrieval performance without particular treatment. Previous efforts often utilize the pair-wise similarity to filter out the mismatched pairs, and such operation is highly sensitive to mismatched or ambiguous data and thus leads to sub-optimal performance. To alleviate these concerns, we propose an efficient approach, termed UCPM, i.e., Uncertainty-guided Cross-modal retrieval with Partially Mismatched pairs, which can significantly reduce the adverse impact of mismatched data pairs. Specifically, a novel Uncertainty Guided Division (UGD) strategy is sophisticatedly designed to divide the corrupted training data into confident matched (clean), easily-identifiable mismatched (noisy) and hardly-determined hard subsets, and the derived uncertainty can simultaneously guide the informative pair learning while reducing the negative impact of potential mismatched pairs. Meanwhile, an effective Uncertainty Self-Correction (USC) mechanism is concurrently presented to accurately identify and rectify the fluctuated uncertainty during the training process, which further improves the stability and reliability of the estimated uncertainty. Besides, a Trusted Margin Loss (TML) is newly designed to enhance the discriminability between those hard pairs, by dynamically adjusting their soft margins to amplify the positive contributions of matched pairs while suppressing the negative impacts of mismatched pairs. Extensive experiments on three widely-used benchmark datasets, verify the effectiveness and reliability of UCPM compared with the existing SOTA approaches, and significantly improve the robustness in both synthetic and real-world PMPs. The code i

关键词： Cross-modal retrieval partially mismatched pairs trusted margin loss uncertainty guided division uncertainty self-correction

来源：评论

学校读者我要写书评

暂无评论

$\mathsf{NCF}$NCF: A Neural Context Fusion Approach to Raw Mobility Annotation

引用

IEEE Transactions on Mobile Computing 2020年第1期21卷 226-238页

作者： Renjun Hu Jingbo Zhou Xinjiang Lu Hengshu Zhu Shuai Ma Hui Xiong SKLSDE Lab Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing China Business Intelligence Lab Baidu Research National Engineering Laboratory of Deep Learning Technology and Application Beijing China Talent Intelligence Center Baidu Inc. Beijing China Management Science and Information Systems Department Rutgers Business School Rutgers University Newark NJ USA

Understanding human mobility patterns at the point-of-interest (POI) scale plays an important role in enhancing business intelligence in mobile environments. While large efforts have been made in this direction, most studies simply utilize POI check-ins to mine the concerned mobility patterns, the effectiveness of which is usually hindered due to data sparsity. To obtain better POI-based human mobility for mining, in this paper, we strive to directly annotate the POIs associated with raw user-generated mobility records. We propose a neural context fusion approach which integrates various context factors in people's POI-visiting behaviors. Our approach evaluates the preference and transition factors via representation learning. Notably, we incorporate an attention mechanism to deal with the randomized transitions in raw mobility. The domain knowledge factors, i.e., distance, time and popularity, remain effective and our approach further includes them from a data-driven perspective. Factors are automatically fused with a feed-forward neural network. Furthermore, we exploit a multi-head architecture to enhance the model expressiveness. Using two real-life data sets, we conduct our experimental study and find that our approach consistently outperforms the state-of-the-art baselines by at least 32 percent in accuracy. Besides, we demonstrate the utility of the obtained POI-based human mobility with a POI recommendation example.

关键词： Annotations Trajectory Mobile computing Computer architecture Business intelligence Neural networks Semantics

来源：评论

学校读者我要写书评

暂无评论

Co-evolution of cooperation and resource allocation in the advantageous environment-based spatial multi-game using adaptive control

引用

Chaos, Solitons & Fractals 2025年 199卷

作者： Chengbin Sun Alfonso de Miguel-Arribas Chaoqian Wang Haoxiang Xia Yamir Moreno School of Economics and Management Dalian University of Technology Dalian 116024 China Institute for Biocomputation and Physics of Complex Systems (BIFI) University of Zaragoza Zaragoza 50018 Spain Zaragoza Logistics Center (ZLC) Zaragoza 50018 Spain Department of Computational and Data Sciences George Mason University Fairfax VA 22030 USA Key Laboratory of Social Computing and Cognitive Intelligence at Dalian University of Technology Ministry of Education of China Dalian 116024 China Department of Theoretical Physics University of Zaragoza Zaragoza 50018 Spain

In real-life complex systems, individuals often encounter multiple social dilemmas that cannot be effectively captured using a single-game model. Furthermore, the environment and limited resources both play a crucial role in shaping individuals’ decision-making behaviors. In this study, we employ an adaptive control mechanism by which agents may benefit from their environment, thus redefining their individual fitness. Under this setting, a detailed examination of the co-evolution of individual strategies and resource allocation is carried. Through extensive simulations, we find that the advantageous environment mechanism not only significantly increases the proportion of cooperators in the system but also influences the resource distribution among individuals. Additionally, limited resources reinforce cooperative behaviors within the system while shaping the evolutionary dynamics and strategic interactions across different dilemmas. Once the system reaches equilibrium, resource distribution becomes highly imbalanced. To promote fairer resource allocation, we introduce a minimum resource guarantee mechanism. Our results show that this mechanism not only reduces disparities in resource distribution across the entire system and among individuals in different dilemmas but also significantly enhances cooperative behavior in higher resource intervals. Finally, to assess the robustness of our model, we further examine the influence of the advantageous environment on system-wide cooperation in small-world and random graph network models.

关键词： Advantageous environment Multigames model Resource allocation Adaptive control

来源：评论

学校读者我要写书评

暂无评论

SiPPing Neural Networks: Sensitivity-informed Provable Pruning of Neural Networks

arXiv

引用

arXiv 2019年

作者： Baykal, Cenk Liebenwein, Lucas Gilitschenski, Igor Feldman, Dan Rus, Daniela Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology United States Robotics and Big Data Laboratory University of Haifa Israel

We introduce a family of pruning algorithms that provably sparsifies the parameters of a trained model in a way that approximately preserves the model's predictive accuracy. Our algorithms use a small batch of input points to construct a data-informed importance sampling distribution over the network's parameters, and either use a sampling-based or deterministic pruning procedure, or an adaptive mixture thereof, to discard redundant weights. Our pruning methods are simultaneously computationally efficient, provably accurate, and broadly applicable to various network architectures and data distributions. The presented approaches are simple to implement and can be easily integrated into standard prune-retrain pipelines. We present empirical comparisons showing that our algorithms reliably generate highly compressed networks that incur minimal loss in performance relative to that of the original network. Copyright © 2019, The Authors. All rights reserved.

关键词： Importance sampling

来源：评论

学校读者我要写书评

暂无评论

FedLGMatch: Federated semi-supervised learning via joint local and global pseudo labeling

引用

Knowledge-Based Systems 2025年 320卷

作者： Zhao, Qing Chu, Jielei Li, Zhaoyu Huang, Wei Luo, Zhipeng Li, Tianrui School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China China Railway Engineering Group Limited Beijing100039 China China Railway Eryuan Engineering Group Co. Ltd. Sichuan Chengdu610031 China College of Computer and Data Science Fuzhou University China

The bulk of existing Federated Learning (FL) algorithms pay attention to supervised setting and assume that clients have fully labeled data. However, it may be impractical for all clients to obtain plenty of labels due to high annotation costs. Hence, the Federated Semi-Supervised Learning (FSSL) as a promising paradigm has better prospect in many realistic applications (e.g. medical scenario). Under Labels-at-Server scenario, most pseudo labeling based FSSL approaches use only the global model to generate pseudo-labels for unlabeled data, while the local models are ignored. When the local data distribution is much more different from the central server (e.g., Non-IID setting), the generated pseudo-labels may contain much noise, thus, resulting in more serious confirmation bias. To tackle the crucial issue, a novel Federated Semi-Supervised Learning via Joint Local and Global Pseudo Labeling (FedLGMatch) framework is proposed in this paper. The prominent advantage of the proposed FedLGMatch is that it allows local models trained in the last communication round to assist global model in generating pseudo-labels, which successfully emphasizes more clean pseudo-label learning at each client. Experimental results also show that FedLGMatch achieves significant performance improvements than other state-of-the-art models on the standard benchmark datasets. © 2025 Elsevier B.V.

关键词： Semi-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Abnormal Scanning Patterns Based on Eye Movement Entropy in Early Psychosis

引用

Biological Psychiatry: cognitive Neuroscience and Neuroimaging 2024年

作者： Zhang, Dan Ma, Chunyan Xu, Lihua Liu, Xu Cui, Huiru Wei, Yanyan Zheng, Wensi Hong, Yawen Xie, Yuou Qian, Zhenying Hu, Yegang Tang, Yingying Li, Chunbo Liu, Zhi Chen, Tao Liu, Haichun Zhang, Tianhong Wang, Jijun Shanghai Key Laboratory of Psychotic Disorders Shanghai Mental Health Center Shanghai Jiao Tong University School of Medicine People's Republic of China Shanghai China First Clinical Medical College of Nanjing Medical University People's Republic of China Nanjing China Shanghai Institute for Advanced Communication and Data Science Shanghai University People's Republic of China Shanghai China School of Communication and Information Engineering Shanghai University People's Republic of China Shanghai China Labor and Worklife Program Harvard University Cambridge Massachusetts United States Big Data Research Laboratory University of Waterloo Waterloo ON Canada Niacin (Shanghai) Technology Co. Ltd. People's Republic of China Shanghai China Department of Automation Shanghai Jiao Tong University People's Republic of China Shanghai China Shanghai Mental Health Center Shanghai Engineering Research Center of Intelligent Psychological Evaluation and Intervention Shanghai Key Laboratory of Psychotic Disorders Shanghai Jiaotong University School of Medicine People's Republic of China Shanghai China CAS Center for Excellence in Brain Science and Intelligence Technology Chinese Academy of Sciences People's Republic of China Shanghai China Institute of Psychology and Behavioral Science Shanghai Jiao Tong University People's Republic of China Shanghai China

Background: Restricted scan path mode is hypothesized to explain abnormal scanning patterns in patients with schizophrenia. Here, we calculated entropy scores (drawing on gaze data to measure the statistical randomness of eye movements) to quantify how strategical and random participants were when processing image stimuli. Methods: Eighty-six patients with first-episode schizophrenia (FES), 124 individuals at clinical high risk (CHR) for psychosis, and 115 healthy control participants (HCs) completed an eye-tracking examination while freely viewing 35 static images (each presented for 10 seconds) and cognitive assessments. We compared group differences in the overall entropy score, as well as entropy scores under various conditions. We also investigated the correlations between entropy scores and symptoms and cognitive function. Results: Increased overall entropy scores were noted in the FES and CHR groups compared with the HC group, and these differences were already apparent within 0 to 2.5 seconds. In addition, the CHR group exhibited higher entropy than the HC group when viewing low-meaning images. Moreover, the entropy within 0 to 2.5 seconds showed significant correlations with negative symptoms in the FES group, attention/vigilance scores in the CHR group, and speed of processing and attention/vigilance scores across all 3 groups. Conclusions: The results indicate that individuals with FES and those at CHR scanned pictures more randomly and less strategically than HCs. These patterns also correlated with clinical symptoms and neurocognition. The current study highlights the potential of the eye movement entropy measure as a neurophysiological marker for early psychosis. © 2024 Society of Biological Psychiatry

关键词： Biomarker Clinical high risk for psychosis cognitive impairments Early psychosis Eye movement Schizophrenia

来源：评论

学校读者我要写书评

暂无评论

Learning graphons via structured gromov-wasserstein barycenters

arXiv

引用

arXiv 2020年

作者： Xu, Hongteng Luo, Dixin Carin, Lawrence Zha, Hongyuan Gaoling School of Artificial Intelligence Renmin University of China 59 Zhongguancun St Haidian District Beijing100872 China Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China School of Computer Science and Technology Beijing Institue of Technology 5 Zhongguancun St Haidian District100811 China Department of ECE Duke University DurhamNC27708 United States School of Data Science Shenzhen Research Institute of Big Data Chinese University of Hong Kong Hong Kong

We propose a novel and principled method to learn a nonparametric graph model called graphon, which is defined in an infinite-dimensional space and represents arbitrary-size graphs. Based on the weak regularity lemma from the theory of graphons, we leverage a step function to approximate a graphon. We show that the cut distance of graphons can be relaxed to the Gromov-Wasserstein distance of their step functions. Accordingly, given a set of graphs generated by an underlying graphon, we learn the corresponding step function as the Gromov-Wasserstein barycenter of the given graphs. Furthermore, we develop several enhancements and extensions of the basic algorithm, e.g., the smoothed Gromov-Wasserstein barycenter for guaranteeing the continuity of the learned graphons and the mixed Gromov-Wasserstein barycenters for learning multiple structured graphons. The proposed approach overcomes drawbacks of prior state-of-the-art methods, and outperforms them on both synthetic and real-world data. The code is available at https://***/HongtengXu/SGWB-Graphon. © 2020, CC BY.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

On the value of imbalance loss functions in enhancing deep learning-based vulnerability detection

引用

Expert Systems with Applications 2025年 291卷

作者： Xiaoxue Ma Yanzhong He Jacky Keung Cheng Tan Chuanxiang Ma Wenhua Hu Fuyang Li School of Science and Technology Hong Kong Metropolitan University Hong Kong China School of Computer Science Wuhan University Wuhan Hubei China School of Computer Science and Artificial Intelligence Wuhan University of Technology Wuhan Hubei China Department of Computer Science City University of Hong Kong Hong Kong China School of Computer Science Hubei University Wuhan Hubei China Hubei Key Laboratory of Big Data Intelligent Analysis and Application (Hubei University) Wuhan Hubei China

Software vulnerability detection is crucial in software engineering and information security, and deep learning has been demonstrated to be effective in this domain. However, the class imbalance issue, where non-vulnerable code snippets vastly outnumber vulnerable ones, hinders the performance of deep learning-based vulnerability detection (DLVD) models. Although some recent research has explored the use of imbalance loss functions to address this issue and enhance model efficacy, they have primarily focused on a limited selection of imbalance loss functions, leaving many others unexplored. Therefore, their conclusions about the most effective imbalance loss function may be biased and inconclusive. To fill this gap, we first conduct a comprehensive literature review of 119 DLVD studies, focusing on the loss functions used by these models. We then assess the effectiveness of nine imbalance loss functions alongside cross entropy (CE) loss (the standard balanced loss function) on two DLVD models across four public vulnerability datasets. Our evaluation incorporates six performance metrics, with results analyzed using the Scott-Knott effect size difference (ESD) test. Furthermore, we employ interpretable analysis to elucidate the impact of loss functions on model performance. Our findings provide key insights for DLVD, which mainly include the following: the LineVul model consistently outperforms the ReVeal model; label distribution aware margin (LDAM) loss achieves the highest Precision, while logit adjustment (LA) loss yields the best Recall; Class balanced focal (CB-Focal) loss excels in comprehensive performance on extremely imbalanced datasets; and LA loss is optimal for nearly balanced datasets. We recommend using LineVul with either CB-Focal loss or LA loss to enhance DLVD outcomes. Our source code and datasets are available at https://***/YanzhongHe/DLVD-ImbalanceLossEmpirical .

关键词：

来源：评论

学校读者我要写书评

暂无评论

SG-PBFT: A secure and highly efficient blockchain PBFT Consensus Algorithm for internet of vehicles

arXiv

引用

arXiv 2021年

作者： Xu, Guangquan Liu, Yihua Xing, Jun Luo, Tao Gu, Yonghao Liu, Shaoying Zheng, Xi Vasilakos, Athanasios V. The Big Data School Qingdao Huanghai University Qingdao266427 China College of Intelligence and Computing Tianjin University Tianjin300350 China The International Engineering Institute Tianjin University Tianjin300350 China The College of Intelligence and Computing Tianjin University Tianjin Tianjin300350 China The school of Computer Science Beijing University of Posts and Telecommunications Beijing100876 China The Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing100876 China School of Informatics and Data Science Hiroshima University Japan The Department of Computing Macquarie University SydneyNSW2109 Australia The University of Technology Sydney Australia The Fuzhou University Fuzhou China Lulea University of Technology Lulea Sweden

The Internet of Vehicles (IoV) is an application of the Internet of things (IoT). It faces two main security problems: (1) the central server of the IoV may not be powerful enough to support the centralized authentication of the rapidly increasing connected vehicles, (2) the IoV itself may not be robust enough to single-node attacks. To solve these problems, this paper proposes SG-PBFT: a secure and highly efficient PBFT consensus algorithm for Internet of Vehicles, which is based on a distributed blockchain structure. The distributed structure can reduce the pressure on the central server and decrease the risk of single-node attacks. The SG-PBFT consensus algorithm improves the traditional PBFT consensus algorithm by using a score grouping mechanism to achieve a higher consensus efficiency. The experimental result shows that our method can greatly improve the consensus efficiency and prevent single-node attacks. Specifically, when the number of consensus nodes reaches 1000, the consensus time of our algorithm is only about 27% of what is required for the state-of-the-art consensus algorithm (PBFT). Our proposed SG-PBFT is versatile and can be used in other application scenarios which require high consensus efficiency. Copyright © 2021, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：