Delineation of site‐specific management zones using estimation of distribution algorithms

In this paper, we present a novel methodology to solve the problem of delineating homogeneous site-specific management zones (SSMZ) in agricultural fields. This problem consists of dividing the field into small regions for which a specific rate of inputs is required. The objec- tive is to minimize the number of management zones, which must be homogeneous according to a specific soil property: physical or chem- ical. Furthermore, as opposed to oval zones, SSMZ with rectangular shapes are preferable since they are more practical for agricultural technologies. The methodology we propose is based on evolutionary computation, specifically on a class of the estimation of distribution algorithms (EDAs). One of the strongest contributions of this study is the representation used to model the management zones, which gener- ates zones with orthogonal shapes, e.g., L or T shapes, and minimizes the number of zones required to delineate the field. The experimental results show that our method is efficient to solve real-field and ran- domly generated instances. The average improvement of our method consists in reducing the number of management zones in the agricul- tural fields concerning other operations research methods presented in the literature. The improvement depends on the size of the field and the level of homogeneity established for the resulting management zones.IT1244-19 TIN2016-78365-R PID2019-104966GB-I0

Mining domain knowledge from app descriptions

Domain analysis aims at obtaining knowledge to a particular domain in the early stage of software development. A key challenge in domain analysis is to extract features automatically from related product artifacts. Compared with other kinds of artifacts, high volume of descriptions can be collected from app marketplaces (such as Google Play and Apple Store) easily when developing a new mobile application (App), so it is essential for the success of domain analysis to obtain features and relationship from them using data technologies. In this paper, we propose an approach to mine domain knowledge from App descriptions automatically. In our approach, the information of features in a single app description is firstly extracted and formally described by a Concern-based Description Model (CDM), this process is based on predefined rules of feature extraction and a modified topic modeling method; then the overall knowledge in the domain is identified by classifying, clustering and merging the knowledge in the set of CDMs and topics, and the results are formalized by a Data-based Raw Domain Model (DRDM). Furthermore, we propose a quantified evaluation method for prioritizing the knowledge in DRDM. The proposed approach is validated by a series of experiments

Using Artificial Neural Networks to Perform Feature Selection on Microarray Data

This article illustrates a feature selection technique that makes use of artificial neural networks. The problem being faced is the analysis of microarray expression data, which requires a mandatory feature selection step due to the strong imbalance between number of features and size of the training set. The proposed technique has been assessed on relevant benchmark datasets. All datasets report gene expression levels taken from female subjects suffering from breast cancer against normal subjects. Experimental results, with average accuracy of about 84% and very good balance between specificity and sensitivity, point to the validity of the approach

Design and Performance analysis of a relational replicated database systems

The hardware organization and software structure of a new database system are presented. This system, the relational replicated database system (RRDS), is based on a set of replicated processors operating on a partitioned database. Performance improvements and capacity growth can be obtained by adding more processors to the configuration. Based on designing goals a set of hardware and software design questions were developed. The system then evolved according to a five-phase process, based on simulation and analysis, which addressed and resolved the design questions. Strategies and algorithms were developed for data access, data placement, and directory management for the hardware organization. A predictive performance analysis was conducted to determine the extent to which original design goals were satisfied. The predictive performance results, along with an analytical comparison with three other relational multi-backend systems, provided information about the strengths and weaknesses of our design as well as a basis for future research

Information Fusion for Assistance Systems in Production Assessment

We propose a novel methodology to define assistance systems that rely on information fusion to combine different sources of information while providing an assessment. The main contribution of this paper is providing a general framework for the fusion of n number of information sources using the evidence theory. The fusion provides a more robust prediction and an associated uncertainty that can be used to assess the prediction likeliness. Moreover, we provide a methodology for the information fusion of two primary sources: an ensemble classifier based on machine data and an expert-centered model. We demonstrate the information fusion approach using data from an industrial setup, which rounds up the application part of this research. Furthermore, we address the problem of data drift by proposing a methodology to update the data-based models using an evidence theory approach. We validate the approach using the Benchmark Tennessee Eastman while doing an ablation study of the model update parameters.Comment: 21 Pages, 10 Figure

The Development of Environmental Productivity: the Case of Danish Energy Plants

The Danish “Klima 2020” plan sets an ambitious target for the complete phasing-out of fossil fuels by 2050. The Danish energy sector currently accounts for 40% of national CO 2 emissions. Based on an extended Farrell input distance function that accounts for CO 2 as an undesirable output, we estimate the environmental productivity of individual generator units based on a panel data set for the period 1998 to 2011 that includes virtually all fuel-fired generator units in Denmark. We further decompose total environmental energy conversion productivity into conversion efficiency, best conversion practice ratio, and conversion scale efficiency and use a global Malmquist index to calculate the yearly changes. By applying time series clustering, we can identify high, middle, and low performance groups of generator units in a dynamic setting. Our results indicate that the sectoral productivity only slightly increased over the fourteen years. Furthermore, we find that there is no overall high achiever group, but that the ranking, although time consistent, varies between the different productivity measures. However, we identify steam turbines and combustion engines for combined heat and power production as potential high performers, while combustion engines that only produce electricity are clearly low performers

The XXL survey: XLVI. Forward cosmological analysis of the C1 cluster sample

We present the forward cosmological analysis of an $XMM$ selected sample of galaxy clusters out to a redshift of unity. Following our previous 2018 study based on the dn/dz quantity alone, we perform an upgraded cosmological analysis of the same XXL C1 cluster catalogue (178 objects), with a detailed account of the systematic errors. We follow the ASpiX methodology: the distribution of the observed X-ray properties of the cluster population is analysed in a 3D observable space (count rate, hardness ratio, redshift) and modelled as a function of cosmology. Compared to more traditional methods, ASpiX allows the inclusion of clusters down to a few tens of photons. We obtain an improvement by a factor of 2 compared to the previous analysis by letting the normalisation of the M-T relation and the evolution of the L-T relation free. Adding constraints from the XXL cluster 2-point correlation function and the BAO from various surveys decreases the uncertainties by 23 and 53 % respectively, and 62% when adding both. Switching to the scaling relations from the Subaru analysis, and letting free more parameters, our final constraints are $\sigma_8$ = $0.99^{+0.14}_{-0.23}$, $\Omega_m$ = 0.296 $\pm$ 0.034 ($S_8 = 0.98^{+0.11}_{-0.21}$) for the XXL sample alone. Finally, we combine XXL ASpiX, the XXL cluster 2-point correlation function and the BAO, with 11 free parameters, allowing for the cosmological dependence of the scaling relations in the fit. We find $\sigma_8$ = $0.793^{+0.063}_{-0.12}$, $\Omega_m$ = 0.364 $\pm$ 0.015 ($S_8 = 0.872^{+0.068}_{-0.12}$), but still compatible with Planck CMB at 2.2$\sigma$. The results obtained by the ASpiX method are promising; further improvement is expected from the final XXL cosmological analysis involving a cluster sample twice as large. Such a study paves the way for the analysis of the eROSITA and future Athena surveys.Comment: 20 pages, 10 figures, accepted for publication in A&A, A&A version has the unabridged abstrac

Predictive Performance Of Machine Learning Algorithms For Ore Reserve Estimation In Sparse And Imprecise Data

Thesis (Ph.D.) University of Alaska Fairbanks, 2006Traditional geostatistical estimation techniques have been used predominantly in the mining industry for the purpose of ore reserve estimation. Determination of mineral reserve has always posed considerable challenge to mining engineers due to geological complexities that are generally associated with the phenomenon of ore body formation. Considerable research over the years has resulted in the development of a number of state-of-the-art methods for the task of predictive spatial mapping such as ore reserve estimation. Recent advances in the use of the machine learning algorithms (MLA) have provided a new approach to solve the age-old problem. Therefore, this thesis is focused on the use of two MLA, viz. the neural network (NN) and support vector machine (SVM), for the purpose of ore reserve estimation. Application of the MLA have been elaborated with two complex drill hole datasets. The first dataset is a placer gold drill hole data characterized by high degree of spatial variability, sparseness and noise while the second dataset is obtained from a continuous lode deposit. The application and success of the models developed using these MLA for the purpose of ore reserve estimation depends to a large extent on the data subsets on which they are trained and subsequently on the selection of the appropriate model parameters. The model data subsets obtained by random data division are not desirable in sparse data conditions as it usually results in statistically dissimilar subsets, thereby reducing their applicability. Therefore, an ideal technique for data subdivision has been suggested in the thesis. Additionally, issues pertaining to the optimum model development have also been discussed. To investigate the accuracy and the applicability of the MLA for ore reserve estimation, their generalization ability was compared with the geostatistical ordinary kriging (OK) method. The analysis of Mean Square Error (MSE), Mean Absolute Error (MAE), Mean Error (ME) and the coefficient of determination (R2) as the indices of the model performance indicated that they may significantly improve the predictive ability and thereby reduce the inherent risk in ore reserve estimation