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

Ciphertext-only fault analysis of GIFT lightweight cryptosystem

Science China(Information Sciences) 2022年第3期65卷 263-265页

作者： Wei LI Shan CAO Dawu GU Jiayao LI Tianpei CAI Menglin WANG Li SUN Zhiqiang LIU Ya LIU School of Computer Science and Technology Donghua University Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai Key Laboratory of Computing and Systems Shanghai Jiao Tong University Shanghai Key Laboratory of Integrate Administration Technologies for Information Security Shanghai Jiao Tong University Department of Computer Science and Engineering University of Shanghai for Science and Technology

Dear editor,The GIFT cryptosystem was proposed by Banik et al. [1]in CHES 2017. It can be widely applied to protect RFID tags and other low-resource devices. It has an SPN structure with a fixed 128-bit key size and two flexible variants of 64-bit and 128-bit block sizes. In simulations, GIFT achieves good performance and surpasses both SIMON and SKINNY [1]. In 2013, Fuhr et al. [2] proposed a ciphertextonly fault analysis(CFA) of AES for three types of faults:zero-byte fault, zero-nibble fault,

关键词： lightweight cryptosystem GIFT ciphertext-only fault analysis cryptanalysis fault analysis

来源：评论

学校读者我要写书评

暂无评论

Exploring Data Geometry for Continual Learning

arXiv

引用

arXiv 2023年

作者： Gao, Zhi Xu, Chen Li, Feng Jia, Yunde Harandi, Mehrtash Wu, Yuwei Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Department of Electrical and Computer Systems Eng. Monash University Data61 Australia

Continual learning aims to efficiently learn from a non-stationary stream of data while avoiding forgetting the knowledge of old data. In many practical applications, data complies with non-Euclidean geometry. As such, the commonly used Euclidean space cannot gracefully capture non-Euclidean geometric structures of data, leading to inferior results. In this paper, we study continual learning from a novel perspective by exploring data geometry for the non-stationary stream of data. Our method dynamically expands the geometry of the underlying space to match growing geometric structures induced by new data, and prevents forgetting by keeping geometric structures of old data into account. In doing so, making use of the mixed curvature space, we propose an incremental search scheme, through which the growing geometric structures are encoded. Then, we introduce an angular-regularization loss and a neighbor-robustness loss to train the model, capable of penalizing the change of global geometric structures and local geometric structures. Experiments show that our method achieves better performance than baseline methods designed in Euclidean space. Copyright © 2023, The Authors. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Exploring Data Geometry for Continual Learning

Exploring Data Geometry for Continual Learning

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Zhi Gao Chen Xu Feng Li Yunde Jia Mehrtash Harandi Yuwei Wu Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Department of Electrical and Computer Systems Eng. Monash University and Data61 Australia

Continual learning aims to efficiently learn from a non-stationary stream of data while avoiding forgetting the knowledge of old data. In many practical applications, data complies with non-Euclidean geometry. As such, the commonly used Euclidean space cannot gracefully capture non-Euclidean geometric structures of data, leading to in-ferior results. In this paper, we study continual learning from a novel perspective by exploring data geometry for the non-stationary stream of data. Our method dynamically expands the geometry of the underlying space to match growing geometric structures induced by new data, and pre-vents forgetting by keeping geometric structures of old data into account. In doing so, making use of the mixed cur-vature space, we propose an incremental search scheme, through which the growing geometric structures are en-coded. Then, we introduce an angular-regularization loss and a neighbor-robustness loss to train the model, capa-ble of penalizing the change of global geometric structures and local geometric structures. Experiments show that our method achieves better performance than baseline methods designed in Euclidean space.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cross-links matter for link prediction: rethinking the debiased GNN from a data perspective 23

Cross-links matter for link prediction: rethinking the debia...

引用

Proceedings of the 37th International Conference on Neural Information Processing systems

作者： Zihan Luo Hong Huang Jianxun Lian Xiran Song Xing Xie Hai Jin 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 Microsoft Research Asia Beijing China

Recently, the bias-related issues in GNN-based link prediction have raised widely spread concerns. In this paper, we emphasize the bias on links across different node clusters, which we call cross-links, after considering its significance in both easing information cocoons and preserving graph connectivity. Instead of following the objective-oriented mechanism in prior works with compromised utility, we empirically find that existing GNN models face severe data bias between internal-links (links within the same cluster) and cross-links, and this inspires us to rethink the bias issue on cross-links from a data perspective. Specifically, we design a simple yet effective twin-structure framework, which can be easily applied to most GNNs to mitigate the bias as well as boost their utility in an end-to-end manner. The basic idea is to generate debiased node embeddings as demonstrations and fuse them into the embeddings of original GNNs. In particular, we learn debiased node embeddings with the help of augmented supervision signals, and a novel dynamic training strategy is designed to effectively fuse debiased node embeddings with the original node embeddings. Experiments on three datasets with six common GNNs show that our framework can not only alleviate the bias between internal-links and cross-links but also boost the overall accuracy. Comparisons with other state-of-the-art methods also verify the superiority of our method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Digital Over-the-Air Federated Learning in Multi-Antenna systems

arXiv

引用

arXiv 2023年

作者： Wang, Sihua Chen, Mingzhe Shen, Cong Yin, Changchuan Brinton, Christopher G. The Beijing Laboratory of Advanced Information Network The Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing100876 China The Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States The Charles L. Brown Department of Electrical and Computer Engineering University of Virginia CharlottesvilleVA United States The School of Electrical and Computer Engineering Purdue University West LafayetteIN United States

In this paper, the performance optimization of federated learning (FL), when deployed over a realistic wireless multiple-input multiple-output (MIMO) communication system with digital modulation and over-the-air computation (AirComp) is studied. In particular, a MIMO system is considered in which edge devices transmit their local FL models (trained using their locally collected data) to a parameter server (PS) using beamforming to maximize the number of devices scheduled for transmission. The PS, acting as a central controller, generates a global FL model using the received local FL models and broadcasts it back to all devices. Due to the limited bandwidth in a wireless network, AirComp is adopted to enable efficient wireless data aggregation. However, fading of wireless channels can produce aggregate distortions in an AirComp-based FL scheme. To tackle this challenge, we propose a modified federated averaging (FedAvg) algorithm that combines digital modulation with AirComp to mitigate wireless fading while ensuring the communication efficiency. This is achieved by a joint transmit and receive beamforming design, which is formulated as an optimization problem to dynamically adjust the beamforming matrices based on current FL model parameters so as to minimize the transmitting error and ensure the FL performance. To achieve this goal, we first analytically characterize how the beamforming matrices affect the performance of the FedAvg in different iterations. Based on this relationship, an artificial neural network (ANN) is used to estimate the local FL models of all devices and adjust the beamforming matrices at the PS for future model transmission. The algorithmic advantages and improved performance of the proposed methodologies are demonstrated through extensive numerical experiments. Copyright © 2023, The Authors. All rights reserved.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Efficient Hybrid Multi-Population Genetic Algorithm for Multi-UAV Task Assignment in Consumer Electronics Applications

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Bai, Xiaoshan Jiang, Haoyu Li, Chao Ullah, Inam Dabel, Maryam M. Al Bashir, Ali Kashif Wu, Zongze Sam, Shuzhi Shenzhen University College of Mechatronics and Control Engineering National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University College of Mechatronics and Control Engineering Shenzhen518060 China Shenzhen University Shenzhen City Joint Laboratory of Autonomous Unmanned Systems and Intelligent Manipulation Shenzhen518060 China Tashkent State University of Economics Department of Artificial Intelligence Tashkent100066 Uzbekistan University of Hafr Al Batin Department of Computer Science and Engineering College of Computer Science and Engineering Saudi Arabia Manchester Metropolitan University Manchester United Kingdom Shenzhen518060 China National University of Singapore Department of Electrical and Computer Engineering Singapore117576 Singapore

In recent years, as people’s living standards have improved and consumption concepts have been transformed, the demand for purchasing consumer electronics online has continued to grow, further stimulating the development of the logistics industry. Consequently, how to deliver consumer electronics to households at minimal cost has become a crucial factor that limits the development of the consumer technology industry. To tackle this problem, this paper studies the task assignment problem for multiple initially dispersed UAVs to deliver products to target locations while minimizing their total operation time. Each UAV can continuously provide delivery services to multiple target locations within its limited loading capacity and operation time. To solve this problem, we propose several hybrid multipopulation genetic algorithms. First, a novel crossover operator for the genetic algorithms is designed, through which a single parent chromosome can generate offspring individually. Second, two mutation mechanisms are performed to increase gene diversity. Third, multiple local search strategies are employed to enhance the populations’ fitness during each iteration of evolution. An improved 2-opt local search strategy is applied to optimize individual chromosomes when their similarity with the current best chromosome falls below a prescribed threshold. Alternatively, local search strategies are utilized for 1-opt, 2h-opt and interchange processes. Combining local search strategies, genetic operators, and the multi-population mechanism leads to several hybrid multi-population genetic algorithms. Numerical simulations and experimental tests demonstrate that the hybrid multi-population genetic algorithm, integrated with the improved 2-opt and 1-opt local search strategies, exhibits superior performance among the designed hybrid genetic algorithms, the minimum marginal cost algorithm (MMA), and the existing popular Co-evolutionary Multi-population Genetic Algorithm (CMGA). In exp

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Artificial intelligence in cancer target identification and drug discovery

引用

Signal Transduction and Targeted Therapy 2022年第6期7卷 1951-1974页

作者： Yujie You Xin Lai Yi Pan Huiru Zheng Julio Vera Suran Liu Senyi Deng Le Zhang College of Computer Science Sichuan UniversityChengdu 610065China Laboratory of Systems Tumor Immunology Friedrich-Alexander-Universität Erlangen-Nürnberg(FAU)and Universitätsklinikum ErlangenErlangen 91052Germany Faculty of Computer Science and Control Engineering Shenzhen Institute of Advanced TechnologyChinese Academy of SciencesRoom D5131068 Xueyuan AvenueShenzhen University TownShenzhen 518055China School of Computing Ulster UniversityBelfast BT151EDUK Institute of Thoracic Oncology Department of Thoracic SurgeryWest China HospitalSichuan UniversityChengdu 610065China Key Laboratory of Systems Biology Hangzhou Institute for Advanced StudyUniversity of Chinese Academy of SciencesChinese Academy of SciencesHangzhou 310024China Key Laboratory of Systems Health Science of Zhejiang Province Hangzhou Institute for Advanced StudyUniversity of Chinese Academy of SciencesHangzhou 310024China

Artificial intelligence is an advanced method to identify novel anticancer targets and discover novel drugs from biology networks because the networks can effectively preserve and quantify the interaction between components of cell systems underlying human diseases such as ***,we review and discuss how to employ artificial intelligence approaches to identify novel anticancer targets and discover ***,we describe the scope of artificial intelligence biology analysis for novel anticancer target ***,we review and discuss the basic principles and theory of commonly used network-based and machine learning-based artificial intelligence ***,we showcase the applications of artificial intelligence approaches in cancer target identification and drug *** together,the artificial intelligence models have provided us with a quantitative framework to study the relationship between network characteristics and cancer,thereby leading to the identification of potential anticancer targets and the discovery of novel drug candidates.

关键词： drugs cancer drug

来源：评论

学校读者我要写书评

暂无评论

Neural-Network-Based Recursive State Estimation for Nonlinear Networked systems With Binary-Encoding Mechanisms

引用

IEEE Transactions on Neural Networks and Learning systems 2025年第6期36卷 10072-10083页

作者： Yuhan Zhang Zidong Wang Lei Zou Wei Qian Shuxin Du College of Electrical Engineering and Automation Shandong University of Science and Technology Qingdao China Department of Computer Science Brunel University of London Middlesex Uxbridge U.K. College of Information Science and Technology Donghua University Shanghai China Engineering Research Center of Digitalized Textile and Fashion Technology Ministry of Education Shanghai China School of Electrical Engineering and Automation Henan Polytechnic University Jiaozuo China Huzhou Key Laboratory of Intelligent Sensing and Optimal Control for Industrial Systems School of Engineering Huzhou University Huzhou China

This work addresses the problem of recursive state estimation for networked control systems with unknown nonlinearities and binary-encoding mechanisms (BEMs). To enhance transmission reliability and reduce network resource consumption, BEMs are used to convert measurement signals into binary bit strings (BBSs) of limited length, which are then transmitted to the estimator through noisy communication channels. During transmission, random bit errors may occur in the BBSs due to channel noise. For the considered nonlinear networked control systems affected by random bit errors, a neural-network (NN)-based recursive estimation strategy is proposed, where an NN with a time-varying tuning scalar is employed to approximate the unknown nonlinearity of the networked control systems. By using the proposed strategy, the upper bounds of the estimation error of the system state and the trace of the estimation error of the NN weight (NNW) are first derived. These bounds are then minimized by recursively designing both the estimator gain matrix and the tuning scalar of the NNW. Finally, the effectiveness of the proposed estimation strategy is demonstrated through a numerical example.

关键词： Artificial neural networks State estimation Encoding Noise Networked control systems Electronic mail Symmetric matrices Estimation error Tuning Recursive estimation

来源：评论

学校读者我要写书评

暂无评论

Carbon-Aware computing in a Network of Data Centers: A Hierarchical Game-Theoretic Approach

arXiv

引用

arXiv 2024年

作者： Breukelman, Enno Hall, Sophie Belgioioso, Giuseppe Dörfler, Florian The KTH Royal Institute of Technology School of Electrical Engineering and Computer Science Division of Decision and Control Systems Malvinas väg 10 StockholmSE-100 44 Sweden The Automatic Control Laboratory Department of Electrical Engineering and Information Technology ETH Zurich Physikstrasse 3 Zürich8092 Switzerland

Over the past decade, the continuous surge in cloud computing demand has intensified data center workloads, leading to significant carbon emissions and driving the need for improving their efficiency and sustainability. This paper focuses on the optimal allocation problem of batch compute loads with temporal and spatial flexibility across a global network of data centers. We propose a bilevel game-theoretic solution approach that captures the inherent hierarchical relationship between supervisory control objectives, such as carbon reduction and peak shaving, and operational objectives, such as priority-aware scheduling. Numerical simulations with real carbon intensity data demonstrate that the proposed approach successfully reduces carbon emissions while simultaneously ensuring operational reliability and priority-aware scheduling. © 2024, CC BY-NC-ND.

关键词： Carbon

来源：评论

学校读者我要写书评

暂无评论

DMNER: Biomedical Named Entity Recognition by Detection and Matching

DMNER: Biomedical Named Entity Recognition by Detection and ...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Bian, Junyi Jiang, Rongze Zhai, Weiqi Huang, Tianyang Huang, Xiaodi Zhou, Hong Zhu, Shanfeng Fudan University School of Computer Science Shanghai China Fudan University Institute of Science and Technology for Brain-Inspired Intelligence Shanghai China Charles Sturt University School of Computing Mathematics and Engineering Nsw Australia Atypon Systems Llc United Kingdom Zhangjiang Fudan International Innovation Center Fudan University Institute of Science and Technology for Brain-Inspired Intelligence Moe Frontiers Center for Brain Science Shanghai Key Lab of Intelligent Information Processing Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence Shanghai China

ISBN: (纸本)9798350386226

Biomedical Named Entity Recognition (NER) is a crucial task in extracting information from biomedical texts. However, the diversity of professional terminology, semantic complexity, and the widespread presence of synonyms pose significant challenges. Traditional methods that rely on sequence labeling training datasets often struggle to handle these complexities. To address this, we introduce a novel framework for BioNER, termed DMNER, which leverages external knowledge and operates in two steps: entity boundary detection and entity category identification through matching. The core of DMNER is its second step, which determines the entity category by retrieving similar entities and their categories from a knowledge dictionary using semantic similarity matching. Our experiments on 10 biomedical datasets demonstrate that DMNER outperforms baselines across these tasks, proving its effectiveness and adaptability. DMNER is versatile and can be applied to various NER tasks, including supervised NER, distantly supervised NER, and NER on multiple datasets with disjoint label sets. The DMNER code is publicly available. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：