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

Journal of Network Intelligence 2024年第3期9卷 1427-1440页

作者： Ye, Li-Zhu Alkawaz, Mohammed Hazim Johar, Md Gapar Md School of Information Technology and Engineering Guangzhou College of Commerce Guangzhou511363 China School of Graduate Studies Management and Science University 40100 Shah Alam Selangor Malaysia Department of Computer Science College of Education for Pure Science University of Mosul Mosul41002 Iraq Software Engineering and Digital Innovation Center Management and Science University Shah Alam40100 Malaysia

Aiming at the unbalanced problem of big data classification, this paper proposes a classification method of unbalanced data on the ground of Bayesian optimal neural network model. The method firstly uses Optimized Graph Convolutional Network (OGCN) network to carry out message passing mechanism in data graph, designs neural network model with self-attention pooling and mean maximization pooling, and then uses Bayes optimization to update the posterior probability of optimization function by constantly updating the probability model and evaluating the objective function. Effectively solve the problem of speed and optimal solution of hyperparameter optimization in the neural network model. Secondly, the model is used for data set training to obtain the weight of the entire network. Secondly, the unbalanced data is mixed sampling to reduce the number of negative samples. Finally, the capability of the model was verified on the CiteSeer dataset. Experimental results showed that the accuracy rate, accuracy rate and recall rate of the proposed algorithm were 0.974, 0.982 and 0.973, respectively, which effectively improved the accuracy rate, accuracy rate and recall rate of unbalanced data classification compared with other algorithms. © 2024, Taiwan Ubiquitous information CO LTD. All rights reserved.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

Hyper Elliptic Curve Based Certificateless Signcryption Scheme for Secure IIoT Communications

引用

computers, Materials & Continua 2022年第5期71卷 2515-2532页

作者： Usman Ali Mohd Yamani Idna Idris Jaroslav Frnda Mohamad Nizam Bin Ayub Roobaea Alroobaea Fahad Almansour Nura Modi Shagari Insaf Ullah Ihsan Ali Department of Computer System and Technology Faculty of Computer Science and Information TechnologyUniversity of MalayaKuala Lumpur50603Malaysia Department of Computer Science University of SwatSaidu Sharif19130Pakistan Center for Research in Mobile Cloud Computing University of MalayaKuala Lumpur50603Malaysia Department of Quantitative Methods and Economic Informatics Faculty of Operation and Economics of Transport and CommunicationsUniversity of Zilina01026 ZilinaSlovakia Department of Computer Science College of Computers and Information TechnologyTaif UniversityTaif21944Saudi Arabia Department of Computer Science College of Sciences and Arts in RassQassim UniversityBuraydah51452Saudi Arabia Department of Computer Science Hamdard Institute of Engineering and TechnologyIslamabad44000Pakistan

Industrial internet of things (IIoT) is the usage of internet of things(IoT) devices and applications for the purpose of sensing, processing andcommunicating real-time events in the industrial system to reduce the unnecessary operational cost and enhance manufacturing and other industrial-relatedprocesses to attain more profits. However, such IoT based smart industriesneed internet connectivity and interoperability which makes them susceptibleto numerous cyber-attacks due to the scarcity of computational resourcesof IoT devices and communication over insecure wireless channels. Therefore, this necessitates the design of an efficient security mechanism for IIoTenvironment. In this paper, we propose a hyperelliptic curve cryptography(HECC) based IIoT Certificateless Signcryption (IIoT-CS) scheme, with theaim of improving security while lowering computational and communicationoverhead in IIoT environment. HECC with 80-bit smaller key and parameterssizes offers similar security as elliptic curve cryptography (ECC) with 160-bitlong key and parameters sizes. We assessed the IIoT-CS scheme security byapplying formal and informal security evaluation techniques. We used Realor Random (RoR) model and the widely used automated validation of internet security protocols and applications (AVISPA) simulation tool for formalsecurity analysis and proved that the IIoT-CS scheme provides resistance tovarious attacks. Our proposed IIoT-CS scheme is relatively less expensivecompared to the current state-of-the-art in terms of computational cost andcommunication overhead. Furthermore, the IIoT-CS scheme is 31.25% and 51.31% more efficient in computational cost and communication overhead,respectively, compared to the most recent protocol.

关键词： IoT security authentication protocols hyperelliptic curve cryptography certificateless public key cryptography

来源：评论

学校读者我要写书评

暂无评论

A Parallel Color Image Encryption Algorithm Based on a 2-D Logistic-Rulkov Neuron Map

引用

IEEE Internet of Things Journal 2025年第11期12卷 18115-18124页

作者： Gao, Suo Zhang, Zheyi Iu, Herbert Ho-Ching Ding, Siqi Mou, Jun Erkan, Uğur Toktas, Abdurrahim Li, Qi Wang, Chunpeng Cao, Yinghong Dalian Polytechnic University School of Information Science and Engineering Dalian116034 China The University of Western Australia School of Electrical Electronic and Computer Engineering PerthWA6009 Australia Dalian University of Technology School of Mathematical Sciences Dalian116024 China Karamanoglu Mehmetbey University Faculty of Engineering Department of Computer Engineering Karaman70200 Turkey Ankara University Engineering Faculty Department of Artificial Intelligence and Data Engineering Ankara06830 Turkey Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan250000 China

Images are widely used in social networks, necessitating efficient and secure transmission, especially in bandwidth-constrained environments. This article aims to develop a color image encryption algorithm that enhances security while optimizing computational efficiency. A novel parallel color image encryption algorithm based on the 2-D logistic-Rulkov neuron map (2D-LRNM) is proposed. In this approach, the three channels of the color image are first separated. Cross-channel information interaction is introduced to form three new channels, which are then processed in parallel. During the encryption process of each channel, a block-wise parallel encryption mechanism is applied, ensuring simultaneous encryption of each block. This block-wise strategy effectively leverages parallel computing resources and balances the task load. To meet the demand for a large number of keystreams during encryption, the 2D-LRNM is introduced. It combines the simplicity and chaotic properties of the Logistic map with the multitimescale dynamics and neurodynamic behaviors of the Rulkov map. By overcoming the dimensional limitations inherent in the single Logistic map, this approach extends the system to a 2-D framework, significantly increasing the complexity of chaotic behavior and improving its unpredictability. Experimental results demonstrate that the proposed encryption algorithm achieves high security and reduces computation time by approximately 83.3%. © 2014 IEEE.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Global video object segmentation with spatial constraint module

引用

Computational Visual Media 2023年第2期9卷 385-400页

作者： Yadang Chen Duolin Wang Zhiguo Chen Zhi-Xin Yang Enhua Wu Engineering Research Center of Digital Forensics Ministry of EducationSchool of Computer and SoftwareNanjing University of Information Science and TechnologyNanjing 210044China State Key Laboratory of Internet of Things for Smart City Department of Electromechanical EngineeringUniversity of MacaoMacao 999078China State Key Laboratory of Computer Science Institute of SoftwareUniversity of Chinese Academy of SciencesBeijing 100190China Faculty of Science and Technology University of MacaoMacao 999078China

We present a lightweight and efficient semisupervised video object segmentation network based on the space-time memory *** some extent,our method solves the two difficulties encountered in traditional video object segmentation:one is that the single frame calculation time is too long,and the other is that the current frame’s segmentation should use more information from past *** algorithm uses a global context(GC)module to achieve highperformance,real-time *** GC module can effectively integrate multi-frame image information without increased memory and can process each frame in real ***,the prediction mask of the previous frame is helpful for the segmentation of the current frame,so we input it into a spatial constraint module(SCM),which constrains the areas of segments in the current *** SCM effectively alleviates mismatching of similar targets yet consumes few additional *** added a refinement module to the decoder to improve boundary *** model achieves state-of-the-art results on various datasets,scoring 80.1%on YouTube-VOS 2018 and a J&F score of 78.0%on DAVIS 2017,while taking 0.05 s per frame on the DAVIS 2016 validation dataset.

关键词： video object segmentation semantic segmentation global context(GC)module spatial constraint

来源：评论

学校读者我要写书评

暂无评论

An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding 26

An AFPTAS for Bin Packing with Partition Matroid via a New M...

引用

26th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2023 and the 27th International Conference on Randomization and Computation, RANDOM 2023

作者： Doron-Arad, Ilan Kulik, Ariel Shachnai, Hadas Computer Science Department Technion Haifa Israel CISPA Helmholtz Center for Information Security Saarbrücken Germany

ISBN: (纸本)9783959772969

We consider the Bin Packing problem with a partition matroid constraint. The input is a set of items of sizes in [0, 1], and a partition matroid over the items. The goal is to pack the items in a minimum number of unit-size bins, such that each bin forms an independent set in the matroid. This variant of classic Bin Packing has natural applications in secure storage on the Cloud, as well as in equitable scheduling and clustering with fairness constraints. Our main result is an asymptotic fully polynomial-time approximation scheme (AFPTAS) for Bin Packing with a partition matroid constraint. This scheme generalizes the known AFPTAS for Bin Packing with Cardinality Constraints and improves the existing asymptotic polynomial-time approximation scheme (APTAS) for Group Bin Packing, which are both special cases of Bin Packing with partition matroid. We derive the scheme via a new method for rounding a (fractional) solution for a configuration-LP. Our method uses this solution to obtain prototypes, in which items are interpreted as placeholders for other items, and applies fractional grouping to modify a fractional solution (prototype) into one having desired integrality properties. © 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

A side match oriented data hiding based on absolute moment block truncation encoding mechanism with reversibility

引用

Multimedia Tools and Applications 2025年第17期84卷 18395-18417页

作者： Liu, Jui-Chuan Lin, Yijie Chang, Ching-Chun Chang, Chin‐Chen Department of Information Engineering and Computer Science Feng Chia University NO.100 Wenhwa Rd. Taichung Seatwen40724 Taiwan Information and Communication Security Research Center Feng Chia University NO.100 Wenhwa Rd. Taichung Seatwen40724 Taiwan

Owing to life style changes during COVID, communication channels were forced to change. Online services ramped up to replace traditional services. It became daily practice for most of us that documents, files, photos, and videos were transmitted through the internet and websites. information security was one of the big issues requiring more and more attention. Researchers proposed various solutions including steganography, watermarking, and data hiding. Reversible data hiding (RDH) is a commonly and widely accepted method to secure information. A receiver can not only extract secret information from stego media but can also recover the original media. This study focuses on enhancing the embedding capacity based on a known scheme proposed by Chang et al. in 2017. The proposed scheme incorporates absolute moment block truncation coding (AMBTC). In addition to using the high and low values generated from AMBTC to hide information, we introduce a multi-pass index reordering method to embed data into the bitmap, further boosting the embedding capacity. We also apply the side match (SM) technique in the bitmap recovery process. Our experimental results show that the proposed scheme can significantly improve embedding capacity. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Leader Election Algorithm for IoT: Cloud Storage Use Case 7

A Lightweight Leader Election Algorithm for IoT: Cloud Stora...

引用

7th International Conference on Future Networks and Distributed Systems, ICFNDS 2023

作者： Bounceur, Ahcene Kfupm University Information And Computer Science Department Interdisciplinary Research Center Intelligent Secure Systems Saudi Arabia

ISBN: (纸本)9798400709036

In a distributed environment where IoT devices collaborate on shared data, ensuring a secure turn-taking process during data updates remains crucial. Unlike in centralized systems, the concept of mutexes is no longer applicable in distributed systems. This is where distributed locks and leader election mechanisms become essential. The BROGO (Branch Optima to Global Optimum) Leader Election Algorithm, known for its low power consumption, presents a compelling solution tailored for IoT systems. Notably, this algorithm achieves a remarkable 95% reduction in energy consumption compared to conventional techniques. In the context of this paper, we use the BROGO algorithm as a case study within the realm of cloud storage. © 2023 ACM.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Budgeted Matroid Maximization: a Parameterized Viewpoint 18

Budgeted Matroid Maximization: a Parameterized Viewpoint

引用

18th International Symposium on Parameterized and Exact Computation, IPEC 2023

作者： Doron-Arad, Ilan Kulik, Ariel Shachnai, Hadas Computer Science Department Technion Haifa Israel CISPA Helmholtz Center for Information Security Saarbrücken Germany

ISBN: (纸本)9783959773058

We study budgeted variants of well known maximization problems with multiple matroid constraints. Given an -matchoid M on a ground set E, a profit function p : E → ≥0, a cost function c : E → ≥0, and a budget B ∈ ≥0, the goal is to find in the -matchoid a feasible set S of maximum profit p(S) subject to the budget constraint, i.e., c(S) ≤ B. The budgeted -matchoid (BM) problem includes as special cases budgeted -dimensional matching and budgeted -matroid intersection. A strong motivation for studying BM from parameterized viewpoint comes from the APX-hardness of unbudgeted -dimensional matching (i.e., B = ∞) already for = 3. Nevertheless, while there are known FPT algorithms for the unbudgeted variants of the above problems, the budgeted variants are studied here for the first time through the lens of parameterized complexity. We show that BM parametrized by solution size is W[1]-hard, already with a degenerate single matroid constraint. Thus, an exact parameterized algorithm is unlikely to exist, motivating the study of FPT-approximation schemes (FPAS). Our main result is an FPAS for BM (implying an FPAS for -dimensional matching and budgeted -matroid intersection), relying on the notion of representative set - a small cardinality subset of elements which preserves the optimum up to a small factor. We also give a lower bound on the minimum possible size of a representative set which can be computed in polynomial time. © 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Optimizing Steering Angle Predictive Convolutional Neural Network for Autonomous Car

引用

computers, Materials & Continua 2022年第5期71卷 2285-2302页

作者： Hajira Saleem Faisal Riaz Asadullah Shaikh Khairan Rajab Adel Rajab Muhammad Akram Mana Saleh Al Reshan Control Automotive and Robotics Lab Affiliated lab of National Center of Robotics and Automation(NCRA HEC Pakistan)and with the Department of Computer Science and Information TechnologyMirpur University of Science and Technology(MUST)Mirpur Azad Kashmir10250Pakistan College of Computer Science and Information System Najran UniversityNajran61441Saudi Arabia College of Computer Science and Engineering University of South FloridaTampa33620United States

Deep learning techniques,particularly convolutional neural networks(CNNs),have exhibited remarkable performance in solving visionrelated problems,especially in unpredictable,dynamic,and challenging *** autonomous vehicles,imitation-learning-based steering angle prediction is viable due to the visual imagery comprehension of *** this regard,globally,researchers are currently focusing on the architectural design and optimization of the hyperparameters of CNNs to achieve the best *** has proven the superiority of metaheuristic algorithms over the manual-tuning of ***,to the best of our knowledge,these techniques are yet to be applied to address the problem of imitationlearning-based steering angle ***,in this study,we examine the application of the bat algorithm and particle swarm optimization algorithm for the optimization of the CNN model and its hyperparameters,which are employed to solve the steering angle prediction *** validate the performance of each hyperparameters’set and architectural parameters’set,we utilized the Udacity steering angle dataset and obtained the best results at the following hyperparameter set:optimizer,Adagrad;learning rate,0.0052;and nonlinear activation function,exponential linear *** per our findings,we determined that the deep learning models show better results but require more training epochs and time as compared to shallower *** show the superiority of our approach in optimizing CNNs through metaheuristic algorithms as compared with the manual-tuning *** testing was also performed using the model trained with the optimal architecture,which we developed using our approach.

关键词： Bat algorithm convolutional neural network hyperparameters metaheuristic optimization algorithm steering angle prediction

来源：评论

学校读者我要写书评

暂无评论

Orbit Weighting Scheme in the Context of Vector Space information Retrieval

引用

computers, Materials & Continua 2024年第7期80卷 1347-1379页

作者： Ahmad Ababneh Yousef Sanjalawe Salam Fraihat Salam Al-E’mari Hamzah Alqudah Department of Computer Science Faculty of Information TechnologyAmerican University of MadabaAmman11821Jordan Department of Cybersecurity Faculty of Information TechnologyAmerican University of MadabaAmman11821Jordan Artificial Intelligence Research Center(AIRC) College of Engineering and Information TechnologyAjman UniversityP.O.Box 346Ajman13306United Arab Emirates Information Security Department Faculty of Information TechnologyUniversity of PetraAmman11196Jordan Department of Data Science and Artificial Intelligence Faculty of Information TechnologyAmerican University of MadabaAmman11821Jordan

This study introduces the Orbit Weighting Scheme(OWS),a novel approach aimed at enhancing the precision and efficiency of Vector Space information retrieval(IR)models,which have traditionally relied on weighting schemes like tf-idf and *** conventional methods often struggle with accurately capturing document relevance,leading to inefficiencies in both retrieval performance and index size *** proposes a dynamic weighting mechanism that evaluates the significance of terms based on their orbital position within the vector space,emphasizing term relationships and distribution patterns overlooked by existing *** research focuses on evaluating OWS’s impact on model accuracy using information Retrieval metrics like Recall,Precision,InterpolatedAverage Precision(IAP),andMeanAverage Precision(MAP).Additionally,we assessOWS’s effectiveness in reducing the inverted index size,crucial for model *** compare OWS-based retrieval models against others using different schemes,including tf-idf variations and *** reveal OWS’s superiority,achieving a 54%Recall and 81%MAP,and a notable 38%reduction in the inverted index *** highlights OWS’s potential in optimizing retrieval processes and underscores the need for further research in this underrepresented area to fully leverage OWS’s capabilities in information retrieval methodologies.

关键词： information retrieval orbit weighting scheme semantic text analysis Tf-Idf weighting scheme vector space model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：