1.

Record Nr.

UNINA9910683390903321

Titolo

Advances in Diagnostic Dermatopathology, from Histopathologic to Molecular Studies / / Yasuhiro Sakai, editor

Pubbl/distr/stampa

Basel : , : MDPI - Multidisciplinary Digital Publishing Institute, , 2023

ISBN

3-0365-6621-X

Descrizione fisica

1 online resource (144 pages)

Disciplina

615.778

Soggetti

Dermatopharmacology

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Sommario/riassunto

This reprint focuses on novel findings of diagnostic dermatopathology, such as diagnosable new morphological (histopathologic) findings, immunohistochemical and immunofluorescent markers, and molecular techniques. Dermatopathology is the most sophisticated area in anatomic pathology; we can easily observe superficial skin lesions using our eyes without the need for an invasive approach and can easily compare gross configurations to microscopic and immunohistochemical findings. Meanwhile, dermatopathology has recently focused on the study of various cutaneous diseases at the molecular biology level. Many cutaneous diseases are now being well-researched, and special attention is paid to keratoacanthoma, lichen sclerosus (et atrophicus), mycosis fungoides, atopic dermatitis, epidermolysis bullosa, extramammary Paget's disease, malignant melanoma, psoriasis, and secondary neoplasms associated with nevus sebaceous.



2.

Record Nr.

UNINA9910767575803321

Titolo

Algorithm Engineering and Experimentation : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers / / edited by Adam L. Buchsbaum, Jack Snoeyink

Pubbl/distr/stampa

Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001

ISBN

3-540-44808-X

Edizione

[1st ed. 2001.]

Descrizione fisica

1 online resource (VIII, 236 p.)

Collana

Lecture Notes in Computer Science, , 0302-9743 ; ; 2153

Disciplina

005.1

Soggetti

Computer programming

Database management

Algorithms

Data structures (Computer science)

Computer graphics

Numerical analysis

Programming Techniques

Database Management

Algorithm Analysis and Problem Complexity

Data Structures

Computer Graphics

Numeric Computing

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

ALENEX’01 -- Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems -- CNOP - A Package for Constrained Network Optimization -- The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests -- Network Tomography through End-to-End Measurements -- Experimental Results on Statistical Approaches to Page Replacement Policies -- Estimating Resemblance of MIDI Documents -- Experiments on Adaptive Set Intersections for Text Retrieval Systems -- PVD: A Stable Implementation for Computing



Voronoi Diagrams of Polygonal Pockets -- Hierarchical Clustering of Trees: Algorithms and Experiments -- Travel Planning with Self-Made Maps -- New Algorithmic Challenges Arising in Measurement-Driven Networking Research -- A Probabilistic Spell for the Curse of Dimensionality -- Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube -- An Empirical Study of a New Approach to Nearest Neighbor Searching -- Spectral Analysis for Data Mining -- Trade Off Between Compression and Search Times in Compact Suffix Array -- Implementation of a PTAS for Scheduling with Release Dates -- Biased Skip Lists for Highly Skewed Access Patterns.

Sommario/riassunto

This book constitutes the thoroughly refereed post-proceedings of the Third International Workshop on Algorithm Engineering and Experimentation, ALENEX 2001, held in Washington, DC, USA in January 2001.The 15 revised full papers presented together with the abstracts of three invited presentations have gone through two rounds of reviewing and revision and were selected from 31 submissions. Among the topics addressed are heuristics for approximation, network optimization, TSP, randomization, sorting, information retrieval, graph computations, tree clustering, scheduling, network algorithms, point set computations, searching, and data mining.