Predicting Prostephanus truncatus (Horn) (Coleoptera: Bostrichidae) populations and associated grain damage in smallholder farmers’ maize stores: A machine learning approach

Prostephanus truncatus is a notorious pest of stored-maize grain and its spread throughout sub-Saharan Africa has led to increased levels of grain storage losses. The current study developed models to predict the level of P. truncatus infestation and associated damage of maize grain in smallholder farmer stores. Data were gathered from grain storage trials conducted in Hwedza and Mbire districts of Zimbabwe and correlated with weather data for each site. Insect counts of P. truncatus and other common stored grain insect pests had a strong correlation with time of year with highest recorded numbers from January to May. Correlation analysis showed insect-generated grain dust from boring and feeding activity to be the best indicator of P. truncatus presence in stores (r = 0.70), while a moderate correlation (r = 0.48) was found between P. truncatus numbers and storage insect parasitic wasps, and grain damage levels significantly correlated with the presence of Tribolium castaneum (r = 0.60). Models were developed for predicting P. truncatus infestation and grain damage using parameter selection algorithms and decision-tree machine learning algorithms with 10-fold cross-validation. The P. truncatus population size prediction model performance was weak (r = 0.43) due to the complicated sampling and detection of the pest and eight-week long period between sampling events. The grain damage prediction model had a stronger correlation coefficient (r = 0.93) and is a good estimator for in situ stored grain insect damage. The models were developed for use under southern African climatic conditions and can be improved with more input data to create more precise models for building decision-support tools for smallholder maize-based production systems.     

基于梯度提升决策树的车轮轮缘厚度磨耗预测

轮对在列车走行过程中起着导向、承受以及传递载荷的作用，其踏面及轮缘磨耗对地铁列车运行安全性和钢轨的寿命都将产生重要影响。根据地铁列车车轮磨耗机理，分析车轮尺寸数据特点，针对轮缘厚度这一型面参数，基于梯度提升决策树算法构建轮缘厚度磨耗预测模型。在该模型的基础上，任意选取某轮对数据进行验证分析，结果表明：基于梯度提升决策树的轮对磨耗预测模型具有较好的预测精度，可预测出1~6个月的轮缘厚度变化趋势范围，预测时间范围较长，可为地铁维保部门对轮对的维修方式由状态修转为预防修提供指导性建议。     

Mathematical representation of radiality constraint in distribution system reconfiguration problem

Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study.     

A synergistic strategy for combining thesaurus-based and corpus-based approaches in building ontology for multilingual search engines

In this article we illustrate a methodology for building cross-language search engine. A synergistic approach between thesaurus-based approach and corpus-based approach is proposed. First, a bilingual ontology thesaurus is designed with respect to two languages: English and Spanish, where a simple bilingual listing of terms, phrases, concepts, and subconcepts is built. Second, term vector translation is used – a statistical multilingual text retrieval techniques that maps statistical information about term use between languages (Ontology co-learning). These techniques map sets of t f id f term weights from one language to another. We also applied a query translation method to retrieve multilingual documents with an expansion technique for phrasal translation. Finally, we present our findings.     

Complexities of digital technology use and the teaching and learning of function

Many argue that digital technologies have the potential to enhance the teaching and learning of mathematics. However, the availability of technology is not sufficient to realise this potential. The study reported takes a detailed approach to investigate the utility of the particular offerings of the available technologies in the teaching and learning of a specific area of mathematics, functions. Sixteen affordances identified in the data are described. The complexity of the process involved in resolving a situation where particular affordances would be useful so as they are perceived and enacted is detailed. Finally, a grounded theory framework arising from the data analysis from this study that can be used to explain, predict and guide action in other digital environments is presented.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

Gradient-based recursive parameter estimation for a periodically nonuniformly sampled-data Hammerstein–Wiener system based on the key-term separation

The identification of the Hammerstein–Wiener (H-W) systems based on the nonuniform input–output dataset remains a challenging problem. This article studies the identification problem of a periodically nonuniformly sampled-data H-W system. In addition, the product terms of the parameters in the H-W system are inevitable. In order to solve the problem, the key-term separation is applied and two algorithms are proposed. One is the key-term-based forgetting factor stochastic gradient (KT-FFSG) algorithm based on the gradient search. The other is the key-term-based hierarchical forgetting factor stochastic gradient (KT-HFFSG) algorithm. Compared with the KT-FFSG algorithm, the KT-HFFSG algorithm gives more accurate estimates. The simulation results indicate that the proposed algorithms are effective.     

SINA: Semantic interpretation of user queries for question answering on interlinked data

The architectural choices underlying Linked Data have led to a compendium of data sources which contain both duplicated and fragmented information on a large number of domains. One way to enable non-experts users to access this data compendium is to provide keyword search frameworks that can capitalize on the inherent characteristics of Linked Data. Developing such systems is challenging for three main reasons. First, resources across different datasets or even within the same dataset can be homonyms. Second, different datasets employ heterogeneous schemas and each one may only contain a part of the answer for a certain user query. Finally, constructing a federated formal query from keywords across different datasets requires exploiting links between the different datasets on both the schema and instance levels. We present Sina, a scalable keyword search system that can answer user queries by transforming user-supplied keywords or natural-languages queries into conjunctive SPARQL queries over a set of interlinked data sources. Sina uses a hidden Markov model to determine the most suitable resources for a user-supplied query from different datasets. Moreover, our framework is able to construct federated queries by using the disambiguated resources and leveraging the link structure underlying the datasets to query. We evaluate Sina over three different datasets. We can answer 25 queries from the QALD-1 correctly. Moreover, we perform as well as the best question answering system from the QALD-3 competition by answering 32 questions correctly while also being able to answer queries on distributed sources. We study the runtime of SINA in its mono-core and parallel implementations and draw preliminary conclusions on the scalability of keyword search on Linked Data.