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

International Conference on Software Engineering (ICSE)

作者： Zhen Li Ning Wang Deqing Zou Yating Li Ruqian Zhang Shouhuai Xu Chao Zhang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Jin YinHu Laboratory Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado Springs Colorado USA Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers; and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities.

关键词： Deep learning Detectors Open source software Software engineering

来源：评论

学校读者我要写书评

暂无评论

Stacked Cross Refinement network for Edge-Aware Salient Object Detection

Stacked Cross Refinement Network for Edge-Aware Salient Obje...

引用

International Conference on Computer Vision (ICCV)

作者： Zhe Wu Li Su Qingming Huang School of Computer Science and Technology University of Chinese Academy of Sciences (UCAS) Beijing China Key Lab of Big Data Mining and Knowledge Management UCAS Beijing China Key Lab of Intell. Info. Process. Inst. of Comput. Tech. CAS Beijing China Peng Cheng Laboratory ShenZhen China

ISBN: (数字)9781728148038

ISBN: (纸本)9781728148045

Salient object detection is a fundamental computer vision task. The majority of existing algorithms focus on aggregating multi-level features of pre-trained convolutional neural networks. Moreover, some researchers attempt to utilize edge information for auxiliary training. However, existing edge-aware models design unidirectional frameworks which only use edge features to improve the segmentation features. Motivated by the logical interrelations between binary segmentation and edge maps, we propose a novel Stacked Cross Refinement network (SCRN) for salient object detection in this paper. Our framework aims to simultaneously refine multi-level features of salient object detection and edge detection by stacking Cross Refinement Unit (CRU). According to the logical interrelations, the CRU designs two direction-specific integration operations, and bidirectionally passes messages between the two tasks. Incorporating the refined edge-preserving features with the typical U-Net, our model detects salient objects accurately. Extensive experiments conducted on six benchmark datasets demonstrate that our method outperforms existing state-of-the-art algorithms in both accuracy and efficiency. Besides, the attribute-based performance on the SOC dataset show that the proposed model ranks first in the majority of challenging scenes. Code can be found at https://***/wuzhe71/SCAN.

关键词： Image edge detection Task analysis Feature extraction Object detection Image segmentation Silicon Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Long-distance entanglement purification for quantum communication

arXiv

引用

arXiv 2021年

作者： Hu, Xiao-Min Huang, Cen-Xiao Sheng, Yu-Bo Zhou, Lan Liu, Bi-Heng Guo, Yu Zhang, Chao Xing, Wen-Bo Huang, Yun-Feng Li, Chuan-Feng Guo, Guang-Can CAS Key Laboratory of Quantum Information University of Science and Technology of China Hefei230026 China Institute of Quantum Information and Technology Nanjing University of Posts and Telecommunications Nanjing210003 China College of Mathematics & Physics Nanjing University of Posts and Telecommunications Nanjing210003 China CAS Center For Excellence in Quantum Information and Quantum Physics University of Science and Technology of China Hefei230026 China Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Nanjing210003 China

High quality long-distance entanglement is essential for both quantum communication and scalable quantum networks. Entanglement purification is to distill high-quality entanglement from low-quality entanglement in a noisy environment and it plays a key role in quantum repeaters. The previous significant entanglement purification experiments require two pairs of low-quality entangled states and were demonstrated in table-top. Here we propose and report a high-efficiency and long-distance entanglement purification using only one pair of hyperentangled state. We also demonstrate its practical application in entanglement-based quantum key distribution (QKD). One pair of polarization spatial-mode hyperentanglement was distributed over 11 km multicore fiber (noisy channel). After purification, the fidelity of polarization entanglement arises from 0.771 to 0.887 and the effective key rate in entanglement-based QKD increases from 0 to 0.332. The values of Clauser-Horne-Shimony-Holt (CHSH) inequality of polarization entanglement arises from 1.829 to 2.128. Moreover, by using one pair of hyperentanglement and deterministic controlled-NOT gate, the total purification efficiency can be estimated as 6.6 × 103 times than the experiment using two pairs of entangled states with spontaneous parametric down conversion (SPDC) sources. Our results offer the potential to be implemented as part of a full quantum repeater and large scale quantum network. Copyright © 2021, The Authors. All rights reserved.

关键词： Quantum communication

来源：评论

学校读者我要写书评

暂无评论

Computing integrals involved the gaussian function with a small standard deviation

arXiv

引用

arXiv 2018年

作者： Ma, Yunyun Ma, Yunyun Xu, Yuesheng Xu, Yuesheng School of Computer Science and Network Security Dongguan University of Technology Dongguan523808 China Department of Mathematics and Statistics Old Dominion University NorfolkVA23529 United States School of Data and Computer Science Guangdong Province Key Lab of Computational Science Sun Yat-sen University Guangzhou510275 China

We develop efficient numerical integration methods for computing an integral whose integrand is a product of a smooth function and the Gaussian function with a small standard deviation. Traditional numerical integration methods applied to the integral normally lead to poor accuracy due to the rapid change in high order derivatives of its integrand when the standard deviation is small. The proposed quadrature schemes are based on graded meshes designed according to the standard deviation so that the quadrature errors on the resulting subintervals are approximately equal. The integral in each subinterval is then computed by considering the Gaussian function as a weight function and interpolating the smooth factor of the integrand at the Chebyshev points of the first kind. For a finite order differentiable factor, we design a quadrature scheme having accuracy of a polynomial order and for an infinitely differentiable factor of the integrand, we design a quadrature scheme having accuracy of an exponential order. Numerical results are presented to confirm the accuracy of these proposed quadrature schemes. Copyright © 2018, The Authors. All rights reserved.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

CustomFair: A Customized Fairness Method for Federated Recommender Systems in Social Internet of Things

引用

IEEE Internet of Things Journal 2024年

作者： Chen, Guorong Li, Chao Du, Fei Yuan, Xiaohan Chi, Cheng Yin, Zihang Wang, Bin Li, Tao Bao, Xuhua Wang, Wei Beijing Jiaotong University Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing100044 China China Academy of Information and Communications Technology Beijing China Network and Data Security Hangzhou310053 China Nankai University College of Computer Science Tianjin300350 China LTD Sangfor Technologies Co Beijing China Xi'an Jiaotong University Ministry of Education Key Lab for Intelligent Networks and Network Security Xi'an China

In the Social Internet of Things (SIoT), edge computing integrates artificial intelligence to learn intricate relationships. The scale and complexity of SIoT cause a data explosion from diverse objects, hindering tailored services to users who own objects. Moreover, conventional edge computing in SIoT depends on centralized data collection, raising concerns about data privacy. To address the above two issues, federated recommender systems (FRSs) present a promising solution. FRSs can provide SIoT services to users and train a shared model while retaining sensitive data locally on objects. However, as FRSs are driven by data, they are inherently susceptible to algorithmic bias, raising substantial fairness concerns that have attracted considerable attention in SIoT. Recent fairness studies predominantly concentrate on a single sensitive attribute for users, thereby overlooking their autonomy. Therefore, we propose CustomFair, a personalized fairness framework that enables users in FRSs to select preferred sensitive attributes and acquire satisfied recommendation services in SIoT scenarios. First, we define customized fairness to ensure group fairness based on users' sensitive attributes. The server segments users into subgroups in a privacy-preserving manner. Second, CustomFair employs the DynBalance method with a flexible regularization coefficient to improve recommendation performance and utilizes the AdaptEpoch strategy to achieve fairness. Extensive experiments indicate that CustomFair improves recommendation performance by 0.1 ∼ 42.92 and enhances fairness by reducing disparities of 0.03 ∼ 5.41 compared to two baselines across three datasets. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Ginsenoside compound-K attenuates OVX-induced osteoporosis via the suppression of RANKL-induced osteoclastogenesis and oxidative stress

引用

Natural Products and Bioprospecting 2023年第1期13卷 159-170页

作者： Lingli Ding Zhao Gao Siluo Wu Chen Chen Yamei Liu Min Wang Yage Zhang Ling Li Hong Zou Guoping Zhao Shengnan Qin Liangliang Xu Key Laboratory of Orthopaedics and Traumatology Lingnan Medical Research CenterThe First Affiliated Hospital of Guangzhou University of Chinese MedicineGuangzhou University of Chinese MedicineGuangzhouChina Er Sha Sports Training Center of Guangdong Province GuangzhouChina School of Basic Medical Science Guangzhou University of Chinese MedicineGuangzhouChina Engineering Laboratory for Nutrition Shanghai Institute of Nutrition and HealthChinese Academy of SciencesShanghaiChina Master Lab for Innovative Application of Nature Products National Center of Technology Innovation for Synthetic BiologyTianjin Institute of Industrial BiotechnologyChinese Academy of SciencesTianjinChina CAS Key Laboratory of Quantitative Engineering Biology Shenzhen Institute of Synthetic BiologyShenzhen Institute of Advanced TechnologyChinese Academy of SciencesShenzhenChina CAS-Key Laboratory of Synthetic Biology CAS Center for Excellence in Molecular Plant SciencesShanghai Institute of Plant Physiology and EcologyChinese Academy of SciencesShanghaiChina Bio-Med Big Data Center Shanghai Institute of Nutrition and HealthChinese Academy of SciencesShanghaiChina State Key Laboratory of Genetic Engineering Department of Microbiology and ImmunologySchool of Life SciencesFudan UniversityShanghaiChina Department of Microbiology The Chinese University of Hong KongHong KongChina Department of Orthopaedics Guangzhou Institute of Traumatic SurgeryGuangzhou Red Cross HospitalMedical CollegeJinan UniversityGuangzhouChina

Osteoporosis(OP),a systemic and chronic bone disease,is distinguished by low bone mass and destruction of bone *** Compound-K(CK),one of the metabolites of ginsenoside Rb1,has anti-aging,anti-inflammatory,anti-cancer,and hypolipidemic *** have demonstrated CK could promote osteogenesis and fracture healing in our previous ***,the contribution of CK to osteoporosis has not been *** the present study,we investigated the effect of CK on osteoclastogenesis and ovariectomy(OVX)-induced *** results showed that CK inhibited receptor activator for nuclear factor-κB ligand(RANKL)-mediated osteoclast differentiation and reactive oxygen species(ROS)activity by inhibiting the phosphorylation of NF-κB p65 and oxidative stress in RAW264.7 *** addition,we also demonstrated that CK could inhibit bone resorption using bone marrow-derived ***,we demonstrated that CK attenuated bone loss by suppressing the activity of osteoclast and alleviating oxidative stress in *** together,these results showed CK could inhibit osteoclastogenesis and prevent OVX-induced bone loss by inhibiting NF-κB signaling pathway.

关键词： Ginsenoside CK NF-κB signaling pathway Osteoporosis Oxidative stress

来源：评论

学校读者我要写书评

暂无评论

Modelling universal order book dynamics in bitcoin market

arXiv

引用

arXiv 2021年

作者： Shi, Fabin Aden, Nathan Huang, Shengda Johnson, Neil Sun, Xiaoqian Gao, Jinhua Xu, Li Shen, Huawei Cheng, Xueqi Song, Chaoming CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing100049 China Department of Physics University of Miami Coral GablesFL33142 United States Physics Department George Washington University WashingtonD.C.20052 United States

Understanding the emergence of universal features such as the stylized facts in markets is a longstanding challenge that has drawn much attention from economists and physicists. Most existing models, such as stochastic volatility models, focus mainly on price changes, neglecting the complex trading dynamics. Recently, there are increasing studies on order books, thanks to the availability of large-scale trading datasets, aiming to understand the underlying mechanisms governing the market dynamics. In this paper, we collect order-book datasets of Bitcoin platforms across three countries over millions of users and billions of daily turnovers. We find a 1+1D field theory, govern by a set of KPZ-like stochastic equations, predicts precisely the order book dynamics observed in empirical data. Despite the microscopic difference of markets, we argue the proposed effective field theory captures the correct universality class of market dynamics. We also show that the model agrees with the existing stochastic volatility models at the long-wavelength limit. © 2021, CC BY.

关键词： Bitcoin

来源：评论

学校读者我要写书评

暂无评论

BiKT: Unleashing the potential of GNNs via Bi-directional Knowledge Transfer

arXiv

引用

arXiv 2023年

作者： Zheng, Shuai Liu, Zhizhe Zhu, Zhenfeng Zhang, Xingxing Li, Jianxin Zhao, Yao The Institute of Information Science Beijing Jiaotong University Beijing100044 China The Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China Qiyuan Lab Beijing China The Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University Beijing100083 China

Based on the message-passing paradigm, there has been an amount of research proposing diverse and impressive feature propagation mechanisms to improve the performance of GNNs. However, less focus has been put on feature transformation, another major operation of the message-passing framework. In this paper, we first empirically investigate the performance of the feature transformation operation in several typical GNNs. Unexpectedly, we notice that GNNs do not completely free up the power of the inherent feature transformation operation. By this observation, we propose the Bi-directional Knowledge Transfer (BiKT), a plug-and-play approach to unleash the potential of the feature transformation operations without modifying the original architecture. Taking the feature transformation operation as a derived representation learning model that shares parameters with the original GNN, the direct prediction by this model provides a topological-agnostic knowledge feedback that can further instruct the learning of GNN and the feature transformations therein. On this basis, BiKT not only allows us to acquire knowledge from both the GNN and its derived model but promotes each other by injecting the knowledge into the other. In addition, a theoretical analysis is further provided to demonstrate that BiKT improves the generalization bound of the GNNs from the perspective of domain adaption. An extensive group of experiments on up to 7 datasets with 5 typical GNNs demonstrates that BiKT brings up to 0.5% - 4% performance gain over the original GNN, which means a boosted GNN is obtained. Meanwhile, the derived model also shows a powerful performance to compete with or even surpass the original GNN, enabling us to flexibly apply it independently to some other specific downstream tasks. Copyright © 2023, The Authors. All rights reserved.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Toward Enhanced Robustness in Unsupervised Graph Representation Learning: A Graph Information Bottleneck Perspective

arXiv

引用

arXiv 2022年

作者： Wang, Jihong Luo, Minnan Li, Jundong Liu, Ziqi Zhou, Jun Zheng, Qinghua The Ministry of Education Key Lab for Intelligent Networks and Network Security School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China The Department of Electrical and Computer Engineering Department of Computer Science School of Data Science University of Virginia United States The Ant Financial Services Group Zhejiang Hangzhou310000 China

Recent studies have revealed that GNNs are vulnerable to adversarial attacks. Most existing robust graph learning methods measure model robustness based on label information, rendering them infeasible when label information is not available. A straightforward direction is to employ the widely used Infomax technique from typical Unsupervised Graph Representation Learning (UGRL) to learn robust unsupervised representations. Nonetheless, directly transplanting the Infomax technique from typical UGRL to robust UGRL may involve a biased assumption. In light of the limitation of Infomax, we propose a novel unbiased robust UGRL method called Robust Graph Information Bottleneck (RGIB), which is grounded in the Information Bottleneck (IB) principle. Our RGIB attempts to learn robust node representations against adversarial perturbations by preserving the original information in the benign graph while eliminating the adversarial information in the adversarial graph. There are mainly two challenges to optimize RGIB: 1) high complexity of adversarial attack to perturb node features and graph structure jointly in the training procedure;2) mutual information estimation upon adversarially attacked graphs. To tackle these problems, we further propose an efficient adversarial training strategy with only feature perturbations and an effective mutual information estimator with subgraph-level summary. Moreover, we theoretically establish a connection between our proposed RGIB and the robustness of downstream classifiers, revealing that RGIB can provide a lower bound on the adversarial risk of downstream classifiers. Extensive experiments over several benchmarks and downstream tasks demonstrate the effectiveness and superiority of our proposed method. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Gradient sparsification for efficient wireless federated learning with differential privacy

引用

science China(Information sciences) 2024年第4期67卷 272-288页

作者： Kang WEI Jun LI Chuan MA Ming DING Feng SHU Haitao ZHAO Wen CHEN Hongbo ZHU School of Electronic and Optical Engineering Nanjing University of Science and Technology Zhejiang Lab Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of Education Data61 Commonwealth Scientific and Industrial Research Organisation School of Information and Communication Engineering Hainan University School of Communications and Information Engineering Nanjing University of Posts and Telecommunications School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University

Federated learning(FL) enables distributed clients to collaboratively train a machine learning model without sharing raw data with each other. However, it suffers from the leakage of private information from uploading models. In addition, as the model size grows, the training latency increases due to the limited transmission bandwidth and model performance degradation while using differential privacy(DP)protection. In this paper, we propose a gradient sparsification empowered FL framework with DP over wireless channels, to improve training efficiency without sacrificing convergence performance. Specifically, we first design a random sparsification algorithm to retain a fraction of the gradient elements in each client's local model, thereby mitigating the performance degradation induced by DP and reducing the number of transmission parameters over wireless channels. Then, we analyze the convergence bound of the proposed algorithm, by modeling a non-convex FL problem. Next, we formulate a time-sequential stochastic optimization problem for minimizing the developed convergence bound, under the constraints of transmit power, the average transmitting delay, as well as the client's DP requirement. Utilizing the Lyapunov drift-plus-penalty framework, we develop an analytical solution to the optimization problem. Extensive experiments have been implemented on three real-life datasets to demonstrate the effectiveness of our proposed algorithm. We show that our proposed algorithms can fully exploit the interworking between communication and computation to outperform the baselines, i.e., random scheduling, round robin, and delay-minimization algorithms.

关键词： federated learning differential privacy gradient sparsification Lyapunov drift convergence analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：