Drying kinetic analysis of municipal solid waste using modified page model and pattern search method

This work studied the drying kinetics of the organic fractions of municipal solid waste (MSW) samples with different initial moisture contents and presented a new method for determination of drying kinetic parameters. A series of drying experiments at different temperatures were performed by using a thermogravimetric technique. Based on the modified Page drying model and the general pattern search method, a new drying kinetic method was developed using multiple isothermal drying curves simultaneously. The new method fitted the experimental data more accurately than the traditional method. Drying kinetic behaviors under extrapolated conditions were also predicted and validated. The new method indicated that the drying activation energies for the samples with initial moisture contents of 31.1 and 17.2 % on wet basis were 25.97 and 24.73 kJ mol−1. These results are useful for drying process simulation and industrial dryer design. This new method can be also applied to determine the drying parameters of other materials with high reliability.

Analysis of Local Search Methods for 3D Data

In questa tesi sono stati analizzati alcuni metodi di ricerca per dati 3D. Viene illustrata una panoramica generale sul campo della Computer Vision, sullo stato dell’arte dei sensori per l’acquisizione e su alcuni dei formati utilizzati per la descrizione di dati 3D. In seguito è stato fatto un approfondimento sulla 3D Object Recognition dove, oltre ad essere descritto l’intero processo di matching tra Local Features, è stata fatta una focalizzazione sulla fase di detection dei punti salienti. In particolare è stato analizzato un Learned Keypoint detector, basato su tecniche di apprendimento di machine learning. Quest ultimo viene illustrato con l’implementazione di due algoritmi di ricerca di vicini: uno esauriente (K-d tree) e uno approssimato (Radial Search). Sono state riportate infine alcune valutazioni sperimentali in termini di efficienza e velocità del detector implementato con diversi metodi di ricerca, mostrando l’effettivo miglioramento di performance senza una considerabile perdita di accuratezza con la ricerca approssimata.

Pattern recognition methods for EMG prosthetic control

In this work we focus on pattern recognition methods related to EMG upper-limb prosthetic control. After giving a detailed review of the most widely used classification methods, we propose a new classification approach. It comes as a result of comparison in the Fourier analysis between able-bodied and trans-radial amputee subjects. We thus suggest a different classification method which considers each surface electrodes contribute separately, together with five time domain features, obtaining an average classification accuracy equals to 75% on a sample of trans-radial amputees. We propose an automatic feature selection procedure as a minimization problem in order to improve the method and its robustness.

Detecting epistasis with restricted response patterns in pairs of biallelic loci.

Well-established examples of genetic epistasis between a pair of loci typically show characteristic patterns of phenotypic distributions in joint genotype tables. However, inferring epistasis given such data is difficult due to the lack of power in commonly used approaches, which decompose the epistatic patterns into main plus interaction effects followed by testing the interaction term. Testing additive-only or all terms may have more power, but they are sensitive to nonepistatic patterns. Alternatively, the epistatic patterns of interest can be enumerated and the best matching one is found by searching through the possibilities. Although this approach requires multiple testing correction over possible patterns, each pattern can be fitted with a regression model with just one degree of freedom and thus the overall power can still be high, if the number of possible patterns is limited. Here we compare the power of the linear decomposition and pattern search methods, by applying them to simulated data generated under several patterns of joint genotype effects with simple biological interpretations. Interaction-only tests are the least powerful; while pattern search approach is the most powerful if the range of possibilities is restricted, but still includes the true pattern.

Direct-search penalty/barrier methods

In Nonlinear Optimization Penalty and Barrier Methods are normally used to solve Constrained Problems. There are several Penalty/Barrier Methods and they are used in several areas from Engineering to Economy, through Biology, Chemistry, Physics among others. In these areas it often appears Optimization Problems in which the involved functions (objective and constraints) are non-smooth and/or their derivatives are not know. In this work some Penalty/Barrier functions are tested and compared, using in the internal process, Derivative-free, namely Direct Search, methods. This work is a part of a bigger project involving the development of an Application Programming Interface, that implements several Optimization Methods, to be used in applications that need to solve constrained and/or unconstrained Nonlinear Optimization Problems. Besides the use of it in applied mathematics research it is also to be used in engineering software packages.

A chemometric study on the analgesic activity of cannabinoid compounds using SDA, KNN and SIMCA methods

The supervised pattern recognition methods K-Nearest Neighbors (KNN), stepwise discriminant analysis (SDA), and soft independent modelling of class analogy (SIMCA) were employed in this work with the aim to investigate the relationship between the molecular structure of 27 cannabinoid compounds and their analgesic activity. Previous analyses using two unsupervised pattern recognition methods (PCA-principal component analysis and HCA-hierarchical cluster analysis) were performed and five descriptors were selected as the most relevants for the analgesic activity of the compounds studied: R (3) (charge density on substituent at position C(3)), Q (1) (charge on atom C(1)), A (surface area), log P (logarithm of the partition coefficient) and MR (molecular refractivity). The supervised pattern recognition methods (SDA, KNN, and SIMCA) were employed in order to construct a reliable model that can be able to predict the analgesic activity of new cannabinoid compounds and to validate our previous study. The results obtained using the SDA, KNN, and SIMCA methods agree perfectly with our previous model. Comparing the SDA, KNN, and SIMCA results with the PCA and HCA ones we could notice that all multivariate statistical methods classified the cannabinoid compounds studied in three groups exactly in the same way: active, moderately active, and inactive.

Derivative-free optimization and filter methods to solve nonlinear constrained problems

In real optimization problems, usually the analytical expression of the objective function is not known, nor its derivatives, or they are complex. In these cases it becomes essential to use optimization methods where the calculation of the derivatives, or the verification of their existence, is not necessary: the Direct Search Methods or Derivative-free Methods are one solution. When the problem has constraints, penalty functions are often used. Unfortunately the choice of the penalty parameters is, frequently, very difficult, because most strategies for choosing it are heuristics strategies. As an alternative to penalty function appeared the filter methods. A filter algorithm introduces a function that aggregates the constrained violations and constructs a biobjective problem. In this problem the step is accepted if it either reduces the objective function or the constrained violation. This implies that the filter methods are less parameter dependent than a penalty function. In this work, we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of the simplex method and filter methods. This method does not compute or approximate any derivatives, penalty constants or Lagrange multipliers. The basic idea of simplex filter algorithm is to construct an initial simplex and use the simplex to drive the search. We illustrate the behavior of our algorithm through some examples. The proposed methods were implemented in Java.

Nonmonotone hybrid tabu search for inequalities and equalities: an experimental study

The main goal of this paper is to analyze the behavior of nonmono- tone hybrid tabu search approaches when solving systems of nonlinear inequalities and equalities through the global optimization of an appro- priate merit function. The algorithm combines global and local searches and uses a nonmonotone reduction of the merit function to choose the local search. Relaxing the condition aims to call the local search more often and reduces the overall computational e ort. Two variants of a perturbed pattern search method are implemented as local search. An experimental study involving a variety of problems available in the lit- erature is presented.

Classification of some penalty methods

Optimization problems arise in science, engineering, economy, etc. and we need to find the best solutions for each reality. The methods used to solve these problems depend on several factors, including the amount and type of accessible information, the available algorithms for solving them, and, obviously, the intrinsic characteristics of the problem. There are many kinds of optimization problems and, consequently, many kinds of methods to solve them. When the involved functions are nonlinear and their derivatives are not known or are very difficult to calculate, these methods are more rare. These kinds of functions are frequently called black box functions. To solve such problems without constraints (unconstrained optimization), we can use direct search methods. These methods do not require any derivatives or approximations of them. But when the problem has constraints (nonlinear programming problems) and, additionally, the constraint functions are black box functions, it is much more difficult to find the most appropriate method. Penalty methods can then be used. They transform the original problem into a sequence of other problems, derived from the initial, all without constraints. Then this sequence of problems (without constraints) can be solved using the methods available for unconstrained optimization. In this chapter, we present a classification of some of the existing penalty methods and describe some of their assumptions and limitations. These methods allow the solving of optimization problems with continuous, discrete, and mixing constraints, without requiring continuity, differentiability, or convexity. Thus, penalty methods can be used as the first step in the resolution of constrained problems, by means of methods that typically are used by unconstrained problems. We also discuss a new class of penalty methods for nonlinear optimization, which adjust the penalty parameter dynamically.

Efficient feature selection filters for high-dimensional data

Feature selection is a central problem in machine learning and pattern recognition. On large datasets (in terms of dimension and/or number of instances), using search-based or wrapper techniques can be cornputationally prohibitive. Moreover, many filter methods based on relevance/redundancy assessment also take a prohibitively long time on high-dimensional. datasets. In this paper, we propose efficient unsupervised and supervised feature selection/ranking filters for high-dimensional datasets. These methods use low-complexity relevance and redundancy criteria, applicable to supervised, semi-supervised, and unsupervised learning, being able to act as pre-processors for computationally intensive methods to focus their attention on smaller subsets of promising features. The experimental results, with up to 10(5) features, show the time efficiency of our methods, with lower generalization error than state-of-the-art techniques, while being dramatically simpler and faster.

Spatial point pattern analysis of gorilla nest sites in the Kagwene Sanctuary, Cameroon: Towards understanding the nesting behavior of a critically endangered subspecies

Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.

Towards Direct Policy Search Reinforcement Learning for Robot Control

This paper proposes a high-level reinforcement learning (RL) control system for solving the action selection problem of an autonomous robot. Although the dominant approach, when using RL, has been to apply value function based algorithms, the system here detailed is characterized by the use of direct policy search methods. Rather than approximating a value function, these methodologies approximate a policy using an independent function approximator with its own parameters, trying to maximize the future expected reward. The policy based algorithm presented in this paper is used for learning the internal state/action mapping of a behavior. In this preliminary work, we demonstrate its feasibility with simulated experiments using the underwater robot GARBI in a target reaching task

Pattern recognition ecological niche models fit to presence-only and presence-absence data

1. Identifying the boundary of a species' niche from observational and environmental data is a common problem in ecology and conservation biology and a variety of techniques have been developed or applied to model niches and predict distributions. Here, we examine the performance of some pattern-recognition methods as ecological niche models (ENMs). Particularly, one-class pattern recognition is a flexible and seldom used methodology for modelling ecological niches and distributions from presence-only data. The development of one-class methods that perform comparably to two-class methods (for presence/absence data) would remove modelling decisions about sampling pseudo-absences or background data points when absence points are unavailable. 2. We studied nine methods for one-class classification and seven methods for two-class classification (five common to both), all primarily used in pattern recognition and therefore not common in species distribution and ecological niche modelling, across a set of 106 mountain plant species for which presence-absence data was available. We assessed accuracy using standard metrics and compared trade-offs in omission and commission errors between classification groups as well as effects of prevalence and spatial autocorrelation on accuracy. 3. One-class models fit to presence-only data were comparable to two-class models fit to presence-absence data when performance was evaluated with a measure weighting omission and commission errors equally. One-class models were superior for reducing omission errors (i.e. yielding higher sensitivity), and two-classes models were superior for reducing commission errors (i.e. yielding higher specificity). For these methods, spatial autocorrelation was only influential when prevalence was low. 4. These results differ from previous efforts to evaluate alternative modelling approaches to build ENM and are particularly noteworthy because data are from exhaustively sampled populations minimizing false absence records. Accurate, transferable models of species' ecological niches and distributions are needed to advance ecological research and are crucial for effective environmental planning and conservation; the pattern-recognition approaches studied here show good potential for future modelling studies. This study also provides an introduction to promising methods for ecological modelling inherited from the pattern-recognition discipline.

Interventions for smoking cessation in hospitalised patients.

BACKGROUND: Smoking contributes to reasons for hospitalisation, and the period of hospitalisation may be a good time to provide help with quitting. OBJECTIVES: To determine the effectiveness of interventions for smoking cessation that are initiated for hospitalised patients. SEARCH METHODS: We searched the Cochrane Tobacco Addiction Group register which includes papers identified from CENTRAL, MEDLINE, EMBASE and PsycINFO in December 2011 for studies of interventions for smoking cessation in hospitalised patients, using terms including (hospital and patient*) or hospitali* or inpatient* or admission* or admitted. SELECTION CRITERIA: Randomized and quasi-randomized trials of behavioural, pharmacological or multicomponent interventions to help patients stop smoking, conducted with hospitalised patients who were current smokers or recent quitters (defined as having quit more than one month before hospital admission). The intervention had to start in the hospital but could continue after hospital discharge. We excluded studies of patients admitted to facilities that primarily treat psychiatric disorders or substance abuse, studies that did not report abstinence rates and studies with follow-up of less than six months. Both acute care hospitals and rehabilitation hospitals were included in this update, with separate analyses done for each type of hospital. DATA COLLECTION AND ANALYSIS: Two authors extracted data independently for each paper, with disagreements resolved by consensus. MAIN RESULTS: Fifty trials met the inclusion criteria. Intensive counselling interventions that began during the hospital stay and continued with supportive contacts for at least one month after discharge increased smoking cessation rates after discharge (risk ratio (RR) 1.37, 95% confidence interval (CI) 1.27 to 1.48; 25 trials). A specific benefit for post-discharge contact compared with usual care was found in a subset of trials in which all participants received a counselling intervention in the hospital and were randomly assigned to post-discharge contact or usual care. No statistically significant benefit was found for less intensive counselling interventions. Adding nicotine replacement therapy (NRT) to an intensive counselling intervention increased smoking cessation rates compared with intensive counselling alone (RR 1.54, 95% CI 1.34 to 1.79, six trials). Adding varenicline to intensive counselling had a non-significant effect in two trials (RR 1.28, 95% CI 0.95 to 1.74). Adding bupropion did not produce a statistically significant increase in cessation over intensive counselling alone (RR 1.04, 95% CI 0.75 to 1.45, three trials). A similar pattern of results was observed in a subgroup of smokers admitted to hospital because of cardiovascular disease (CVD). In this subgroup, intensive intervention with follow-up support increased the rate of smoking cessation (RR 1.42, 95% CI 1.29 to 1.56), but less intensive interventions did not. One trial of intensive intervention including counselling and pharmacotherapy for smokers admitted with CVD assessed clinical and health care utilization endpoints, and found significant reductions in all-cause mortality and hospital readmission rates over a two-year follow-up period. These trials were all conducted in acute care hospitals. A comparable increase in smoking cessation rates was observed in a separate pooled analysis of intensive counselling interventions in rehabilitation hospitals (RR 1.71, 95% CI 1.37 to 2.14, three trials). AUTHORS' CONCLUSIONS: High intensity behavioural interventions that begin during a hospital stay and include at least one month of supportive contact after discharge promote smoking cessation among hospitalised patients. The effect of these interventions was independent of the patient's admitting diagnosis and was found in rehabilitation settings as well as acute care hospitals. There was no evidence of effect for interventions of lower intensity or shorter duration. This update found that adding NRT to intensive counselling significantly increases cessation rates over counselling alone. There is insufficient direct evidence to conclude that adding bupropion or varenicline to intensive counselling increases cessation rates over what is achieved by counselling alone.

Towards Direct Policy Search Reinforcement Learning for Robot Control

This paper proposes a high-level reinforcement learning (RL) control system for solving the action selection problem of an autonomous robot. Although the dominant approach, when using RL, has been to apply value function based algorithms, the system here detailed is characterized by the use of direct policy search methods. Rather than approximating a value function, these methodologies approximate a policy using an independent function approximator with its own parameters, trying to maximize the future expected reward. The policy based algorithm presented in this paper is used for learning the internal state/action mapping of a behavior. In this preliminary work, we demonstrate its feasibility with simulated experiments using the underwater robot GARBI in a target reaching task