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

4th International Workshop on Human Brain and Artificial Intelligence, HBAI 2024

作者： Pan, Guandong Wu, Zhaobang Yang, Yaqian Wang, Xin Liu, Longzhao Zheng, Zhiming Tang, Shaoting School of Computer Science and Engineering Beihang University Beijing100191 China Institute of Artificial Intelligence Beihang University Beijing100191 China Key Laboratory of Mathematics Informatics and Behavioral Semantics Beihang University Beijing100191 China Institute of Medical Artificial Intelligence Binzhou Medical University Yantai264003 China Zhongguancun Laboratory Beijing100094 China Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing Beihang University Beijing100191 China PengCheng Laboratory Shenzhen518055 China State Key Lab of Software Development Environment Beihang University Beijing100191 China

ISBN: (纸本)9789819640003

The need for automatic and high-quality emotion annotation is paramount in applications such as continuous emotion recognition and video highlight detection, yet achieving this through manual human annotations is challenging. Inspired by inter-subject correlation (ISC) utilized in neuroscience, this study introduces a novel Electroencephalography (EEG) based ISC methodology that leverages a single-electrode and feature-based dynamic approach. Our contributions are three folds: Firstly, we reidentify two potent emotion features suitable for classifying emotions-first-order difference (FD) an differential entropy (DE). Secondly, through the use of overall correlation analysis, we demonstrate the heterogeneous synchronized performance of electrodes. This performance aligns with neural emotion patterns established in prior studies, thus validating the effectiveness of our approach. Thirdly, by employing a sliding window correlation technique, we showcase the significant consistency of dynamic ISCs across various features or key electrodes in each analyzed film clip. Our findings indicate the method’s reliability in capturing consistent, dynamic shared neural synchrony among individuals, triggered by evocative film stimuli. This underscores the potential of our approach to serve as an indicator of continuous human emotion arousal. The implications of this research are significant for advancements in affective computing and the broader neuroscience field, suggesting a streamlined and effective tool for emotion analysis in real-world applications. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Electroencephalography (EEG) Emotion Annotation Inter-subject Correlation

来源：评论

学校读者我要写书评

暂无评论

A decomposition based algorithm for maximal contractions

引用

Frontiers of Computer Science 2013年第6期7卷 801-811页

作者： Dongchen JIANG Wei LI Jie LUO Yihua LOU Zhengzhong LIAO State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China Tencent Technology (Beijing) Company Limited Beijing 100080 China

This paper proposes a decomposition based algo- rithm for revision problems in classical propositional logic. A set of decomposing rules are presented to analyze the satis- fiability of formulas. The satisfiability of a formula is equivalent to the satisfiability of a set of literal sets. A decomposing function is constructed to calculate all satisfiable literal sets of a given formula. When expressing the satisfiability of a formula, these literal sets are equivalent to all satisfied models of such formula. A revision algorithm based on this decomposing function is proposed, which can calculate maximal contractions of a given problem. In order to reduce the memory requirement, a filter function is introduced. The improved algorithm has a good performance in both time and space perspectives.

关键词： belief change maximal contraction decomposing rules revision algorithm

来源：评论

学校读者我要写书评

暂无评论

Defense Against Adversarial Faces at the Source: Strengthened Faces Based on Hidden Disturbances

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： Li, Shuangliang Wang, Jinwei Wu, Hao Zhang, Jiawei Cheng, Xin Luo, Xiangyang Ma, Bin School of Software Nanjing Universityof Information Science and Technology Nanjing210044 China College of Cryptology and Cyber Science Nankai University Tianjing300073 China State Key Laboratory of Mathemat-ical Engineering and Advanced Computing Zhengzhou450002 China School of Cyber Security and Information Law Chongqing University of Posts and Telecommunications Chongqing400065 China School of Computer Science Nanjing University of Information Science and Technology Nanjing210044 China School of Cyber Security Qilu University of Technology Shandong Academy of Sciences Shandong250353 China

Face Recognition (FR) systems, while widely used across various sectors, are vulnerable to adversarial attacks, particularly those based on deep neural networks. Despite existing efforts to enhance the robustness of FR models, they still face the risk of secondary adversarial attacks. To address this, we propose a novel approach employing "strengthened face" with preemptive defensive perturbations. Strengthened face ensures original recognition accuracy while safeguarding FR systems against secondary attacks. In the white-box scenario, the strengthened face utilizes gradient-based and optimization-based methods to minimize feature representation differences between face pairs. For the black-box scenario, we propose Shielded Gradient Sign Descent (SGSD) to optimize the gradient update direction of strengthened faces, ensuring the transferability and effectiveness against unknown adversarial attacks. Experimental results demonstrate the efficacy of strengthened faces in defending against adversarial faces without compromising the performance of FR models or face image visual quality. Moreover, SGSD outperforms conventional methods, achieving an average performance improvement of 4% in transferability across different attack intensities. © 2020 IEEE.

关键词： adversarial attacks face recognition facial protection

来源：评论

学校读者我要写书评

暂无评论

Path Sensitive Static Analysis of Taint-Style Vulnerabilities in PHP Code 17

Path Sensitive Static Analysis of Taint-Style Vulnerabilitie...

引用

2017 17th IEEE International Conference on Communication Technology (ICCT 2017)

作者： Xue-Xiong Yan Qing-Xian Wang Heng-Tai Ma Institute of Software Chinese Academy of Sciences State Key Laboratory of Mathematical Engineering and Advanced Computing

ISBN: (纸本)9781509039456;9781509039449

this paper presents a novel path-sensitive static analysis method for detecting taint-style vulnerabilities in PHP code. The new method includes three key, the first of which is path searching during a basic block, the second is path searching between blocks, and the third is path searching crossing function call. A tool name POSE implements the new method and the testing results show the method is valid for taint-style vulnerabilities in PHP code.

关键词： path-sensitive PHP taint-style vulnerability POSE

来源：评论

学校读者我要写书评

暂无评论

Accelerating the cryo-EM structure determination in RELION on GPU cluster

引用

Frontiers of Computer Science 2022年第3期16卷 21-39页

作者： Xin YOU Hailong YANG Zhongzhi LUAN Depei QIAN Sino-German Joint Software Institute School of Computer Science and EngineeringBeihang UniversityBeijing 100191China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 214125

The cryo-electron microscopy(cryo-EM)is one of the most powerful technologies available today for structural *** RELION(Regularized Likelihood Optimization)implements a Bayesian algorithm for cryo-EM structure determination,which is one of the most widely used software in this *** researchers have devoted effort to improve the performance of RELION to satisfy the analysis for the ever-increasing volume of *** this paper,we focus on performance analysis of the most time-consuming computation steps in RELION and identify their performance bottlenecks for specific *** propose several performance optimization strategies to improve the overall performance of RELION,including optimization of expectation step,parallelization of maximization step,accelerating the computation of symmetries,and memory affinity *** experiment results show that our proposed optimizations achieve significant speedups of RELION across representative *** addition,we perform roofline model analysis to understand the effectiveness of our optimizations.

关键词： cryo-EM structure determination performance optimization GPU acceleration RELION

来源：评论

学校读者我要写书评

暂无评论

Forgeability of Wang-Zhu-Feng-Yau’s Attribute-Based Signature with Policy-and-Endorsement Mechanism

引用

Journal of Computer Science & Technology 2013年第4期28卷 743-748页

作者：葛爱军黄欣沂陈成马传贵张锐 State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Fujian Provincial Key Laboratory of Network Security and Cryptology School of Mathematics and Computer ScienceFujian Normal University Institute of Software Chinese Academy of Sciences

Recently, Wang et al. presented a new construction of attribute-based signature with policy-and-endorsement mechanism. The existential unforgeability of their scheme was claimed to be based on the strong Diffie-Hellman assumption in the random oracle model. Unfortunately, by carefully revisiting the design and security proof of Wang et alfs scheme, we show that their scheme cannot provide unforgeability, namely, a forger, whose attributes do not satisfy a given signing predicate, can also generate valid signatures. We also point out the flaws in Wang et al.＇s proof.

关键词： attribute-based signature existential unforgeability policy-and-endorsement

来源：评论

学校读者我要写书评

暂无评论

A temporal programming model with atomic blocks based on projection temporal logic

引用

Frontiers of Computer Science 2014年第6期8卷 958-976页

作者： Xiaoxiao YANG Yu ZHANG Ming FU Xinyu FENG State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China Suzhou Institute for Advanced Study University of Science & Technology of China SuZhou 215123 China

Atomic blocks, a high-level language construct that allows programmers to explicitly specify the atomicity of operations without worrying about the implementations, are a promising approach that simplifies concurrent programming. On the other hand, temporal logic is a successful model in logic programming and concurrency verification, but none of existing temporal programming models supports concurrent programming with atomic blocks yet. In this paper, we propose a temporal programming model （αPTL） which extends the projection temporal logic （PTL） to support concurrent programming with atomic blocks. The novel construct that formulates atomic execution of code blocks, which we call atomic interval formulas, is always interpreted over two consecutive states, with the internal states of the block being abstracted away. We show that the framing mechanism in projection temporal logic also works in the new model, which consequently supports our development of an executive language. The language supports concurrency by introducing a loose interleaving semantics which tracks only the mutual exclusion between atomic blocks. We demonstrate the usage of αPTL by modeling and verifying both the fine-grained and coarse-grained concurrency.

关键词： atomic blocks semantics temporal logic programming verification framing

来源：评论

学校读者我要写书评

暂无评论

Quantum verification of NP problems with single photons and linear optics

引用

Light(Science & Applications) 2021年第9期10卷 1750-1760页

作者： Aonan Zhang Hao Zhan Junjie Liao Kaimin Zheng Tao Jiang Minghao Mi Penghui Yao Lijian Zhang National Laboratory of Solid State Microstructures Key Laboratory of Intelligent Optical Sensing and Manipulation(Ministry of Education)and College of Engineering and Applied SciencesNanjing University210093NanjingChina Collaborative Innovation Center of Advanced Microstructures Nanjing University210093NanjingChina State Key Laboratory for Novel Software Technology Nanjing University210093NanjingChina

Quantum computing is seeking to realize hardware-optimized algorithms for application-related computational ***(nondeterministic-polynomial-time)is a complexity class containing many important but intractable problems like the satisfiability of potentially conflict constraints(SAT).According to the well-founded exponential time hypothesis,verifying an SAT instance of size n requires generally the complete solution in an O(n)-bit *** contrast,quantum verification algorithms,which encode the solution into quantum bits rather than classical bit strings,can perform the verification task with quadratically reduced information about the solution in O~(Õ−−√n)*** we realize the quantum verification machine of SAT with single photons and linear *** using tunable optical setups,we efficiently verify satisfiable and unsatisfiable SAT instances and achieve a clear completeness-soundness gap even in the presence of experimental *** protocol requires only unentangled photons,linear operations on multiple modes and at most two-photon joint *** features make the protocol suitable for photonic realization and scalable to large problem sizes with the advances in high-dimensional quantum information manipulation and large scale linear-optical *** results open an essentially new route toward quantum advantages and extend the computational capability of optical quantum computing.

关键词： quantum optics verify

来源：评论

学校读者我要写书评

暂无评论

Exploring the Limits of Superconductivity in Metal-Stuffed B-C Clathrates via Ionic Lattice Anharmonicity

arXiv

引用

arXiv 2025年

作者： Zhao, Wenbo Sun, Ying Li, Jiaxiang Yuan, Peng Iitaka, Toshiaki Zhong, Xin Li, Hefei Fang, Yue-Wen Liu, Hanyu Errea, Ion Xie, Yu Key Laboratory of Material Simulation Methods and Software of Ministry of Education College of Physics Jilin University Changchun130012 China International Center of Future Science Jilin University Changchun130012 China College of Physics Jilin University Changchun130012 China Discrete Event Simulation Research Team RIKEN Center for Computational Science 2-1 Hirosawa Saitama Wako351-0198 Japan State Key Laboratory of Superhard Materials College of Physics Jilin University Changchun130012 China Europa Plaza 1 Donostia/San Sebastián20018 Spain Manuel de Lardizabal Pasealekua 5 Donostia/San Sebastián20018 Spain Manuel de Lardizabal Pasealekua 4 Donostia/San Sebastián20018 Spain Key Laboratory of Physics and Technology for Advanced Batteries of Ministry of Education College of Physics Jilin University Changchun130012 China

Metal-stuffed B−C compounds with sodalite clathrate structure have captured increasing attention due to their predicted exceptional superconductivity above liquid nitrogen temperature at ambient pressure. However, by neglecting the quantum lattice anharmonicity, the existing studies may result in an incomplete understanding of such a lightweight system. Here, using state-of-the-art ab initio methods incorporating quantum effects and machine learning potentials, we revisit the properties of a series of XYB6C6 clathrates where X and Y are metals. Our findings show that ionic quantum and anharmonic effects can harden the Eg and Eu vibrational modes, enabling the dynamical stability of 15 materials previously considered unstable in the harmonic approximation, including materials with previously unreported (XY)1+ state, which is demonstrated here to be crucial to reach high critical temperatures. Further calculations based on the isotropic Migdal-Eliashberg equation demonstrate that the Tc values for KRbB6C6 and RbB3C3 among these stabilized compounds are 87 and 98 K at 0 and 15 GPa, respectively, both being higher than Tc of 77 K of KPbB6C6 at the anharmonic level. These record-high Tc values, surpassing liquid nitrogen temperatures, emphasize the importance of anharmonic effects in stabilizing B–C clathrates with large electron-phonon coupling strength and advancing the search for high-Tc superconductivity at (near) ambient pressure. © 2025, CC BY.

关键词： Technetium compounds

来源：评论

学校读者我要写书评

暂无评论

Collusion-Proof Result Inference in Crowdsourcing

引用

Journal of Computer Science & Technology 2018年第2期33卷 351-365页

作者： Peng-Peng Chen Hai-Long Sun Yi-Li Fang Jin-Peng Huai State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing 100191 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing 100191 China

In traditional crowdsourcing, workers are expected to provide independent answers to tasks so as to ensure the diversity of answers. However, recent studies show that the crowd is not a collection of independent workers, but instead that workers communicate and collaborate with each other. To pursue more rewards with little effort, some workers may collude to provide repeated answers, which will damage the quality of the aggregated results. Nonetheless, there are few efforts considering the negative impact of collusion on result inference in crowdsourcing. In this paper, we are specially concerned with the Collusion-Proof result inference problem for general crowdsourcing tasks in public platforms. To that end, we design a metric, the worker performance change rate, to identify the colluded answers by computing the difference of the mean worker performance before and after removing the repeated answers. Then we incorporate the collusion detection result into existing result inference methods to guarantee the quality of the aggregated results even with the occurrence of collusion behaviors. With real-world and synthetic datasets, we conducted an extensive set of evaluations of our approach. The experimental results demonstrate the superiority of our approach in comparison with the state-of-the-art methods.

关键词： crowdsourcing quality control collusion collaborative crowdsourcing result inference

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：