A image encryption algorithm based on chaotic Lorenz system and novel primitive polynomial S-boxes by Temadher Alassiry Al-Maadeed (14147847)

“…<p>We have proposed a robust, secure and efficient image encryption algorithm based on chaotic maps and algebraic structure. …”

A Novel Encryption Method for Dorsal Hand Vein Images on a Microcomputer by M. Z. Yildiz (16855476)

“…Second, the pre- and post-processed images were encrypted with a new encryption algorithm in the microcomputer environment. …”

A novel encryption algorithm using multiple semifield S-boxes based on permutation of symmetric group by Iqtadar Hussain (14147850)

“…To ensure the appropriate utilization of these chaotic maps, we carry out in-depth analyses of their behavior in the context of secure communication and apply the pseudo-random sequences of chaotic maps in the proposed image encryption algorithm accordingly.</p><h2>Other Information</h2><p dir="ltr">Published in: Computational and Applied Mathematics<br>License: <a href="https://creativecommons.org/licenses/by/4.0" target="_blank">https://creativecommons.org/licenses/by/4.0</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.1007/s40314-023-02208-x" target="_blank">https://dx.doi.org/10.1007/s40314-023-02208-x</a></p>…”

TIDCS: A Dynamic Intrusion Detection and Classification System Based Feature Selection by Zina Chkirbene (16869987)

Subjects:

Exploiting Sparsity in Amplify-and-Forward Broadband Multiple Relay Selection by Ala Gouissem (7006463)

“…In particular, by separating all the subcarriers or some subcarrier groups from each other and by optimizing the selection and beamforming vector(s) using OMP algorithm, a higher level of frequency diversity can be achieved. …”

Dynamic single node failure recovery in distributed storage systems by Itani, M.

“…To minimize the system repair cost, we formulate our problem using incidence matrices and solve it heuristically using genetic algorithms for all possible cases of single node failures. …”
Get full text
Get full text
Get full text
Get full text

A depth-controlled and energy-efficient routing protocol for underwater wireless sensor networks by Umesh Kumar Lilhore (17727684)

“…In the proposed energy-efficient routing protocol, an enhanced cluster head node is used to select a strategy that can analyze the remaining energy and directions of each participating node. …”

Reputation-based cooperative detection model of selfish nodes in cluster-based QoS-OLSR protocol. (c2014) by Moati, Nadia

Get full text
Get full text

A Novel Steganography Technique for Digital Images Using the Least Significant Bit Substitution Method by Shahid Rahman (16904613)

“…Additionally, the proposed approach achieved a 6.43 percent better score in PSNR with a variable measure of code inserted in similar images with distinct dimensions. Furthermore, encrypting the same amount of information in images of varying sizes resulted in approximately 6.77 percent improvements. …”

Privacy Preserving Cancellable Template Generation for Crypto-Biometric Authentication System by Mohd Imran (12249782)

“…Our main contribution includes: (a) Secure template generation by Mobius transformation using user keyset (p, q), (b) Securing the user template using permutation and encryption operation. The analysis of security and matching performance of the proposed preservation scheme has been evaluated against publicly available fingerprint database FVC2000 DB1, FVC2000 DB2, FVC2002 DB1, FVC2002 DB3, FVC2004 DB1 and FVC2004 DB3 containing 800 images of 100 persons, 8 images per person in each database using FMR, FAR, GAR, ROC Curve, and EER parameters. …”

MDPF: Minimum Distance Packet Forwarding for Search Applications in Mobile Ad Hoc Networks by Artail, Hassan

“…This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. …”
Get full text
Get full text
Get full text
Get full text

A cluster-based model for QoS-OLSR protocol by Otrok, Hadi

“…Therefore, we propose a novel clustering algorithm and a relay node selection based on different combinations of metrics, such as connectivity, residual energy, and bandwidth. …”
Get full text
Get full text
Get full text
Get full text

The bus sightseeing problem by Qian Hu (205735)

“…Significant research focus has been directed toward profitable routing variants due to the practical importance of their applications and their interesting structure, which jointly optimizes node selection and routing decisions. Profitable routing applications arise in the tourism industry aiming to maximize the profit score of attractions visited within a limited time period. …”

A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks by Abu-Khzam, Faisal N.

“…We introduce a hybrid heuristic for this problem, in which we combine low-degree vertex elimination and high-degree vertex selection. This simple and efficient method yields very promising experimental results, outperforming known heuristic algorithms.…”
Get full text
Get full text
Get full text
Get full text

A Deployment Optimization Model for Wimax Base-Stations by Aboualmal, Abdulhadi Mahmoud

Get full text

Combining offline and on-the-fly disambiguation to perform semantic-aware XML querying by Tekli, Joe

“…We use a semantic-aware inverted index to allow semantic-aware search, result selection, and result ranking functionality. The semantically augmented XML data tree is processed for structural node clustering, based on semantic query concepts (i.e., key-concepts), in order to identify and rank candidate answer sub-trees containing related occurrences of query key-concepts. …”
Get full text
Get full text
Get full text
Get full text

DSDM: A Distributed Service Discovery Model for Manets by Artail, Hassan

“…This model is built on top of the network layer of the TCP/IP stack and benefits from the up-to-date routing information enabled by proactive routing protocols that attempt to keep the information in the routing tables of the mobile nodes current. The designed system is based on storing service descriptions in selected nodes that are searched in accordance to a proposed Minimum Distance Packet Forwarding (MDPF) algorithm. …”
Get full text
Get full text
Get full text
Get full text

From Collatz Conjecture to chaos and hash function by Masrat Rasool (17807813)

“…<p>The non-linear property of Chaos is a promising approach to information security, and many accomplishments have been made by combining Chaos with several sub-security domains, including chaos-based stream ciphers, block ciphers, image encryption, and hash functions. Most Chaos-based hash functions are insecure or inefficient due to their dependence on complex, attacked multi-dimensional maps or uncertain, weak one-dimensional maps like logistic and tent. …”

A novel network-based SIS framework for improved GA performance by Tohme, Rawane

“…Genetic algorithms have long been used to solve complex optimization problems by mimicking natural selection processes. …”
Get full text
Get full text
Get full text

Cooperative clustering models for Vehicular ad hoc networks. (c2013) by Abdel Wahab, Omar Mohammad

Get full text
Get full text