Prior studies on Massive Open Online Courses (MOOCs) suggest that there is a significant decrease in student participation after one week of instruction [8]. This paper uses a combination of students’ Week 1 assignment performance and social interaction within the MOOC to predict their final performance in the course. The study also examines the role external incentives in final MOOC performanc...

This paper presents a Frame Semantics analysis of calendric terms in English, Hebrew, and German, demonstrating the inextricable relationship between morphology and semantics. Here, we consider how Frame Semantics can be extended to morphological analysis. Traditionally, the morpheme has been taken as the smallest unit of meaning in linguistic analysis, with generative word formation rules gene...

Brief introduction to cyclotomic theory over Q using adeles. Discussion of the definitions of modular forms and automorphic forms. Introducing the adelic automorphic forms via strong approximation theorem. Discussion of the connected components of Shimura varieties (modular curves). Smooth/admissible representations of locally finite groups. Definition and admissibility of (cuspidal) automorphi...

A distributed system is composed of a number of elements, the most important of which are software components, processing nodes and networks. Some of these elements can be specified as part of a distributed system’s design, while others are given (i.e., they have to be accepted as they are). Typically when building a distributed system, the software is under the designer’s control. Depending on...

A distributed system is composed of a number of elements, the most important of which are software components, processing nodes and networks. Some of these elements can be specified as part of a distributed system’s design, while others are given (i.e., they have to be accepted as they are). Typically when building a distributed system, the software is under the designer’s control. Depending on...

Synchronisation and Coordination (Part 2) Transactions A transaction can be regarded as a set of server operations that are guaranteed to appear atomic in the presence of multiple clients and partial failure. The concept of a transaction originates from the database community as a mechanism to maintain the consistency of databases. Transaction management is build around two basic operations: Be...

• A graph G is an ordered pair (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End : E → M2(V ), where M2(V ) is the set of all 2-element sub-multisets of V ; we usually write V = V (G), E = E(G), and End = EndG. • If x is an edge and u, v are vertices such that End(x) = {u, v}, we say that x joins u, v (or u, v are incident ...