It is widely known that closure operators on finite sets can be represented by sets of implications (also known as inclusion dependencies) as well as by formal contexts. In this paper we survey known results and present new findings concerning time and space requirements of diverse tasks for managing closure operators, given in contextual, implicational, or black-box representation. These tasks...

Identifying writing style shifts and variations are fundamental capabilities when addressing authorship related tasks. In this work we examine a simplified approach for unsupervised authorship and plagiarism detection which is based on binary bag of words representation. We evaluate our approach using PAN-2012 Authorship Attribution challenge data, which includes both open/closed class authorsh...

The deregulated markets and other factors are pushing power systems to their limits accentuating the need for more robust control. This paper presents a conceptual overview of a control approach for supporting a self-healing power system based on a distributed autonomous architecture and a set of coordinated closed loop controls. The proposed architecture is modular and scalable from the viewpo...

Discovering association rules from transaction databases is one of the most studied data mining task. Many effective techniques have been proposed over the years. All these algorithms share the same two steps methodology: frequent itemsets enumeration followed by effective association rules generation step. In this paper, we propose a new propositional satisfiability based approach to mine asso...

This paper deals with vision-based closed-loop control schemes for collision avoidance as well as maintenance of clearance in a-priori unknown textured environments. These control schemes are based on fuzzy logic and employ a visual motion cue, we call the Visual Threat Cue (VTC) that provides some measure for a relative change in range as well as clearance between 3D surface and a fixated obse...

0

We derive a parameterized, closed-formed schedulability bound for weighted round robin schedulers in hard real-time computing systems. The schedulability bound uses several parameters to represent important system behaviors: (1) Number of tasks; (2) Normalized deadline that measures the tightness of task deadlines; (3) Tasks set workload burst-ness; (4) Overhead ratio, which measures the portio...