TAAC'2014: Лекції

Abstract. In recent years, we can observe a growth in interest in rough set theory and its applications. Evidence of this can be found in the increasing number of high-quality articles on rough sets and related topics that have been published in international journals, proceedings of symposia, workshops, and conferences. In addition, many international workshops and conferences in their programs have included special sessions on the theory and applications of rough sets. Rough set theory constitutes a sound basis for data mining applications. The theory offers mathematical tools to discover hidden patterns in data. It identifies partial or total dependencies in data bases, eliminates redundant data, gives approach to null values, missing data, dynamic data and others. The methods of data mining in very large data bases using rough sets have been developed too. The theory has been followed by the development of several software systems that implement rough set operations. In the talk, I introduce basic notions and illustrate them with simple examples. I also discuss methodologies for analyzing data and survey applications.

Abstract. There exist several common theoretical information paradigms in the Information Sciences. May be, the most popular is the approach based on the generalization of the Shannon's Information Theory [Shannon, 1949; Lu, 1999]. Another approach is the attempt to be synthesized in a common structure the existing mathematical theories, which are applicable for explanation of the information phenomena [Cooman et al, 1995]. Besides of this, we need to point the diligence of the many researchers to give formal or not formal definitions of the concept "information". At the end, there exist some works that claim for theoretical generality and aspire to be a new approach in the Information Science, but theirs authors should clear up what they really talk about.
The theoretical base of the informatics needs philosophical support and substantiation to become wide accepted scientific paradigm. This way, the closely scientific research in the domain of informatics would be able to leap across its boundaries and to become as elements of the scientific view of life.
Discovering the common philosophical base has exceptional importance. The philosophical rationalizing and substantiating of the information phenomena become as leading goal of the scientific knowledge... Read more

Abstract. One of the main issues when designing telecommunication networks is to build network topologies that provide a sufficient degree of survivability. Survivable networks which are still functional after the failures of some links (nodes) have to satisfy some connectivity requirements. However, this requirement is often insufficient regarding the reliability of a telecommunication network. Indeed, the alternative paths could be too long to guarantee an effective routing. In data networks, such as Internet and ATM networks, the elongation of the route of the information could cause a strong loss in the transfer speed. For other networks, the signal itself could be degraded by a longer routing. In such cases, the L-hop requirement guarantees exactly the needed quality of the alternative routes.
Given a weighted graph G = (N, E), an integer L ≥ 3, and a pair of nodes s, t, the Two node-disjoint Hop constrained Survivable Network Design Problem (TNHNDP) consists of finding the minimum cost subgraph in G containing at least two node-disjoint paths of at most L hops between s and t.
In this talk, we consider the facial structure of the associated polytope. We characterize its dimension and give some classes of valid inequalities along with necessary and/or sufficient conditions for these inequalities of the formulation to define facets. We also derive separation routines for these inequalities. Using these results, we finally develop a branch-and cut algorithm and discuss some computational results for L = 3.

Abstract. Wireless Sensor Networks (WSNs) have been used in challenging, hostile environments for various applications (forest fire detection, battlefield surveillance, habitat monitoring, traffic management, etc.) New assumptions imposed by such applications and constraints of WSNs such as for example availability of a trusted third party or sensor capabilities make many previously proposed solutions designed for traditional networks not appropriate. In this lecture I will give an overview of different schemes proposed in the literature to deal with security and privacy challenges such as secure routing, secure data distribution, and trusted key exchange etc. for various classes of WSNs (including mobile sensor networks, unattended sensor networks, etc.)