Despite treatment guidelines recommending observation for men with low-risk prostate cancer with life expectancy <10 years, a majority of elderly patients choose active treatment, which may result in overtreatment. Given the growing burden of prostate cancer among men aged ≥80 years (super-elderly men), accumulation of survival data for evaluation of overtreatment among super-elderly patients i...

Peer-to-peer (P2P) Data-sharing systems now generate a significant portion of internet traffic. P2P systems have emerged as a popular way to share huge volumes of data. Requirements for widely distributed information systems supporting virtual organizations have given rise to a new category of P2P systems called schemabased. In such systems each peer is a database management system in itself, e...

In this paper we show that the static conflict resolution strategy of XACML is not always sufficient to satisfy the policy needs of an organisation where multiple parties provide their own individual policies. Different conflict resolution strategies are often required for different situations. Thus combining one or more sets of policies into a single XACML ‘super policy’ that is evaluated by a...

Argumentation has been acknowledged as a powerful mechanism for automated decision making. In this context several recent works have studied the problem of accommodating preference information in argumentation. The majority of these studies rely on Dung’s abstract argumentation framework and its underlying acceptability semantics. In this paper we show that Dung’s acceptability semantics, when ...

We consider the problem of PAC-learning decision trees, i.e., learning a decision tree over the n-dimensional hypercube from independent random labeled examples. Despite significant effort, no polynomial-time algorithm is known for learning polynomial-sized decision trees (even trees of any super-constant size), even when examples are assumed to be drawn from the uniform distribution on {0,1}. ...

The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts). This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. The idea of algorithm is connected with so-called boundary subtables. After constr...

Decision makers (DMs) face different levels of uncertainty throughout the decision making process. In particular, natural language is generally subjective or ambiguous when used to express perceptions and judgments. The aim of this paper is to extend the VIKOR method and develop a methodology for solving multi-criteria decision making (MCDM) problems with stochastic data. The weights of the sto...

In this paper we deene and study super complexity cores of languages L with respect to classes C with L 6 2 C. A super complexity core S of L can be considered as an innnite set of strings for which the decision problem for L is very hard to solve with respect to the available \resources" xed by C even for algorithms which have to compute the correct result only for all inputs x 2 S. For exampl...

We propose a new storage model called MBSM (Multiresolution Block Storage Model) for laying out tables on disks. MBSM is intended to speed up operations such as scans that are typical of data warehouse workloads. Disk blocks are grouped into “super-blocks,” with a single record stored in a partitioned fashion among the blocks in a superblock. The intention is that a scan operation that needs to...