Entity

Time filter

Source Type

TU
Breitenfurt bei Wien, Austria

Ghimire B.,TU | Bhattacharjee S.,Indian Institute of Technology Kharagpur | Ghosh S.K.,Indian Institute of Technology Kharagpur
Proceedings - 2013 4th International Conference on Computing for Geospatial Research and Application, COM.Geo 2013 | Year: 2013

With rapid increase of scope, coverage and volume of geographic datasets, knowledge discovery from spatial data have drawn a lot of research interest for last few decades. Traditional analytical techniques cannot easily discover new, implicit patterns, and relationships that are hidden into geographic datasets. The principle of this work is to evaluate the performance of traditional and spatial data mining techniques for analysing spatial certainty, such as spatial autocorrelation. Analysis is done by classification technique, i.e. a Decision Tree (DT) based approach on a spatial diversity coefficient. ID3 (Iterative Dichotomiser 3) algorithm is used for building the conventional and spatial decision trees. A synthetically generated spatial accident dataset and real accident dataset are used for this purpose. The spatial DT (SDT) is found to be more significant in spatial decision making. © 2013 IEEE. Source


Ekbote R.,I.T.M. Gwalior | Gupta A.,I.T.M. Gwalior | Akashe S.,I.T.M. Gwalior | Sharma S.,TU
2012 Students Conference on Engineering and Systems, SCES 2012 | Year: 2012

Static Random Access Memory (SRAM) units are often directly integrated onto the same die with the microprocessors and influence the design metrics significantly. SRAM often consumes large percentages of the die size and their leakages significantly contribute to the static power dissipation of those chips. The main objective of this article is to characterize the leakage and acces time(speed) of Six different 7T SRAM cells The simulation results indicate that the timing behavior of SRAM cells are largely the same but power dissipation, leakage power in particular, vary significantly in 45nm technology. © 2012 IEEE. Source


Carboxymethyl-α-cyclodextrin polymer grafted onto nano TiO2 (CM-α-CD PG/nano TiO2) was fabricated and its feasibility for the determination of levodopa (l-DOPA) was investigated. The synthesized sorbent was characterized by Fourier transform infrared (FT-IR) spectroscopy, Scanning Electron Microscopy (SEM) and Transmission Electron Microscopy (TEM). The adsorption mechanism is based on the host-guest effect between l-DOPA and CM-α-CD PG grafted on nano TiO2. The selectivity is due to the size of l-DOPA and also the hydrophobic interaction of CM-α-CD polymer with this compound. The experimental conditions were optimized for the separation/determination of l-DOPA. Under the optimum conditions, the adsorption capacity of CM-α-CD PG/nano TiO2 for l-DOPA and the preconcentration factor were 63.8 μg g-1 and 20, respectively. The limit of detection (LOD), the relative standard deviation (RSD), and the linear range were 0.016 μg mL-1, 2.3%, and 0.05-1.3 μg mL-1, respectively. © 2015 The Royal Society of Chemistry. Source


Sharma S.K.,TU
Computers and Mathematics with Applications | Year: 2012

This paper presents the characterization and modeling of several correlative channel models, namely, the Kronecker, Weichselberger, and structured models for multi-input multi-output (MIMO) systems. Due to its simplicity, the Kronecker model is by far the most popular MIMO channel model in the literature. It greatly simplifies channel analysis, as it holds that scatterers around the transmitter fade independently of those around the receiver. Despite its popularity, the Kronecker model has been shown to be inaccurate. The Weichselberger model uses the eigenvalue decomposition (EVD) of the channel as its parameters, and in most cases, is more accurate than the Kronecker model. The structured model is an extension of the Weichselberger model to the wideband MIMO channel. It uses tensors to express the wideband MIMO channel in an elegant fashion, often with fewer parameters than the Kronecker model. © 2012 Elsevier Ltd. All rights reserved. Source


Aminof B.,IST | Kotek T.,TU | Rubin S.,TU | Spegni F.,University | Veith H.,TU
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2014

A standard technique for solving the parameterized model checking problem is to reduce it to the classic model checking problem of finitely many finite-state systems. This work considers some of the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable Monadic Second Order Logic formulas and graph operations. First, we settle the exact computational complexity of the parameterized model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases that model checking the parameterized system can be reduced to model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the parameterized system is equivalent to a single finite-state system (more precisely a Büchi word automaton), and establish tight bounds on the sizes of such automata. © 2014 Springer-Verlag. Source

Discover hidden collaborations