أ. آدمبن سعيد

قسم الحاسوب كلية التربية قصر بن غشير

الاسم الكامل

أ. آدم أحمد عمر بن سعيد

المؤهل العلمي

ماجستير

الدرجة العلمية

محاضر

ملخص

أبومارية هو احد اعضاء هيئة التدريس بقسم الحاسوب بكلية التربية قصر بن غشير. يعمل السيد أبومارية بجامعة طرابلس كـمحاضر منذ 2016-12-16.

تنزيل السيرة الذاتية

معلومات الاتصال

روابط التواصل

الإستشهادات

الكل منذ 2017
الإستشهادات
h-index
i10-index

المؤهلات

ماجستير

هندسة الحاسوب
أكاديمية الدراسات العليا
10 ,2009

بكالوريوس

هندسة الحاسوب
كليةة التقنية الصناعية مصراتة
1 ,2001

الخبرة

مهندس صيانة - مصرف الأمة ومصرف الجمهورية

مهندس في قسم صيانة أجهزة الكومبيوتر والطابعات الليزرية والخطية والآلات عد العملة..
2001 - 2011

المنشورات

Design of New Secret Key to Increase the Security of LSB Algorithm

Nowadays, information security has become a big challenge for the world due to the rapid growth of Internet users day after day. Unauthorized access to confidential data can have serious implications such as financial loss, etc. One of the best techniques for secure communication is secret writing. Hiding data is very important nowadays as data travels over multiple insecure networks. To avoid this problem, encryption is used that hides data, but in some cases encryption cannot provide full security because the message is still available for encryption analysis. Encryption focuses on making the message unreadable to any unauthorized person who might intercept it. On the other hand, hiding information is a means of hiding the existence of a message to allow secure communication in a completely undetectable manner. Hide information and encryption are two different ways to hide data. In this paper the researcher suggests how to hide the message using the least significant bit algorithm inside an image and encrypt it in a new way, by modifying the DES algorithm, the researcher generated subkeys from the DES algorithm and used them to specify the masking mechanism in the digital image.
Jalal M Mehalhal , Adem.A.Bensaid, Mohammed F. Ighbeeshah(12-2020)
full text Publisher's website


Analysis and comparison of data compression Techniques and their application to text files

Due to the rapid development in information technology in terms of information exchange and transmission through different transmission media, and the provision of storage places. when the volume of data is smaller, this means that, it provides better transmission speed. and saves time, which led to the emergence of data compression techniques to reduce its size without compromising the quality of the data. Data compression is still an important topic of research and has many applications and required uses. This paper presents a study of some of the data compression methods: Huffmann and Huffmann shift code, binary shift code algorithm, and the LZW method, analyzing and comparing between them, using a fixed text for all methods. keywords: Data compression, compression techniques, Huffmann, Huffmann shift code, binary shift code , LZW.
Jalal M. Mehalhal, Adem.A.Bensaid, Mohamed Egbisha(8-2021)
full text Publisher's website


Implementation of Digital Image Compression Using The Comparison Between The Adjacent Pixel On RGB Image With Variant Brightness And Contrast

Information technology has witnessed a great development in the terms of the huge amount of information exchanged, the ways of exchanging this information, and the speed of its exchange. One of the most essential media used to transfer data is the digital image. Image compression plays a very important role in the transfer and storing of image data due to storage limitations. The main goal of image compression is to represent the image with the fewest number of bits without losing the basic information content within the original image. Digital images contain a large amount of digital information that needs efficient technologies to be stored and to transmit a large volume of data. In this study, a method was used to compress digital images, in which the bits of each pixel are compared with the pixels adjacent to it, and the result of the comparison is a new code to represent the bits of the second pixel, and its size is different, either increasing or decreasing, and calculating the image size after performing the compression process. Each pixel was divided into two parts, the right part of it was compared with the right part of the adjacent pixel, while the left part was compared to the left part of the adjacent pixel, therefore, a new code was obtained. This method was applied on a group of images with different content to obtain good results.
Adem.A.Bensaid, Jalal M. Mehalhal, Mohamed Egbisha(5-2022)
full text