Search

It is important to protect the soil and groundwater from the pollution originating from leachate. Compacted clay soils is a favorable and economic method to protect groundwater and soil against contamination. In this study, compaction tests of leachate was done by using Modified Proctor method. The effects of microbial activity on the permeability of compacted clay soils were analyzed and the obtained data were applied to k-Nearest Neighbors (k-NN) method to predict the permeability of soils in landfill sites. k-NN method, which is a non-parametric distance-based machine learning method and widely used in classification and regression problems was applied to model the relationship between the microorganisms and the permeability. By using k-NN classification method, total heterotrophic bacteria and fungi microorganisms correctly classified the permeability variance as 78.59% and 77.31% success rate, respectively. Also, k-NN modelling was set on regression mode to predict permeability value and produced similar success rates in regression similarity with the actual value. Although, fecal coliforms and fecal streptococci microorganisms had neutral or negative contribution on analyses. For prediction accuracy and regression analysis, the k-NN method was considered for modeling the data. The results of the k-Nearest Neighbors method proved that it is a promising tool for predicting permeability of compacted clay by using microbial activity.

In recent years, there has been increasing interest in the development of telediagnosis and telemonitoring systems for Parkinson's disease (PD) based on measuring the motor system disorders caused by the disease. As approximately 90% percent of PD patients exhibit some form of vocal disorders in the earlier stages of the disease, the recent PD telediagnosis studies focus on the detection of the vocal impairments from sustained vowel phonations or running speech of the subjects. In these studies, various speech signal processing algorithms have been used to extract clinically useful information for PD assessment, and the calculated features were fed to learning algorithms to construct reliable decision support systems. In this study, we apply, to the best of our knowledge for the first time, the tunable Q-factor wavelet transform (TQWT) to the voice signals of PD patients for feature extraction, which has higher frequency resolution than the classical discrete wavelet transform. We compare the effectiveness of TQWT with the state-ofthe-art feature extraction methods used in diagnosis of PD from vocal disorders. For this purpose, we have collected the voice recordings of 252 subjects in the context of this study and extracted multiple feature subsets from the voice recordings. The feature subsets are fed to multiple classifiers and the predictions of the classifiers are combined with ensemble learning approaches. The results show that TQWT performs better or comparable to the state-of-the-art speech signal processing techniques used in PD classification. We also find that Mel-frequency cepstral and the tunable-Q wavelet coefficients, which give the highest accuracies, contain complementary information in PD classification problem resulting in an improved system when combined using a filter feature selection technique. (C) 2018 Elsevier B.V. All rights reserved.

In this study, base-2 computer arithmetic procedures are developed for the analyzing of fast division algorithms; Non- Restoring Division, SRT division and Division by Multiplication algorithms. For this purpose, those algorithms have been developed in MATLAB software simulation platform to compare the performance of the three division method. Depending on the number of bits used in simulation, memory space (A), the number of transactions (I) and the algorithms executed by the CPU processing time (T) criteria were used in the analyzing. As a result of our comparisons, division by multiplication algorithm had achieved better in those three criterias.

This study aims at measuring the image representation capacity of Layer-4, one of the visual processing steps in the cerebral cortex and at comparing it with pixel-like representations. Visual information that comes into Layer-4 as input is transformed into a nonlinear representation that is capable of detecting certain visual patterns, similar to an RBF-network, and then is passed to neighboring and upper layers. This internal representation, analogous to the kernel concept in the field of machine learning, specifies which frequent patterns exist in the given image patch and is also capable of easily learning and predicting its variations such as its spatial transformations. In this paper, using a Layer-4 simulation model [1], the sensitivity of Layer-4 representation to the spatial transformations of natural images is analyzed. Using multikernel support vector machine (SVM) approach using a limited number of support vectors, it has been shown that Layer-4 representation is more accurate in the targeted learning tasks.

The goal of this study is to explore the advantages of representing natural images with the cortical Layer-4 processing, which is the first step in visual information processing performed by the cerebral cortex of the brain. A cortical module, a macrocolumn, receives input from a small visual field and its Layer 4 performs a nonlinear transform of this input to generate its pluripotent representation. In this study, we design some tests on such image windows in order to explore the differences and advantages of Layer-4 representation over the pixel representation. These tests measure how much the neighborhood is preserved in the feature space and how much discriminability remains between spatially related (neighboring/shifted) image windows. The accuracies of the representations are measured using Support Vector Machines (SVM) and K-Nearest Neighbor (K-NN) algorithms as the classification methods.

The satisfiability problem (SAT) is a constitutive decision problem for mathematical logic, VLSI engineering and computational theory. Uniform random 3 Boolean satisfiability problem is a type of SAT problem which consists of randomly generated clauses with 3 literals. In this study, two population based metaheuristic algorithms, particle swarm optimization (PSO), differential evolution (DE) were implemented to solve uniform random 3 Boolean satisfiability problem on both CPU and GPU through nVidia CUDA framework. Moreover the performance comparison of both algorithms was done in terms of solution quality, running time and speedup performance between CPU and GPU. The novel contribution of the study into the literature is comparison of PSO and DE algorithms in GPU to solve uniform random 3 Boolean satisfiability problem. As the results of the study; PSO find the best optimal solution for the problem rather than DE algorithm. In addition to this, solving this problem on GPU results nearly 11.95-30.4 times for PSO and 7.21-18.04 times for DE faster than CPU implementation.