Conceptual Model and Security Requirements for DRM Techniques Used for e-Learning Objects Protection

This paper deals with the security problems of DRM protected e-learning content. After a short review of the main DRM systems and methods used in e-learning, an examination is made of participators in DRM schemes (e-learning object author, content creator, content publisher, license creator and end user). Then a conceptual model of security related processes of DRM implementation is proposed which is improved afterwards to reflect some particularities in DRM protection of e-learning objects. A methodical way is used to describe the security related motives, responsibilities and goals of the main participators involved in the DRM system. Taken together with the process model, these security properties are used to establish a list of requirements to fulfill and a possibility for formal verification of real DRM systems compliance with these requirements.

HI!MVC: Hierarchical MVC Framework for WEB Applications

This paper presents Hi!MVC, a framework for developing high interactive web applications with a MVC Architecture. Nowadays, to manage, extend and correct web applications can be difficult due to the navigational paradigm they are based on. Hi!MVC framework helps to make these tasks easier. This framework allows building a web based interface, generating each page from the objects that represent its state. Every class to be showed in the interface is associated with two entities: its html representation (view) and its interactions in the view manager (controller). The whole html page is generated by composition of views according to the composition relationship of objects. Interactions between user and application are managed by the controller associated to the view which shows interaction elements (links or forms). Hi!MVC allows building web interface in a hierarchical and distributed way. There are other frameworks and APIs offering MVC architectures to web applications, but we think that they are not applying exactly the same concepts. While they keep on basing their architectures on the navigational paradigm we are offering a new point of view based on an innovator hierarchical model. First, we present the main ideas of our proposal. Next, we expose how to implement it using different Java technologies. Finally, we make a first approach to our hierarchical MVC model. We also compare shortly our proposal with the previously cited technologies.

Defining Interestigness for Association Rules

Interestingness in Association Rules has been a major topic of research in the past decade. The reason is that the strength of association rules, i.e. its ability to discover ALL patterns given some thresholds on support and confidence, is also its weakness. Indeed, a typical association rules analysis on real data often results in hundreds or thousands of patterns creating a data mining problem of the second order. In other words, it is not straightforward to determine which of those rules are interesting for the end-user. This paper provides an overview of some existing measures of interestingness and we will comment on their properties. In general, interestingness measures can be divided into objective and subjective measures. Objective measures tend to express interestingness by means of statistical or mathematical criteria, whereas subjective measures of interestingness aim at capturing more practical criteria that should be taken into account, such as unexpectedness or actionability of rules. This paper only focusses on objective measures of interestingness.

Preserving Linked Data

PRELIDA (PREserving LInked DAta) is an FP7 Coordination Action funded by the European Commission under the Digital Preservation Theme. PRELIDA targets the particular stakeholders of the Linked Data community, including data providers, service providers, technology providers and end user communities. These stakeholders have not been traditionally targeted by the Digital Preservation community, and are typically not aware of the digital preservation solutions already available. So an important task of PRELIDA is to raise awareness of existing preservation solutions and to facilitate their uptake. At the same time, the Linked Data cloud has specific characteristics in terms of structuring, interlinkage, dynamicity and distribution that pose new challenges to the preservation community. PRELIDA organises in-depth discussions among the two communities to identify which of these characteristics require novel solutions, and to develop road maps for addressing the new challenges. PRELIDA will complete its lifecycle at the end of this year, and the talk will report about the major findings.

Generalization of Ehrlich-Kjurkchiev Method for Multiple Roots of Algebraic Equations

In this paper a new method which is a generalization of the Ehrlich-Kjurkchiev method is developed. The method allows to find simultaneously all roots of the algebraic equation in the case when the roots are supposed to be multiple with known multiplicities. The offered generalization does not demand calculation of derivatives of order higher than first simultaneously keeping quaternary rate of convergence which makes this method suitable for application from practical point of view.

HW Implementation of a Optimized Algorithm for the Application of Active Rules in a Transition P-system

P systems or Membrane Computing are a type of a distributed, massively parallel and non deterministic system based on biological membranes. They are inspired in the way cells process chemical compounds, energy and information. These systems perform a computation through transition between two consecutive configurations. As it is well known in membrane computing, a configuration consists in a m-tuple of multisets present at any moment in the existing m regions of the system at that moment time. Transitions between two configurations are performed by using evolution rules which are in each region of the system in a non-deterministic maximally parallel manner. This work is part of an exhaustive investigation line. The final objective is to implement a HW system that evolves as it makes a transition P-system. To achieve this objective, it has been carried out a division of this generic system in several stages, each of them with concrete matters. In this paper the stage is developed by obtaining the part of the system that is in charge of the application of the active rules. To count the number of times that the active rules is applied exist different algorithms. Here, it is presents an algorithm with improved aspects: the number of necessary iterations to reach the final values is smaller than the case of applying step to step each rule. Hence, the whole process requires a minor number of steps and, therefore, the end of the process will be reached in a shorter length of time.

The Application of Graph Model for Automation of the User Interface Construction

The ability of automatic graphic user interface construction is described. It is based on the building of user interface as reflection of the data domain logical definition. The submitted approach to development of the information system user interface enables dynamic adaptation of the system during their operation. This approach is used for creation of information systems based on CASE-system METAS.

The Application of Cloud Computing in Education

Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2015