POST-QUANTUM BLIND SIGNATURE PROTOCOL ON NON-COMMUTATIVE ALGEBRAS

A method for constructing a blind signature scheme based on a hidden discrete logarithm problem defined in finite non-commutative associative algebras is proposed. Blind signature protocols are constructed using four-dimensional and six-dimensional algebras defined over a ground finite field GF(p) and containing a global two-sided unit as an algebraic support. The basic properties of the used algebra, which determine the choice of protocol parameters, are described.

DUAL TRANSFORMER ENCODERS FOR SESSION-BASED RECOMMENDATION

When long-term user proles are not available, session-based recommendation methods are used to predict the user's next actions from anonymous sessions-based data. Recent advances in session-based recommendation highlight the necessity of modeling not only user sequential behaviors but also the user's main interest in a session, while avoiding the eect of unintended clicks causing interest drift of the user. In this work, we propose a Dual Transformer Encoder Recommendation model (DTER) as a solution to address this requirement. The idea is to combine the following recipes: (1) a Transformer-based model with dual encoders capable of modeling both sequential patterns and the main interest of the user in a session; (2) a new recommendation model that is designed for learning richer session contexts by conditioning on all permutations of the session prex. This approach provides a unied framework for leveraging the ability of the Transformer's self-attention mechanism in modeling session sequences while taking into account the user's main interest in the session. We empirically evaluate the proposed method on two benchmark datasets. The results show that DTER outperforms state-of-the-art session-based recommendation methods on common evaluation metrics.

A CLOSED-FORM SOLUTION FOR A QUEUEING MODEL OF ENERGY EFFICIENT ETHERNET LINKS

To save energy consumption of Ethernet switches, IEEE has standardized a new energy-efficient operation for Ethernet links with a low-power state and transition mechanisms between the high-power state for transporting traffic and the low-power state.In this paper, we propose a queueing model with the Markov Modulated Compound Poisson Process that is able to characterize backbone packet traffic. We derive a closed-form solution for the stationary distribution of the proposed queueing model. We show that our model can capture an entire system where the transition times are constant.

MODELING AMINO ACID SUBSTITUTIONS FOR WHOLE GENOMES

Modeling amino acid substitution process is a core task in bioinformatics. New advanced sequencing technologies have generated huge datasets including whole genomes from various species. Estimating amino acid substitution models from whole genome datasets provides us unprecedented opportunities to accurately investigate relationships among species. In this paper, we review state-of-the-art computational methods to estimate amino acid substitution models from large datasets. We also describe a comprehensive pipeline to practically estimate amino acid models from whole genome datasets. Finally, we apply amino acid substitution models to build phylogenomic trees from bird and plant genome datasets. We compare our newly reconstructed phylogenomic trees and published ones and discuss new findings.

THE TRAVELING SALESMAN PROBLEM WITH MULTI-VISIT DRONE

This paper deals with the Traveling Salesman Problem with Multi-Visit Drone (TSP-MVD) in which a truck works in collaboration with a drone that can serve up to q > 1 customers consecutively during each sortie. We propose a Mixed Integer Linear Programming (MILP) formulation and a metaheuristic based on Iterated Local Search to solve the problem. Benchmark instances collected from the literature of the special case with q = 1 are used to test the performance of our algorithms. The obtained results show that our MILP model can solve a number of instances to optimality. This is the first time optimal solutions for these instances are reported. Our ILS performs better other algorithms in terms of both solution quality and running time on several class of instances. The numerical results obtained by testing the methods on new randomly generated instances show again the effectiveness of the methods as well as the positive impact of using the multi-visit drone.

ROBUST FINITE-TIME SUPOPTIMAL CONTROL OF LARGE-SCALE SYSTEMS WITH INTERACTED STATE AND CONTROL DELAYS

This paper is concerned with a problem of supoptimal nite-time control for a class of linear large-scale delay systems. The system under consideration is subjected to the state and control delays interacted between subsystems. Based on improved LMI-based approach combining with new estimation techniques, we derive sucient conditions for solving nite-time H1 control and guaranteed cost control of the system. Numerical examples are given to illustrate the validity and eectiveness of the theoretical results.

SENTIMENT ANALYSIS FOR SOCIAL MEDIA: A SURVEY

With the rapid development of the Internet industry, an increasing number of social media platforms have been developed. These social media platforms have become the main channels for communication among most users. Opinions from social media platforms provide the most updated and inclusive information. Sentiments from opinions are a valuable data source for solving many issues. Therefore, sentiment analysis has developed into one of the most popular natural language processing fields. Hence, improving the performance of sentiment analysis methods or discovering new problems related to these methods is essential. In this context, we must be aware of the general information relevant to this area. This survey presents a summary of the necessary stages for building a complete model to be used in sentiment analysis. For each procedure, we list the popular techniques that have been widely used in recent years. In addition, discussions and comparisons related to these methods are provided. Additionally, we discuss the challenges and possible research directions for future research in this field.

DEEP LEARNING FOR SEMANTIC MATCHING: A SURVEY

Semantic matching finds certain types of semantic relationships among schema/data constructs. Examples include entity matching, entity linking, coreference resolution, schema/ontology matching, semantic text similarity, textual entailment, question answering, tagging, etc. Semantic matching has received much attention in the database, AI, KDD, Web, and Semantic Web communities. Recently, many works have also applied deep learning (DL) to semantic matching. In this paper we survey this fast growing topic. We define the semantic matching problem, categorize its variations into a taxonomy, and describe important applications. We describe DL solutions for important variations of semantic matching. Finally, we discuss future R\&D directions.

PRIVACY IN ADVANCED CRYPTOGRAPHIC PROTOCOLS: PROTOTYPICAL EXAMPLES

Cryptography is the fundamental cornerstone of cybersecurity employed for achieving data confidentiality, integrity, and authenticity. However, when cryptographic protocols are deployed for emerging applications such as cloud services or big data, the demand for security grows beyond these basic requirements. Data nowadays are being extensively stored in the cloud, users also need to trust the cloud servers/authorities that run powerful applications. Collecting user data, combined with powerful machine learning tools, can come with a huge risk of mass surveillance or undesirable data-driven strategies for making profits rather than for serving the user. Privacy, therefore, becomes more and more important, and new techniques should be developed to protect personal information and to reduce trust requirements on the authorities or the Big Tech providers. In a general sense, privacy is ``the right to be left alone'' and privacy protection allows individuals to have control over how their personal information is collected and used. In this survey, we discuss the privacy protection methods of various cryptographic protocols, in particular we review: - Privacy in electronic voting systems. This may be, perhaps, the most important real-world application where privacy plays a fundamental role. %classical authentication with group, ring signatures, anonymous credentials. - Private computation. This may be the widest domain in the new era of modern technologies with cloud computing and big data, where users delegate the storage of their data and the computation to the cloud. In such a situation, ``how can we preserve privacy?'' is one of the most important questions in cryptography nowadays. - Privacy in contact tracing. This is a typical example of a concrete study on a contemporary scenario where one should deal with the unexpected social problem but needs not pay the cost of weakening the privacy of users. Finally, we will discuss some notions which aim at reinforcing privacy by masking the type of protocol that we execute, we call it the covert cryptographic primitives and protocols.

USING COMBINATORIAL MAPS FOR ALGORITHMS ON GRAPHS

The aim of this paper is to come back to a data structure representation of graph by permutations. This originated in the years 1960-1970 by contributions due to J. Edmonds [7], A. Jacques [11], W. Tutte [22] in order to consider the embedding of a graph in a surface as a combinatorial object. Some algebraic developments where suggested in [4] and [12]. It was also used for implementation in different situation, like planarity testing by H. de Fraysseix and P. Rosenstiehl [6], computer vision by G. Damiand and A. Dupas [5] or formal proofs by G. Gonthier [9].