检索结果-南通市图书馆

Modeling and Verification of Aircraft Takeoff Through Novel Quantum Nets

Computers, Materials & Continua 2022年第8期72卷 3331-3348页

作者： Maryam Jamal nazir ahmad zafar Atta-ur-Rahman Dhiaa Musleh Mohammed A.Gollapalli Sghaier Chabani School of Systems and Technology University of Management&Technology(UMT)C-II Block C 2 Phase 1 Johar TownLahore54770PunjabPakistan Department of Computer Science COMSATS University Islamabad–Sahiwal CampusSahiwal57000PunjabPakistan Department of Computer Science(CS) College of Computer Science and Information Technology(CCSIT)Imam Abdulrahman Bin Faisal University(IAU)Dammam31441Saudi Arabia Department of Computer Information System(CIS) College of Computer Science and Information Technology(CCSIT)Imam Abdulrahman Bin Faisal University(IAU)Dammam31441Saudi Arabia

The formal modeling and verification of aircraft takeoff is a challenge because it is a complex safety-critical *** task of aircraft takeoff is distributed amongst various computer-based controllers,however,with the growing malicious threats a secure communication between aircraft and controllers becomes highly *** research serves as a starting point for integration of BB84 quantum protocol with petri nets for secure modeling and verification of takeoff *** integrated model combines the BB84 quantum cryptographic protocol with powerful verification tool support offered by petri *** model certain important properties of BB84,a new variant of petri nets coined as Quantum Nets are proposed by defining their mathematical foundations and overall system dynamics,furthermore,some important system properties are also abstractly *** proposed QuantumNets are then applied for modeling of aircraft takeoff process by defining three quantum nets:namely aircraft,runway controller and gate *** authentication between quantum nets,the use of external places and transitions is demonstrated to describe the encryptiondecryption process of qubits ***,the developed takeoff quantum network is verified through simulation offered by colored petri-net(CPN)***,reachability tree(RT)analysis is also performed to have greater confidence in feasibility and correctness of the proposed aircraft takeoff model through the Quantum Nets.

关键词： Aircraft takeoff BB84 quantum cryptography petri-nets quantum nets formal modeling and verification

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

LR(K) Parser Construction Using Bottom-up Formal Analysis

引用

Journal of Software Engineering and Applications 2012年第1期5卷 21-28页

作者： nazir ahmad zafar 不详

Design and construction of an error-free compiler is a difficult and challenging process. The main functionality of a compiler is to translate a source code to an executable machine code correctly and efficiently. In formal verification of software, semantics of a language has more meanings than the syntax. It means source program verification does not give guarantee the generated code is correct. This is because the compiler may lead to an incorrect target program due to bugs in itself. It means verification of a compiler is much more important than verification of a source program. In this paper, we present a new approach by linking context-free grammar and Z notation to construct LR(K) parser. This has several advantages because correctness of the compiler depends on describing rules that must be written in formal languages. First, we have defined grammar then language derivation procedure is given using right-most derivations. Verification of a given language is done by recursive procedures based on the words. Ambiguity of a language is checked and verified. The specification is analyzed and validated using Z/Eves tool. Formal proofs are presented using powerful techniques of reduction and rewriting available in Z/Eves.

关键词： Compiler Construction LR(K) Parser Context-Free Grammar Z Specification Correctness Verification

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Model Analysis of Equivalence Classes in UML Events Relations

引用

Journal of Software Engineering and Applications 2013年第12期6卷 653-661页

作者： nazir ahmad zafar Department of Computer Science King Faisal University Hofuf KSA

Unified Modeling Language (UML) has become a de facto standard for design, specification and modeling of object oriented software systems. UML structures being graphical in nature lack defining semantics of the systems and are prone to causing errors. Formal methods are proved to be a powerful tool for requirement analysis, design and specification of software systems. Hence, linking UML with formal approaches will enhance modeling power of software systems. In this paper, an approach is developed by integrating UML and Z notation focusing on equivalence relation of the state diagrams. The Z is used because it is based on the first order predicate logic having rigorous computer tool support. The reflexivity, symmetry and transitivity properties, being important at design level, are identified and described. It is believed that this approach will be effective and useful at both academics and industrial level. The need, reasoning and benefits of the integrated approach are discussed. The resultant formal models are analyzed and validated using Z/Eves tool.

关键词： UML State Diagrams Equivalence Relations Formal Methods Z notation Validation and Verification

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Syntax-Tree Regular Expression Based DFA FormalConstruction

引用

Intelligent Information Management 2012年第4期4卷 138-146页

作者： nazir ahmad zafar Fawaz Alsaade Department of Computer Science King Faisal University Hofuf KSA

Compiler is a program whose functionality is to translate a computer program written in source language into an equivalent machine code. Compiler construction is an advanced research area because of its size and complexity. The source codes are in higher level languages which are usually complex and, consequently, increase the level of abstraction. Due to such reasons, design and construction of error free compiler is a challenge of the twenty first century. Verification of a source program does not guarantee about correctness of code generated because the bugs in compiler may lead to an incorrect target program. Therefore, verification of compiler is more important than verifying the source programs. Lexical analyzer is a main phase of compiler used for scanning input and grouping into sequence of tokens. In this paper, formal construction of deterministic finite automata (DFA) based on regular expression is presented as a part of lexical analyzer. At first, syntax tree is described based on the augmented regular expression. Then formal description of important operators, checking nullability and computing first and last positions of internal nodes of the tree is described. In next, the transition diagram is described from the follow positions and converted into deterministic finite automata by defining a relationship among syntax tree, transition diagram and DFA. Formal specification of the procedure is described using Z notation and model analysis is provided using Z/Eves toolset.

关键词： Automata Theory Compiler Verification Lexical Analyzer Automated Tools Z Specification

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A U-Net-Based CNN Model for Detection and Segmentation of Brain Tumor

引用

Computers, Materials & Continua 2023年第1期74卷 1333-1349页

作者： Rehana Ghulam Sammar Fatima Tariq Ali nazir ahmad zafar Abdullah A.Asiri Hassan A.Alshamrani Samar M.Alqhtani Khlood M.Mehdar Department of Computer Science COMSATS University IslamabadSahiwal CampusSahiwal57000Pakistan Radiological Sciences Department College of applied medical sciencesNajran UniversityNajran61441Saudi Arabia Department of Information Systems College of Computer Science and Information SystemsNajran UniversityNajran61441Saudi Arabia Anatomy Department Medicine CollegeNajran UniversityNajran61441Saudi Arabia

Human brain consists of millions of cells to control the overall structure of the human *** these cells start behaving abnormally,then brain tumors *** and initial stage brain tumor detection has always been an issue in the field of medicines for medical *** handle this issue,various deep learning techniques for brain tumor detection and segmentation techniques have been developed,which worked on different datasets to obtain fruitful results,but the problem still exists for the initial stage of detection of brain tumors to save human *** this purpose,we proposed a novel U-Net-based Convolutional Neural Network(CNN)technique to detect and segmentizes the brain tumor for Magnetic Resonance Imaging(MRI).Moreover,a 2-dimensional publicly available Multimodal Brain Tumor Image Segmentation(BRATS2020)dataset with 1840 MRI images of brain tumors has been used having an image size of 240×240 *** initial dataset preprocessing the proposed model is trained by dividing the dataset into three parts i.e.,testing,training,and validation *** model attained an accuracy value of 0.98%on the BRATS2020 dataset,which is the highest one as compared to the already existing techniques.

关键词： U-net brain tumor magnetic resonance images convolutional neural network segmentation

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Modeling Components and Services of LTE Mobile Communications System

引用

International Journal of Communications, Network and System Sciences 2012年第12期5卷 815-824页

作者： Ishtiaq Ahmed Choudhry nazir ahmad zafar Department of Communication and Networking King Faisal University Al-Ahsa KSA Department of Computer Science King Faisal University Al-Ahsa KSA

The latest wireless broadband network standard is LTE (Long Term Evolution) which is developed by 3GPP (3rd Generation Partnership Project). It will enable mobile devices such as smart phones, tablets and laptops to access Internet at a very high speed along with lots of multimedia services. There are many issues that are yet to be solved due to dynamic complex nature of wireless systems, multimedia software applications and software requirements. Poor service quality, service disconnections due to mobility, seamless handover, handover interruption time and downward compatibility to other Radio Access Networks (RAN) are some of the key issues for the current LTE systems that are addressed very recently in the scientific literature. Formal method is one of the promising software engineering techniques that assure quality and perfection in software system models. Formal methods use mathematical language to explicitly specify system specifications and requirements that serve as initial grounds for further development and implementation. It efficiently handles all component connections and resource management parameters using discrete structures. Z Schema language is used to model static aspects of LTE communications system. All the schemas are being verified using Z/Eves toolset. The aim is to provide sound mathematical foundation for system validation and verification that eventually results in a more reliable, scalable and complete software system.

关键词： LTE Communications System Formal Methods Emerging Software Mathematical Language Z Notation

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Refinement in Formal Proof of Equivalence in Morphisms over Strongly Connected Algebraic Automata

引用

Journal of Software Engineering and Applications 2009年第2期2卷 77-85页

作者： nazir ahmad zafar Ajmal Hussain Amir Ali Faculty of Information Technology University of Central Punjab

Automata theory has played an important role in computer science and engineering particularly modeling behavior of systems since last couple of decades. The algebraic automaton has emerged with several modern applications, for ex-ample, optimization of programs, design of model checkers, development of theorem provers because of having proper-ties and structures from algebraic theory of mathematics. Design of a complex system not only requires functionality but it also needs to model its control behavior. Z notation is an ideal one used for describing state space of a system and then defining operations over it. Consequently, an integration of algebraic automata and Z will be an effective computer tool which can be used for modeling of complex systems. In this paper, we have combined algebraic automata and Z notation defining a relationship between fundamentals of these approaches. At first, we have described algebraic automaton and its extended forms. Then homomorphism and its variants over strongly connected automata are speci-fied. Finally, monoid endomorphisms and group automorphisms are formalized, and formal proof of their equivalence is given under certain assumptions. The specification is analyzed and validated using Z/EVES tool.

关键词： Formal Methods Automata Integration of Approaches Z Notation Validation

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Verifying Monoid and Group Morphisms over Strongly Connected Algebraic Automata

引用

Journal of Software Engineering and Applications 2010年第8期3卷 803-812页

作者： nazir ahmad zafar Ajmal Hussain Amir Ali 不详

Automata theory has played an important role in theoretical computer science since last couple of decades. The alge-braic automaton has emerged with several modern applications, for example, optimization of programs, design of model checkers, development of theorem provers because of having certain interesting properties and structures from algebraic theory of mathematics. Design of a complex system requires functionality and also needs to model its control behavior. Z notation has proved to be an effective tool for describing state space of a system and then defining operations over it. Consequently, an integration of algebraic automata and Z will be a useful computer tool which can be used for modeling of complex systems. In this paper, we have linked algebraic automata and Z defining a relationship between fundamentals of these approaches which is refinement of our previous work. At first, we have described strongly connected algebraic automata. Then homomorphism and its variants over strongly connected automata are specified. Next, monoid endomorphisms and group automorphisms are formalized. Finally, equivalence of endomorphisms and automorphisms under certain assumptions are described. The specification is analyzed and validated using Z/Eves toolset.

关键词： Formal Methods Z notation Algebraic Automata Validation and Verification

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Volume-complementary bipolar layered oxide enables stable symmetric sodium-ion batteries

引用

Nano Research 2024年第5期17卷 4125-4133页

作者： Bo Peng Feng Wang nazir ahmad Lai Yu Shenghua Chen Genqiang Zhang School of Materials Science and Engineering Key Laboratory of Efficient Conversion and Solid-state Storage of Hydrogen and Electricity of Anhui ProvinceAnhui University of TechnologyMa’anshan 243002China Hefei National Research Center for Physical Sciences at the Microscale Chinese Academy of Sciences(CAS)Key Laboratory of Materials for Energy ConversionDepartment of Materials Science and EngineeringUniversity of Science and Technology of ChinaHefei 230026China National Innovation Platform(Center)for Industry-Education Integration of Energy Storage Technology School of Chemical Engineering and TechnologyXi’an Jiaotong UniversityXi’an 710049China

The commercialization of sodium-ion batteries is based on developing low-cost,highly stable,and safe cathode and anode ***,the promising hard carbon anode and layered oxide cathode suffer from low sodium-embedded potential near 0.1 V and severe phase transitions,which cause safe problem and short lifespan,***,we design a low-strain bipolar P2-Na_(0.7)Ni_(0.25)Fe_(0.2)Ti_(0.55)O_(2) to solve the mentioned obstacles,whereas(Ni,Fe)and Ti provide charge compensation when it is used as cathode and anode,*** is revealed that the bipolar layered oxide undergoes solid-solution reaction when used as cathode or anode,and exhibits volume-complementary feature in a sodium-ion full-cell,as identified by in-situ X-ray ***,the safe symmetric sodium-ion full-cell exhibits excellent cyclic stability with 91.7%capacity retention after 200 *** work will provide a new horizon for designing safe and stable sodium-ion batteries.

关键词： sodium-ion batteries bipolar layered oxides solid-solution reaction volume complementation symmetric battery

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Enhanced Topic-Aware Summarization Using Statistical Graph Neural Networks

引用

Computers, Materials & Continua 2024年第8期80卷 3221-3242页

作者： Ayesha Khaliq Salman Afsar Awan Fahad ahmad Muhammad Azam Zia Muhammad zafar Iqbal Department of Computer Science University of Agriculture FaisalabadFaisalabadPunjab37300Pakistan School of Computing Faculty of TechnologyUniversity of PortsmouthSouthseaPortsmouthPO12UPUK Department of Mathematics and Statistics University of Agriculture FaisalabadFaisalabadPunjab37300Pakistan

The rapid expansion of online content and big data has precipitated an urgent need for efficient summarization techniques to swiftly comprehend vast textual documents without compromising their original *** approaches in Extractive Text Summarization(ETS)leverage the modeling of inter-sentence relationships,a task of paramount importance in producing coherent *** study introduces an innovative model that integrates Graph Attention Networks(GATs)with Transformer-based Bidirectional Encoder Representa-tions from Transformers(BERT)and Latent Dirichlet Allocation(LDA),further enhanced by Term Frequency-Inverse Document Frequency(TF-IDF)values,to improve sentence selection by capturing comprehensive topical *** approach constructs a graph with nodes representing sentences,words,and topics,thereby elevating the interconnectivity and enabling a more refined understanding of text *** model is stretched to Multi-Document Summarization(MDS)from Single-Document Summarization,offering significant improvements over existing models such as THGS-GMM and Topic-GraphSum,as demonstrated by empirical evaluations on benchmark news datasets like Cable News Network(CNN)/Daily Mail(DM)and *** results consistently demonstrate superior performance,showcasing the model’s robustness in handling complex summarization tasks across single and multi-document *** research not only advances the integration of BERT and LDA within a GATs but also emphasizes our model’s capacity to effectively manage global information and adapt to diverse summarization challenges.

关键词： Summarization graph attention network bidirectional encoder representations from transformers Latent Dirichlet Allocation term frequency-inverse document frequency

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：