Browse Results

Select your format based upon: 1) how you want to read your book, and 2) compatibility with your reading tool. To learn more about using Bookshare with your device, visit the Help Center.

Here is an overview of the specialized formats that Bookshare offers its members with links that go to the Help Center for more information.

• Bookshare Web Reader - A customized reading tool for Bookshare members offering all the features of DAISY with a single click of the "Read Now" link.
• DAISY (Digital Accessible Information System) - A digital book file format. DAISY books from Bookshare are DAISY 3.0 text files that work with just about every type of access technology that reads text. Books that contain images will have the download option of ‘DAISY Text with Images’.
• BRF (Braille Refreshable Format) - Digital Braille for use with refreshable Braille devices and Braille embossers.
• MP3 (MPEG audio layer 3) - Provides audio only with no text. These books are created with a text-to-speech engine and spoken by Kendra, a high quality synthetic voice from Ivona. Any device that supports MP3 playback is compatible.
• DAISY Audio - Similar to the DAISY option above; however, this option uses MP3 files created with our text-to-speech engine that utilizes Ivonas Kendra voice. This format will work with Daisy Audio compatible players such as Victor Reader Stream and Read2Go.
• EPUB - A standard e-book format that can be read on many tools, such as iBooks, Readium or others.
• Word - Accessible Word output, which can be unzipped and opened in any tool that allows .docx files

Formal Aspects of Component Software: 13th International Conference, FACS 2016, Besançon, France, October 19-21, 2016, Revised Selected Papers (Lecture Notes in Computer Science #10231)

This book constitutes the thoroughly revised selected papers from the 13th International Conference on Formal Aspects of Component Software, FACS 2016, held in Besançon, France, in October 2016. The 11 full papers presented together with one tool paper and 3 invited papers were carefully reviewed and selected from 27 submissions. FACS 2016 is concerned with how formal methods can be used to make component-based and service-oriented software development succeed. Formal methods have provided a foundation for component-based software by successfully addressing challenging issues such as mathematical models for components, composition and adaptation, or rigorous approaches to verification, deployment, testing, and certification.

Formal Aspects of Component Software: 11th International Symposium, FACS 2014, Bertinoro, Italy, September 10-12, 2014, Revised Selected Papers (Lecture Notes in Computer Science #8997)

This book constitutes revised selected papers from the International Symposium on Formal Aspects of Component Software, FACS 2014, held in Bertinoro, Italy, in September 2014.The 20 full papers presented in this volume were carefully reviewed and selected from 44 submissions. They are organized in topical sections named: compositional approaches; adaptation and evolution; application and experience; tools; scheduling, time and hybrid systems; other verification approaches and safety and liveness of composition. The volume also contains two invited talks, one full paper and one abstract.

Formal Aspects of Component Software: 9th International Symposium, FACS 2012, Mountain View, CA, USA, September 11-13, 2012. Revised Selected Papers (Lecture Notes in Computer Science #7684)

This book constitutes the revised selected papers of the 9th International Symposium on Formal Aspects of Component Software, FACS 2012, held in Mountain View, CA, USA in September 2012. The 16 full papers presented were carefully reviewed and selected from 40 submissions. They cover topics such as formal models for software components and their interaction; formal aspects of services, service oriented architectures, business processes, and cloud computing; design and verification methods for software components and services; composition and deployment: models, calculi, languages; formal methods and modeling languages for components and services; model based and GUI based testing of components and services; models for QoS and other extra-functional properties (e.g., trust, compliance, security) of components and services; components for real-time, safety-critical, secure, and/or embedded systems; industrial or experience reports and case studies; update and reconfiguration of component and service architectures; component systems evolution and maintenance; autonomic components and self-managed applications; formal and rigorous approaches to software adaptation and self-adaptive systems.

Formal Aspects of Component Software: 14th International Conference, FACS 2017, Braga, Portugal, October 10-13, 2017, Proceedings (Lecture Notes in Computer Science #10487)

This book constitutes the thoroughly revised selected papers from the 14th International Conference on Formal Aspects of Component Software, FACS 2017, held in Braga, Portugal, in October 2017. The 14 full papers presented were carefully reviewed and selected from 26 submissions. FACS 2016 is concerned with how formal methods can be used to make component-based and service-oriented software development succeed. Formal methods have provided a foundation for component-based software by successfully addressing challenging issues such as mathematical models for components, composition and adaptation, or rigorous approaches to verification, deployment, testing, and certification.

Formal Aspects of Component Software: 17th International Conference, FACS 2021, Virtual Event, October 28–29, 2021, Proceedings (Lecture Notes in Computer Science #13077)

This book constitutes the thoroughly revised selected papers from the 17th International Symposium, FACS 2021, which was hel virtually in October 2021.The 7 full papers and 1 short contribution were carefully reviewed and selected from 16 submissions and are presented in the volume together with 1 invited paper. FACS 2021 is concerned with how formal methods can be applied to component-based software and system development. The book is subdivided into two blocks: Modelling & Composition and Verification. Chapter "A Linear Parallel Algorithm to Compute Bisimulation and Relational Coarsest Partitions" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Formal Aspects of Component Software: 18th International Conference, FACS 2022, Virtual Event, November 10–11, 2022, Proceedings (Lecture Notes in Computer Science #13712)

This book constitutes the thoroughly revised selected papers from the 18th International Symposium, FACS 2022, which was held online in November 2022.The 12 full papers and 1 short paper were carefully reviewed and selected from 25 submissions. FACS 2021 is focusing on the areas of component software and formal methods in order to promote a deeper understanding of how formal methods can or should be used to make component-based software development succeed.

Formal Aspects of Context (Applied Logic Series #20)

We welcome Volume 20, Formal Aspects of Context. Context has always been recognised as strongly relevant to models in language, philosophy, logic and artifi­ cial intelligence. In recent years theoretical advances in these areas and especially in logic have accelerated the study of context in the international community. An annual conference is held and many researchers have come to realise that many of the old puzzles should be reconsidered with proper attention to context. The volume editors and contributors are from among the most active front-line researchers in the area and the contents shows how wide and vigorous this area is. There are strong scientific connections with earlier volumes in the series. I am confident that the appearance of this book in our series will help secure the study of context as an important area of applied logic. D.M.Gabbay INTRODUCTION This book is a result of the First International and Interdisciplinary Con­ ference on Modelling and Using Context, which was organised in Rio de Janeiro in January 1997, and contains a selection of the papers presented there, refereed and revised through a process of anonymous peer review. The treatment of contexts as bona-fide objects of logical formalisation has gained wide acceptance in recent years, following the seminal impetus by McCarthy in his 'lUring award address.

Formal Aspects of Measurement: Proceedings of the BCS-FACS Workshop on Formal Aspects of Measurement, South Bank University, London, 5 May 1991 (Workshops in Computing)

This book contains the eight invited papers presented at the workshop on Formal Aspects of Measurement held at South Bank University on 5th May 1991, organised by the British Computer Society's Special Interest Group on Formal Aspects of Computer Science (FACS). In addition, there are five papers which have been included because of their relevance to the subject of the workshop. The book represents something of a landmark in software engineering research. The British Computer Society's Special Interest Group on Formal Aspects of Computer Science (FACS) has an established reputa­ tion among researchers in formal methods of software specification, design and validation. These researchers have not in the past paid much attention to software measurement. Perhaps software measurement re­ search was felt to have emphasised its management potential at the expense of proper scientific foundations? At any rate, for the FACS group to host a workshop in this field is recognition of the significant body of formal measurement theories and techniques which has now become available to software engineers.

Formal Aspects of Security: First International Conference, FASec 2002, London, UK, December 16-18, 2002, Revised Papers (Lecture Notes in Computer Science #2629)

Formal Aspects of Security and Trust: 8th International Workshop, FAST 2011, Leuven, Belgium, September 12-14, 2011. Revised Selected Papers (Lecture Notes in Computer Science #7140)

This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Workshop on Formal Aspects of Security and Trust, FAST 2011, held in conjunction with the 16th European Symposium on Research in Computer Security, ESORICS 2011, in Leuven, Belgium in September 2011. The 15 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 42 submissions. The papers focus on security and trust policy models; security protocol design and analysis; formal models of trust and reputation; logics for security and trust; distributed trust management systems; trust-based reasoning; digital assets protection; data protection; privacy and ID issues; information flow analysis; language-based security; security and trust aspects of ubiquitous computing; validation/analysis tools; web service security/trust/privacy; grid security; security risk assessment; and case studies.

Formal Aspects of Security and Trust: 7th International Workshop, FAST 2010, Pisa, Italy, September 16-17, 2010. Revised Selected Papers (Lecture Notes in Computer Science #6561)

This book constitutes the thoroughly refereed post-proceedings of the 7th International Workshop on Formal Aspects of Security and Trust, FAST 2010, held as part of the 8th IEEE International Conference on Software Engineering and Formal Methods, SEFM 2010 in Pisa, Italy in September 2010. The 14 revised full papers presented together with one invited paper were carefully reviewed and selected from 42 submissions. The papers focus of formal aspects in security and trust policy models, security protocol design and analysis, formal models of trust and reputation, logics for security and trust, distributed trust management systems, trust-based reasoning, digital assets protection, data protection, privacy and id issues, information flow analysis, language-based security, security and trust aspects in ubiquitous computing, validation/analysis tools, web service security/trust/privacy, grid security, security risk assessment, and case studies.

The Formal Complexity of Natural Language (Studies in Linguistics and Philosophy #33)

Ever since Chomsky laid the framework for a mathematically formal theory of syntax, two classes of formal models have held wide appeal. The finite state model offered simplicity. At the opposite extreme numerous very powerful models, most notable transformational grammar, offered generality. As soon as this mathematical framework was laid, devastating arguments were given by Chomsky and others indicating that the finite state model was woefully inadequate for the syntax of natural language. In response, the completely general transformational grammar model was advanced as a suitable vehicle for capturing the description of natural language syntax. While transformational grammar seems likely to be adequate to the task, many researchers have advanced the argument that it is "too adequate. " A now classic result of Peters and Ritchie shows that the model of transformational grammar given in Chomsky's Aspects [IJ is powerful indeed. So powerful as to allow it to describe any recursively enumerable set. In other words it can describe the syntax of any language that is describable by any algorithmic process whatsoever. This situation led many researchers to reasses the claim that natural languages are included in the class of transformational grammar languages. The conclu­ sion that many reached is that the claim is void of content, since, in their view, it says little more than that natural language syntax is doable algo­ rithmically and, in the framework of modern linguistics, psychology or neuroscience, that is axiomatic.

Formal Concept Analysis: 13th International Conference, ICFCA 2015, Nerja, Spain, June 23-26, 2015, Proceedings (Lecture Notes in Computer Science #9113)

This book constitutes the refereed proceedings of the 13th International Conference on Formal Concept Analysis, ICFCA 2015, held in Neja, Spain, in June 2015. The 16 revised full papers presented were carefully reviewed and selected from 38 submissions. The topics in this volume cover theoretical aspects of FCA; methods and applications of FCA to different fields and enhanced FCA that show new trends in FCA, for instance, pattern structures of fuzzy FCA.

Formal Concept Analysis: 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings (Lecture Notes in Computer Science #12733)

This book constitutes the proceedings of the 16th International Conference on Formal Concept Analysis, ICFCA 2021, held in Strasbourg, France, in June/July 2021. The 14 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 32 submissions. The book also contains four invited contributions in full paper length. The research part of this volume is divided in five different sections. First, "Theory" contains compiled works that discuss advances on theoretical aspects of FCA. Second, the section "Rules" consists of contributions devoted to implications and association rules. The third section "Methods and Applications" is composed of results that are concerned with new algorithms and their applications. "Exploration and Visualization" introduces different approaches to data exploration.

Formal Concept Analysis: 11th International Conference, ICFCA 2013, Dresden, Germany, May 21-24, 2013, Proceedings (Lecture Notes in Computer Science #7880)

This book constitutes the refereed proceedings of the 11th International Conference on Formal Concept Analysis, ICFCA 2013, held in Dresden, Germany, in May 2013. The 15 regular papers presented in this volume were carefully reviewed and selected from 46 submissions. The papers present current research from a thriving theoretical community and a rapidly expanding range of applications in information and knowledge processing including data visualization and analysis (mining), knowledge management, as well as Web semantics, and software engineering. In addition the book contains a reprint of the first publication in english describing the seminal stem-base construction by Guigues and Duquenne; and a position paper pointing out potential future applications of FCA.

Formal Concept Analysis: 15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25–28, 2019, Proceedings (Lecture Notes in Computer Science #11511)

This book constitutes the proceedings of the 15th International Conference on Formal Concept Analysis, ICFCA 2019, held in Frankfurt am Main, Germany, in June 2019.The 15 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 36 submissions. The book also contains four invited contributions in full paper length. The field of Formal Concept Analysis (FCA) originated in the 1980s in Darmstadt as a subfield of mathematical order theory, with prior developments in other research groups. Its original motivation was to consider complete lattices as lattices of concepts, drawing motivation from philosophy and mathematics alike. FCA has since then developed into a wide research area with applications much beyond its original motivation, for example in logic, data mining, learning, and psychology.

Formal Concept Analysis: 10th International Conference, ICFCA 2012, Leuven, Belgium, May 7-10, 2012. Proceedings (Lecture Notes in Computer Science #7278)

This book constitutes the refereed proceedings of the 10th International Conference on Formal Concept Analysis, ICFCA 2012, held in Leuven, Belgium in May 2012. The 20 revised full papers presented together with 6 invited talks were carefully reviewed and selected from 68 submissions. The topics covered in this volume range from recent advances in machine learning and data mining; mining terrorist networks and revealing criminals; concept-based process mining; to scalability issues in FCA and rough sets.

Formal Concept Analysis: 17th International Conference, ICFCA 2023, Kassel, Germany, July 17–21, 2023, Proceedings (Lecture Notes in Computer Science #13934)

This book constitutes the proceedings of the 17th International Conference on Formal Concept Analysis, ICFCA 2023, which took place in Kassel, Germany, in July 2023.The 13 full papers presented in this volume were carefully reviewed and selected from 19 submissions. The International Conference on Formal Concept Analysis serves as a platform for researchers from FCA and related disciplines to showcase and exchange their research findings. The papers are organized in two topical sections, first "Theory" and second "Applications and Visualization".

Formal Concept Analysis: 7th International Conference, ICFCA 2009 Darmstadt, Germany, May 21-24, 2009 Proceedings (Lecture Notes in Computer Science #5548)

The discipline of formal concept analysis (FCA) is concerned with the form- ization of concepts and conceptual thinking. Built on the solid foundation of lattice and order theory, FCA is ?rst and foremost a mathematical discipline. However,its motivation andguiding principles arebasedon strongphilosophical underpinnings. In practice, FCA provides a powerful framework for the qua- tative, formal analysis of data, as demonstrated by numerous applications in diverse areas. Likewise, it emphasizes the aspect of human-centered information processing by employing visualization techniques capable of revealing inherent structure in data in an intuitively graspable way. FCA thereby contributes to structuring and navigating the ever-growing amount of information available in our evolving information society and supports the process of turning data into information and ultimately into knowledge. In response to an expanding FCA community, the International Conference on Formal Concept Analysis (ICFCA) was established to provide an annual opportunity for the exchange of ideas. Previous ICFCA conferences were held in Darmstadt (2003), Sydney (2004), Lens (2005), Dresden (2006), Clermont- Ferrand (2007), as well as Montreal (2008) and are evidence of vivid ongoing interest and activities in FCA theory and applications. ICFCA 2009 took place during May 21–24 at the University of Applied S- ences in Darmstadt. Beyond serving as a host of the very ?rst ICFCA in 2003, Darmstadt can be seen as the birthplace of FCA itself, where this discipline was introduced in the early 1980s and elaborated over the subsequent decades.

Formal Concept Analysis: Foundations and Applications (Lecture Notes in Computer Science #3626)

Formal concept analysis has been developed as a field of applied mathematics based on the mathematization of concept and concept hierarchy. It thereby allows us to mathematically represent, analyze, and construct conceptual structures. The formal concept analysis approach has been proven successful in a wide range of application fields. 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: Mathematical Foundations

This first textbook on formal concept analysis gives a systematic presentation of the mathematical foundations and their relations to applications in computer science, especially in data analysis and knowledge processing. Above all, it presents graphical methods for representing conceptual systems that have proved themselves in communicating knowledge. The mathematical foundations are treated thoroughly and are illuminated by means of numerous examples, making the basic theory readily accessible in compact form.

Formal Concept Analysis: 12th International Conference, ICFCA 2014, Cluj-Napoca, Romania , June 10-13, 2014. Proceedings (Lecture Notes in Computer Science #8478)

This book constitutes the refereed proceedings of the 12th International Conference on Formal Concept Analysis, ICFCA 2014, held in Cluj-Napoca, Romania, in June 2014. The 16 regular papers presented together with 3 invited talks were carefully reviewed and selected from 39 submissions. The papers in this volume cover a rich range of FCA aspects, such as theory, enhanced FCA. Knowledge discovery and knowledge spaces, as well as methods and applications. In addition the book contains a reprint of the first publication "Sub direct decomposition of concept lattices" by Rudolf Wille.

Formal Concept Analysis: Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings (Lecture Notes in Computer Science #3403)

This volume contains the Proceedings of ICFCA 2005, the 3rd International Conference on Formal Concept Analysis. The ICFCA conference series aims to be the premier forum for the publication of advances in applied lattice and order theory, and in particular scienti?c advances related to formal concept analysis. Formal concept analysis is a ?eld of applied mathematics with its mat- matical root in order theory, in particular in the theory of complete lattices. Researchers had long been aware of the fact that these ?elds have many - tential applications. Formal concept analysis emerged in the 1980s from e?orts to restructure lattice theory to promote better communication between lattice theorists and potential users of lattice theory. The key theme was the mathe- tization of concept and conceptual hierarchy. Since then, the ?eld has developed into a growing research area in its own right with a thriving theoretical com- nity and an increasing number of applications in data and knowledge processing, including data visualization, information retrieval, machine learning, data an- ysis and knowledge management. ICFCA2005re?ectedbothpracticalbene?tsandprogressinthefoundational theory of formal concept analysis. Algorithmic aspects were discussed as well as e?orts to broaden the ?eld. All regular papers appearing in this volume were refereed by at least two, in most cases three independent reviewers. The ?nal decision to accept the papers was arbitrated by the Program Chairs based on the referee reports. It was the involvement of the Program Committee and the Editorial Board that ensured the scienti?c quality of these proceedings.

Formal Concept Analysis: 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, Proceedings (Lecture Notes in Computer Science #10308)

This book constitutes the proceedings of the 14th International Conference on Formal Concept Analysis, ICFCA 2017, held in Rennes, France, in June 2017. The 13 full papers presented in this volume were carefully reviewed and selected from 37 submissions. The book also contains an invited contribution and a historical paper translated from German and originally published in “Die Klassifkation und ihr Umfeld”, edited by P. O. Degens, H. J. Hermes, and O. Opitz, Indeks-Verlag, Frankfurt, 1986.The field of Formal Concept Analysis (FCA) originated in the 1980s in Darmstadt as a subfield of mathematical order theory, with prior developments in other research groups. Its original motivation was to consider complete lattices as lattices of concepts, drawing motivation from philosophy and mathematics alike. FCA has since then developed into a wide research area with applications much beyond its original motivation, for example in logic, data mining, learning, and psychology.

Formal Concept Analysis: 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings (Lecture Notes in Computer Science #4390)

This book constitutes the refereed proceedings of the 5th International Conference on Formal Concept Analysis, ICFCA 2007, held in Clermont-Ferrand, France in February 2007. The 19 revised full papers presented together with 1 invited lecture 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.