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

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3384-3392页

作者： Alkhouri, Ismail R. Jha, Sumit Beckus, Andre Atia, George Jha, Susmit Ewetz, Rickard Velasquez, Alvaro OrlandoFL32816 United States Michigan State University Computational Mathematics Science and Engineering Department East LansingMI48824 United States University of Michigan Electrical Engineering and Computer Science Department Ann ArborMI48109 United States Florida International University Knights Foundation School of Computing and Information Sciences MiamiFL33199 United States Air Force Research Laboratory Rome Information Directorate NY13441 United States Department Computer Science Department OrlandoFL32816 United States SRI International Computer Science Laboratory Menlo ParkCA94025 United States Electrical and Computer Engineering Department OrlandoFL32816 United States University of Colorado Computer Science Department BoulderCO80309 United States

Protein folding neural networks (PFNNs) such as AlphaFold predict remarkably accurate structures of proteins compared to other approaches. However, the robustness of such networks has heretofore not been fully explored. This is particularly relevant given the broad social implications of such technologies and the fact that biologically small perturbations to noncritical residues of a protein sequence do not typically lead to drastic changes in the protein structure. Our study demonstrates that, similar to adversarial methods in machine learning, small changes to protein sequences can result in significant differences in the predicted protein structures using AlphaFold as determined by large distance measures. Despite this, our findings using multiple protein sequences suggest that AlphaFold is able to accurately predict the domain structure and folding regions of a protein. To gauge structural differences, we employ two alignment-based measures [root-mean-square deviation (RMSD) and the global distance test (GDT) similarity], and one alignment-free measure, which is an effective graph-based structure representation (GraSR) method. We prove that the problem of minimally perturbing protein sequences is NP-complete. Based on the well-established block substitution matrices (BLOSUM62) sequence alignment scoring matrix, we generate adversarial sequences. In our experimental evaluation, we consider 111 proteins (including 29 COVID-19 sequences) in the Universal Protein resource (UniProt), a central resource for protein data. Our findings suggest that, despite the high RMSD values returned by AlphaFold, it is capable of handling the BLOSUM adversarial sequences considered in our analysis, as evidenced by the preservation of the folded regions and the GraSR results. © 2020 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

software Defect Prediction Using Ensemble Technique 9

Software Defect Prediction Using Ensemble Technique

引用

9th International Conference on information Management and Technology, ICIMTech 2024

作者： Wicaksono, Pandu Arisaputra, Panji Yunanda, Rezky Kristian, Willy Mujhid, Almuzhidul School of Computer Science Bina Nusantara University Software Engineering Department Jakarta11480 Indonesia School of Information Systems Bina Nusantara University Information Systems Department Jakarta11480 Indonesia

ISBN: (纸本)9798350390025

software defect prediction is the methodical process of identifying code segments that are likely to have problems. This is done by analyzing software metrics and using categorization algorithms. This work introduces an alternate approach that utilizes ensemble learning techniques to improve the effectiveness of fault detection models. The models utilized in this study are CodeGPT and CodeBERT, both of which are transformer-based deep learning models that can extract code features from source code. The models are trained using the PROMISE dataset, which consists of Java projects that have been labeled with defects. The test results show that using ensemble learning methods can improve the accuracy, precision, recall, and F1 score of a single model by around 1-3%. This study contributes to the progress of software dependability and quality by utilizing advanced software fault prediction algorithms. © 2024 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

A Provably Secure Lightweight Key Agreement Protocol for Wireless Body Area Networks in Healthcare System

引用

IEEE Transactions on Industrial Informatics 2023年第2期19卷 1683-1690页

作者： Zia, Maryam Obaidat, Mohammad S. Mahmood, Khalid Shamshad, Salman Saleem, Muhammad Asad Chaudhry, Shehzad Ashraf Comsats University Islamabad Department of Computer Science Sahiwal57000 Pakistan University of Jordan King Abdullah Ii School of Information Technology Amman11942 Jordan University of Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China Amity University UP Noida201301 India National Yunlin University of Science and Technology Future Technology Research Center Yunlin64002 Taiwan The University of Lahore Department of Software Engineering Lahore54590 Pakistan Abu Dhabi University Department of Computer Science and Information Technology College of Engineering Abu Dhabi United Arab Emirates Nisantasi University Department of Computer Engineering Faculty of Engineering and Architecture Istanbul34398 Turkey

Wireless Body Area Network (WBAN) is a vital application of the Internet of Things (IoT) that plays a significant role in gathering a patient's healthcare information. This collected data helps special professionals like doctors or physicians analyze patients' health status to cure different diseases. However, collecting such information from an insecure channel can be threatening due to the potential security threats. Therefore, it is crucial to secure this sensitive information. This article proposes a secure and lightweight authentication protocol for WBAN. The devised protocol is scalable, secure, and lightweight compared to various relevant competing protocols. The informal security analysis shows that the designed protocol is lightweight, secure, and efficient in resisting various major attacks. The performance analysis demonstrates our protocol's supremacy over various competing protocols in terms of computation and communication costs, inducing efficiency of 20.3% and 12.3%, respectively. Moreover, the practical performance of the designed protocol from the network point of view is measured using the widely recognized NS3 simulation tool. © 2005-2012 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

A Fractional Fourier Based Medical Image Authentication Approach

引用

computers, Materials & Continua 2022年第2期70卷 3133-3150页

作者： Fayez Alqahtani Mohammed Amoon Walid El-Shafai Department of Software Engineering College of Computer and Information SciencesKing Saud UniversityRiyadh11451Saudi Arabia Department of Computer Science Community CollegeKing Saud UniversityRiyadh11437Saudi Arabia Department of Computer Science and Engineering Faculty of Electronic EngineeringMenoufia UniversityMenouf32952Egypt Department of Electronics and Electrical Communications Engineering Faculty of Electronic EngineeringMenoufia UniversityMenouf32952Egypt

Patient medical information in all forms is crucial to keep private and secure,particularly when medical data communication occurs through insecure ***,there is a bad need for protecting and securing the color medical images against impostors and *** this paper,an optical medical image security approach is *** is based on the optical bit-plane Jigsaw Transform(JT)and Fractional Fourier Transform(FFT).Different kernels with a lone lens and a single arbitrary phase code are exploited in this security approach.A preceding bit-plane scrambling process is conducted on the input color medical images prior to the JT and FFT processes to accomplish a tremendous level of robustness and *** confirm the efficiency of the suggested security approach for secure color medical image communication,various assessments on different color medical images are examined based on different statistical security ***,a comparative analysis is introduced between the suggested security approach and other conventional cryptography *** simulation outcomes acquired for performance assessment demonstrate that the suggested security approach is highly *** has excellent encryption/decryption performance and superior security results compared to conventional cryptography approaches with achieving recommended values of average entropy and correlation coefficient of 7.63 and 0.0103 for encrypted images.

关键词： Medical image security encryption JT FFT cryptosystem

来源：评论

学校读者我要写书评

暂无评论

Industrial Automation information Analogy for Smart Grid Security

引用

computers, Materials & Continua 2022年第5期71卷 3985-3999页

作者： Muhammad Asif Ishfaq Ali Shahbaz Ahmad Azeem Irshad Akber Abid Gardezi Fawaz Alassery Habib Hamam Muhammad Shafiq Department of Computer Science National Textile UniversityFaisalabad37610PunjabPakistan Department of Computer Science and Software Engineering International Islamic UniversityIslamabadPakistan Department of Computer Science COMSATS University IslamabadIslamabadPakistan Department of Computer Engineering College of Computers and Information TechnologyTaif UniversityTaifSaudi Arabia Faculty of Engineering Moncton UniversityNBE1A3E9Canada Department of Information and Communication Engineering Yeungnam UniversityGyeongsan38541Korea

Industrial automation or assembly automation is a strictly monitored environment,in which changes occur at a good *** are many types of entities in the focusing environment,and the data generated by these devices is *** addition,because the robustness is achieved by sensing redundant data,the data becomes *** data generating device,whether it is a sensing device or a physical device,streams the data to a higher-level deception device for calculation,so that it can be driven and configured according to the updated *** the emergence of the Industry 4.0 concept that includes a variety of automation technologies,various data is generated through numerous ***,the data generated for industrial automation requires unique information Architecture(IA).IA should be able to satisfy hard real-time constraints to spontaneously change the environment and the instantaneous configuration of all *** understand its applicability,we used an example smart grid *** smart grid system needs an IA to fulfill the communication requirements to report the hard real-time changes in the power immediately following the *** addition,in a smart grid system,it needs to report changes on either side of the system,i.e.,consumers and suppliers configure and reconfigure the system according to the *** this article,we propose an analogy of a physical phenomenon.A point charge is used as a data generating device,the streamline of electric flux is used as a data flow,and the charge distribution on a closed surface is used as a ***,the intensity changes are used in the physical process,e.g.,the smart *** analogy is explained by metaphors,and the structural mapping framework is used for its theoretical *** proposed analogy provides a theoretical basis for the development of such information architectures that can represent data flows,definition changes(deterministic and non-deterministic),events,and i

关键词： Industry 4.0 information architecture industrial automation

来源：评论

学校读者我要写书评

暂无评论

An Algorithm for Modified Minimum Length Sliding k Transmitter Problem 10

An Algorithm for Modified Minimum Length Sliding k Transmitt...

引用

10th International Conference on Networking Systems and Security, NSysS 2023

作者： Al-Mahmud, Mohammad Saidur Rahman, Md. Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka1205 Bangladesh

ISBN: (纸本)9798400708787

Advancement in wireless technology, artificial intelligence and robotics introduces different problems on coverage or visibility in different architectural shapes. Usually, architectural shapes are represented by two dimensional polygons. Such two dimensional polygons are partitioned using various partitioning techniques to solve those coverage or visibility problems. One such partitioning technique uses reflex vertices of orthogonal polygons. We establish some relations among different components of an orthogonal polygon after it is being partitioned by reflex vertices. There are many variants of each visibility or coverage problems in wireless technology. One such variant is minimum length sliding k transmitter problem. Such transmitters can travel back and forth along the boundary of an orthogonal polygon and can modeled as an omnidirectional wireless modem, transmit signal orthogonally and can penetrate through k walls (k is a fixed integer and k > 0) to reach the client. Let s be an orthogonal line segment where the k transmitter travels back and forth. A point p is covered by the guard if there exist a point q ĝ s such that is a line segment normal to s and at most k intersections with the boundary walls of the polygon. The objective is to minimize the sum of lengths of the sliding k transmitters to cover the entire polygon. In this paper we consider a modification in the above problem where instead of omnidirectional k transmitters we consider k transmitters which can transmit and receive signal orthogonally inside the polygon. The objective of the problem remains same and we termed this problem as modified minimum length sliding k transmitter problem. We develop an algorithm for this modified problem which finds the minimum length cover in O(n2) time. © 2023 ACM.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Unsupervised feature selection via multiple graph fusion and feature weight learning

引用

science China(information sciences) 2023年第5期66卷 56-72页

作者： Chang TANG Xiao ZHENG Wei ZHANG Xinwang LIU Xinzhong ZHU En ZHU School of Computer Science China University of Geosciences State Key Laboratory for Novel Software Technology Nanjing University School of Computer National University of Defense Technology National Supercomputing Center in Jinan Qilu University of Technology (Shandong Academy of Sciences) College of Mathematics Physics and Information Engineering Zhejiang Normal University

Unsupervised feature selection attempts to select a small number of discriminative features from original high-dimensional data and preserve the intrinsic data structure without using data labels. As an unsupervised learning task, most previous methods often use a coefficient matrix for feature reconstruction or feature projection, and a certain similarity graph is widely utilized to regularize the intrinsic structure preservation of original data in a new feature space. However, a similarity graph with poor quality could inevitably afect the final results. In addition, designing a rational and efective feature reconstruction/projection model is not easy. In this paper, we introduce a novel and efective unsupervised feature selection method via multiple graph fusion and feature weight learning（MGF2WL） to address these issues. Instead of learning the feature coefficient matrix, we directly learn the weights of diferent feature dimensions by introducing a feature weight matrix, and the weighted features are projected into the label space. Aiming to exploit sufficient relation of data samples, we develop a graph fusion term to fuse multiple predefined similarity graphs for learning a unified similarity graph, which is then deployed to regularize the local data structure of original data in a projected label space. Finally, we design a block coordinate descent algorithm with a convergence guarantee to solve the resulting optimization problem. Extensive experiments with sufficient analyses on various datasets are conducted to validate the efficacy of our proposed MGF2WL.

关键词： unsupervised feature selection graph fusion feature weight learning local structure preservation

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Tesseract and EasyOCR for Bangla Optical Character Recognition on the Novel Bangla CrossHair Dataset 3

Performance Analysis of Tesseract and EasyOCR for Bangla Opt...

引用

3rd International Conference on Intelligent Systems, Advanced Computing, and Communication, ISACC 2025

作者： Chowdhury, Abdulla Nasir Sami, Aftar Ahmad Mamun, Shah Masud Parvej Absar, Shakib Rahman, Fuad Kohinoor, Saidur Rahman Leading University Department of Electrical and Electronic Engineering Sylhet Bangladesh Leading University Department of Computer Science and Engineering Sylhet Bangladesh Taylor's University Department of Software Engineering Kualalampur Malaysia King Fahd University of Petroleum and Minerals Department of Information and Computer Science Dhahran Saudi Arabia

ISBN: (纸本)9798331523893

This paper presents a comparative study of key metrics for OCR engines in Bangla language processing. PyTesseract (a Python wrapper for Tesseract OCR) and EasyOCR were benchmarked on a novel dataset, "Bangla-CrossHair,"created for testing OCR engines. This dataset combines samples from "Bangla Text Detection and Recognition,""Bangla Handwritten Characters,"and "Bangla Handwritten Words"datasets and includes diverse image types, such as blurred, clear, torn, and tilted. Results show EasyOCR outperforms PyTesseract in several scenarios, while PyTesseract consistently demonstrated faster processing. Since many OCR engines provide pre-trained capabilities, traditional metrics like training and validation accuracy are challenging to measure for some models, including PyTesseract. Instead, Character Level Accuracy, Word Level Accuracy, Levenshtein Distance, Character Error Rate, Word Error Rate, Precision, Recall, F1-Score, and Inference time were measured for an unbiased evaluation. © 2025 IEEE.

关键词： Optical character recognition

来源：评论

学校读者我要写书评

暂无评论

Yolo Based License Plate Detection of Triple Riders and Violators

Yolo Based License Plate Detection of Triple Riders and Viol...

引用

2023 International Conference on computer Communication and Informatics, ICCCI 2023

作者： Nandhakumar, R.G. Devi, K. Nirmala Krishnamoorthy, N. Shanthi, S. Pranesh, V.R. Nikhalyaa, S. Kongu Enginering College Perundurai Department of Computer Science and Engineering Tamilnadu Erode India Vellore Institutte of Technology School of Information and Engineering Department of Software Systems and Engineering Vellore India

ISBN: (纸本)9798350348217

Road safety is of prime importance as road accidents are among the biggest causes of deaths in the country. Road Accidents are majorly due to violators and lawbreakers of road safety rules like not wearing helmets, triple riding etc. Even though there are many smart systems to monitor these violations, it is complicated to keep a track of the data and view it efficiently anywhere. Also monitoring the permit details of other state vehicles is hard. A method was proposed to address this issue. based on Deep learning and Optical Character Recognition (OCR). Here we detect the riders not wearing helmet and triple riders using object detection by comparing YOLOv2 and YOLOv3. This simplifies the task of traffic police who can't continuously and efficiently monitor all the violators. We gathered our data from three different sources. Kaggle was used to collect the data set. A number of items can be recognized by the real-time object recognition system YOLO in a single frame. It recognizes object more precisely and faster than other recognition systems. It can predict up to 9000 classes and even unseen classes. It divides the image into m∗m matrix and each grid detects objects within itself. The trained model is tested using a test dataset set after training in order to measure the performance. For Number plate detection we use OCR based character recognition. The recognized license plate images of violators are captured and stored in a database which is then sent to the concerned department. The stored data can be easily accessed using the developed mobile app. Metrics considered for evaluation is Accuracy. The average is utilized to assess object detection models like R-CNN and YOLO. The average calculates a score by comparing the detected box to the ground-truth bounding box. The better the score, the more precise the model's detections are. When compared to YOLOv2, YOLOv3 exhibits strong performance in terms of accuracy with 95.5%. © 2023 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Fixed-point quantum continuous search algorithm with optimal query complexity

引用

science China(Physics,Mechanics & Astronomy) 2025年第6期68卷 80-91页

作者： Shan Jin Yuhan Huang Shaojun Wu Guanyu Zhou Chang-Ling Zou Luyan Sun Xiaoting Wang Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of ChinaChengdu 610051China Key Laboratory of Quantum Information CASUniversity of Science and Technology of ChinaHefei 230022China Center for Quantum Information Institute for Interdisciplinary Information SciencesTsinghua UniversityBeijing 100084China Department of Electronic and Computer Engineering The Hong Kong University of Science and TechnologyHong Kong 999077China Hefei National Laboratory Hefei 230088China

Continuous search problems(CSPs),which involve finding solutions within a continuous domain,frequently arise in fields such as optimization,physics,and *** discrete search problems,CSPs require navigating an uncountably infinite space,presenting unique computational *** this work,we propose a fixed-point quantum search algorithm that leverages continuous variables to address these challenges,achieving a quadratic *** by the discrete search results,we manage to establish a lower bound on the query complexity of arbitrary quantum search for CSPs,demonstrating the optimality of our *** addition,we demonstrate how to design the internal structure of the quantum search oracle for specific ***,we develop a general framework to apply this algorithm to a range of problem types,including optimization and eigenvalue problems involving continuous variables.

关键词： quantum search quantum algorithm quantum computation optimization spectral problems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：