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

arXiv 2025年

作者： Wang, Wei Zhang, Xianglong Xu, Peng Chen, Rongmao Yang, Laurence Tianruo School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Jinyinhu Laboratory Wuhan430040 China School of Computer National University of Defense Technology Changsha410073 China School of Computer and Artificial Intelligence Zhengzhou University Zhengzhou450001 China Department of Computer Science St. Francis Xavier University AntigonishNSB2G 2W5 Canada

Oblivious RAM (ORAM) allows a client to securely retrieve elements from outsourced servers without leakage about the accessed elements or their virtual addresses. Two-server ORAM, designed for secure two-party RAM computation, stores data across two non-colluding servers. However, many two-server ORAM schemes suffer from excessive local storage or high bandwidth costs. To serve lightweight clients, it is crucial for ORAM to achieve concretely efficient bandwidth while maintaining O(1) local storage. Hence, this paper presents two new client-friendly two-server ORAM schemes that achieve practical logarithmic bandwidth under O(1) local storage, while incurring linear symmetric key computations. The core design features a hierarchical structure and a pairwise-area setting for the elements and their tags. Accordingly, we specify efficient read-only and write-only private information retrieval (PIR) algorithms in our schemes to ensure obliviousness in accessing two areas respectively, so as to avoid the necessity of costly shuffle techniques in previous works. We empirically evaluate our schemes against LO13 (TCC’13), AFN17 (PKC’17), and KM19 (PKC’19) in terms of both bandwidth and time cost. The results demonstrate that our schemes reduce bandwidth by approximately 2 ∼ 4× compared to LO13, and by 16 ∼ 64× compared to AFN17 and KM19. For a database of size 214 blocks, our schemes are over 64× faster than KM19, while achieving similar performance to LO13 and AFN17 in the WAN setting, with a latency of around 1 second. Copyright © 2025, The Authors. All rights reserved.

关键词： Virtual addresses

来源：评论

学校读者我要写书评

暂无评论

Towards a Theoretical Framework of Autonomous Systems Underpinned by Intelligence and Systems sciences

引用

IEEE/CAA Journal of Automatica Sinica 2021年第1期8卷 52-63页

作者： Yingxu Wang Ming Hou Konstantinos NPlataniotis Sam Kwong Henry Leung Edward Tunstel Imre JRudas Ljiljana Trajkovic International Institute of Cognitive Informatics and Cognitive Computing Department of Electrical and Computer EngineeringSchulich School of Engineering and Hotchkiss Brain InstituteUniversity of CalgaryCalgary T2N 1N4Canada Toronto Research Centre Defence Research&Development CanadaToronto M3K 2C9Canada Department of Electrical&Computer Engineering University of TorontoToronto M5S3G4Canada Department of Computer Science City University of Hong KongHong KongChina Department of Electrical and Computer Engineering Schulich School of EngineeringUniversity of CalgaryCalgary T2N 1N4Canada Autonomous&Intelligent Systems Department United Technologies Research CenterCT 06108 USA University Research&Innovation Center(EKIK) Óbuda UniversityBudapest H-1034Hungary School of Engineering Science Simon Fraser UniversityBurnaby V5A 1S6Canada

Autonomous systems are an emerging AI technology functioning without human intervention underpinned by the latest advances in intelligence,cognition,computer,and systems *** paper explores the intelligent and mathematical foundations of autonomous *** focuses on structural and behavioral properties that constitute the intelligent power of autonomous *** explains how system intelligence aggregates from reflexive,imperative,adaptive intelligence to autonomous and cognitive intelligence.A hierarchical intelligence model(HIM)is introduced to elaborate the evolution of human and system intelligence as an inductive *** properties of system autonomy are formally analyzed towards a wide range of applications in computational intelligence and systems *** paradigms of autonomous systems including brain-inspired systems,cognitive robots,and autonomous knowledge learning systems are *** in autonomous systems will pave a way towards highly intelligent machines for augmenting human capabilities.

关键词： Autonomous systems(AS) cognitive systems computational intelligence engineering paradigms intelligence science intelligent mathematics

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Enabled Intrusion Detection for Edge Devices in the Internet of Things

Machine Learning Enabled Intrusion Detection for Edge Device...

引用

IEEE Annual Computing and Communication Workshop and Conference (CCWC)

作者： Maram Alsharif Danda B. Rawat Department of Electrical Engineering & Computer Science Data Science and Cybersecurity Center (DSC2) Howard University Washington D.C. USA

In this paper, we present recent approaches proposed to secure the Internet of Things (IoT) devices against malicious cyber attacks and malware. As IoT devices have limited computing, storage, processing and communication capabilities, protection those devices by themselves is very challenging. Fog computing has been proposed to support resource constrained IoT devices to reduce delay caused by cloud computing. We also presented adopted ML models and datasets vs. targeted cyber attacks in a tabular form.

关键词： Cloud computing Computational modeling Intrusion detection Optimized production technology Delays Internet of Things Security

来源：评论

学校读者我要写书评

暂无评论

Object Semantics Give Us the Depth We Need: Multi-Task Approach to Aerial Depth Completion

Object Semantics Give Us the Depth We Need: Multi-Task Appro...

引用

2023 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2023

作者： Gazani, Sara Hatami Dadboud, Fardad Bolic, Miodrag Mantegh, Iraj Najjaran, Homayoun University of Victoria Department of Mechanical Engineering 3800 Finnerty Road VictoriaBCV8P 5C2 Canada School of Electrical Engineering and Computer Science University of Ottawa 800 King Edward OttawaONKlN 6N5 Canada MontrealQC Canada

ISBN: (纸本)9798350337020

Depth completion and object detection are two crucial tasks often used for aerial 3D mapping, path planning, and collision avoidance of Uncrewed Aerial Vehicles (UAVs). Common solutions include using measurements from a LiDAR sensor;however, the generated point cloud is often sparse and irregular and limits the system's capabilities in 3D rendering and safety-critical decision-making. To mitigate this challenge, information from other sensors on the UAV (viz., a camera used for object detection) is utilized to help the depth completion process generate denser 3D models. Performing both aerial depth completion and object detection tasks while fusing the data from the two sensors poses a challenge to resource efficiency. We address this challenge by proposing a novel approach to jointly execute the two tasks in a single pass. The proposed method is based on an encoder-focused multi-task learning model that exposes the two tasks to jointly learned features. We demonstrate how semantic expectations of the objects in the scene learned by the object detection pathway can boost the performance of the depth completion pathway while regressing the missing depth values. Experimental results show that the proposed multi-task network outperforms its single-task counterpart, particularly when exposed to defective inputs. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Subband Splitting: Simple, Efficient and Effective Technique for Solving Block Permutation Problem in Determined Blind Source Separation

arXiv

引用

arXiv 2024年

作者： Matsumoto, Kazuki Yatabe, Kohei Department of Communications and Computer Engineering Waseda University 3–4–1 Ohkubo Shinjuku-ku Tokyo169–8555 Japan Department of Electrical Engineering and Computer Science Tokyo University of Agriculture and Technology 2–24–16 Naka-cho Koganei-shi Tokyo184–8588 Japan

Solving the permutation problem is essential for determined blind source separation (BSS). Existing methods, such as independent vector analysis (IVA) and independent low-rank matrix analysis (ILRMA), tackle the permutation problem by modeling the co-occurrence of the frequency components of source signals. One of the remaining challenges in these methods is the block permutation problem, which may cause severe performance degradation. In this paper, we propose a simple and effective technique for solving the block permutation problem. The proposed technique splits the entire frequency bands into several overlapping subbands and sequentially applies BSS methods (e.g., IVA, ILRMA, or any other method) to each subband. Since the splitting reduces the size of the problem, the BSS methods can effectively work in each subband. Then, the permutations among the subbands are aligned by using the separation result in one subband as the initial values for the other subbands. Additionally, we propose SS-IVA and SS-ILRMA by combining subband splitting (SS) with IVA and ILRMA. Experimental results demonstrated that our technique remarkably improves the separation performance without increasing computational cost. In particular, our SS-ILRMA achieved the separation performance comparable to the oracle method (frequency-domain independent component analysis with the ideal permutation solver). Moreover, SS-ILRMA converged faster than conventional IVA and ILRMA. Copyright © 2024, The Authors. All rights reserved.

关键词： Independent component analysis

来源：评论

学校读者我要写书评

暂无评论

Heuristic Search for Nonlinear Substitutions for Cryptographic Applications

Lecture Notes on Data Engineering and Communications Technol...

引用

Lecture Notes on Data engineering and Communications Technologies 2023年 180卷 288-298页

作者： Kuznetsov, Oleksandr Frontoni, Emanuele Kandiy, Sergey Smirnov, Oleksii Ulianovska, Yuliia Kobylianska, Olena Department of Political Sciences Communication and International Relations University of Macerata Via Crescimbeni 30/32 Macerata62100 Italy Department of Information and Communication Systems Security Faculty of Comupter Science V. N. Karazin Kharkiv National University 4 Svobody Sq Kharkiv61022 Ukraine Department of Information Engineering Marche Polytechnic University Via Brecce Bianche 12 Ancona60131 Italy Cybersecurity & Software Academic Department Central Ukrainian National Technical University 8 University Avenue Kropyvnytskyi25006 Ukraine Department of Computer Science and Software Engineering University of Customs and Finance Vernadskogo Street 2/4 Dnipro49000 Ukraine

Heuristic algorithms are used to solve complex computational problems quickly in various computer applications. Such algorithms use heuristic functions that rank the search alternatives instead of a full enumeration of possible variants. The algorithm selects, at each iteration, an alternative with the best value for the heuristics. In this paper, we investigate the complex computational problem of finding highly nonlinear substitutions (S-boxes) in the space of 8-bit permutations. The generation of S-boxes is an important field of research, since nonlinear substitutions are widely used in various cryptographic applications. For instance, S-boxes in symmetric ciphers are responsible for cryptographic strength to linear, differential, algebraic, and other types of cryptanalysis. We propose new heuristics in the form of a cost function, calculated with the Walsh-Hadamard transform. We use the Hill Climbing Algorithm to find highly nonlinear substitutions. Our experiments demonstrate that the new heuristics give good results – it takes about 80,000 iterations of the algorithm to generate 8-bit S-boxes with a nonlinearity of 104. For the optimized parameters, the number of iterations of the algorithm is comparable to the best known results, which confirms the significance and value of the research. © The Author(s).

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Differential Evolution for Optimizing Parameter Estimation in Practical D2D Channels

Differential Evolution for Optimizing Parameter Estimation i...

引用

IEEE Conference on Wireless Communications and Networking

作者： Samuel B. Ferreira Gomes Nidhi Simmons Michel Daoud Yacoub Paschalis C. Sofotasios Simon L. Cotton Wireless Technology Laboratory School of Electrical and Computer Engineering University of Campinas Campinas Brazil Centre for Wireless Innovation School of Electronics Electrical Engineering and Computer Science Queen's University Belfast Belfast UK Department of Computer and Communication Engineering C2PS and 6G Center Khalifa University Abu Dhabi UAE Department of Electrical Engineering Tampere University Tampere Finland

ISBN: (数字)9798350303582

ISBN: (纸本)9798350303599

Inspired by the theory of natural evolution, Differential Evolution (DE) functions constitute an optimization tool in the field of evolutionary algorithms. Here, we propose employing DE to estimate physically acceptable fading parameters in device-to-device (D2D) communication channels. We examine four real-world D2D propagation channel measurements obtained under various conditions: indoor, outdoor, line-of-sight (LOS), and non-LOS. Four popular fading models, $\kappa-\mu, \eta-\mu, \kappa-\mu$ /inverse gamma, and $\eta-\mu$ /inverse gamma are used to characterize these links. Two fitness functions, Kullback-Leibler divergence (KLD) and mean squared error (MSE), are utilized for evaluation. We also compare the DE with another evolutionary algorithm, namely the genetic algorithm (GA). Notably, our results demonstrate that while both algorithms deliver excellent estimation performances, DE emerges as significantly faster and more robust compared to GA. Regarding fitness performances, the algorithm, when paired with KLD, outperforms the pairing with MSE, as assessed through the minimization of the Akaike information criterion.

关键词： Fading channels Parameter estimation Metaheuristics Estimation Channel estimation Line-of-sight propagation Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Physical Layer Security: From Far-Field to Near-Field

引用

IEEE Transactions on Wireless Communications 2025年

作者： Zhao, Boqun Ouyang, Chongjun Zhang, Xingqi Liu, Yuanwei University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Queen Mary University of London School of Electronic Engineering and Computer Science LondonE1 4NS United Kingdom The University of Manchester School of Electrical and Electronic Engineering Manchester United Kingdom The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong

The secrecy performance in both near-field and far-field communications is analyzed using two fundamental metrics: the secrecy capacity under a power constraint and the minimum power requirement to achieve a specified secrecy rate target. 1) For the secrecy capacity, a closed-form expression is derived under a discrete-time memoryless setup. This expression is further analyzed under several far-field and near-field channel models, and the capacity scaling law is revealed by assuming an infinitely large transmit array and an infinitely high power. A novel concept of "depth of insecurity" is proposed to evaluate the secrecy performance achieved by near-field beamfocusing. It is demonstrated that increasing the number of transmit antennas reduces this depth and thus improves the secrecy performance. 2) Regarding the minimum required power, a closed-form expression is derived and analyzed within far-field and near-field scenarios. Asymptotic analyses are performed by setting the number of transmit antennas to infinity to unveil the power scaling law. Numerical results are provided to demonstrate that: i) compared to far-field communications, near-field communications expand the areas where secure transmission is feasible, specifically when the eavesdropper is located in the same direction as the intended receiver;ii) as the number of transmit antennas increases, neither the secrecy capacity nor the minimum required power scales or vanishes unboundedly, adhering to the principle of energy conservation. © 2002-2012 IEEE.

关键词： Secure communication

来源：评论

学校读者我要写书评

暂无评论

Deep Learning based Defect Detection Algorithm for Solar Panels 5

Deep Learning based Defect Detection Algorithm for Solar Pan...

引用

5th World Robot Conference Symposium on Advanced Robotics and Automation, WRC SARA 2023

作者： Li, Jiaqi Li, Hongxu Wu, Yifan Zhou, Hailiang Manfredi, Luigi Li, Peng Zhang, Hong Hebei Province Yanshan University Department of Key Lab of Industrial Computer Control Engineering Qinhuangdao066004 China University of Alberta Department of Computing Science EdmontonABT6G 2R3 Canada Hebei Baoding Jiasheng Photovoltaic Technology Co. Ltd. China United Kingdom Southern University of Science and Technology Department of Electronic and Electrical Engineering Shenzhen China

ISBN: (纸本)9798350307320

Defect detection of solar panels plays an essential role in guaranteeing product quality within automated production lines. However, traditional manual inspection of solar panel defects suffers from low efficiency. This paper proposes an enhanced YOLOv5 algorithm (EL-YOLOv5) fused with the CBAM hybrid attention module to ensure product quality. The algorithm focuses on detecting five common types of defects that frequently appear on photovoltaic production lines, namely hidden cracks, scratches, broken grids, black spots, and short circuits. This study utilizes publicly available solar panel datasets, as well as datasets collected from actual photovoltaic production lines. These datasets are annotated accordingly and used to train the proposed algorithm. The experimental results demonstrate that the proposed algorithm achieves good performance on both the public and actual solar panel defect datasets. Particularly in actual datasets, where defect features are often less apparent and defects are smaller in size, the proposed algorithm can still detect even minor black spots. © 2023 IEEE.

关键词： Solar panels

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Reinforcement Learning: A Survey

arXiv

引用

arXiv 2023年

作者： Bai, Hui Cheng, Ran Jin, Yaochu Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Faculty of Technology Bielefeld University Bielefeld33615 Germany Department of Computer Science University of Surrey Surrey GuildfordGU2 7XH United Kingdom

Reinforcement learning (RL) is a machine learning approach that trains agents to maximize cumulative rewards through interactions with environments. The integration of RL with deep learning has recently resulted in impressive achievements in a wide range of challenging tasks, including board games, arcade games, and robot control. Despite these successes, several critical challenges remain, such as brittle convergence properties caused by sensitive hyperparameters, difficulties in temporal credit assignment with long time horizons and sparse rewards, a lack of diverse exploration, particularly in continuous search space scenarios, challenges in credit assignment in multi-agent RL, and conflicting objectives for rewards. Evolutionary computation (EC), which maintains a population of learning agents, has demonstrated promising performance in addressing these limitations. This article presents a comprehensive survey of state-of-the-art methods for integrating EC into RL, referred to as evolutionary reinforcement learning (EvoRL). We categorize EvoRL methods according to key research areas in RL, including hyperparameter optimization, policy search, exploration, reward shaping, meta-RL, and multi-objective RL. We then discuss future research directions in terms of efficient methods, benchmarks, and scalable platforms. This survey serves as a resource for researchers and practitioners interested in the field of EvoRL, highlighting the important challenges and opportunities for future research. With the help of this survey, researchers and practitioners can develop more efficient methods and tailored benchmarks for EvoRL, further advancing this promising cross-disciplinary research field. Copyright © 2023, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：