Dermoscopy of pigmented lesions on mucocutaneous junction and mucous membrane

Author Posting. Copyright (c) The Authors 2009 This is the author's version of the work. It is posted here for personal use, not for redistribution. The definitive version was published in BRITISH JOURNAL OF DERMATOLOGY, volume: 161, issue: 6, pages:1255-1261. https://doi.org/10.1111/j.1365-2133.2009.09251.xBackground The dermoscopic features of pigmented lesions on the mucocutaneous junction and mucous membrane are different from those on hairy skin. Differentiation between benign lesions and malignant melanomas of these sites is often difficult. Objective To define the dermoscopic patterns of lesions on the mucocutaneous junction and mucous membrane, and assess the applicability of standard dermoscopic algorithms to these lesions. Patients and methods An unselected consecutive series of 40 lesions on the mucocutaneous junction and mucous membrane was studied. All the lesions were imaged using dermoscopy devices, analysed for dermoscopic patterns and scored with algorithms including the ABCD rule, Menzies method, 7-point checklist, 3-point checklist and the CASH algorithm. Results Benign pigmented lesions of the mucocutaneous junction and mucous membrane frequently presented a dotted-globular pattern (25%), a homogeneous pattern (25%), a fish scale-like pattern (18 center dot 8%) and a hyphal pattern (18 center dot 8%), while melanomas of these sites showed a multicomponent pattern (75%) and a homogeneous pattern (25%). The fish scale-like pattern and hyphal pattern were considered to be variants of the ring-like pattern. The sensitivities of the ABCD rule, Menzies method, 7-point checklist, 3-point checklist and CASH algorithm in diagnosing mucosal melanomas were 100%, 100%, 63%, 88% and 100%; and the specificities were 100%, 94%, 100%, 94% and 100%, respectively. Conclusion The ring-like pattern and its variants (fish scale-like pattern and hyphal pattern) are frequently observed as well as the dotted-globular pattern and homogeneous pattern in mucosal melanotic macules. The algorithms for pigmented lesions on hairy skin also apply to those on the mucocutaneous junction and mucous membrane with high sensitivity and specificity.ArticleBRITISH JOURNAL OF DERMATOLOGY. 161(6):1255-1261 (2009)journal articl

Estimating residual biomass of olive tree crops using terrestrial laser scanning

[EN] Agricultural residues have gained increasing interest as a source of renewable energy. The development of methods and techniques that allow to inventory residual biomass needs to be explored further. In this study, the residual biomass of olive trees was estimated based on parameters derived from using a Terrestrial Laser Scanning System (TLS). To this end, 32 olive trees in 2 orchards in the municipality of Viver, Central Eastern Spain, were selected and measured using a TLS system. The residual biomass of these trees was pruned and weighed. Several algorithms were applied to the TLS data to compute the main parameters of the trees: total height, crown height, crown diameter and crown volume. Regarding the last parameter, 4 methods were tested: the global convex hull volume, the convex hull by slice volume, the section volume, and the volume measured by voxels. In addition, several statistics were computed from the crown points for each tree. Regression models were calculated to predict residual biomass using 3 sets of potential explicative variables: firstly, the height statistics retrieved from 3D cloud data for each crown tree, secondly, the parameters of the trees derived from TLS data and finally, the combination of both sets of variables. Strong relationships between residual biomass and TLS parameters (crown volume parameters) were found (R2 = 0.86, RMSE = 2.78 kg). The pruning biomass pre- diction fraction was improved by 6%, in terms of R2, when the variance of the crown-point elevations was selected (R2 = 0.92, RMSE = 2.01 kg). The study offers some important insights into the quantification of residual biomass, which is essential information for the production of biofuel.Fernández-Sarría, A.; López- Cortés, I.; Estornell Cremades, J.; Velázquez Martí, B.; Salazar Hernández, DM. (2019). Estimating residual biomass of olive tree crops using terrestrial laser scanning. International Journal of Applied Earth Observation and Geoinformation. 75:163-170. https://doi.org/https://doi.org/10.1016/j.jag.2018.10.019S1631707

Partial Correctness of a Power Algorithm

This work continues a formal verification of algorithms written in terms of simple-named complex-valued nominative data [6],[8],[15],[11],[12],[13]. In this paper we present a formalization in the Mizar system [3],[1] of the partial correctness of the algorithm: i := val.1 j := val.2 b := val.3 n := val.4 s := val.5 while (i n) i := i + j s := s * b return s computing the natural n power of given complex number b, where variables i, b, n, s are located as values of a V-valued Function, loc, as: loc/.1 = i, loc/.3 = b, loc/.4 = n and loc/.5 = s, and the constant 1 is located in the location loc/.2 = j (set V represents simple names of considered nominative data [17]).The validity of the algorithm is presented in terms of semantic Floyd-Hoare triples over such data [9]. Proofs of the correctness are based on an inference system for an extended Floyd-Hoare logic [2],[4] with partial pre- and post-conditions [14],[16],[7],[5].Institute of Informatics, University of Białystok, PolandGrzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, and Karol Pąk. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9–32, 2018. doi:10.1007/s10817-017-9440-6.R.W. Floyd. Assigning meanings to programs. Mathematical aspects of computer science, 19(19–32), 1967.Adam Grabowski, Artur Korniłowicz, and Adam Naumowicz. Four decades of Mizar. Journal of Automated Reasoning, 55(3):191–198, 2015. doi:10.1007/s10817-015-9345-1.C.A.R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10): 576–580, 1969.Ievgen Ivanov and Mykola Nikitchenko. On the sequence rule for the Floyd-Hoare logic with partial pre- and post-conditions. In Proceedings of the 14th International Conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer. Volume II: Workshops, Kyiv, Ukraine, May 14–17, 2018, volume 2104 of CEUR Workshop Proceedings, pages 716–724, 2018.Ievgen Ivanov, Mykola Nikitchenko, Andrii Kryvolap, and Artur Korniłowicz. Simple-named complex-valued nominative data – definition and basic operations. Formalized Mathematics, 25(3):205–216, 2017. doi:10.1515/forma-2017-0020.Ievgen Ivanov, Artur Korniłowicz, and Mykola Nikitchenko. Implementation of the composition-nominative approach to program formalization in Mizar. The Computer Science Journal of Moldova, 26(1):59–76, 2018.Ievgen Ivanov, Artur Korniłowicz, and Mykola Nikitchenko. On an algorithmic algebra over simple-named complex-valued nominative data. Formalized Mathematics, 26(2):149–158, 2018. doi:10.2478/forma-2018-0012.Ievgen Ivanov, Artur Korniłowicz, and Mykola Nikitchenko. An inference system of an extension of Floyd-Hoare logic for partial predicates. Formalized Mathematics, 26(2): 159–164, 2018. doi:10.2478/forma-2018-0013.Ievgen Ivanov, Artur Korniłowicz, and Mykola Nikitchenko. Partial correctness of GCD algorithm. Formalized Mathematics, 26(2):165–173, 2018. doi:10.2478/forma-2018-0014.Ievgen Ivanov, Artur Korniłowicz, and Mykola Nikitchenko. On algebras of algorithms and specifications over uninterpreted data. Formalized Mathematics, 26(2):141–147, 2018. doi:10.2478/forma-2018-0011.Artur Kornilowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the algebra of nominative data in Mizar. In Maria Ganzha, Leszek A. Maciaszek, and Marcin Paprzycki, editors, Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, FedCSIS 2017, Prague, Czech Republic, September 3–6, 2017., pages 237–244, 2017. ISBN 978-83-946253-7-5. doi:10.15439/2017F301.Artur Kornilowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the nominative algorithmic algebra in Mizar. In Leszek Borzemski, Jerzy Świątek, and Zofia Wilimowska, editors, Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology – ISAT 2017 – Part II, Szklarska Poręba, Poland, September 17–19, 2017, volume 656 of Advances in Intelligent Systems and Computing, pages 176–186. Springer, 2017. ISBN 978-3-319-67228-1. doi:10.1007/978-3-319-67229-8_16.Artur Korniłowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. An approach to formalization of an extension of Floyd-Hoare logic. In Vadim Ermolayev, Nick Bassiliades, Hans-Georg Fill, Vitaliy Yakovyna, Heinrich C. Mayr, Vyacheslav Kharchenko, Vladimir Peschanenko, Mariya Shyshkina, Mykola Nikitchenko, and Aleksander Spivakovsky, editors, Proceedings of the 13th International Conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer, Kyiv, Ukraine, May 15–18, 2017, volume 1844 of CEUR Workshop Proceedings, pages 504–523. CEUR-WS.org, 2017.Artur Korniłowicz, Ievgen Ivanov, and Mykola Nikitchenko. Kleene algebra of partial predicates. Formalized Mathematics, 26(1):11–20, 2018. doi:10.2478/forma-2018-0002.Andrii Kryvolap, Mykola Nikitchenko, and Wolfgang Schreiner. Extending Floyd-Hoare logic for partial pre- and postconditions. In Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, and Grygoriy Zholtkevych, editors, Information and Communication Technologies in Education, Research, and Industrial Applications: 9th International Conference, ICTERI 2013, Kherson, Ukraine, June 19–22, 2013, Revised Selected Papers, pages 355–378. Springer International Publishing, 2013. ISBN 978-3-319-03998-5. doi:10.1007/978-3-319-03998-5_18.Volodymyr G. Skobelev, Mykola Nikitchenko, and Ievgen Ivanov. On algebraic properties of nominative data and functions. In Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, and Grygoriy Zholtkevych, editors, Information and Communication Technologies in Education, Research, and Industrial Applications – 10th International Conference, ICTERI 2014, Kherson, Ukraine, June 9–12, 2014, Revised Selected Papers, volume 469 of Communications in Computer and Information Science, pages 117–138. Springer, 2014. ISBN 978-3-319-13205-1. doi:10.1007/978-3-319-13206-8_6.27218919

Novel Artificial Human Optimization Field Algorithms - The Beginning

New Artificial Human Optimization (AHO) Field Algorithms can be created from scratch or by adding the concept of Artificial Humans into other existing Optimization Algorithms. Particle Swarm Optimization (PSO) has been very popular for solving complex optimization problems due to its simplicity. In this work, new Artificial Human Optimization Field Algorithms are created by modifying existing PSO algorithms with AHO Field Concepts. These Hybrid PSO Algorithms comes under PSO Field as well as AHO Field. There are Hybrid PSO research articles based on Human Behavior, Human Cognition and Human Thinking etc. But there are no Hybrid PSO articles which based on concepts like Human Disease, Human Kindness and Human Relaxation. This paper proposes new AHO Field algorithms based on these research gaps. Some existing Hybrid PSO algorithms are given a new name in this work so that it will be easy for future AHO researchers to find these novel Artificial Human Optimization Field Algorithms. A total of 6 Artificial Human Optimization Field algorithms titled "Human Safety Particle Swarm Optimization (HuSaPSO)", "Human Kindness Particle Swarm Optimization (HKPSO)", "Human Relaxation Particle Swarm Optimization (HRPSO)", "Multiple Strategy Human Particle Swarm Optimization (MSHPSO)", "Human Thinking Particle Swarm Optimization (HTPSO)" and "Human Disease Particle Swarm Optimization (HDPSO)" are tested by applying these novel algorithms on Ackley, Beale, Bohachevsky, Booth and Three-Hump Camel Benchmark Functions. Results obtained are compared with PSO algorithm.Comment: 25 pages, 41 figure