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

6th Conference on Advances in Financial Technologies, AFT 2024

作者： Kotzer, Arad Rottenstreich, Ori The Department of Computer Science Technion Haifa Israel The Department of Computer Science The Department of Electrical and Computer Engineering Technion Haifa Israel

ISBN: (纸本)9783959773454

Light clients implement a simple solution for Bitcoin’s scalability problem, as they do not store the entire blockchain but only the state of particular addresses of interest. To be able to keep track of the updated state of their addresses, light clients rely on full nodes to provide them with the required information. To do so, they must reveal information about the addresses they are interested in. This paper studies the two most common light client implementations, SPV and Neutrino with regards to their privacy. We define privacy metrics for comparing the privacy of the different implementations. We evaluate and compare the privacy of the implementations over time on real Bitcoin data and discuss the inherent privacy-communication tradeoff. In addition, we propose general techniques to enhance light client privacy in the existing implementations. Finally, we propose a new SPV-based light client model, the aggregation model, evaluate it, and show it can achieve enhanced privacy than in the existing light client implementations. © Arad Kotzer and Ori Rottenstreich.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Comparison of deep learning algorithms for site detection of false data injection attacks in smart grids

引用

Energy Informatics 2024年第1期7卷 71页

作者： Nasir, Qassim Abu Talib, Manar Arshad, Muhammad Arbab Ishak, Tracy Berrim, Romaissa Alsaid, Basma Badway, Youssef Abu Waraga, Omnia Department of Computer Engineering University of Sharjah Sharjah United Arab Emirates Department of Computer Science University of Sharjah Sharjah United Arab Emirates Department of Computer Science Iowa State University AmesIA United States Department of Electrical Engineering University of Sharjah Sharjah United Arab Emirates

False Data Injection Attacks (FDIA) pose a significant threat to the stability of smart grids. Traditional Bad Data Detection (BDD) algorithms, deployed to remove low-quality data, can easily be bypassed by these attacks which require minimal knowledge about the parameters of the power bus systems. This makes it essential to develop defence approaches that are generic and scalable to all types of power systems. Deep learning algorithms provide state-of-the-art detection for FDIA while requiring no knowledge about system parameters. However, there are very few works in the literature that evaluate these models for FDIA detection at the level of an individual node in the power system. In this paper, we compare several recent deep learning-based model that proven their high performance and accuracy in detecting the exact location of the attack node, which are convolutional neural networks (CNN), Long Short-Term Memory (LSTM), attention-based bidirectional LSTM, and hybrid models. We, then, compare their performance with baseline multi-layer perceptron (MLP)., All the models are evaluated on IEEE-14 and IEEE-118 bus systems in terms of row accuracy (RACC), computational time, and memory space required for training the deep learning model. Each model was further investigated through a manual grid search to determine the optimal architecture of the deep learning model, including the number of layers and neurons in each layer. Based on the results, CNN model exhibited consistently high performance in very short training time. LSTM achieved the second highest accuracy;however, it had required an averagely higher training time. The attention-based LSTM model achieved a high accuracy of 94.53 during hyperparameter tuning, while the CNN model achieved a moderately lower accuracy with only one-fourth of the training time. Finally, the performance of each model was quantified on different variants of the dataset—which varied in their l2-norm. Based on the results, LSTM, CNN obta

关键词： Smart power grids

来源：评论

学校读者我要写书评

暂无评论

Efficient Bit-Plane Based Medical Image Cryptosystem Using Novel and Robust Sine-Cosine Chaotic Map

引用

computers, materials & Continua 2025年第4期83卷 917-933页

作者： Zeric Tabekoueng Njitacke Louai A.Maghrabi Musheer Ahmad Turki Althaqafi Department of Electrical and Electronic Engineering College of Technology(COT)University of BueaBueaP.O.Box 63Cameroon Department of Software Engineering College of EngineeringUniversity of Business and TechnologyJeddah22246Saudi Arabia Department of Computer Engineering Jamia Millia IslamiaNew Delhi110025India Department of Computer Science School of EngineeringComputing and DesignDar Al-Hekma UniversityJeddah22246Saudi Arabia

This paper presents a high-security medical image encryption method that leverages a novel and robust sine-cosine *** map demonstrates remarkable chaotic dynamics over a wide range of *** employ nonlinear analytical tools to thoroughly investigate the dynamics of the chaotic map,which allows us to select optimal parameter configurations for the encryption *** findings indicate that the proposed sine-cosine map is capable of generating a rich variety of chaotic attractors,an essential characteristic for effective *** encryption technique is based on bit-plane decomposition,wherein a plain image is divided into distinct bit *** planes are organized into two matrices:one containing the most significant bit planes and the other housing the least significant *** subsequent phases of chaotic confusion and diffusion utilize these matrices to enhance *** auxiliary matrix is then generated,comprising the combined bit planes that yield the final encrypted *** results demonstrate that our proposed technique achieves a commendable level of security for safeguarding sensitive patient information in medical *** a result,image quality is evaluated using the Structural Similarity Index(SSIM),yielding values close to zero for encrypted images and approaching one for decrypted ***,the entropy values of the encrypted images are near 8,with a Number of Pixel Change Rate(NPCR)and Unified Average Change Intensity(UACI)exceeding 99.50%and 33%,***,quantitative assessments of occlusion attacks,along with comparisons to leading algorithms,validate the integrity and efficacy of our medical image encryption approach.

关键词： Image cryptosystem robust chaos sine-cosine map nonlinear analysis tools medical images

来源：评论

学校读者我要写书评

暂无评论

NCFS:new chaotic fuzzy system as a general function approximator

引用

Journal of Control and Decision 2023年第4期10卷 514-528页

作者： Hamid Abbasi Mahdi Yaghoobi Arash Sharifi Mohammad Teshnehlab Department of Computer Engineering Science and Research BranchIslamic Azad UniversityTehranIran Department of Electrical and Computer Engineering Mashhad BranchIslamic Azad UniversityMashhadIran Department of Electrical and Computer Engineering K.N.T University of TechnologyTehranIran

Conventional fuzzy systems(type-1 and type 2)are universal *** goal of this paper is to design and implement a new chaotic fuzzy system(NCFS)based on the Lee oscil-lator for function approximation and chaotic *** incorporates fuzzy reasoning of the fuzzy systems,self-adaptation of the neural networks,and chaotic signal generation in a unique *** features enable the structure to handle uncertainties by generating new information or by chaotic search among prior *** fusion of chaotic structure into the neurons of the membership layer of a conventional fuzzy system makes the NCFS more capable of confronting nonlinear *** on the GFA and Stone-Weierstrass theorems,we show that the proposed model has the function approximation *** NCFS perfor-mance is investigated by applying it to the problem of chaotic *** results are demonstrated to ilustrate the concept of function approximation.

关键词： Chaotic fuzzy system function approximation chaotic neural network oscillatory neuron

来源：评论

学校读者我要写书评

暂无评论

Hybrid Water Quality Prediction with Multimodal Low-rank Fusion and Localized Attention

引用

IEEE Internet of Things Journal 2025年第12期12卷 21158-21169页

作者： Bi, Jing Li, Yibo Yuan, Haitao Wang, Mengyuan Wang, Ziqi Zhang, Jia Zhou, MengChu Beijing University of Technology College of Computer Science Beijing100124 China Beihang University School of Automation Science and Electrical Engineering Beijing100191 China Beihang University School of Energy and Power Engineering Beijing100191 China Southern Methodist University Department of Computer Science DallasTX75206 United States New Jersey Institute of Technology Department of Electrical and Computer Engineering NewarkNJ07102 United States

Water quality prediction methods forecast the short-or long-term trends of its changes, providing proactive advice for preventing and controlling water pollution. Existing water quality prediction methods typically fail to capture water quality's nonlinear characteristics accurately and only consider historical time series data. However, meteorology and other factors also significantly impact water quality indicators. Therefore, considering only historical data of water quality time series is not feasible. To solve this problem, this work proposes a hybrid water quality prediction model called CMLIP, which integrates ConvNeXt V2, Multimodal bottleneck transformer, Low-rank multimodal fusion, ITransformer, and PatchTST. CMLIP inputs water quality time series and meteorological remotely sensed rainfall images into a multimodal fusion module before prediction. Specifically, CMLIP integrates the model of ConvNeXt V2 to extract image features. Its multimodal fusion module combines a multimodal bottleneck transformer and the low-rank multimodal fusion to fuse the time series and images. Furthermore, CMLIP combines iTransformer and PatchTST to form an improved prediction module that realizes the prediction of fused features. Experimental results with real-life water quality time series and remotely sensed rainfall images demonstrate that CMLIP when fusing meteorological data, achieves an average improvement of 17% in water quality forecasting accuracy compared to forecasts using only water quality time series. Moreover, CMLIP outperforms other state-of-the-art algorithms in both data fusion and prediction, with an average enhancement of 6% in fusion effectiveness and an average improvement of 22% in prediction accuracy. © 2025 IEEE.

关键词： Rain

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation

引用

IEEE Transactions on Information Theory 2025年第6期71卷 4556-4580页

作者： Wang, Ziao Wang, Weina Wang, Lele The University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T 1Z4 Canada University of Michigan Department of Electrical and Computer Engineering Ann ArborMI48109 United States Carnegie Mellon University Computer Science Department PittsburghPA15213 United States

Graph alignment refers to the task of finding the vertex correspondence between two correlated graphs of n vertices. Extensive study has been done on polynomial time algorithms for the graph alignment problem under the Erdős–Rényi graph pair model, where the two graphs are Erdős–Rényi graphs with edge probability qu , correlated under certain vertex correspondence. To achieve exact recovery of the correspondence, all existing algorithms at least require the edge correlation coefficient ρu between the two graphs to be non-vanishing as n → ∞. Moreover, it is conjectured that no polynomial-time algorithm can achieve exact recovery under vanishing edge correlation ρu u ≥ n−Θ(1). We identify a local tree structure, which incorporates one layer of user information and one layer of attribute information, and apply the subgraph counting technique to such structures. A polynomial-time algorithm is proposed that recovers the vertex correspondence for most of the vertices, and then refines the output to achieve exact recovery. The consideration of attribute information is motivated by real-world applications like LinkedIn and Twitter, where user attributes like birthplace and education background can aid alignment. © 1963-2012 IEEE.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Shuffled multi-evolutionary algorithm with linear population size reduction

引用

Soft Computing 2024年第21期28卷 12671-12688页

作者： Ahandani, Morteza Alinia Kharrati, Hamed Rahimi, Afshin Department of Electrical Engineering Langarud Branch Islamic Azad University Langarud Iran Faculty of Electrical and Computer Engineering University of Tabriz Tabriz Iran Department of Mechanical Automotive and Materials Engineering University of Windsor WindsorONN9B 3P4 Canada

The evolutionary algorithms with shuffling concept divide a population into several groups and then each group try to evolve its members in an independent evolutionary process. In an attempt to increase and diversify search moves and preventing the premature convergence of such algorithms, this paper proposes a meta-heuristic technique by employing several evolutionary processes for different groups. In this strategy, different groups can be evolved using a randomly selected evolutionary process. In accordance with this purpose and to provide an ability of jumping out of local optima, which can be useful for finding global optima in complex optimization problems, four different evolutionary strategies inspired from shuffled frog leaping (SFL), shuffled complex evolution (SCE), shuffled differential evolution (SCE) and opposition-based learning (OBL) are incorporated into a new structure called the shuffled multi-evolutionary algorithm (SMEA). The SMEA is extended with linear population size reduction (LPSR) known as L-SMEA, which continually decreases the population size and number of groups according to a linear function. The SMEA is evaluated on CEC2014 and CEC2017 benchmark functions. The obtained results are compared with SFL, SCE and SDE and other state-of-the-art algorithms proposed in the literatures. Performing the statistical analysis of the obtained results demonstrate that the proposed L-SMEA is superior to other three algorithms including SFL, SCE and SDE and some other state-of-the-art algorithms. Also, the performed experiments indicate the contribution of employing multiple evolutionary strategies beside of linear population size reduction leads to achieving a more effective and robust algorithm than those used single evolutionary strategy. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Bounded Flow Preservers 35

Fault-Tolerant Bounded Flow Preservers

引用

35th International Symposium on Algorithms and Computation, ISAAC 2024

作者： Bansal, Shivam Choudhary, Keerti Dhanoa, Harkirat Wardhan, Harsh Department of Computer Science and Engineering IIT Delhi India Department of Electrical Engineering IIT Delhi India

ISBN: (纸本)9783959773546

Given a directed graph G = (V, E) with n vertices, m edges and a designated source vertex s ∈ V, we consider the question of finding a sparse subgraph H of G that preserves the flow from s up to a given threshold λ even after failure of k edges. We refer to such subgraphs as (λ, k)-fault-tolerant bounded-flow-preserver ((λ, k)-FT-BFP). Formally, for any F ⊆ E of at most k edges and any v ∈ V, the (s, v)-max-flow in H \ F is equal to (s, v)-max-flow in G \ F, if the latter is bounded by λ, and at least λ otherwise. Our contributions are summarized as follows: 1. We provide a polynomial time algorithm that given any graph G constructs a (λ, k)-FT-BFP of G with at most λ2kn edges. 2. We also prove a matching lower bound of Ω(λ2kn) on the size of (λ, k)-FT-BFP. In particular, we show that for every λ, k, n ≥ 1, there exists an n-vertex directed graph whose optimal (λ, k)-FT-BFP contains Ω(min{2kλn, n2}) edges. 3. Furthermore, we show that the problem of computing approximate (λ, k)-FT-BFP is NP-hard for any approximation ratio that is better than O(log(λ−1n)). © Shivam Bansal, Keerti Choudhary, Harkirat Dhanoa, and Harsh Wardhan.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Defocus blur detection using novel local directional mean patterns(LDMP)and segmentation via KNN matting

引用

Frontiers of computer science 2022年第2期16卷 110-122页

作者： Awais KHAN Aun IRTAZA Ali JAVED Tahira NAZIR Hafiz MALIK Khalid Mahmood MALIK Muhammad Ammar KHAN Department of Computer Science University of Engineering and TechnologyTaxila 47050Pakistan Department of Electrical and Computer Engineering University of MichiganDearbornMI 48128USA Department of Software Engineering University of Engineering and TechnologyTaxila 47050Pakistan Department of Computer Science and Engineering Oakland UniversityMI 48309USA

Detection and segmentation of defocus blur is a challenging task in digital imaging applications as the blurry images comprise of blur and sharp regions that wrap significant information and require effective methods for information *** defocus blur detection and segmentation methods have several limitations i.e.,discriminating sharp smooth and blurred smooth regions,low recognition rate in noisy images,and high computational cost without having any prior knowledge of images i.e.,blur degree and camera ***,there exists a dire need to develop an effective method for defocus blur detection,and segmentation robust to the above-mentioned *** paper presents a novel features descriptor local directional mean patterns(LDMP)for defocus blur detection and employ KNN matting over the detected LDMP-Trimap for the robust segmentation of sharp and blur *** argue/hypothesize that most of the image fields located in blurry regions have significantly less specific local patterns than those in the sharp regions,therefore,proposed LDMP features descriptor should reliably detect the defocus blurred *** fusion of LDMP features with KNN matting provides superior performance in terms of obtaining high-quality segmented regions in the ***,the proposed LDMP features descriptor is robust to noise and successfully detects defocus blur in high-dense noisy *** results on Shi and Zhao datasets demonstrate the effectiveness of the proposed method in terms of defocus blur *** and comparative analysis signify that our method achieves superior segmentation performance and low computational cost of 15 seconds.

关键词： defocus blur detection local directional mean patterns image matting sharpness metrics blur segmentation

来源：评论

学校读者我要写书评

暂无评论

Tough Polymeric Hydrogels Based on Amino Acid Derivative Mediated Dynamic Metal Coordination Bonds

引用

Chinese Journal of Polymer science 2024年第10期42卷 1578-1588,I0014页

作者： Meng Li Meng-Yuan Zhang Wu-Xuan Lei Zhu-Ting Lv Qing-Hua Shang Zheng Zhao Jiang-Tao Li Yi-Long Cheng Engineering Research Center of Energy Storage Materials and Devices Ministry of EducationSchool of ChemistryXi’an Jiaotong UniversityXi’an710049China Polymer Materials&Engineering Department School of Materials Science&Engineering Chang’an UniversityXi’an710064China School of Electrical Engineering Xi’an Jiaotong UniversityXi’an710049China Department of Nuclear Medicine the First Affiliated Hospital of ChinaXi’an Jiaotong UniversityXi’an710049China

Abstract The development of physically crosslinked hydrogels with excellent mechanical and sensing properties is of importance for expanding the practical applications of intelligent soft hydrogel ***,after copolymerization of hydroxyl-containing amino acid derivative N-acryloyl serine(ASer)with acrylamide(AM),we introduce Zr4+through an immersion strategy to construct metal ion-toughened non-covalent crosslinked hydrogels(with tensile strength of up to 5.73 MPa).It is found that the synergistic coordination of hydroxyl and carboxyl groups with Zr^(4+)substantially increases the crosslinking density of the hydrogels,thereby imparting markedly superior mechanical properties compared to hydroxyl-free Zr^(4+)-crosslinked hydrogels,such as N-acryloyl alanine(AAla)copolymerized with AM hydrogels(with tensile strength of 2.98 MPa)Through the adjustment of the composition of the copolymer and the density of coordination bonds,the mechanical properties of the hydrogels can be modulated over a wide ***,due to the introduction of metal ions and the dynamic nature of coordination bonds,the hydrogels also exhibit excellent sensing performance and good self-recovery properties,paving the way for the development of flexible electronic substrates with outstanding comprehensive performances.

关键词： Hydrogel Amino acid Metal coordination Mechanical performance Flexible sensor

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：