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

arXiv 2025年

作者： Li, Hengzhuang Zhang, Teng National Engineering Research Center for Big Data Technology and System Service Computing Technology and Systems Laboratory Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Out-of-distribution (OOD) detection is crucial for developing trustworthy and reliable machine learning systems. Recent advances in training with auxiliary OOD data demonstrate efficacy in enhancing detection capabilities. Nonetheless, these methods heavily rely on acquiring a large pool of high-quality natural outliers. Some prior methods try to alleviate this problem by synthesizing virtual outliers but suffer from either poor quality or high cost due to the monotonous sampling strategy and the heavy-parameterized generative models. In this paper, we overcome all these problems by proposing the Hamiltonian Monte Carlo Outlier Synthesis (HamOS) framework, which views the synthesis process as sampling from Markov chains. Based solely on the in-distribution data, the Markov chains can extensively traverse the feature space and generate diverse and representative outliers, hence exposing the model to miscellaneous potential OOD scenarios. The Hamiltonian Monte Carlo with sampling acceptance rate almost close to 1 also makes our framework enjoy great efficiency. By empirically competing with SOTA baselines on both standard and large-scale benchmarks, we verify the efficacy and efficiency of our proposed HamOS. Our code is available at: https://***/Fir-lat/HamOS_OOD. © 2025, CC BY.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

Against Mobile Collusive Eavesdroppers: Cooperative Secure Transmission and Computation in UAV-Assisted MEC Networks

引用

IEEE Transactions on Mobile computing 2025年第6期24卷 5280-5297页

作者： Zhao, Mingxiong Wang, Zirui Guo, Kun Zhang, Rongqian Quek, Tony Q. S. Yunnan University National Pilot School of Software Kunming650500 China Ministry of Education Engineering Research Center of Integration and Application of Digital Learning Technology Beijing100039 China Ministry of Education Engineering Research Center of Cyberspace Kunming650504 China Yunnan University of Finance and Economics Yunnan Key Laboratory of Service Computing Kunming650221 China Yunnan University Yunnan Key Laboratory of Software Engineering Kunming650091 China East China Normal University Shanghai Key Laboratory of Multidimensional Information Processing School of Communications and Electronics Engineering Shanghai200241 China Yunnan University School of Information Science and Engineering Kunming650500 China Singapore University of Technology and Design Information Systems Technology and Design 487372 Singapore

In Uncrewed Aerial Vehicle (UAV)-assisted Mobile Edge computing (MEC) networks, the security of transmission faces significant challenges due to the vulnerabilities of line-of-sight links and potential eavesdropping on two-hop links. This paper addresses these challenges with an innovative Cooperative Secure Transmission and Computation strategy (CSTC), specifically engineered for time-slotted UAV-assisted MEC networks plagued by mobile collusive eavesdroppers. These eavesdroppers significantly bolster their interception capabilities through coordinated and optimized movements, escalating the security threats. To neutralize these risks, the proposed CSTC employs the UAV and remote devices as helper nodes to emit jamming signals, thereby thwarting eavesdropping activities, while simultaneously facilitating the efficient relay of users’ tasks to the base station for advanced processing. The CSTC aims to maximize the sum Secrecy Transmission Rate (STR) satisfying task latency constraints. It involves a joint optimization of UAV trajectory, jamming beamformers, transmit power, and data offloading strategy to expedite task transmission. Additionally, a real-time computation scheduling approach is developed based on a newly defined metric, the Urgency Degree of Users (UDoU), to enhance task processing efficiency. Our extensive simulations validate that the CSTC not only elevates the sum STR but also consistently meets latency constraints, demonstrating its robustness against advanced mobile eavesdropping techniques. © 2002-2012 IEEE.

关键词： Jamming

来源：评论

学校读者我要写书评

暂无评论

MixSA: Training-free Reference-based Sketch Extraction via Mixture-of-Self-Attention

arXiv

引用

arXiv 2025年

作者： Yang, Rui Wu, Xiaojun He, Shengfeng The School of Computer Sciences Shaanxi Normal University Xi'An China The School of Computer Science The Key Laboratory of Intelligent Computing and Service Technology for Folk Song of the Ministry of Culture and Tourism Shaanxi Normal University Xi'An710119 China The School of Computing and Information Systems Singapore Management University Singapore

Current sketch extraction methods either require extensive training or fail to capture a wide range of artistic styles, limiting their practical applicability and versatility. We introduce Mixture-of-Self-Attention (MixSA), a training-free sketch extraction method that leverages strong diffusion priors for enhanced sketch perception. At its core, MixSA employs a mixture-of-self-attention technique, which manipulates self-attention layers by substituting the keys and values with those from reference sketches. This allows for the seamless integration of brushstroke elements into initial outline images, offering precise control over texture density and enabling interpolation between styles to create novel, unseen styles. By aligning brushstroke styles with the texture and contours of colored images, particularly in late decoder layers handling local textures, MixSA addresses the common issue of color averaging by adjusting initial outlines. Evaluated with various perceptual metrics, MixSA demonstrates superior performance in sketch quality, flexibility, and applicability. This approach not only overcomes the limitations of existing methods but also empowers users to generate diverse, high-fidelity sketches that more accurately reflect a wide range of artistic expressions. Copyright © 2025, The Authors. All rights reserved.

关键词： Image texture

来源：评论

学校读者我要写书评

暂无评论

On the -differential spectra of two classes of power functions over finite fields

引用

Applicable Algebra in Engineering, Communication and computing 2025年 1-30页

作者： Liu, Qian Huang, Zhiwei Chen, Zhixiong Jiang, Rong Zhang, Liupiao Key Laboratory of Information Security of Network Systems College of Computer and Data Science Fuzhou University Fuzhou China Hubei Key Laboratory of Applied Mathematics Faculty of Mathematics and Statistics Hubei University Wuhan China Yunnan Key Laboratory of Service Computing Yunnan University of Finance and Economics Kunming China Fujian Key Laboratory of Financial Information Processing Putian University Putian China School of Computer Science and Technology Dongguan University of Technology Dongguan China

Recently, a new concept called multiplicative differential was introduced by Ellingsen et al. [7]. As an extension of the differential uniformity, it is theoretically appealing to determine the properties of c-differential uniformity and the corresponding c-differential spectrum. In this paper, based on certain quadratic character sums and two special elliptic curves over $$\mathbb {F}_p$$ , the $$(-1)$$ -differential spectra of the following two classes of power functions over $$\mathbb {F}_{p^n}$$ is completely determined: (1) $$f_1(x)=x^{\frac{p^n+3}{2}}$$ , where $$p>3$$ and $$p\equiv 3\pmod 4$$ ; (2) $$f_2(x)=x^{p^n-3}$$ , where $$p>3$$ . The obtained result shows that the $$(-1)$$ -differential spectra of $$f_1(x)$$ and $$f_2(x)$$ can be expressed explicitly in terms of n. Moreover, an upper bound of the c-differential uniformity of $$f_2(x)$$ is given.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DFMC:Feature-Driven Data-Free Knowledge Distillation

引用

IEEE Transactions on Circuits and systems for Video technology 2025年

作者： Zhang, Zherui Xu, Rongtao Wang, Changwei Xu, Wenhao Chen, Shunpeng Xu, Shibiao Xu, Guangyuan Guo, Li Beijing University of Posts and Telecommunications School of Artificial Intelligence Beijing100876 China Chinese Academy of Sciences State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Beijing100190 China Qilu University of Technology Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250316 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan250014 China

Data-Free Knowledge Distillation (DFKD) enables knowledge transfer from teacher networks without access to the real dataset. However, generator-based DFKD methods often suffer from insufficient diversity or low-confidence in synthetic images, negatively impacting student network performance. This paper introduces DFMC, a generative feature-driven framework to mitigate the inherent limitations of DFKD. We propose exploiting semantic description between generative feature domains to guide augmentation strategies, avoiding random abstract inputs caused by inconsistent semantic quality. Then, by applying noise to the generative features, we produce contrastive learning pairs indirectly, limiting the sampling range of the feature domain to encourage the student network to learn domain-invariant features. Finally, we guide the student network to deeply mimic the teacher’s layer-wise implicit classification behavior for the augmented synthetic images. Extensive experiments across various datasets and downstream tasks demonstrate the effectiveness of DFMC, achieving significant improvements while preventing student networks from overfitting to semantic ambiguous images. © 1991-2012 IEEE.

关键词： Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

ASTARS Aided NOMA Covert Communication Networks

引用

IEEE Transactions on Vehicular technology 2025年

作者： Yue, Xinwei Song, Xinlong Zhao, Jingjing Huang, Chongwen Jin, Hongxu Xiang, Wei Key Laboratory of Information and Communication Systems Ministry of Information Industry Beijing102206 China Beijing Information Science and Technology University Key Laboratory of Modern Measurement & Control Technology Ministry of Education Beijing102206 China Beihang University School of Electronic and Information Engineering Beijing100191 China Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China Xidian University State Key Laboratory of Integrated Service Networks Xi'an710071 China Hangzhou310027 China Zunyi Normal University School of Information Engineering Zunyi563006 China La Trobe University School of Computing Engineering and Mathmatical Sciences MelbourneVIC3086 Australia

The active simultaneously transmitting and reflecting surface (STARS) has been proposed as a complement of passive STARS (PSTARS) to inhibit the double path-loss. This paper applies the active STARS (ASTARS) to aid in non-orthogonal multiple access (NOMA) covert communications over cascaded rice fading channels, where two wardens are located on the opposite sides of ASTARS to monitor the transmission information. More specifically, we derive approximate expressions for detection error probability of two wardens. The optimal detection threshold and minimum detection error probability are presented in the worst covert scenarios. The covert transmission rate expressions for a coupe of covert users are further deduced by taking into account imperfect/perfect successive interference cancellation. The experimental simulation results are presented to confirm that: 1) The detection error probability of ASTARS-NOMA networks is superior to that of ASTARS assisted-orthogonal multiple access (ASTARS-OMA) and PSTARS aided NOMA networks;2) As the number of active elements increases, the covert transmission rates of ASTARS-NOMA networks become larger relative to ASTARS-OMA;and 3) ASTARS-NOMA has ability to provide the enhanced system throughput in delay-tolerant transmission mode. © 2025 IEEE.

关键词： Fading channels

来源：评论

学校读者我要写书评

暂无评论

Implementation and Analysis of Probabilistic Methods for Gate-Level Circuit Reliability Estimation

引用

Tsinghua Science and technology 2007年第S1期12卷 32-38页

作者：王真江建慧杨光 Key Laboratory of Embedded Systems and Service Computing Ministry of Education of Shanghai Department of Computer Science and Technology Tongji University

The development of VLSI technology results in the dramatically improvement of the performance of integrated circuits. However, it brings more challenges to the aspect of reliability. Integrated circuits become more susceptible to soft errors. Therefore, it is imperative to study the reliability of circuits under the soft error. This paper implements three probabilistic methods (two pass, error propagation probability, and probabilistic transfer matrix) for estimating gate-level circuit reliability on PC. The functions and performance of these methods are compared by experiments using ISCAS85 and 74-series circuits.

关键词： soft error soft error rate signal reliability failure probability reliability estimation

来源：评论

学校读者我要写书评

暂无评论

SFedXL: Semi-Synchronous Federated Learning With Cross-Sharpness and Layer-Freezing

引用

IEEE Internet of Things Journal 2025年

作者： Zhao, Mingxiong Zhao, Shihao Feng, Chenyuan Yang, Howard H. Niyato, Dusit Quek, Tony Q. S. Yunnan University National Pilot School of Software Kunming650500 China Ministry of Education Engineering Research Center of Integration and Application of Digital Learning Technology Beijing100039 China Ministry of Education Engineering Research Center of Cyberspace Kunming650504 China Yunnan University of Finance and Economics Yunnan Key Laboratory of Service Computing Kunming650221 China EURECOM Sophia Antipolis06410 France Zhejiang University University of Illinois Urbana-Champaign Institute Zhejiang University Haining314400 China Nanyang Technological University School of Computer Science and Engineering 639798 Singapore Singapore University of Technology and Design Information Systems Technology and Design Pillar 487372 Singapore

Federated learning (FL) emerges as a potential solution for enabling multiple terminal devices to collaboratively accomplish computational tasks within an Unmanned Aerial Vehicle (UAV) swarm. However, traditional FL approaches, predicated on synchronous data aggregation, are not feasible for a UAV swarm owing to the inherently variable and dynamic nature of their communication networks compared with terrestrial systems. Furthermore, the data procured by UAVs is often highly heterogeneous, attributable to disparities in deployment environments and device attributes. Considering the distinct flight paths and unique operational conditions encountered by different UAVs, a considerable amount of data remains unlabeled. To tackle the challenges associated with asynchronous operations and the prevalence of unlabeled data, we introduce a novel framework termed Semi-synchronous FL with Cross-Sharpness and Layer-Freezing (SFedXL), tailored for a UAV swarm. In particular, we devise a cross-sharpness model training strategy aimed at optimizing the utilization of both labeled and unlabeled datasets. Additionally, we propose an innovative semi-synchronous model aggregation protocol, complemented by client-specific layer-freezing and client cluster scheduling, designed to expedite the training process. Our simulation results indicate that the proposed algorithm surpasses current FL methods in terms of object recognition accuracy and communication efficiency, albeit with a trade-off of increased local computation latency. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Game-theoretic private blockchain design in edge computing networks

引用

Digital Communications and Networks 2024年第6期10卷 1622-1634页

作者： Daoqi Han Yang Liu Fangwei Zhang Yueming Lu Key Laboratory of Trustworthy Distributed Computing and Service Ministry of EducationBeijing University of Posts and Telecommunications(BUPT)Beijing 100876China Beijing Institute of Astronautical Systems Engineering BeijingChina Beijing Institute of Technology BeijingChina

Considering the privacy challenges of secure storage and controlled flow,there is an urgent need to realize a decentralized ecosystem of private blockchain for cyberspace.A collaboration dilemma arises when the participants are self-interested and lack feedback of complete *** blockchains have similar faults,such as trustlessness,single-factor consensus,and heavily distributed ledger,preventing them from adapting to the heterogeneous and resource-constrained Internet of *** this paper,we develop the game-theoretic design of a two-sided rating with complete information feedback to stimulate collaborations for private *** design consists of an evolution strategy of the decision-making network and a computing power network for continuously verifiable *** formulate the optimum rating and resource scheduling problems as two-stage iterative games between participants and *** theoretically prove that the Stackelberg equilibrium exists and the group evolution is ***,we propose a multi-stage evolution consensus with feedback on a block-accounting workload for metadata *** continuously validate a block,the metadata of the optimum rating,privacy,and proofs are extracted to store on a lightweight ***,to increase resource utilization,surplus computing power is scheduled flexibly to enhance security by ***,the evaluation results show the validity and efficiency of our model,thereby solving the collaboration dilemma in the private blockchain.

关键词： Ecosystem Edge computing Feedback Stackelberg game Private blockchain Scalable computing power

来源：评论

学校读者我要写书评

暂无评论

A Reduced Reachability Tree for a Class of Unbounded Petri Nets

引用

IEEE/CAA Journal of Automatica Sinica 2015年第4期2卷 345-352页

作者： Shouguang Wang Mengdi Gan Mengchu Zhou Dan You School of Information and Electronic Engineering Zhejiang Gongshang University State Key Laboratory for Manufacturing Systems Engineering Xi’an Jiaotong University Ministry of Education(MoE)Key Laboratory of Embedded System and Service Computing Tongji University MoE Key Laboratory of Embedded System and Service Computing Tongji University Department of Electrical and Computer Engineering New Jersey Institute of Technology

As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size. © 2014 Chinese Association of Automation.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：