Decision tree pruning is critical for the construction of good decision trees. The most popular and widely used method among various pruning methods is cost-complexity pruning, whose implementation requires a training dataset to develop a full tree and a validation dataset to prune the tree. However, different pruned trees are found to be produced when the original dataset are randomly partitio...

My research interests involve Finite Model Theory and Descriptive Complexity, an area of research nestled in the intersection of Combinatorics, Logic and Computer Science. Inspired by Ehrenfeucht–Fräıssé games, I have been studying local properties of regular colored graphs– in particular, the computational complexity of realizing a given set of neighborhoods in a graph.

Although parallel systems with high peak performance have been exciting, high peak performance often means high power consumption. In this paper, power-aware parallel systems are investigated, where each node can make dynamic voltage scaling (DVS). Based on the characteristics of communication and memory access in MPI programs, a compiler is used to automatically form communication and computat...

This note introduces a new general conjecture correlating the dimensionality dT of an infinite lattice with N nodes to the asymptotic value of its Wiener Index W(N). In the limit of large N the general asymptotic behavior W(N)≈Ns is proposed, where the exponent s and dT are related by the conjectured formula s=2+1/dT allowing a new definition of dimensionality dW=(s-2)-1. Being related to the t...

Hiermit versichere ich, daa ich die Arbeit selbstt andig verfaat und keine anderen als die angegebenen Quellen und Hilfsmittel benutzt sowie Zitate kenntlich gemacht habe. I have many people to thank and acknowledge. Especially I would like to thank my advisor, Eric Rosen, for all the time he spent in supporting my thesis work.

Real time systems are widely used systems in now days. Most of these systems work in fault prone environment. The job running in these systems should be finished on its deadline as timing constraints which requires some energy to finishing it. If there is any fault occurring in the system then it may not be possible that the job running will finish on its deadline and will give the desired resu...

We consider extensions of xed-point logic by means of generalized quantiiers in the context of descriptive complexity. By the well-known theorem of Immerman and Vardi, xed-point logic captures PTime over linearly ordered structures. It fails, however , to express even most fundamental structural properties, like simple cardinality properties, in the absence of order. In the present investigatio...

The classical logical antinomy known as Richard-Berry paradox is combined with plausible assumptions about the size i.e. the descriptional complexity, of Turing machines formalizing certain sentences, to show that formalization of language leads to contradiction.

We quickly review labelled Markov processes (LMP) and provide a counterexample showing that in general measurable spaces, event bisimilarity and state bisimilarity differ in LMP. This shows that the logic in Desharnais [3] does not characterize state bisimulation in non-analytic measurable spaces. Furthermore we show that, under current foundations of Mathematics, such logical characterization ...