Preface

In recent years the involvement of Information Technology in business, governments, and education has increased dramatically. More and more research works have been conducted in different areas of Information Technology such as Artificial Intelligence, Database Managements, Algorithms, Web Technologies, Computer Graphics, Networks, etc. In recognizing the importance and major advances, Information Technology has been chosen to be the theme of this special issue of the Information Science Journal

A deep learning system for recognizing facial expression in real-time

This article presents an image-based real-time facial expression recognition system that is able to recognize the facial expressions of several subjects on a webcam at the same time. Our proposed methodology combines a supervised transfer learning strategy and a joint supervision method with center loss, which is crucial for facial tasks. A newly proposed Convolutional Neural Network (CNN) model, MobileNet, which has both accuracy and speed, is deployed in both offline and in a real-time framework that enables fast and accurate real-time output. Evaluations towards two publicly available datasets, JAFFE and CK+, are carried out respectively. The JAFFE dataset reaches an accuracy of 95.24%, while an accuracy of 96.92% is achieved on the 6-class CK+ dataset, which contains only the last frames of image sequences. At last, the average run-time cost for the recognition of the real-time implementation is around 3.57ms/frame on a NVIDIA Quadro K4200 GPU. - 2019 Association for Computing Machinery.This work was made possible by NPRP grant (10-0205-170346) from the Qatar National Research Fund (a member of Qatar Foundation). The statements made herein are solely the responsibility of the authors. Authors' addresses: Y. Miao and H. Dong, University of Ottawa, 800 King Edward Avenue, Ottawa, ON K1N 6N5, Canada; emails: {ymiao036, hdong}@uottawa.ca; J. Mohamad Al Jaam, Qatar University, Ibn Khaldoon Hall, Doha, Qatar; email: [email protected]; A. El Saddik, University of Ottawa, 800 King Edward Avenue, Ottawa, ON K1N 6N5, Canada; email: [email protected]. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]. 2019 Association for Computing Machinery. 1551-6857/2019/05-ART33 $15.00 https://doi.org/10.1145/3311747Scopu

حول منطق التحليل الرمزي ومبدأ الاستنتاج المباشر

This paper discusses an approach using the M-valued symbolic logic with syllogistic reasoning and direct inference principle (reasoning from statistical information to conclusions about individuals), to manipu¬late statistical knowledge evaluated in a qualitative way. The graduation scale of M symbolic quantifiers is expressed in terms of truth degrees, which should not be arbitrary, but rather should be based on the available information from the knowledge base.‏هذا البحث يناقش طريقة نوعية تعتمد على المنطق الرمزي المحدود ومبادئ الاستنتاج المنطقية الثلاثية والمباشرة (الاستنتاج من المعلومات الإحصائية للحصول على الخلاصات النهائية والنتائج) لمعالجة البيانات المقيمة بطريقة نوعية ، علما بأن مقاييس التدرج المنطقية المستخدمة ممثلة بل بدرجات حقائق متنوعة تعتمد بصورة حقيقة ‏ومباشرة على المعلومات المتوفرة من قاعدة البيانات المتاحة، بدلا من أن تكون عشوائية

A new construction technique of a triangle-free 3-colored K16’s

In this paper, we propose a new coloring technique of the edges of the complete graph on 16 vertices, K16, with three different colors, without producing any monochromatic triangle. This method is totally different from those proposed by [R.E. Greenwood, A.M. Gleason, Combinatorial relations and chromatic graphs, Canadian Journal of Mathematics 7 (1955) 1–7; J.G. Kalbfleish, R.G. Stanton, On the maximal triangle-free edge-chromatic graphs in three colors, Journal of Combinatorial Theory 5 (1968) 9–20; C. Laywine, L.P. Mayberry, A simple construction giving the two non-isomorphic triangle free 3-colored K16’s, Journal of Combinatorial Theory Series B (1988) 120–124; B. Benhamou, Étude des Symétries et de la Cardinalité en Calcul Propoaitionel: Application aux Algorithmes Syntaxiques, Ph.D. Thesis, University of Aix-Marseilles I, France, 1993] which prove that the classical multicolor Ramsey number R(3, 3, 3) is 17. This number is the only non-trivial tricolor Ramsey number known till now in spite of more than fifty years of extensive research on Ramsey numbers [S.P. Radziszowski, Small Ramsey numbers, The Electronic Journal of Combinatorics DS1.Revision 11 (2006) 1–60]. We show also how we can convert the Ramsey-graph 3-coloring problem into a satisfiability instance having 2160 clauses of 3-literals each and 360 variables (i.e., a 3-SAT instance)

حول عدد رمسي الكلاسيكي الألوان (3,3,3) R

In this paper, we are interested in the problem of evaluation of the classical multicolor Ramsey number i?(3,3,3). We first convert it successfully into a system of clauses of 3-literals each, i.e., a 3-SAT instance. We then describe the algebraic method of Greenwood and Gleason [2], which is based on the finite field Fl6, that constructs a monochromatic triangle-free edge-coloring with three colors of the Ramsey graph Kl6 associated with the number i?(3,3,3). We propose a simple and new coloring method, completely dif¬ferent from that of Greenwood and Gleason, which colors the edges of the Ramsey graph Ku with three colors without any monochromatic triangle.في هذا البحث، نحن مهتمون بمشكلة تقييم عدد رمسي الكلاسيكي متعدد الألوان (3,3,3‏)R في المرحلة الأولى، نبين كيف يمكن تحويل هذه المشكلة إلى نظام ساتي من 3 ‏متغيرات، بعد ذلك، نشرح طريقة Greenwood ‏ و Gleason ‏الجبرية، التي تعتمد على F16 المحدود، من أجل إنشاء شبكة كاملة من 16‏نقطة خالية من المثلثات آحادية اللون، بعد تلوينها بثلاثة ألوان مختلفة، حيث أن مثل هذه الشبكة الملونة تحدد قيمة عدد رمسي الكلاسيكي ‏السابق الذكر، ثم نقترح طريقة جديدة وبسيطة، مختلفة تماما عن طريقة Greenwood و Gleason لإنشاء شبكة كاملة من 16 نقطة ملونة بثلاثة الوان، وخالية من المثلثات ذات اللون الواحد

تعامل نوعى مع التأكيدات القياسية

In this paper we present a newapproach to a symbolic treatment ofquan-tified statements having the following form "Q A's are 5's", knowing that A and B are labels denoting sets,and Q is a linguistic quantifier interpreted as a proportion evaluated in a qualitative way. Our model can be viewed as a symbolic generalization of statistical conditional probability notions as well as a symbolic generalization of the classical probabilistic operators.Our approach is founded on a symbolic finite M-valued logic in which the graduation scale ofM symbolic quantifiers is translated in terms of truth degrees. Moreover,we propose symbolic inference rules allowing us to manage quantified statements. Finally, we present a symbolic formal-isation of direct inference principle allowing us to reason with particular individuals.في هذا البحث ، نقدم طريقة جديدة للمعالجة الرمزية للجمل القياسية المحدودة ذات الشكل التالي : "ك أ ← ب" علما بأن أ وب هن مسميات تمثل مجموعات بينما ك هو قياس لغوي يمثل نسبة مقيمة بطريقة نوعية، نموذجنا هذا، يمكن اعتباره تعميم رمزي من التصورات الاحتمالية الشرطية الإحصائية، وأيضا تعميم رمزي كلاسيكي للمعامل الاحتمالية، طريقتنا معتمدة بشكل رئيسي على المنطق الرمزي المحدود حيث أن مقياس التدرج في هذا المنطق ممثل بدرجات حقائق منطقية مختلفة، علاوة على ذلك ، فإننا نقترع قواعد استدلال رمزية تسمح لنا بالتعامل مع الجمل القياسية المحدودة وأخير نقدم تشكل رمزي من مبدأ الاستدلال المباشر يسمح لنا بالتعامل المنطقي الخصوصي