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

Dipper Throated Optimization for Detecting Black-Hole Attacks inMANETs

computers, Materials & Continua 2023年第1期74卷 1905-1921页

作者： Reem Alkanhel El-Sayed M.El-kenawy Abdelaziz A.Abdelhamid Abdelhameed Ibrahim Mostafa Abotaleb Doaa Sami Khafaga Department of Information Technology College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Department of Communications and Electronics Delta Higher Institute of Engineering and TechnologyMansoura35111Egypt Faculty of Artificial Intelligence Delta University for Science and TechnologyMansoura35712Egypt Department of Computer Science Faculty of Computer and Information SciencesAin Shams UniversityCairo11566Egypt Department of Computer Science College of Computing and Information TechnologyShaqra University11961Saudi Arabia Computer Engineering and Control Systems Department Faculty of EngineeringMansoura UniversityMansoura35516Egypt Department of System Programming South Ural State UniversityChelyabinsk454080Russia Department of Computer Sciences College of Computer and Information SciencesPrincess Nourah Bint Abdulrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia

In terms of security and privacy,mobile ad-hoc network(MANET)continues to be in demand for additional debate and *** more MANET applications become data-oriented,implementing a secure and reliable data transfer protocol becomes a major concern in the ***,MANET’s lack of infrastructure,unpredictable topology,and restricted resources,as well as the lack of a previously permitted trust relationship among connected nodes,contribute to the attack detection burden.A novel detection approach is presented in this paper to classify passive and active black-hole *** proposed approach is based on the dipper throated optimization(DTO)algorithm,which presents a plausible path out of multiple paths for statistics transmission to boost MANETs’quality of service.A group of selected packet features will then be weighed by the DTO-based multi-layer perceptron(DTO-MLP),and these features are collected from nodes using the Low Energy Adaptive Clustering Hierarchical(LEACH)clustering *** is a powerful classifier and the DTO weight optimization method has a significant impact on improving the classification process by strengthening the weights of key features while suppressing the weights ofminor *** hybridmethod is primarily designed to combat active black-hole *** the LEACH clustering phase,however,can also detect passive black-hole *** effect of mobility variation on detection error and routing overhead is explored and evaluated using the suggested *** diverse mobility situations,the results demonstrate up to 97%detection accuracy and faster execution ***,the suggested approach uses an adjustable threshold value to make a correct conclusion regarding whether a node is malicious or benign.

关键词： Black-hole attack mobile ad-hoc network optimization dipper throated optimization

来源：评论

学校读者我要写书评

暂无评论

Sheffer stroke operation on L-algebras via an algorithmic approach

引用

Soft Computing 2024年第19期28卷 10801-10813页

作者： Gürsoy, Necla Kırcalı Öner, Tahsin Gürsoy, Arif Ülker, Alper Department of Computer Programming Ege Vocational School Ege University İzmir Bornova35100 Turkey Department of Mathematics Ege University İzmir Bornova35100 Turkey Department of Mathematics and Computer Science İstanbul Kültür University Bakırköy Istanbul34156 Turkey Izmir Biomedicine and Genome Center İzmir Balçova35340 Turkey

In this study, we introduce the Sheffer stroke L-algebra and prove some fundamental theorems, propositions and lemmas of Sheffer Stroke L-algebras. The notions of filter and ultrafilter for Sheffer stroke L-algebra are studied. We give subalgebra and normal subset definitions of a Sheffer stroke L-algebras. Moreover, a homomorphism between Sheffer stroke L-algebras is introduced and isomorphism theorems are presented. Finally, we give three new algorithms for Sheffer stroke L-algebras. Thus, it is contributed to researchers on different application areas by presenting an algorithmic approach on this subject, for the first time in the literature. © The Author(s) 2024.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Information theoretical approach to minimization of AND/EXOR expressions of switching functions

Information theoretical approach to minimization of AND/EXOR...

引用

4th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services, ITELSIKS 1999

作者： Shmerko, V. Popel, D. Stanković, R.S. Cheushev, V. Yanushkevich, S. Department of Computer Aided Design Systems Techinal University of Szczecin Poland Department of Computer Sicience State University of Informatics and Radioelectronics Minks Belarus Department of Computer Science Faculty of Electronic Engineering University of Nis Serbia Department of Programming Technologies State University Minsk Belarus

ISBN: (纸本)078035768X

In modern circuit design, the Shannon decomposition of switching functions is widely used. On the other hand, in information theory of telecommunication, the Shannon entropy used as a measure to represent the information in numerical values, is a key notion. In this paper, we relate these two concepts, belonging to different areas, into an approach to the minimisation of exclusive-or sum-of-products (AND/EXOR) expressions for switching functions. The Shannon decomposition, and the closely related Davio decomposition for AND/EXOR expressions are interpreted in terms of basic concepts in the information theory. Thanks to that, we have proposed an entropy based strategy for minimization of AND/EXOR expressions. We have provided a comparison and an experimental verification of this strategy with some known heuristic minimization strategies using benchmarks. In some cases, our program Info-EXOR produces extremely better results. Moreover, the information theory interpretation of classical decomposition of switching functions offers a new point of view to the existing design styles. © 1999 IEEE.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of an Instrumented walking cane for Detection of Freezing of Gait 3

Design and Implementation of an Instrumented walking cane fo...

引用

3rd IEEE International Multidisciplinary Conference on Engineering Technology, IMCET 2021

作者： Haidar Ahmad, Joelle El-Asmar, Alain Abi Zeid Daou, Roy Hayek, Ali Boercsoek, Josef Faculty of Public Health Biomedical Technologies Department Jounieh Lebanon MART Learning Education and Research Center Chananir Lebanon University of Kassel Faculty of Electrical Engineering/Computer Science Department of Computer Architecture and System Programming Germany

ISBN: (纸本)9781665405874

Independent mobility is an important feature of an individual's normal life and with the elderly population continually growing, assistive devices such as walkers and canes provide help and guidance to users. Freezing of Gait (FoG) is an episodic phenomenon that is a common symptom of an age-related disease known as Parkinson Disease (PD). This paper is headed toward implementing a detection, diagnosis and correction system for FoG episodes. The proposed cane will generate visual, auditory and tactile cues to help patients overcome this problem, therefore reducing fall risks. In addition, a vibrating calf cuff will be attached to the calf for muscle stimulation. A compatible android phone application is designed to display heart rate measurements of the patient as well as his exact location in case of fall detection. The system is considered to be an electrically safe, portable, comfortable and a low-cost device. The performance of this system is analyzed thoroughly and the accuracy of all methodologies is considered carefully and evaluated. The results have shown no faulty errors and good accuracy and detection percentages. © 2021 IEEE.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Computing with lattices: An application of type classes

引用

Journal of Functional programming 1992年第4期2卷 475-503页

作者： Jones, Mark P. Programming Research Group Oxford University UK Department of Computer Science Yale University Yale Station New Haven CT 06520-2158 PO Box 2158 United Kingdom

This paper presents a simple framework for performing calculations with the elements of (finite) lattices. A particular feature of this work is the use of type classes to enable the use of overloaded function symbols within a strongly typed language. Previous applications of type classes have been in areas that are of most interest to language implementors. This paper suggests that type classes might also be useful as a general tool in the development of clear and modular programs. © 1992, Cambridge University Press. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multicore Software Engineering, Performance, and Tools 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Victor Pankratius Michael Philippsen

ISBN: (数字)9783642312021

ISBN: (纸本)9783642312014

This book constitutes the refereed proceedings of the International Conference on Multiscore Software Engineering, Performance, and Tools, MSEPT 2012, held in Prague in May/June 2012. The 9 revised papers, 4 of which are short papers were carefully reviewed and selected from 24 submissions. The papers address new work on optimization of multicore software, program analysis, and automatic parallelization. They also provide new perspectives on programming models as well as on applications of multicore systems.

关键词： Special Purpose and Application-Based Systems System Performance and Evaluation Software Engineering programming Languages, Compilers, Interpreters Operating Systems programming Techniques

来源：评论

学校读者我要写书评

暂无评论

Gracefully adding negation and disjunction to Prolog 3rd

引用

3rd International Conference on Logic programming, ICLP 1986

作者： Poole, David L. Goebel, Randy Logic Programming and Artificial Intelligence Group Department of Computer Science University of Waterloo WaterlooONN2L 3G1 Canada

ISBN: (纸本)9783540164920

We show how one can add negation and disjunction to Prolog, with the property that there is no overhead in run time if we do not use the negation, and we only pay for the negation when we actually use it. The extension is based on Loveland's MESON proof procedure, which requires that a negative ancestor search and availability of contrapostive forms of formulae be added to Prolog. We identify a property of literals that can be statically determined, in order to avoid using the full generality of the full clausal proof procedure when not required. © 1986, Springer-Verlag.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Normalisation by evaluation for dependent types 1

Normalisation by evaluation for dependent types

引用

1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016

作者： Altenkirch, Thorsten Kaposi, Ambrus School for Computer Science University of Nottingham Nottingham United Kingdom Department of Programming Languages and Compilers Eötvös Loránd University Budapest Hungary

ISBN: (纸本)9783959770101

We develop normalisation by evaluation (NBE) for dependent types based on presheaf categories. Our construction is formulated using internal type theory using quotient inductive types. We use a typed presentation hence there are no preterms or realizers in our construction. NBE for simple types is using a logical relation between the syntax and the presheaf interpretation. In our construction, we merge the presheaf interpretation and the logical relation into a proof-relevant logical predicate. We have formalized parts of the construction in Agda. © 2016 Thorsten Altenkirch and Ambrus Kaposi.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

WIP: An Engaging Undergraduate Intro to Model Checking in Software Engineering Using TLA+ 54

WIP: An Engaging Undergraduate Intro to Model Checking in So...

引用

54th IEEE Frontiers in Education Conference, FIE 2024

作者： Läufer, Konstantin Mertin, Gunda Thiruvathukal, George K. Loyola University Software and Systems Laboratory Department of Computer Science Chicago United States Institute for Software Engineering and Programming Languages University of Lübeck Germany

ISBN: (纸本)9798350351507

Background: In this Innovative Practice Work in Progress, we present our initial efforts to integrate formal methods, with a focus on model-checking specifications written in Temporal Logic of Actions (TLA+), into computer science education, targeting undergraduate juniors/seniors and graduate students. Many safety-critical systems and services crucially depend on correct and reliable behavior. Formal methods can play a key role in ensuring correct and safe system behavior, yet remain underutilized in educational and industry contexts. Aims: We aim to (1) qualitatively assess the state of formal methods in computer science programs, (2) construct level-appropriate examples that could be included midway into one's undergraduate studies, (3) demonstrate how to address successive 'failuresy' through progressively stringent safety and liveness requirements, and (4) establish an ongoing framework for assessing interest and relevance among students. Methods: We detail our pedagogical strategy for embedding TLA+ into an intermediate course on formal methods at our institution. After starting with a refresher on mathematical logic, students specify the rules of simple puzzles in TLA+ and use its included model checker (known as TLC) to find a solution. We gradually escalate to more complex, dynamic, event-driven systems, such as the control logic of a microwave oven, where students will study safety and liveness requirements. We subsequently discuss explicit concurrency, along with thread safety and deadlock avoidance, by modeling bounded counters and buffers. Results: Our initial findings suggest that through careful curricular design and choice of examples and tools, it is possible to inspire and cultivate a new generation of software engineers proficient in formal methods. Conclusions: Our initial efforts suggest that 84% of our students had a positive experience in our formal methods course. Our future plans include a longitudinal analysis within our own institution and

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Direct and Inverse Optimization Problems in a Gas Deposit Model 15

Direct and Inverse Optimization Problems in a Gas Deposit Mo...

引用

15th International Conference Management of Large-Scale System Development, MLSD 2022

作者： Skiba, Alexander Federal Research Center 'Computer Science and Control' of the Russian Academy of Sciences Design Methods for Developing Systems Department of Mathematical Methods of Regional Programming Moscow Russia

ISBN: (数字)9781665497015

ISBN: (纸本)9781665497015

A continuous dynamic model for the development of a gas field is studied. Two mathematical problems are posed, solved and analyzed. In the direct problem, we are looking for the maximum accumulated profit on a set of temporary functions of a certain type. In the inverse optimization problem, we define the entire set of planning horizons. We subject the assigned tasks to a comprehensive analysis. © 2022 IEEE.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：