International Conference Papers

Permanent URI for this collectionhttp://dl.cerist.dz/handle/CERIST/4

Browse

Start date: 2019End date: 2019

Search Results

Now showing 1 - 5 of 5
  • Thumbnail Image
    Item
    IoT-DMCP: An IoT data management and control platform for smart cities
    (SCITEPRESS – Science and Technology Publications, 2019) Boulkaboul, Sahar; Djenouri, Djamel; Bouhafs, Sadmi; Belaid, Mohand
    This paper presents a design and implementation of a data management platform to monitor and control smart objects in the Internet of Things (IoT). This is through IPv4/IPv6, and by combining IoT specific features and protocols such as CoAP, HTTP and WebSocket. The platform allows anomaly detection in IoT devices and real-time error reporting mechanisms. Moreover, the platform is designed as a standalone application, which targets at extending cloud connectivity to the edge of the network with fog computing. It extensively uses the features and entities provided by the Capillary Networks with a micro-services based architecture linked via a large set of REST APIs, which allows developing applications independently of the heterogeneous devices. The platform addresses the challenges in terms of connectivity, reliability, security and mobility of the Internet of Things through IPv6. The implementation of the platform is evaluated in a smart home scenario and tested via numeric results. The results show low latency, at the order of few ten of milliseconds, for building control over the implemented mobile application, which confirm realtime feature of the proposed solution.
  • Thumbnail Image
    Item
    آليات ردع السرقات العلمية في البحوث الاجتماعية: البوابة الوطنية للإشعار عن الأطروحات نموذجا
    (مخبر الدراسات القانونية و مسؤولية المهنيين بجامعة طاهري محمد بشار, 2019-12-15) مبتوش, نوال
    Résumé : لقد تفشت ظاهرة السرقة العلمية في الجامعات الجزائرية و أصبحت محل اهتمام العديد من الأكاديميين و الباحثين من مختلف التخصصات. حيث أنها تفاقمت بشكلٍ ملحوظٍ في السنوات الأخيرة عند طلبة السنوات النهائية لمختلف الأطوار الجامعية، لاسيما في ما يخص مذكرات ما بعد التدرج الماجستير,الدكتوراه,الدكتوراه ل.م.د فالسرقة العلمية جريمة أخلاقية, حيث يقوم الباحث أو الطالب بالاستغلال مجهودات غيره و ينتسبها لنفسه بدون أي وجه حق. وهذا يتنافى مع مبدأ الأمانة العلمية والنزاهة الأكاديمية. وفي هذا الصدد تعتبر البوابة الوطنية للإشعار عن الأطروحات الوسيلة الشاملة للوصول إلى الإنتاج العلمي للباحثين فيما يخص الأطروحات (ماجستير، دكتوراه، دكتوراه LMD) على المستوى الوطني, و التي يمكن من خلالها تجنب تكرار مواضيع الأطروحات و انتحالها.تم تطوير البوابة الوطنية لإشعار عن الأطروحات في عام 2010 من طرف مركز البحث في الإعلام العلمي و التقني ,بطلب من وزارة التعليم العالي و البحث العلمي.
  • Thumbnail Image
    Item
    Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs
    (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019-06-18) Belazzougui, Djamal; Cunial, Fabio
    Given a string T on an alphabet of size σ, we describe a bidirectional Burrows-Wheeler index that takes O(|T| log σ) bits of space, and that supports the addition and removal of one character, on the left or right side of any substring of T, in constant time. Previously known data structures that used the same space allowed constant-time addition to any substring of T, but they could support removal only from specific substrings of T. We also describe an index that supports bidirectional addition and removal in O(log log |T|) time, and that takes a number of words proportional to the number of left and right extensions of the maximal repeats of T. We use such fully-functional indexes to implement bidirectional, frequency-aware, variable-order de Bruijn graphs with no upper bound on their order, and supporting natural criteria for increasing and decreasing the order during traversal.
  • Thumbnail Image
    Item
    Computing the Antiperiod(s) of a String
    (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019-06-18) Alamro, Hayam; Badkobeh, Golnaz; Belazzougui, Djamal; Iliopoulos, Costas S.; Puglisi, Simon J.
    A string S[1, n] is a power (or repetition or tandem repeat) of order k and period n/k, if it can be decomposed into k consecutive identical blocks of length n/k. Powers and periods are fundamental structures in the study of strings and algorithms to compute them efficiently have been widely studied. Recently, Fici et al. (Proc. ICALP 2016) introduced an antipower of order k to be a string composed of k distinct blocks of the same length, n/k, called the antiperiod. An arbitrary string will have antiperiod t if it is prefix of an antipower with antiperiod t. In this paper, we describe efficient algorithm for computing the smallest antiperiod of a string S of length n in O(n) time. We also describe an algorithm to compute all the antiperiods of S that runs in O(n log n) time.
  • Thumbnail Image
    Item
    Using ABE for Medical Data Protection in Fog Computing
    (2019-05-03) Krinah, Abdelghani; Challal, Yacine; Omar, Mawloud; Nouali, Omar
    Fog is an extension of the cloud computing paradigm, developed to fix the clouds latency, especially for applications requiring a very short response time, such as e-health applications. However, these applications also require a high level of data confidentiality, hence the need to apply appropriate encryption techniques, which can ensure security needs, while respecting the characteristics of the infrastructures devices. In this article, we will focus on ABE encryption, through the work done to study its applicability in the cloud and the Internet of things, as well as the improvements that can be made to adapt it to the fog computing environment.