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

PNSS: Unknown Face Presentation Attack Detection with Pseudo Negative Sample Synthesis

computers, Materials & Continua 2025年第5期83卷 3097-3112页

作者： Hongyang Wang Yichen Shi Jun Feng Zitong Yu Zhuofu Tao School of Information Science and Technology Shijiazhuang Tiedao UniversityShijiazhuang050043China Shijiazhuang Key Laboratory of Artificial Intelligence Shijiazhuang Tiedao UniversityShijiazhuang050043China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong UniversityShanghai200240China School of Computer Science and Technology Great Bay UniversityDongguan523808China School of Electrical and Computer Engineering University of CaliforniaLos AngelesCA 90095USA

Face Presentation Attack Detection(fPAD)plays a vital role in securing face recognition systems against various presentation *** supervised learning-based methods demonstrate effectiveness,they are prone to overfitting to known attack types and struggle to generalize to novel attack *** studies have explored formulating fPAD as an anomaly detection problem or one-class classification task,enabling the training of generalized models for unknown attack ***,conventional anomaly detection approaches encounter difficulties in precisely delineating the boundary between bonafide samples and unknown *** address this challenge,we propose a novel framework focusing on unknown attack detection using exclusively bonafide facial data during *** core innovation lies in our pseudo-negative sample synthesis(PNSS)strategy,which facilitates learning of compact decision boundaries between bonafide faces and potential attack ***,PNSS generates synthetic negative samples within low-likelihood regions of the bonafide feature space to represent diverse unknown attack *** overcome the inherent imbalance between positive and synthetic negative samples during iterative training,we implement a dual-loss mechanism combining focal loss for classification optimization with pairwise confusion loss as a *** architecture effectively mitigates model bias towards bonafide samples while maintaining discriminative *** evaluations across three benchmark datasets validate the framework’s superior ***,our PNSS achieves 8%–18% average classification error rate(ACER)reduction compared with state-of-the-art one-class fPAD methods in cross-dataset evaluations on Idiap Replay-Attack and MSU-MFSD datasets.

关键词： Face presentation attack detection pseudo negative sample anomaly detection one-class classification

来源：评论

学校读者我要写书评

暂无评论

Fixed-time-synchronized control: a system-dimension-categorized approach

引用

science China(Information sciences) 2023年第7期66卷 177-194页

作者： Wanyue JIANG Shuzhi Sam GE Dongyu LI Institute for Future & Shandong Key Laboratory of Industrial Control Technology School of Automation Qingdao University Department of Electrical and Computer Engineering National University of Singapore School of Cyber Science and Technology Beihang University Shanghai Institute of Satellite Engineering

This study addresses the fixed-time-synchronized control problem of perturbed multi-input multioutput(MIMO) systems. In the task of fixed-time-synchronized control, different dimensions of the output signal in MIMO systems are required to reach the desired value simultaneously within a fixed time *** MIMO system is categorized into two cases: the input-dimension-dominant and the state-dimensiondominant cases. The classification is defined according to the dimension of system signals and, more importantly, the capability of converging at the same time. For each kind of MIMO system, sufficient Lyapunov conditions for fixed-time-synchronized convergence are explored, and the corresponding robust sliding mode controllers are designed. Moreover, perturbations are compensated using the super-twisting technique. The brake control of the vertical takeoff and landing aircraft is considered to verify the proposed method for the input-dimension-dominant case, which shows the essential advantages of decreasing the energy consumption and the output trajectory length. Furthermore, comparative numerical simulations are performed to show the semi-time-synchronized property for the state-dimension-dominant case.

关键词： fixed-time-synchronized convergence sliding mode control perturbed MIMO systems

来源：评论

学校读者我要写书评

暂无评论

Investigations and Time Estimation on Federated Learning for Future Internet of Vehicles

引用

IEEE Internet of Things Journal 2025年第11期12卷 17387-17398页

作者： Fukumoto, Shun Li, Ruidong Zeng, Kai Nan, Haihan Su, Zhou Kanazawa University Intelligent Computation and Network Laboratory Division of Electrical Information and Communication Engineering Kanazawa920-1192 Japan Kunming University of Science and Technology Faculty of Information Engineering Automation Kunming066000 China Kanazawa University Division of Electrical Information and Communication Engineering Kanazawa920-1192 Japan George Mason University Electrical and Computer Engineering Department FairfaxVA22030 United States Xi’an Jiaotong University School of Cyber Science and Engineering Xi’an710049 China

For future Internet of Vehicles (IoV), communications and computing will converge to provide services. Federated learning (FL), as one of the typical distributed computing technologies, needs to be integrated with IoV. For such integration, FL suffers from the straggler effect that the entire learning speed is lowered down, because of the existence of the devices, such as low-powered road side units and vehicles, taking more time to complete their tasks. Although the existing mechanisms reduce straggler effects by adopting asynchronous mechanisms and clustering mechanisms, they lack the detailed analysis of the reasons and the impacts of each cause, leading to inefficiencies in the design of algorithm. Additionally, most of the existing work only considered the impact of a single factor in computation, communication, or data distribution, which lacks comprehensive on research for causes of stragglers effects. The bottleneck is that it is laborious to observe the time delay precisely with the existing high-calculating evaluations. In this article, we elaborately explore the effects of computing power, communication capability, and data distributions on the straggler effects with carefully designing and conducting the extensive experiments. After investigations, we propose a novel learning completion time estimation formula for low computing capability devices with mini-batch stochastic gradient decent (SGD). We compare our proposed estimation formula with the one based on floating operation per second (FLOPs). Through the evaluations, our formula can demonstrate the improvement up to 72.4% at docker and 32.4% at Raspberry Pi device compared to the existing work. © 2014 IEEE.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

InGaPχ^((2))integrated photonics platform for broadband,ultra-efficient nonlinear conversion and entangled photon generation

引用

Light(science & Applications) 2024年第12期13卷 3090-3098页

作者： Joshua Akin Yunlei Zhao Yuvraj Misra A.K.M.Naziul Haque Kejie Fang Holonyak Micro and Nanotechnology Laboratory and Department of Electrical and Computer Engineering University of Illinois at Urbana-ChampaignUrbanaIL 61801USA Illinois Quantum Information Science and Technology Center University of Illinois at Urbana-ChampaignUrbanaIL 61801USA

Nonlinear optics plays an important role in many areas of science and *** advance of nonlinear optics is empowered by the discovery and utilization of materials with growing optical *** we demonstrate an indium gallium phosphide(InGaP)integrated photonics platform for broadband,ultra-efficient second-order nonlinear *** InGaP nanophotonic waveguide enables second-harmonic generation with a normalized efficiency of 128,000%/W/cm^(2)at 1.55μm pump wavelength,nearly two orders of magnitude higher than the state of the art in the telecommunication C ***,we realize an ultra-bright,broadband time-energy entangled photon source with a pair generation rate of 97 GHz/mW and a bandwidth of 115 nm centered at the telecommunication C *** InGaP entangled photon source shows high coincidence-to-accidental counts ratio CAR>10^(4)and two-photon interference visibility>98%.The InGaP second-order nonlinear photonics platform will have wide-ranging implications for non-classical light generation,optical signal processing,and quantum networking.

关键词： nonlinear optics coincidence

来源：评论

学校读者我要写书评

暂无评论

Shorter ZK-SNARKs from square span programs over ideal lattices

引用

Cybersecurity 2025年第1期8卷 208-226页

作者： Xi Lin Heyang Cao Feng‑Hao Liu Zhedong Wang Mingsheng Wang Key Laboratory of Cyberspace Security Defense Institute of Information EngineeringChinese Academy of SciencesBeijingChina School of Cyber Security University of Chinese Academy of SciencesBeijingChina School of Electrical Engineering&Computer Science Washington State UniversityPullmanWAUSA School of Cyber Science and Engineering Shanghai Jiaotong UniversityShanghaiChina

Zero-knowledge succinct non-interactive arguments of knowledge(zk-SNARKs)are cryptographic protocols that ofer efcient and privacy-preserving means of verifying NP language relations and have drawn considerable atten‑tion for their appealing applications,e.g.,verifable computation and anonymous payment *** with the pre-quantum case,the practicability of this primitive in the post-quantum setting is still unsatisfactory,espe‑cially for the space *** tackle this issue,this work seeks to enhance the efciency and compactness of lat‑tice-based zk-SNARKs,including proof length and common reference string(CRS)*** this paper,we develop the framework of square span program-based SNARKs and design new zk-SNARKs over cyclotomic *** with previous works,our construction is without parallel repetition and achieves shorter proof and CRS lengths than previous lattice-based zk-SNARK ***,the proof length of our scheme is around 23.3%smaller than the recent shortest lattice-based zk-SNARKs by Ishai et al.(in:Proceedings of the 2021 ACM SIGSAC conference on computer and communications security,pp 212-234,2021),and the CRS length is 3.6×*** constructions follow the framework of Gennaro et al.(in:Proceedings of the 2018 ACM SIGSAC conference on computer and com‑munications security,pp 556-573,2018),and adapt it to the ring setting by slightly modifying the knowledge *** develop concretely small constructions by using module-switching and key-switching procedures in a novel way.

关键词： Zk-SNARKs Post-quantum Succinct argument

来源：评论

学校读者我要写书评

暂无评论

High-Performance Flow Classification of Big Data Using Hybrid CPU-GPU Clusters of Cloud Environments

引用

Tsinghua science and Technology 2024年第4期29卷 1118-1137页

作者： Azam Fazel-Najafabadi Mahdi Abbasi Hani H.Attar Ayman Amer Amir Taherkordi Azad Shokrollahi Mohammad R.Khosravi Ahmed A.Solyman Department of Computer Engineering Faculty of EngineeringBu-Ali Sina UniversityHamedan ***Iran Department of Energy Engineering Zarqa UniversityZarqa 13132Jordan Department of Informatics University of OsloOslo 0316Norway Department of Computer Science MalmöUniversityMalmö20506Sweden Shandong Provincial University Laboratory for Protected Horticulture Weifang University of Science and TechnologyWeifang 261100China Department of Electrical and Electronics Engineering NişantaşıUniversityIstanbul 34481742Türkiye

The network switches in the data plane of Software Defined Networking (SDN) are empowered by an elementary process, in which enormous number of packets which resemble big volumes of data are classified into specific flows by matching them against a set of dynamic rules. This basic process accelerates the processing of data, so that instead of processing singular packets repeatedly, corresponding actions are performed on corresponding flows of packets. In this paper, first, we address limitations on a typical packet classification algorithm like Tuple Space Search (TSS). Then, we present a set of different scenarios to parallelize it on different parallel processing platforms, including Graphics Processing Units (GPUs), clusters of Central Processing Units (CPUs), and hybrid clusters. Experimental results show that the hybrid cluster provides the best platform for parallelizing packet classification algorithms, which promises the average throughput rate of 4.2 Million packets per second (Mpps). That is, the hybrid cluster produced by the integration of Compute Unified Device Architecture (CUDA), Message Passing Interface (MPI), and OpenMP programming model could classify 0.24 million packets per second more than the GPU cluster scheme. Such a packet classifier satisfies the required processing speed in the programmable network systems that would be used to communicate big medical data.

关键词： OpenMP Compute Unified Device Architecture(CUDA) Message Passing Interface(MPI) packet classification medical data tuple space algorithm Graphics Processing Unit(GPU)cluster

来源：评论

学校读者我要写书评

暂无评论

Hypergraph-Based Source Codes for Function Computation Under Maximal Distortion

Hypergraph-Based Source Codes for Function Computation Under...

引用

作者： Basu, Sourya Seo, Daewon Varshney, Lav R. University of Illinois Urbana-Champaign Coordinated Science Laboratory Department of Electrical and Computer Engineering UrbanaIL61801 United States Daegu Gyeongbuk Institute of Science and Technology Department of Electrical Engineering and Computer Science Daegu42988 Korea Republic of

This work investigates functional source coding problems with maximal distortion, motivated by approximate function computation in many modern applications. The maximal distortion treats imprecise reconstruction of a function value as good as perfect computation if it deviates less than a tolerance level, while treating reconstruction that differs by more than that level as a failure. Using a geometric understanding of the maximal distortion, we propose a hypergraph-based source coding scheme for function computation that is constructive in the sense that it gives an explicit procedure for finding optimal or good auxiliary random variables. Moreover, we find that the hypergraph-based coding scheme achieves the optimal rate-distortion function in the setting of coding for computing with side information and achieves the Berger-Tung sum-rate inner bound in the setting of distributed source coding for computing. It also achieves the El Gamal-Cover inner bound for multiple description coding for computing and is optimal for successive refinement and cascade multiple description problems for computing. Lastly, the benefit of complexity reduction of finding a forward test channel is shown for a class of Markov sources. © 2020 IEEE.

关键词： Image coding

来源：评论

学校读者我要写书评

暂无评论

Robust Monocular Camera-Based Localization in Industrial Environments

Robust Monocular Camera-Based Localization in Industrial Env...

引用

2024 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2024

作者： Won, Yungu Choi, Yein Ryu, Hwangryol Moon, Youngmin Kwon, Kihoon Hwang, Sung Soo Handong Global University Dept. of Computer Science and Electrical Engineering Pohang Korea Republic of Research Institute of Industrial Science & Technology Smart Engineering Research Laboratory Pohang Korea Republic of School of Computer Science and Electrical Engineering Handong Global University Pohang Korea Republic of

ISBN: (纸本)9798331530839

This paper proposes a camera-based system for robust localization of workers or robots in large-scale factories and industrial sites. The system is designed with the convenience and efficiency of workers in mind, providing stable tracking capabilities. To achieve this, a monocular camera is attached to a safety helmet, enabling localization without restricting the worker's range of motion. Additionally, by combining Visual Simultaneous Localization and Mapping and Visual Place Recognition, the system tracks the location of workers or robots while minimizing tracking loss, ensuring consistent localization. Our methodology has enhanced the accuracy and reliability of position estimation by approximately 46.0%. By accurately identifying the location of workers or robots, the system aims to prevent accidents and ensure swift responses in emergency situations. © 2024 IEEE.

关键词： Industrial robots

来源：评论

学校读者我要写书评

暂无评论

Learning Minimax-Optimal Terminal State Estimators and Smoothers

引用

IFAC-PapersOnLine 2023年第2期56卷 11545-11550页

作者： Xiangyuan Zhang Raj Kiriti Velicheti Tamer Başar Department of Electrical and Computer Engineering and Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana IL 61801 USA

We develop the first model-free policy gradient (PG) algorithm for the minimax state estimation of discrete-time linear dynamical systems, where adversarial disturbances could corrupt both dynamics and measurements. Specifically, the proposed algorithm learns a minimax-optimal solution for three fundamental tasks in robust (minimax) estimation, namely terminal state filtering, terminal state prediction, and smoothing, in a unified fashion. We further establish convergence and finite sample complexity guarantees for the proposed PG algorithm. Additionally, we propose a model-free algorithm to evaluate the attenuation (robustness) level of any estimator or smoother, which serves as a model-free solution to identify the maximum size of the disturbance under which the estimator will still be robust. We demonstrate the effectiveness of the proposed algorithms through extensive numerical experiments.

关键词： Minimax Filtering Prediction Smoothing Policy Gradient Sample Complexity

来源：评论

学校读者我要写书评

暂无评论

Entropic and Operational Characterizations of Dynamic Quantum Resources

引用

IEEE Transactions on Information Theory 2025年

作者： Ji, Kaiyuan Chitambar, Eric Cornell University School of Electrical and Computer Engineering IthacaNY14850 United States University of Illinois at Urbana-Champaign Coordinated Science Laboratory Department of Electrical and Computer Engineering UrbanaIL61801 United States

We offer new methods for characterizing general closed and convex quantum resource theories, including dynamic ones, based on entropic concepts and operational tasks. We propose a resource-theoretic generalization of the quantum conditional min-entropy, termed the free conditional min-entropy (FCME), in the sense that it quantifies an observer's "subjective"degree of uncertainty about a quantum system given that the observer's information processing is limited to free operations of the resource theory. Using this generalized concept, we provide a complete set of entropic conditions for free convertibility between quantum states or channels in any closed and convex quantum resource theory. We also derive an information-theoretic interpretation for the resource global robustness of a state or a channel in terms of a mutual-information-like quantity based on the FCME. Apart from this entropic approach, we characterize dynamic resources by also analyzing their performance in operational tasks. We construct operationally meaningful and complete sets of resource monotones with these tasks, which enable faithful tests of free convertibility between quantum channels. Finally, we show that every well-defined robustness-based measure of a channel can be interpreted as an operational advantage of the channel over free channels in a communication task. © 1963-2012 IEEE.

关键词： Quantum channel

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：