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}. ...

objective(s):transforming growth factor-β(tgf-β) is involved in colorectal cancer (crc). the sd-208 acts as an anti-cancer agent in different malignancies via tgf-β signaling. this work aims to show the effect of manipulation of tgf-β signaling on some mirnas implicated in crc. materials and methods: we investigated the effects of sd-208 on sw-48, a colon adenocarcinoma cell line. the cell line...

Question: What is the impact of a decision aid outlining the different surgical options for stage I or stage II breast cancer on patient decision making? Design: Cluster randomized controlled trial. Setting: Twenty surgeons from communities in centralwest and eastern Ontario. Patients: A total of 201 of 208 patients (97%) with newly diagnosed clinical stage I or stage II breast cancer agreed to...

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...

The specific objectives of the paper are: validation of the theoretical model for strategic planning of e-learning implementation by means of factor analysis, presentation of the structure of AHP and ANP models for decision making about e-learning implementation, comparison between developed AHP and ANP models, analysis of the results of group decision making supported by sw TeamEC2000 based on...

In this paper, we propose a novel random-forest scheme, namely Joint Maximum Purity Forest (JMPF), for classification, clustering, and regression tasks. In the JMPF scheme, the original feature space is transformed into a compactly pre-clustered feature space, via a trained rotation matrix. The rotation matrix is obtained through an iterative quantization process, where the input data belonging...

Abstract—In the current study, energy and exergy analysis of a 65 MW steam power plant was carried out. This study investigated the effect of variations of overall conductance of the super heater on the performance of an existing steam power plant located in Derna, Libya. The performance of the power plant was estimated by a mathematical modelling which considers the off-design operating condit...