Reference Points Based on Dynamic Optimisation: A Versatil Algorithm for Mixed Fishery Management with Bio-economic Agestructured Models

Single-species management objectives may not be consistent within mixed fisheries. They may lead species to unsafe situations, promote discarding of over-quota and/or misreporting of catches. We provide an algorithm for characterising bio-economic reference points for a mixed fishery as the steady-state solution of a dynamic optimal management problem. The optimisation problem takes into account: i) that species are fishing simultaneously in unselective fishing operations and ii)intertemporal discounting and fleet costs to relate reference points to discounted economic profits along optimal trajectories. We illustrate how the algorithm can be implemented by applying it to the European Northern Stock of Hake (Merluccius merluccius), where fleets also capture Northern megrim (Lepidorhombus whiffiagonis) and Northern anglerfish (Lophius piscatorius and Lophius budegassa). We find that optimal mixed management leads to a target reference point that is quite similar to the 2/3 of the Fmsy single-species (hake) target. Mixed management is superior to singlespecies management because it leads the fishery to higher discounted profits with higher long-term SSB for all species. We calculate that the losses due to the use of the Fmsy single-species (hake) target in this mixed fishery account for 11.4% of total discounted profits.

Study of an object recognition algorithm

This project introduces an improvement of the vision capacity of the robot Robotino operating under ROS platform. A method for recognizing object class using binary features has been developed. The proposed method performs a binary classification of the descriptors of each training image to characterize the appearance of the object class. It presents the use of the binary descriptor based on the difference of gray intensity of the pixels in the image. It shows that binary features are suitable to represent object class in spite of the low resolution and the weak information concerning details of the object in the image. It also introduces the use of a boosting method (Adaboost) of feature selection al- lowing to eliminate redundancies and noise in order to improve the performance of the classifier. Finally, a kernel classifier SVM (Support Vector Machine) is trained with the available database and applied for predictions on new images. One possible future work is to establish a visual servo-control that is to say the reac- tion of the robot to the detection of the object.

A Note on Risk Acceptance, Bankruptcy Avoidance and Riskiness Measures

In this work we clarify the relationships between riskiness, risk acceptance and bankruptcy avoidance. We distinguish between the restriction on the current wealth required to make a gamble acceptable to the decision maker and the restriction on the current wealth required to guarantee no bankruptcy if a gamble is accepted. We focus on the measure of riskiness proposed by Foster and Hart.

Genetics of Type III Bartter Syndrome in Spain, Proposed Diagnostic Algorithm

9 p.

Molecular diagnosis of distal renal tubular acidosis in Tunisian patients: proposed algorithm for Northern Africa populations for the ATP6V1B1, ATP6V0A4 and SCL4A1 genes

Background: Primary distal renal tubular acidosis (dRTA) caused by mutations in the genes that codify for the H+ -ATPase pump subunits is a heterogeneous disease with a poor phenotype-genotype correlation. Up to now, large cohorts of dRTA Tunisian patients have not been analyzed, and molecular defects may differ from those described in other ethnicities. We aim to identify molecular defects present in the ATP6V1B1, ATP6V0A4 and SLC4A1 genes in a Tunisian cohort, according to the following algorithm: first, ATP6V1B1 gene analysis in dRTA patients with sensorineural hearing loss (SNHL) or unknown hearing status. Afterwards, ATP6V0A4 gene study in dRTA patients with normal hearing, and in those without any structural mutation in the ATP6V1B1 gene despite presenting SNHL. Finally, analysis of the SLC4A1 gene in those patients with a negative result for the previous studies. Methods: 25 children (19 boys) with dRTA from 20 families of Tunisian origin were studied. DNAs were extracted by the standard phenol/chloroform method. Molecular analysis was performed by PCR amplification and direct sequencing. Results: In the index cases, ATP6V1B1 gene screening resulted in a mutation detection rate of 81.25%, which increased up to 95% after ATP6V0A4 gene analysis. Three ATP6V1B1 mutations were observed: one frameshift mutation (c.1155dupC; p.Ile386fs), in exon 12; a G to C single nucleotide substitution, on the acceptor splicing site (c.175-1G > C; p.?) in intron 2, and one novel missense mutation (c. 1102G > A; p. Glu368Lys), in exon 11. We also report four mutations in the ATP6V0A4 gene: one single nucleotide deletion in exon 13 (c.1221delG; p. Met408Cysfs* 10); the nonsense c.16C > T; p.Arg6*, in exon 3; and the missense changes c.1739 T > C; p.Met580Thr, in exon 17 and c.2035G > T; p.Asp679Tyr, in exon 19. Conclusion: Molecular diagnosis of ATP6V1B1 and ATP6V0A4 genes was performed in a large Tunisian cohort with dRTA. We identified three different ATP6V1B1 and four different ATP6V0A4 mutations in 25 Tunisian children. One of them, c.1102G > A; p.Glu368Lys in the ATP6V1B1 gene, had not previously been described. Among deaf since childhood patients, 75% had the ATP6V1B1 gene c. 1155dupC mutation in homozygosis. Based on the results, we propose a new diagnostic strategy to facilitate the genetic testing in North Africans with dRTA and SNHL.

A Data Dropout Compensation Algorithm Based on the Iterative Learning Control Methodology for Discrete-Time Systems

This paper deals with the convergence of a remote iterative learning control system subject to data dropouts. The system is composed by a set of discrete-time multiple input-multiple output linear models, each one with its corresponding actuator device and its sensor. Each actuator applies the input signals vector to its corresponding model at the sampling instants and the sensor measures the output signals vector. The iterative learning law is processed in a controller located far away of the models so the control signals vector has to be transmitted from the controller to the actuators through transmission channels. Such a law uses the measurements of each model to generate the input vector to be applied to its subsequent model so the measurements of the models have to be transmitted from the sensors to the controller. All transmissions are subject to failures which are described as a binary sequence taking value 1 or 0. A compensation dropout technique is used to replace the lost data in the transmission processes. The convergence to zero of the errors between the output signals vector and a reference one is achieved as the number of models tends to infinity.

An update of the J48Consolidated WEKA’s class: CTC algorithm enhanced with the notion of coverage

This document aims to describe an update of the implementation of the J48Consolidated class within WEKA platform. The J48Consolidated class implements the CTC algorithm [2][3] which builds a unique decision tree based on a set of samples. The J48Consolidated class extends WEKA’s J48 class which implements the well-known C4.5 algorithm. This implementation was described in the technical report "J48Consolidated: An implementation of CTC algorithm for WEKA". The main, but not only, change in this update is the integration of the notion of coverage in order to determine the number of samples to be generated to build a consolidated tree. We define coverage as the percentage of examples of the training sample present in –or covered by– the set of generated subsamples. So, depending on the type of samples that we use, we will need more or less samples in order to achieve a specific value of coverage.

J48Consolidated: an implementation of CTC algorithm for WEKA

The CTC algorithm, Consolidated Tree Construction algorithm, is a machine learning paradigm that was designed to solve a class imbalance problem, a fraud detection problem in the area of car insurance [1] where, besides, an explanation about the classification made was required. The algorithm is based on a decision tree construction algorithm, in this case the well-known C4.5, but it extracts knowledge from data using a set of samples instead of a single one as C4.5 does. In contrast to other methodologies based on several samples to build a classifier, such as bagging, the CTC builds a single tree and as a consequence, it obtains comprehensible classifiers. The main motivation of this implementation is to make public and available an implementation of the CTC algorithm. With this purpose we have implemented the algorithm within the well-known WEKA data mining environment http://www.cs.waikato.ac.nz/ml/weka/). WEKA is an open source project that contains a collection of machine learning algorithms written in Java for data mining tasks. J48 is the implementation of C4.5 algorithm within the WEKA package. We called J48Consolidated to the implementation of CTC algorithm based on the J48 Java class.