Resultado de la búsqueda
6 búsqueda de la palabra clave 'Meanings'
Refinar búsqueda Generar rss de la búsqueda
Link de la búsquedaBusiness Process Management / SpringerLink (Online service) ; Florian Daniel ; Jianmin Wang ; Barbara Weber (2013)
Título : Business Process Management : 11th International Conference, BPM 2013, Beijing, China, August 26-30, 2013. Proceedings Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Florian Daniel ; Jianmin Wang ; Barbara Weber Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2013 Otro editor: Imprint: Springer Colección: Lecture Notes in Computer Science, ISSN 0302-9743 num. 8094 Número de páginas: XVI, 355 p. 124 illus Il.: online resource ISBN/ISSN/DL: 978-3-642-40176-3 Idioma : Inglés (eng) Palabras clave: Business Information technology Data processing Software engineering Computer logic Application software Management information systems science and IT in Logics Meanings of Programs Engineering Appl. Administrative Processing Computing Systems Clasificación: 658 Empresas. Organización de empresas Resumen: This book constitutes the proceedings of the 11th International Conference on Business Process Management, BPM 2013, held in Beijing, China, in August 2013. The 17 regular papers and 8 short papers included in this volume were carefully reviewed and selected from 118 submissions. The papers are organized in 7 topical sections named: process mining; conformance checking; process data; process model matching; process architectures and collaboration; as well as alternative perspectives, and industry paper Nota de contenido: Keynotes -- Moneyball for nanoHUB: Theory-driven and Data-driven Approaches to understand the Formation and Success of Software Development Teams -- Towards the Next Generation Intelligent BPM - In the Era of Big Data -- BPM In The Cloud -- Process mining -- Bridging Abstraction Layers in Process Mining by automated Matching of Events and Activities -- Mining Configurable Process Models from Collections of Event Logs -- Slice, Mine and Dice: Complexity-Aware Automated Discovery of Business Process Models -- Business Process Mining from Ecommerce Web logs -- Discovering Data-Aware Declarative Process Models from Event Logs -- Enhancing Declare Maps Based on Event Correlations -- Conformance checking -- Aligning Event Logs and Process Models for Multi-Perspective Conformance Checking: An Approach Based on Integer Linear Programming -- Conformance Checking in the Large: Partitioning and Topology -- On Enabling Compliance of Cross-organizational Business Processes -- Process data -- Verification of Query Completeness over Processes -- Modeling and Enacting Complex Data Dependencies in Business Processes -- Event Stream Processing Units in Business Processes -- Process model matching -- Predicting the Quality of Process Model Matching -- Increasing Recall of Process Model Matching by Improved Activity Label Matching -- A Visualization Approach for Difference Analysis of Process Models and Instance Traffic -- Process architectures and collaboration -- Business Process Architectures with Multiplicities: Transformation and Correctness -- Optimal resource assignment in workflows for maximizing cooperation -- Accelerating Collaboration in Task Assignment Using a Socially Enhanced Resource Model -- Alternative perspectives -- Splitting GSM Schemas: A Framework for Outsourcing of Declarative Artifact Systems -- Composing Workflow Activities on the Basis of Dataflow Structures -- Mixing Paradigms for More Comprehensible Models -- Industry papers -- An Agile BPM Project Methodology -- Declarative Modeling - An Academic Dream or the Future for BPM? -- Investigating Clinical Care Pathways Correlated With Outcomes -- Exformatics Declarative Case Management Workflows as DCR Graphs En línea: http://dx.doi.org/10.1007/978-3-642-40176-3 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=36623 Business Process Management : 11th International Conference, BPM 2013, Beijing, China, August 26-30, 2013. Proceedings [documento electrónico] / SpringerLink (Online service) ; Florian Daniel ; Jianmin Wang ; Barbara Weber . - Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013 . - XVI, 355 p. 124 illus : online resource. - (Lecture Notes in Computer Science, ISSN 0302-9743; 8094) .
ISBN : 978-3-642-40176-3
Idioma : Inglés (eng)
Palabras clave: Business Information technology Data processing Software engineering Computer logic Application software Management information systems science and IT in Logics Meanings of Programs Engineering Appl. Administrative Processing Computing Systems Clasificación: 658 Empresas. Organización de empresas Resumen: This book constitutes the proceedings of the 11th International Conference on Business Process Management, BPM 2013, held in Beijing, China, in August 2013. The 17 regular papers and 8 short papers included in this volume were carefully reviewed and selected from 118 submissions. The papers are organized in 7 topical sections named: process mining; conformance checking; process data; process model matching; process architectures and collaboration; as well as alternative perspectives, and industry paper Nota de contenido: Keynotes -- Moneyball for nanoHUB: Theory-driven and Data-driven Approaches to understand the Formation and Success of Software Development Teams -- Towards the Next Generation Intelligent BPM - In the Era of Big Data -- BPM In The Cloud -- Process mining -- Bridging Abstraction Layers in Process Mining by automated Matching of Events and Activities -- Mining Configurable Process Models from Collections of Event Logs -- Slice, Mine and Dice: Complexity-Aware Automated Discovery of Business Process Models -- Business Process Mining from Ecommerce Web logs -- Discovering Data-Aware Declarative Process Models from Event Logs -- Enhancing Declare Maps Based on Event Correlations -- Conformance checking -- Aligning Event Logs and Process Models for Multi-Perspective Conformance Checking: An Approach Based on Integer Linear Programming -- Conformance Checking in the Large: Partitioning and Topology -- On Enabling Compliance of Cross-organizational Business Processes -- Process data -- Verification of Query Completeness over Processes -- Modeling and Enacting Complex Data Dependencies in Business Processes -- Event Stream Processing Units in Business Processes -- Process model matching -- Predicting the Quality of Process Model Matching -- Increasing Recall of Process Model Matching by Improved Activity Label Matching -- A Visualization Approach for Difference Analysis of Process Models and Instance Traffic -- Process architectures and collaboration -- Business Process Architectures with Multiplicities: Transformation and Correctness -- Optimal resource assignment in workflows for maximizing cooperation -- Accelerating Collaboration in Task Assignment Using a Socially Enhanced Resource Model -- Alternative perspectives -- Splitting GSM Schemas: A Framework for Outsourcing of Declarative Artifact Systems -- Composing Workflow Activities on the Basis of Dataflow Structures -- Mixing Paradigms for More Comprehensible Models -- Industry papers -- An Agile BPM Project Methodology -- Declarative Modeling - An Academic Dream or the Future for BPM? -- Investigating Clinical Care Pathways Correlated With Outcomes -- Exformatics Declarative Case Management Workflows as DCR Graphs En línea: http://dx.doi.org/10.1007/978-3-642-40176-3 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=36623 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Cellular Automata and Groups Tipo de documento: documento electrónico Autores: Tullio Ceccherini-Silberstein ; SpringerLink (Online service) ; Michel Coornaert Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2010 Colección: Springer Monographs in Mathematics, ISSN 1439-7382 Número de páginas: XX, 440 p. 52 illus Il.: online resource ISBN/ISSN/DL: 978-3-642-14034-1 Idioma : Inglés (eng) Palabras clave: Computer science logic Algebra Dynamics Ergodic theory Science Logics and Meanings of Programs Dynamical Systems Theory Clasificación: 51 Matemáticas Resumen: Cellular automata were introduced in the first half of the last century by John von Neumann who used them as theoretical models for self-reproducing machines. The authors present a self-contained exposition of the theory of cellular automata on groups and explore its deep connections with recent developments in geometric group theory, symbolic dynamics, and other branches of mathematics and theoretical computer science. The topics treated include in particular the Garden of Eden theorem for amenable groups, and the Gromov-Weiss surjunctivity theorem as well as the solution of the Kaplansky conjecture on the stable finiteness of group rings for sofic groups. The volume is entirely self-contained, with 10 appendices and more than 300 exercises, and appeals to a large audience including specialists as well as newcomers in the field. It provides a comprehensive account of recent progress in the theory of cellular automata based on the interplay between amenability, geometric and combinatorial group theory, symbolic dynamics and the algebraic theory of group rings which are treated here for the first time in book form Nota de contenido: Cellular Automata -- Residually Finite Groups -- Surjunctive Groups -- Amenable Groups -- The Garden of Eden Theorem -- Finitely Generated Amenable Groups -- Local Embeddability and Sofic Groups -- Linear Cellular Automata -- Nets and the Tychonoff Product Theorem -- Uniform Structures -- Symmetric Groups -- Free Groups -- Inductive Limits and Projective Limits of Groups -- The Banach-Alaoglu Theorem -- The Markov-Kakutani Fixed Point Theorem -- The Hall Harem Theorem -- Complements of Functional Analysis -- Ultrafilters En línea: http://dx.doi.org/10.1007/978-3-642-14034-1 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33766 Cellular Automata and Groups [documento electrónico] / Tullio Ceccherini-Silberstein ; SpringerLink (Online service) ; Michel Coornaert . - Berlin, Heidelberg : Springer Berlin Heidelberg, 2010 . - XX, 440 p. 52 illus : online resource. - (Springer Monographs in Mathematics, ISSN 1439-7382) .
ISBN : 978-3-642-14034-1
Idioma : Inglés (eng)
Palabras clave: Computer science logic Algebra Dynamics Ergodic theory Science Logics and Meanings of Programs Dynamical Systems Theory Clasificación: 51 Matemáticas Resumen: Cellular automata were introduced in the first half of the last century by John von Neumann who used them as theoretical models for self-reproducing machines. The authors present a self-contained exposition of the theory of cellular automata on groups and explore its deep connections with recent developments in geometric group theory, symbolic dynamics, and other branches of mathematics and theoretical computer science. The topics treated include in particular the Garden of Eden theorem for amenable groups, and the Gromov-Weiss surjunctivity theorem as well as the solution of the Kaplansky conjecture on the stable finiteness of group rings for sofic groups. The volume is entirely self-contained, with 10 appendices and more than 300 exercises, and appeals to a large audience including specialists as well as newcomers in the field. It provides a comprehensive account of recent progress in the theory of cellular automata based on the interplay between amenability, geometric and combinatorial group theory, symbolic dynamics and the algebraic theory of group rings which are treated here for the first time in book form Nota de contenido: Cellular Automata -- Residually Finite Groups -- Surjunctive Groups -- Amenable Groups -- The Garden of Eden Theorem -- Finitely Generated Amenable Groups -- Local Embeddability and Sofic Groups -- Linear Cellular Automata -- Nets and the Tychonoff Product Theorem -- Uniform Structures -- Symmetric Groups -- Free Groups -- Inductive Limits and Projective Limits of Groups -- The Banach-Alaoglu Theorem -- The Markov-Kakutani Fixed Point Theorem -- The Hall Harem Theorem -- Complements of Functional Analysis -- Ultrafilters En línea: http://dx.doi.org/10.1007/978-3-642-14034-1 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33766 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Data Mining and Knowledge Discovery via Logic-Based Methods : Theory, Algorithms, and Applications Tipo de documento: documento electrónico Autores: Evangelos Triantaphyllou ; SpringerLink (Online service) Editorial: Boston, MA : Springer US Fecha de publicación: 2010 Colección: Springer Optimization and Its Applications, ISSN 1931-6828 num. 43 Número de páginas: XXXIV, 350 p. 91 illus., 9 illus. in color Il.: online resource ISBN/ISSN/DL: 978-1-4419-1630-3 Idioma : Inglés (eng) Palabras clave: Computer science Operations research Decision making logic Mathematical Data mining Management Science Mining and Knowledge Discovery Logics Meanings of Programs Logic Foundations Research, Formal Languages Operation Research/Decision Theory Clasificación: 51 Matemáticas Resumen: The importance of having efficient and effective methods for data mining and knowledge discovery (DM) is rapidly growing. This is due to the wide use of fast and affordable computing power and data storage media and also the gathering of huge amounts of data in almost all aspects of human activity and interest. While numerous methods have been developed, the focus of this book presents algorithms and applications using one popular method that has been formulated in terms of binary attributes, i.e., by Boolean functions defined on several attributes that are easily transformed into rules that can express new knowledge. This book presents methods that deal with key data mining and knowledge discovery issues in an intuitive manner, in a natural sequence, and in a way that can be easily understood and interpreted by a wide array of experts and end users. The presentation provides a unique perspective into the essence of some fundamental DM issues, many of which come from important real life applications such as breast cancer diagnosis. Applications and algorithms are accompanied by extensive experimental results and are presented in a way such that anyone with a minimum background in mathematics and computer science can benefit from the exposition. Rigor in mathematics and algorithmic development is not compromised and each chapter systematically offers some possible extensions for future research Nota de contenido: Algorithmic Issues -- Inferring a Boolean Function from Positive and Negative Examples -- A Revised Branch-and-Bound Approach for Inferring a Boolean Function from Examples -- Some Fast Heuristics for Inferring a Boolean Function from Examples -- An Approach to Guided Learning of Boolean Functions -- An Incremental Learning Algorithm for Inferring Boolean Functions -- A Duality Relationship Between Boolean Functions in CNF and DNF Derivable from the Same Training Examples -- The Rejectability Graph of Two Sets of Examples -- Application Issues -- The Reliability Issue in Data Mining: The Case of Computer-Aided Breast Cancer Diagnosis -- Data Mining and Knowledge Discovery by Means of Monotone Boolean Functions -- Some Application Issues of Monotone Boolean Functions -- Mining of Association Rules -- Data Mining of Text Documents -- First Case Study: Predicting Muscle Fatigue from EMG Signals -- Second Case Study: Inference of Diagnostic Rules for Breast Cancer -- A Fuzzy Logic Approach to Attribute Formalization: Analysis of Lobulation for Breast Cancer Diagnosis -- Conclusions En línea: http://dx.doi.org/10.1007/978-1-4419-1630-3 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33602 Data Mining and Knowledge Discovery via Logic-Based Methods : Theory, Algorithms, and Applications [documento electrónico] / Evangelos Triantaphyllou ; SpringerLink (Online service) . - Boston, MA : Springer US, 2010 . - XXXIV, 350 p. 91 illus., 9 illus. in color : online resource. - (Springer Optimization and Its Applications, ISSN 1931-6828; 43) .
ISBN : 978-1-4419-1630-3
Idioma : Inglés (eng)
Palabras clave: Computer science Operations research Decision making logic Mathematical Data mining Management Science Mining and Knowledge Discovery Logics Meanings of Programs Logic Foundations Research, Formal Languages Operation Research/Decision Theory Clasificación: 51 Matemáticas Resumen: The importance of having efficient and effective methods for data mining and knowledge discovery (DM) is rapidly growing. This is due to the wide use of fast and affordable computing power and data storage media and also the gathering of huge amounts of data in almost all aspects of human activity and interest. While numerous methods have been developed, the focus of this book presents algorithms and applications using one popular method that has been formulated in terms of binary attributes, i.e., by Boolean functions defined on several attributes that are easily transformed into rules that can express new knowledge. This book presents methods that deal with key data mining and knowledge discovery issues in an intuitive manner, in a natural sequence, and in a way that can be easily understood and interpreted by a wide array of experts and end users. The presentation provides a unique perspective into the essence of some fundamental DM issues, many of which come from important real life applications such as breast cancer diagnosis. Applications and algorithms are accompanied by extensive experimental results and are presented in a way such that anyone with a minimum background in mathematics and computer science can benefit from the exposition. Rigor in mathematics and algorithmic development is not compromised and each chapter systematically offers some possible extensions for future research Nota de contenido: Algorithmic Issues -- Inferring a Boolean Function from Positive and Negative Examples -- A Revised Branch-and-Bound Approach for Inferring a Boolean Function from Examples -- Some Fast Heuristics for Inferring a Boolean Function from Examples -- An Approach to Guided Learning of Boolean Functions -- An Incremental Learning Algorithm for Inferring Boolean Functions -- A Duality Relationship Between Boolean Functions in CNF and DNF Derivable from the Same Training Examples -- The Rejectability Graph of Two Sets of Examples -- Application Issues -- The Reliability Issue in Data Mining: The Case of Computer-Aided Breast Cancer Diagnosis -- Data Mining and Knowledge Discovery by Means of Monotone Boolean Functions -- Some Application Issues of Monotone Boolean Functions -- Mining of Association Rules -- Data Mining of Text Documents -- First Case Study: Predicting Muscle Fatigue from EMG Signals -- Second Case Study: Inference of Diagnostic Rules for Breast Cancer -- A Fuzzy Logic Approach to Attribute Formalization: Analysis of Lobulation for Breast Cancer Diagnosis -- Conclusions En línea: http://dx.doi.org/10.1007/978-1-4419-1630-3 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33602 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Instruction Sequences for Computer Science Tipo de documento: documento electrónico Autores: Jan A. Bergstra ; SpringerLink (Online service) ; Cornelis A. Middelburg Editorial: Paris : Atlantis Press Fecha de publicación: 2012 Colección: Atlantis Studies in Computing, ISSN 2212-8557 num. 2 Número de páginas: XVI, 232 p Il.: online resource ISBN/ISSN/DL: 978-94-91216-65-7 Idioma : Inglés (eng) Palabras clave: Computer science organization Programming languages (Electronic computers) Computers logic Mathematical Science Computation by Abstract Devices Logics and Meanings of Programs Logic Formal Languages Languages, Compilers, Interpreters Systems Organization Communication Networks Clasificación: 51 Matemáticas Resumen: This book demonstrates that the concept of an instruction sequence offers a novel and useful viewpoint on issues relating to diverse subjects in computer science. Selected issues relating to well-known subjects from the theory of computation and the area of computer architecture are rigorously investigated in this book thinking in terms of instruction sequences. The subjects from the theory of computation, to wit the halting problem and non-uniform computational complexity, are usually investigated thinking in terms of a common model of computation such as Turing machines and Boolean circuits. The subjects from the area of computer architecture, to wit instruction sequence performance, instruction set architectures and remote instruction processing, are usually not investigated in a rigorous way at all Nota de contenido: Introduction -- Instruction Sequences -- Instruction Processing -- Expressiveness of Instruction Sequences -- Computation-Theoretic Issues -- Computer-Architectural Issues -- Instruction Sequences and Process Algebra -- Variations on a Theme -- Appendix A: Five Challenges for Projectionism -- Appendix B: Natural Number Functional Units -- Appendix C: Dynamically Instantiated Instructions -- Appendix D: Analytic Execution Architectures En línea: http://dx.doi.org/10.2991/978-94-91216-65-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33067 Instruction Sequences for Computer Science [documento electrónico] / Jan A. Bergstra ; SpringerLink (Online service) ; Cornelis A. Middelburg . - Paris : Atlantis Press, 2012 . - XVI, 232 p : online resource. - (Atlantis Studies in Computing, ISSN 2212-8557; 2) .
ISBN : 978-94-91216-65-7
Idioma : Inglés (eng)
Palabras clave: Computer science organization Programming languages (Electronic computers) Computers logic Mathematical Science Computation by Abstract Devices Logics and Meanings of Programs Logic Formal Languages Languages, Compilers, Interpreters Systems Organization Communication Networks Clasificación: 51 Matemáticas Resumen: This book demonstrates that the concept of an instruction sequence offers a novel and useful viewpoint on issues relating to diverse subjects in computer science. Selected issues relating to well-known subjects from the theory of computation and the area of computer architecture are rigorously investigated in this book thinking in terms of instruction sequences. The subjects from the theory of computation, to wit the halting problem and non-uniform computational complexity, are usually investigated thinking in terms of a common model of computation such as Turing machines and Boolean circuits. The subjects from the area of computer architecture, to wit instruction sequence performance, instruction set architectures and remote instruction processing, are usually not investigated in a rigorous way at all Nota de contenido: Introduction -- Instruction Sequences -- Instruction Processing -- Expressiveness of Instruction Sequences -- Computation-Theoretic Issues -- Computer-Architectural Issues -- Instruction Sequences and Process Algebra -- Variations on a Theme -- Appendix A: Five Challenges for Projectionism -- Appendix B: Natural Number Functional Units -- Appendix C: Dynamically Instantiated Instructions -- Appendix D: Analytic Execution Architectures En línea: http://dx.doi.org/10.2991/978-94-91216-65-7 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33067 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Logics in Computer Science : A Study on Extensions of Temporal and Strategic Logics Tipo de documento: documento electrónico Autores: Fabio Mogavero ; SpringerLink (Online service) Editorial: Paris : Atlantis Press Fecha de publicación: 2013 Colección: Atlantis Studies in Computing, ISSN 2212-8557 num. 3 Número de páginas: XVII, 149 p Il.: online resource ISBN/ISSN/DL: 978-94-91216-95-4 Idioma : Inglés (eng) Palabras clave: Computer science Algorithms logic Mathematical Science Logics and Meanings of Programs Logic Formal Languages Algorithm Analysis Problem Complexity Clasificación: 51 Matemáticas Resumen: In this monograph we introduce and examine four new temporal logic formalisms that can be used as specification languages for the automated verification of the reliability of hardware and software designs with respect to a desired behavior. The work is organized in two parts. In the first part two logics for computations, the graded computation tree logic and the computation tree logic with minimal model quantifiers are discussed. These have proved to be useful in describing correct executions of monolithic closed systems. The second part focuses on logics for strategies, strategy logic and memoryful alternating-time temporal logic, which have been successfully applied to formalize several properties of interactive plays in multi-entities systems modeled as multi-agent games Nota de contenido: Graded Computation Tree Logic -- Minimal Model Quantifiers -- Reasoning About Strategies -- Relentful Strategic Reasoning -- Appendix A Mathematical Notation En línea: http://dx.doi.org/10.2991/978-94-91216-95-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32655 Logics in Computer Science : A Study on Extensions of Temporal and Strategic Logics [documento electrónico] / Fabio Mogavero ; SpringerLink (Online service) . - Paris : Atlantis Press, 2013 . - XVII, 149 p : online resource. - (Atlantis Studies in Computing, ISSN 2212-8557; 3) .
ISBN : 978-94-91216-95-4
Idioma : Inglés (eng)
Palabras clave: Computer science Algorithms logic Mathematical Science Logics and Meanings of Programs Logic Formal Languages Algorithm Analysis Problem Complexity Clasificación: 51 Matemáticas Resumen: In this monograph we introduce and examine four new temporal logic formalisms that can be used as specification languages for the automated verification of the reliability of hardware and software designs with respect to a desired behavior. The work is organized in two parts. In the first part two logics for computations, the graded computation tree logic and the computation tree logic with minimal model quantifiers are discussed. These have proved to be useful in describing correct executions of monolithic closed systems. The second part focuses on logics for strategies, strategy logic and memoryful alternating-time temporal logic, which have been successfully applied to formalize several properties of interactive plays in multi-entities systems modeled as multi-agent games Nota de contenido: Graded Computation Tree Logic -- Minimal Model Quantifiers -- Reasoning About Strategies -- Relentful Strategic Reasoning -- Appendix A Mathematical Notation En línea: http://dx.doi.org/10.2991/978-94-91216-95-4 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=32655 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Permalink
