Reviewerly/exHarmony huggingface dataset:
Emotion Classification with Natural Language Processing (Comparing BERT and Bi-Directional LSTM models for use with Twitter conversations)

We have constructed a novel neural network architecture called CWE-LSTM(concatenated word-emoji bidirectional long short-term memory) for classify-ing emotions in Twitter conversations. The architecture is based on a combina-tion of word and emoji embeddings with domain specificity in Twitter data. Itsperformance is compared to a current state of the art natural language process-ing model from Google, BERT. We show that CWE-LSTM is more successful atclassifying emotions in Twitter conversations than BERT (F 1 73 versus 69). Fur-thermore, we hypothesize why this type of problem’s domain specificity makesit a poor candidate for transfer learning with BERT. This is to further detail thediscussion between large, general models and slimmer, domain specific modelsin the field of natural language processing.
Network-Based Website Fingerprinting

The IETF is well on its way to protecting connection metadata withprotocols such as DNS-over-TLS and DNS-over-HTTPS, and work-in-progress towards encrypting the TLS SNI. However, more work is neededto protect traffic metadata, especially in the context of web traffic.In this document, we survey Website Fingerprinting attacks, which area class of attacks that use machine learning techniques to attack webprivacy, and highlight metadata leaks used by said attacks. We alsosurvey proposed mitigations for such leakage and discuss theirapplicability to IETF protocols such as TLS, QUIC, and HTTP. Weendeavor to show that Website Fingerprinting attacks are a seriousproblem that affect all Internet users, and we pose open problems anddirections for future research in this area.
A Fully Decentralized Autoscaling Algorithm for Stream Processing Applications

Stream Processing deals with the efficient, real-time processing of continuous streams of data. Stream Processing engines ease the development and deployment of such applications which are commonly pipelines of operators to be traversed by each data item. Due to the varying velocity of the streams, autoscaling is needed to dynamically adapt the number of instances of each operator. With the advent of geographically-dispersed computing platforms such as Fog platforms, operators are dispersed accordingly, and autoscaling needs to be decentralized as well. In this paper, we propose an algorithm allowing for scaling decisions to be taken and enforced in a fully-decentralized way. In particular, in spite of scaling actions being triggered concurrently, each operator maintains a view of its neighbours in the graph so as no data message is lost. The protocol is detailed and its correctness discussed. Its performance is captured through early simulation experiments.
Survey and Analysis of Computing Education at Japanese Universities: Informatics in General Education

We conducted the first nationwide survey of computing education at Japanese universities in 2016. In this paper, we report the survey result of informatics in general education for all students at a university or a faculty. The survey covers various aspects including program organization, quality and quantity of educational achievement, students, teaching staff and computing environment. 739 answers are collected from 530 universities in response to the survey. The answers cover 70.5% of the Japanese universities, and approximately 81.6% of the 649 universities that responded to the survey. The Information Processing Society of Japan (IPSJ) and the Japanese Ministry of Education (MEXT) will utilize the survey result to develop a new computing curriculum standard J17 and national policy of computing education respectively.
DYNAMIC GRADED EPISTEMIC LOGIC

Abstract Graded epistemic logic is a logic for reasoning about uncertainties. Graded epistemic logic is interpreted on graded models. These models are generalizations of Kripke models. We obtain completeness of some graded epistemic logics. We further develop dynamic extensions of graded epistemic logics, along the framework of dynamic epistemic logic. We give an extension with public announcements, i.e., public events, and an extension with graded event models, a generalization also including nonpublic events. We present complete axiomatizations for both logics.
Low-latency Job Scheduling with Preemption for the Development of Deep Learning.

One significant challenge in the job scheduling of computing clusters for the development of deep learning algorithms is the efficient scheduling of trial-and-error (TE) job, the type of job in which the users seek to conduct small-scale experiments while monitoring their processes. Unfortunately, the existing job schedulers to date do not feature well-balanced scheduling for the mixture of TE jobs and best-effort (BE) jobs, or they can handle the mixture in limited situations at most. To fill in this niche, we propose an algorithm that can significantly reduce the latency of TE jobs in versatile situations without greatly elongating the slowdown of the BE jobs. Our algorithm efficiently schedules both TE and BE jobs by selectively preempting the BE jobs that can be, when the time comes, resumed without much delay. In our simulation study with synthetic and real workloads, we were able to reduce the 95th percentile of the slowdown rates for the TE jobs in the standard FIFO strategy by 96.6%, while compromising the median of the BE slowdown rates by only 18.0% and the 95th percentile by only 23.9%.
Towards discourse annotation and sentiment analysis of the Basque Opinion Corpus

Discourse information is crucial for a better understanding of the text structure and it is also necessary to describe which part of an opinionated text is more relevant or to decide how a text span can change the polarity (strengthen or weaken) of other span by means of coherence relations. This work presents the first results on the annotation of the Basque Opinion Corpus using Rhetorical Structure Theory (RST). Our evaluation results and analysis show us the main avenues to improve on a future annotation process. We have also extracted the subjectivity of several rhetorical relations and the results show the effect of sentiment words in relations and the influence of each relation in the semantic orientation value.
A Pregroup Representation of Word Order Alternation Using

Pregroup calculus has been used for the representation of free word order languages (Sanskrit and Hungarian), using a construction called precyclicity. However, restricted word order alternation has not been handled before. This paper aims at introducing and formally expressing three methods of representing word order alternation in the pregroup representation of any language. This paper describes the word order alternation patterns of Hindi, and creates a basic pregroup representation for the language. In doing so, the shortcoming of correct reductions for ungrammatical sentences due to the current apparatus is highlighted, and the aforementioned methods are invoked for a grammatically accurate representation of restricted word order alternation. The replicability of these methods is explained in the representation of adverbs and prepositional phrases in English.
Asymmetric Unification and Disunification

We compare two kinds of unification problems: Asymmetric Unification and Disunification, which are variants of Equational Unification. Asymmetric Unification is a type of Equational Unification where the instances of the right-hand sides of the equations are in normal form with respect to the given term rewriting system. In Disunification we solve equations and disequations with respect to an equational theory for the case with free constants. We contrast the time complexities of both and show that the two problems are incomparable: there are theories where one can be solved in polynomial time while the other is NP-hard. This goes both ways. The time complexity also varies based on the termination ordering used in the term rewriting system.
Stone type representation theorems via games

The classes of relativized relation algebras (whose units are not necessarily transitive as binary relations) are known to be finitely axiomatizable. In this article, we give a new proof for this fact that is easier and more transparent than the original
On the End-Vertex Problem of Graph Searches.

End vertices of graph searches can exhibit strong structural properties andare crucial for many graph algorithms. The problem of deciding whether a givenvertex of a graph is an end-vertex of a particular search was first introducedby Corneil, K\ohler and Lanlignel in 2010. There they showed that this problemis in fact NP-complete for LBFS on weakly chordal graphs. A similar result forBFS was obtained by Charbit, Habib and Mamcarz in 2014. Here, we prove that theend-vertex problem is NP-complete for MNS on weakly chordal graphs and for MCSon general graphs. Moreover, building on previous results, we show that thisproblem is linear for various searches on split and unit interval graphs.
Fraud Detection in Medical Insurance Claim with Privacy Preserving Data Publishing in TLS-N Using Blockchain

Insurance fraud is one of the most serious problem that insurers, consumers and regulators witnessed in the last couple of years affecting availability of insurances. Increase in the cost of the companies, inflated premium is caused by the number of frauds in the medical insurance sector threatening the viability of the insurance companies and also an adverse effect on the profit they incur. Forged documents submitted for claim settlement gets verified due to limited resource availability. Enabling TLS-N in the conversation between the insurance company, policy holder and medical institution curtail life insurance frauds. Data privacy must be given utmost importance while we handle medical insurance scenarios, TLS-N with privacy preserving data publishing schemes facilitates privacy and mitigates content hiding attack. These records stored in blockchain keeps track of the policy details, the medical reports and insurance claims over the period of validity, helps detecting fraud in the insurance claim.
Improving the usability of secure information storing within blockchain applications

Today's blockchain applications have been inherently created by and for users who understand the blockchain technology. To improve mass adoption of blockchain solutions, the user experience must improve, and the attention must move to users not familiar with the underlying technology. This dissertation starts with reviewing the main concepts of blockchain technology and examining the UX of different Ethereum wallets with the aim to deliver a more user-friendly wallet based on user feedback. It then delivers a wallet design that enables even the most non-technical users to securely and safely use a cryptocurrency wallet with a decreased risk of content loss. The developed solution is then compared to the existing main stream token wallets.
Dichotomy Algorithms in the Multi-class Problem of Pattern Recognition

Pattern recognitionPattern recognition problem in geometric state with solutions in the class of decision trees is discussed. In each node, the partition of the corresponding subsample of objects is performed using a linear function (hyperplane). In this paper, for the node of the decision tree we state the problem of the dichotomy of a set of classes into 2 subsets of classes for 2 different definitions of the distance function between such subsets. This problem is considered in relation to the projection of the initial sample on the direction connecting 2 most remote points. For any 2 variants of the partition of a set of classes, the concept of closeness is introduced on the basis of the distance between the corresponding binary tuples. For 4 different algorithms for partition of a set of classes, computational experiments are conducted for a series of 100 random sets. The results of computational experiments and the complexity of these algorithms are presented.
Dislocazioni a destra interrogative tra grammatica e discorso

Abstract This article deals with clitic right dislocation (CLRD) structures. The interface examination of the interpretative, syntactic and prosodic properties of CLRDs shows that these constructions can be ordered on a scale based to a minor or greater degree of prosodic and syntactic integration between verb and post-verbal object. This scale of integration is based on the hypothesis that the different dislocations are part of a complex system of resources for the post-verbal expression of topic and focus categories. Crucially, the study shows that in interrogative CLRDs the clitic resumes an accessible referent which is also focal, manifesting the greater intersubjective attitude of the speaker. The work is based on the analysis of spoken data mostly taken from the CLIPS corpus.
A STUDY OF DERIVING USABILITY EVALUATION FACTORS ON VIRTUAL REALITY CONTENTS

Appears in: EDULEARN19 Proceedings Publication year: 2019Pages: 2272-2278ISBN: 978-84-09-12031-4ISSN: 2340-1117doi: 10.21125/edulearn.2019.0616Conference name: 11th International Conference on Education and New Learning TechnologiesDates: 1-3 July, 2019Location: Palma, Spain
Estimation for number of almost periodic solutions of first-order ordinary differential equations

Approaches to estimating for the number of almost periodic solutions of ordinary differential equations are considered. Conditions that allow determinating both the upper and lower bounds for these solutions are found. The existence and stability of almost periodic problems are considered.
ELEKTRONIK PEMBELAJARAN SEMESTER (E-RPS) BERBASIS WEB FAKULTAS ILMU KOMPUTER UNIVERSITAS PASIR PENGARAIAN

The teaching plan is a guideline for the learning process which is then known as the Semester Learning Plan (RPS). Objectives should be clearly formulated to be achieved by the material or material to be taught, teaching and learning activities and tools used, evaluation and reference sources in the form of reading books. In the Faculty of Computer Science in filling out the Semester Learning Plan still using a manual system using Microsoft Word. Each Lecturer must fill in the Semester Learning Plan by typing Semester Learning Plan data according to the course taken on the form already made in Microsoft Word. Therefore, it is necessary to make the application of the Computer Science Learning Plan application. The E-RPS aims to make it easier for lecturers to fill out the Semester Learning Plan. The results of this practical work in the form of a website-based application that can facilitate the lecturer in filling out the Semester Learning Plan and with the lecturer no longer need to explain the contents of the Semester Learning Plan to students, because each student can see or print their own results according to the course what our want
Comparative Analysis on the Characteristic of Typical Meteorological Year Applying Principal Component Analysis

The reliable Typical Meteorological Year (TMY) data, sometimes called Test Reference Year (TRY) data, are necessary in the feasibility study of renewable energy installation as well as zero energy building. In Korea, there are available TMY data; TMY from Korea Institute of Energy Research (KIER), TRY from the Korean Solar Energy Society (KSES) and TRY from Passive House Institute Korea (PHIKO). This study aims at examining their characteristics by using Principle Component Analysis (PCA) at six ground observing stations. First step is to investigate the annual averages of meteorological elements from TMY data and their standard deviations. Then, PCA is done to find which principle components are derived from different TMY data. Temperature and solar irradiance are determined as the main principle component of TMY data produced by KIER and KSES at all stations whereas TRY data from PHIKO does not show similar result from those by KIER and KSES.
DeepLogic: Towards End-to-End Differentiable Logical Reasoning.

Combining machine learning with logic-based expert systems in order to get the best of both worlds are becoming increasingly popular. However, to what extent machine learning can already learn to reason over rule-based knowledge is still an open problem. In this paper, we explore how symbolic logic, defined as logic programs at a character level, is learned to be represented in a high-dimensional vector space using RNN-based iterative neural networks to perform reasoning. We create a new dataset that defines 12 classes of logic programs exemplifying increased level of complexity of logical reasoning and train the networks in an end-to-end fashion to learn whether a logic program entails a given query. We analyse how learning the inference algorithm gives rise to representations of atoms, literals and rules within logic programs and evaluate against increasing lengths of predicate and constant symbols as well as increasing steps of multi-hop reasoning.
Initial Experiments In Cross-Lingual Morphological Analysis Using Morpheme Segmentation

The paper describes initial experiments in data-driven cross-lingual morphological analysis of open-category words using a combination of unsupervised morpheme segmentation, annotation projection and an LSTM encoder-decoder model with attention. Our algorithm provides lemmatisation and morphological analysis generation for previously unseen low-resource language surface forms with only annotated data on the related languages given. Despite the inherently lossy annotation projection, we achieved the best lemmatisation F1-score in the VarDial 2019 Shared Task on Cross-Lingual Morphological Analysis for both Karachay-Balkar (Turkic languages, agglutinative morphology) and Sardinian (Romance languages, fusional morphology).
Post-Knowledge

The monopolization of our techno-scientific culture by digital information technology, the Technopoly has unintentionally resulted in the extinction of knowledge or postknowledge, by reducing knowledge to systems of symbols—formalized algorithmic hierarchies of symbol-systems without external reference; a totalistic virtuality, or real virtuality. The extinction of knowledge or post-knowledge has resulted in two mutually reinforcing situations. One situation is the rise of a new elite of technology experts. The other situation is the dummification of people. These two mutually reinforcing situations further result in an illegitimate role reversal between people and their machines. The machines become treated as smart; people become treated as dummies. The role reversal of machines and people reinforces the monopoly of digital technology over everything. The monopoly of digital techno-scientific culture, the Technopoly, becomes accepted without question and without criticism. However, there is a way to retrieve knowledge, and that way is through restoring the (Ionian) tradition of critical discussion within all our institutions. Critical discussion can be restored by increasing democratic participation in our techno-scientific culture, which amounts to implementing a Socratic social architecture.
INFLUENCE OF PRECARIZATION OF EMPLOYMENT OF SCIENTIFIC AND PEDAGOGICAL WORKERS ON THE PERSONNEL POTENTIAL OF REGIONAL UNIVERSITIES

INFLUENCE OF PRECARIZATION OF EMPLOYMENT OF SCIENTIFIC AND PEDAGOGICAL WORKERS ON THE PERSONNEL POTENTIAL OF REGIONAL UNIVERSITIES
Websites as support tools for learning the English language

espanolLos sitios Web contribuyen significativamente en el aprendizaje del idioma Ingles, facilitando la ensenanza de los maestros ya que a traves del uso de estrategias dinamicas ayudan a reforzar el enfoque cognitivo con mayor facilidad, ya que permite desarrollarlas destrezas del idioma con precision, mejorando la interrelacion de los alumnos en el aula de clase, lo cual aparta a las estrategias ambiguas utilizadas con el metodo tradicional de aprendizaje. Estas herramientas tecnologicas radican su importancia en la variedad de actividades interactivas y practicas para la comprension del idioma Ingles, favoreciendo la motivacion de los estudiantes en el desarrollo de las actividades propias de la asignatura. De acuerdo con los resultados de esta investigacion se logro evidenciar el cambio de comportamiento y de asimilacion, de tal manera, que el 78 % de los alumnos que recibieron la asignatura de Ingles con el aporte de los sitios Web, lo cual les permitio un aprendizaje mas satisfactorio ya que contaron con actividades interactivas para su beneficio. Se utilizaron los metodos de la observacion, cuantitativo y cualitativo, teniendo como muestra a 144 educandos de los modulos 1, 2, 3 y 4 de Ingles, empleandose una encuesta de 10 preguntas orientadas en el uso de sitios Web como herramienta de apoyo para el aprendizaje del idioma Ingles, lo cual es un aporte de gran importancia tanto para estudiantes como para docentes en el interaprendizaje de este idioma extranjero EnglishThe Websites contribute much to the learning of the English language, facilitating the teaching of the teachers through the use of dynamic strategies they help to reinforce the cognitive approach with greater ease, since it allows to develop the language skills with precision, improving the communication of the students in the classroom, which separates the ambiguous strategies used with the traditional method of learning. These technological tools are important in the variety of interactive activities and practices for understanding the English language, improving the motivation of students in the improvement of the activities of the subject. According to the results of this research, it was possible to show the change in behavior and assimilation, in such a way that 78 % of the students who received the subject of English with the contribution of the Websites, which allowed them to learn more satisfactory since they had interactive activities for their benefit. The quantitative and qualitative methods of observation were applied, taking as sample 144 students from modules 1, 2, 3 and 4 of English, using a survey of 10 questions oriented to the use of Websites as asupport tool for the learning the English language, which is a contribution of great importance for both students and teachers inthe inter-learning of this foreign language
Phoenix - The Arabic Object-Oriented Programming Language

A computer program is a set of electronic instructions executed from within the computer memory by the computer central processing unit. Its purpose is to control the functionalities of the computer allowing it to perform various tasks. Basically, a computer program is written by humans using a programming language. A programming language is the set of grammatical rules and vocabulary that governs the correct writing of a computer program. In practice, the majority of the existing programming languages are written in English-speaking countries and thus they all use the English language to express their syntax and vocabulary. However, many other programming languages were written in non-English languages, for instance, the Chinese BASIC, the Chinese Python, the Russian Rapira, and the Arabic Loughaty. This paper discusses the design and implementation of a new programming language, called Phoenix. It is a General-Purpose, High-Level, Imperative, Object-Oriented, and Compiled Arabic programming language that uses the Arabic language as syntax and vocabulary. The core of Phoenix is a compiler system made up of six components, they are the Preprocessor, the scanner, the parser, the semantic analyzer, the code generator, and the linker. The experiments conducted have illustrated the several powerful features of the Phoenix language including functions, while-loop, and arithmetic operations. As future work, more advanced features are to be developed including inheritance, polymorphism, file processing, graphical user interface, and networking.