الصفحة 1
الصفحة 1
Mathematical Morphology : 40 Years On ; Proceedings of the 7th International Symposium on Mathematical Morphology, April 18-20, 2005
Mathematical Morphology is a speciality in Image Processing and Analysis, which considers images as geometrical objects, to be analyzed through their interactions with other geometrical objects. It relies on several branches of mathematics, such as discrete geometry, topology, lattice theory, partial differential equations, integral geometry and geometrical probability. It has produced fast and efficient algorithms for computer analysis of images, and has found applications in bio-medical imaging, materials science, geoscience, remote sensing, quality control, document processing and data analysis. This book contains the 43 papers presented at the 7th International Symposium on Mathematical Morphology, held in Paris on April 18-20, 2005. It gives a lively state of the art of current research topics in this field. It also marks a milestone, the 40 years of uninterrupted development of this ever-expanding domain.
Hexagonal image processing : A practical approach
Hexagonal Image Processing provides an introduction to the processing of hexagonally sampled images, includes a survey of the work done in the field, and presents a novel framework for hexagonal image processing (HIP) based on hierarchical aggregates. Digital image processing is currently dominated by the use of square sampling lattices, however, hexagonal sampling lattices can also be used to define digital images. The strengths offered by hexagonal lattices over square lattices are considerable: • higher packing density, • uniform connectivity of points (pixels) in the lattice, • better angular resolution by virtue of having more nearest neighbours, and • superlative representation of curves. The utility of the HIP framework is demonstrated by implementing several basic image processing techniques (for the spatial and frequency domain) and some applications. The HIP framework serves as a tool for comparing processing of images defined on a square vs hexagonal grid, to determine their relative merits and demerits. The theory and algorithms covered are supplemented by attention to practical details such as accommodating hardware that support only images sampled on a square lattice. Including a Foreword written by Professor Narendra Ahuja, an eminent researcher in the field of Image Processing and Computer Vision, the book’s fresh approach to the subject offers insight and workable know-how to both researchers and postgraduates.
Graph structures for knowledge representation and reasoning ; 6th International Workshop, GKR 2020, virtual event, September 5, 2020, revised selected papers
This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Workshop on Graph Structures for Knowledge Representation and Reasoning, GKR 2020, held virtually in September 2020, associated with ECAI 2020, the 24th European Conference on Artificial Intelligence.
Formal concept analysis ; Vol. 3874 ; 4th International Conference, ICFCA 2006, Dresden, Germany, Feburary 13-17, 2006, Proceedings
This book constitutes the refereed proceedings of the 4th International Conference on Formal Concept Analysis, held in February 2006. The 17 revised full papers presented together with four invited papers were carefully reviewed and selected for inclusion in the book. The papers show advances in applied lattice and order theory and in particular scientific advances related to formal concept analysis and its practical applications: data and knowledge processing including data visualization, information retrieval, machine learning, data analysis and knowledge management.
Formal concept analysis ; Vol. 3403 ; 3rd International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings
This book constitutes a comprehensive and systematic presentation of the state of the art of formal concept analysis and its applications. The first part of the book is devoted to foundational and methodological topics. The contributions in the second part demonstrate how formal concept analysis is successfully used outside of mathematics, in linguistics, text retrieval, association rule mining, data analysis, and economics. The third part presents applications in software engineering.
Formal Concept Analysis ; 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008. Proceedings
Formal Concept Analysis (FCA) is a mathematical theory of concepts and c- ceptual hierarchyleadingto methods for conceptually analyzing data and kno- edge. The theory itselfstronglyreliesonorder and lattice theory,whichhasbeen studied by mathematicians over decades. FCA proved itself highly relevant in several applications from the beginning , and, over the last years, the range of application shaskept growing. The mainreasonfor this comesfromthe fact that our modern society has turned into an “information” society. After years and years of using computers, companies realized they had stored gigantic amounts of data.
Formal Concept Analysis ; 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings
This book constitutes the refereed proceedings of the 5th International Conference on Formal Concept Analysis, ICFCA 2007. The papers comprise state of the art research from foundational to applied lattice theory and related fields, all of which involve methods and techniques of formal concept analysis such as data visualization, information retrieval, machine learning, data analysis and knowledge management.
Discrete Geometry, Combinatorics and Graph Theory ; 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Revised Selected Papers
Theis book includes discrete algorithmic geometry, combinatorics and graph theory
Discrete and computational geometry; Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004
This book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2004, held in Tokyo, Japan in October 2004, to honor Janos Pach on his fiftieth year. The 20 revised full papers presented were carefully selected during two rounds of reviewing and improvement from over 60 talks at the conference. All current issues in discrete algorithmic geometry are addressed.
Cryptology and Network Security ; 19th International Conference, CANS 2020, Vienna, Austria, December 14–16, 2020, Proceedings
This book constitutes the refereed proceedings of the 19th International Conference on Cryptology and Network Security, CANS 2020, held in Vienna, Austria, in December 2020.* The 30 full papers were carefully reviewed and selected from 118 submissions. The papers focus on topics such as cybersecurity; credentials; elliptic curves; payment systems; privacy-enhancing tools; lightweight cryptography; and codes and lattices.
Cryptography and cryptanalysis in Java : Creating and programming advanced algorithms with Java SE 17 LTS and Jakarta EE 10
Includes challenging cryptographic solutions that are implemented in Java 17 and Jakarta EE 10. It provides a robust introduction to Java 17's new features and updates, a roadmap for Jakarta EE 10 security mechanisms, a unique presentation of the "hot points" (advantages and disadvantages) from the Java Cryptography Architecture (JCA), and more. You Will Learn : Develop programming skills for writing cryptography algorithms in Java / Dive into security schemes and modules using Java / Explore “good” vs “bad” cryptography based on processing execution times and reliability / Play with pseudo-random generators, hash functions, etc. / Leverage lattice-based cryptography methods, the NTRU framework library, and more
Concept Lattices and Their Applications ; Fourth International Conference, CLA 2006 Tunis, Tunisia, October 30-November 1, 2006 Selected Papers
This book constitutes the refereed proceedings of the Fourth International Conference on Concept Lattices and their Applications, CLA 2006, held in Tunis, Tunisia, October 30-November 1, 2006.
Bilinear integrable systems : From classical to quantum, continuous to discrete ; Proceedings of the NATO Advanced Research Workshop on Bilinear Integrable Systems: From Classical to Quantum, Continuous to Discrete St. Petersburg, Russia, 15-19 September 2002
Trained as a physicistin his home university Kyushu University, Professor Hirota earned his PhD in’61 at Northwestern University with Professor Siegert in the field of “QuantumStatistical mechanics”. He wrote a widely appreciated Doctoral dissertation on“Functional Integral representation of the grand partition function”. As a youngresearcher, he entered the RCA Company in Tokyo to do research on semi-conductor plasmas. Professor Hirota was led to model the Toda lattice as a non-linear networkof ladder-type LC circuits. The self-dual case led to equations very reminiscentof the Sine-Gordon equation, with much the same features (existence of onesoliton, soliton-soliton interaction, etc)
Automorphic Forms and Lie Superalgebras
Most known examples of Lie superalgebras with a related automorphic form such as the Fake Monster Lie algebra whose reflection group is given by the Leech lattice arise from (super)string theory and can be derived from lattice vertex algebras. The No-Ghost Theorem from dual resonance theory and a conjecture of Berger-Li-Sarnak on the eigenvalues of the hyperbolic Laplacian provide strong evidence that they are of rank at most 26.The aim of this book is to give the reader the tools to understand the ongoing classification and construction project of this class of Lie superalgebras and is ideal for a graduate course.
Automorphic forms and even unimodular lattices : Kneser neighbors of niemeier lattices
This book includes a self-contained approach of the general theory of quadratic forms and integral Euclidean lattices.It explains how the new advances in the Langlands program mentioned above pave the way for a solution. This study proves to be very rich, leading us to classical themes such as theta series, Siegel modular forms, the triality principle, L-functions and congruences between Galois representations.
Applied cryptography and network security ; 19th International Conference, ACNS 2021, Kamakura, Japan, June 21–24, 2021, Proceedings, Part I
The two-volume set LNCS 12726 + 12727 constitutes the proceedings of the 19th International Conference on Applied Cryptography and Network Security, ACNS 2021, which took place virtually during June 21-24, 2021. The 37 full papers presented in the proceedings were carefully reviewed and selected from a total of 186 submissions. They were organized in topical sections as follows: Part I: Cryptographic protocols; secure and fair protocols; cryptocurrency and smart contracts; digital signatures; embedded system security; lattice cryptography; Part II: Analysis of applied systems; secure computations; cryptanalysis; system security; and cryptography and its applications.
Applied algebra, algebraic algorithms and error-correcting codes ; 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007, Proceedings
Among the subjects addressed are block codes, including list-decoding algorithms; algebra and codes: rings, fields, algebraic geometry codes; algebra: rings and fields, polynomials, permutations, lattices; cryptography: cryptanalysis and complexity; computational algebra: algebraic algorithms and transforms; sequences and boolean functions.
Applied algebra, algebraic algorithms and error-correcting codes ; 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings
This book constitutes the refereed proceedings of the 16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16, held in Las Vegas, NV, USA in February 2006. The 25 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 32 submissions. Among the subjects addressed are block codes; algebra and codes: rings, fields, and AG codes; cryptography; sequences; decoding algorithms; and algebra: constructions in algebra, Galois groups, differential algebra, and polynomials.
Algorithmic number theory ; 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings
This book constitutes the refereed proceedings of the 7th International Algorithmic Number Theory Symposium, ANTS 2006, held in Berlin, July 2006. The book presents 37 revised full papers together with 4 invited papers selected for inclusion. The papers are organized in topical sections on algebraic number theory, analytic and elementary number theory, lattices, curves and varieties over fields of characteristic zero, curves over finite fields and applications, and discrete logarithms.
Algebraic and Proof-theoretic Aspects of Non-classical Logics : Papers in Honor of Daniele Mundici on the Occasion of His 60th Birthday
It profound connections between logic and such diverse fields of research as functional analysis, probability and measure theory, the geometry of toric varieties, piecewise linear geometry, and error-correcting codes. Several prominent logicians, mathematicians, and computer scientists
