Visar resultat för..."Hamadi"

Muslim societies are struggling under the need for modernization and the drift towards Islamic fundamentalism. The balance between these two forces is struck differently in the various Muslim societies depending upon the constellation of groups as historical legacies. However, the tension is real. In this work, Jan-Erik Lane and Hamadi Redissi look at the underlying social consequences of religious beliefs to account for the political differences between major civilizations of the world against a background of the rise of modern capitalism. Offering a timely new appraisal of the political and social impact of Islam, this expanded second edition of Religion and Politics has been fully updated in line with new events and will be welcomed by political scientists and historians alike. In a readable and accessible style, this thought-provoking work raises the question of whether the tenets of Islam might be reconciled with the requirements of post-modernity.

Classical computer science textbooks tell us that some problems are 'hard'. Yet many areas, from machine learning and computer vision to theorem proving and software verification, have defined their own set of tools for effectively solving complex problems. Tractability provides an overview of these different techniques, and of the fundamental concepts and properties used to tame intractability. This book will help you understand what to do when facing a hard computational problem. Can the problem be modelled by convex, or submodular functions? Will the instances arising in practice be of low treewidth, or exhibit another specific graph structure that makes them easy? Is it acceptable to use scalable, but approximate algorithms? A wide range of approaches is presented through self-contained chapters written by authoritative researchers on each topic. As a reference on a core problem in computer science, this book will appeal to theoreticians and practitioners alike.

Muslim societies are struggling under the need for modernization and the drift towards Islamic fundamentalism. The balance between these two forces is struck differently in the various Muslim societies depending upon the constellation of groups as historical legacies. However, the tension is real. In this work, Jan-Erik Lane and Hamadi Redissi look at the underlying social consequences of religious beliefs to account for the political differences between major civilizations of the world against a background of the rise of modern capitalism. Offering a timely new appraisal of the political and social impact of Islam, this expanded second edition of Religion and Politics has been fully updated in line with new events and will be welcomed by political scientists and historians alike. In a readable and accessible style, this thought-provoking work raises the question of whether the tenets of Islam might be reconciled with the requirements of post-modernity.

This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units.The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP),  constraint programming (CP), stochastic local search (SLS), optimal path finding with A*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD).The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.

This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units.The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP),  constraint programming (CP), stochastic local search (SLS), optimal path finding with A*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD).The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.

Autonomous combinatorial search (AS) represents a new field in combinatorial problem solving. Its major standpoint and originality is that it considers that problem solvers must be capable of self-improvement operations. This is the first book dedicated to AS.

This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Conference on Learning and Intelligent Optimization, LION 6, held in Paris, France, in January 2012. The 23 long and 30 short revised papers were carefully reviewed and selected from a total of 99 submissions. The papers focus on the intersections and uncharted territories between machine learning, artificial intelligence, mathematical programming and algorithms for hard optimization problems. In addition to the paper contributions the conference also included 3 invited speakers, who presented forefront research results and frontiers, and 3 tutorial talks, which were crucial in bringing together the different components of LION community.

Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to feasible regions and using heuristics to efficiently explore these regions. Various mathematical formalisms may be used to express and tackle combinatorial problems, among them the constraint satisfaction problem (CSP) and the propositional satisfiability problem (SAT). These algorithms, or constraint solvers, apply search space reduction through inference techniques, use activity-based heuristics to guide exploration, diversify the searches through frequent restarts, and often learn from their mistakes.In this book the author focuses on knowledge sharing in combinatorial search, the capacity to generate and exploit meaningful information, such as redundant constraints, heuristic hints, and performance measures, during search, which can dramatically improve the performance of a constraint solver. Information can be shared between multiple constraint solvers simultaneously working on the same instance, or information can help achieve good performance while solving a large set of related instances. In the first case, information sharing has to be performed at the expense of the underlying search effort, since a solver has to stop its main effort to prepare and communicate the information to other solvers; on the other hand, not sharing information can incur a cost for the whole system, with solvers potentially exploring unfeasible spaces discovered by other solvers. In the second case, sharing performance measures can be done with little overhead, and the goal is to be able to tune a constraint solver in relation to the characteristics of a new instance – this corresponds to the selection of the most suitable algorithm for solving a given instance. The book is suitable for researchers, practitioners, and graduate students working in the areas of optimization, search, constraints, and computational complexity.

Decades of innovations in combinatorial problem solving have produced better and more complex algorithms. These new methods are better since they can solve larger problems and address new application domains. They are also more complex which means that they are hard to reproduce and often harder to fine-tune to the peculiarities of a given problem. This last point has created a paradox where efficient tools are out of reach of practitioners.Autonomous search (AS) represents a new research field defined to precisely address the above challenge. Its major strength and originality consist in the fact that problem solvers can now perform self-improvement operations based on analysis of the performances of the solving process -- including short-term reactive reconfiguration and long-term improvement through self-analysis of the performance, offline tuning and online control, and adaptive control and supervised control. Autonomous search "crosses the chasm" and provides engineers and practitioners with systems that are able to autonomously self-tune their performance while effectively solving problems. This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms.Autonomous search (AS) represents a new research field defined to precisely address the above challenge. Its major strength and originality consist in the fact that problem solvers can now perform self-improvement operations based on analysis of the performances of the solving process -- including short-term reactive reconfiguration and long-term improvement through self-analysis of the performance, offline tuning and online control, and adaptive control and supervised control. Autonomous search "crosses the chasm" and provides engineers and practitioners with systems that are able to autonomously self-tune their performance while effectively solving problems. This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms.This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms.This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms.

Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to feasible regions and using heuristics to efficiently explore these regions. Various mathematical formalisms may be used to express and tackle combinatorial problems, among them the constraint satisfaction problem (CSP) and the propositional satisfiability problem (SAT). These algorithms, or constraint solvers, apply search space reduction through inference techniques, use activity-based heuristics to guide exploration, diversify the searches through frequent restarts, and often learn from their mistakes.In this book the author focuses on knowledge sharing in combinatorial search, the capacity to generate and exploit meaningful information, such as redundant constraints, heuristic hints, and performance measures, during search, which can dramatically improve the performance of a constraint solver. Information can be shared between multiple constraint solvers simultaneously working on the same instance, or information can help achieve good performance while solving a large set of related instances. In the first case, information sharing has to be performed at the expense of the underlying search effort, since a solver has to stop its main effort to prepare and communicate the information to other solvers; on the other hand, not sharing information can incur a cost for the whole system, with solvers potentially exploring unfeasible spaces discovered by other solvers. In the second case, sharing performance measures can be done with little overhead, and the goal is to be able to tune a constraint solver in relation to the characteristics of a new instance – this corresponds to the selection of the most suitable algorithm for solving a given instance. The book is suitable for researchers, practitioners, and graduate students working in the areas of optimization, search, constraints, and computational complexity.

Challenging the traditional conception of medieval Europe as insular and even xenophobic, Shirin A. Khanmohamadi's In Light of Another's Word looks to early ethnographic writers who were surprisingly aware of their own otherness, especially when faced with the far-flung peoples and cultures they meant to describe. These authors-William of Rubruck among the Mongols, "John Mandeville" cataloguing the world's diverse wonders, Geraldus Cambrensis describing the manners of the twelfth-century Welsh, and Jean de Joinville in his account of the various Saracens encountered on the Seventh Crusade-display an uncanny ability to see and understand from the perspective of the very strangers who are their subjects.Khanmohamadi elaborates on a distinctive late medieval ethnographic poetics marked by both a profound openness to alternative perspectives and voices and a sense of the formidable threat of such openness to Europe's governing religious and cultural orthodoxies. That we can hear the voices of medieval Europe's others in these narratives in spite of such orthodoxies allows us to take full measure of the productive forces of disorientation and destabilization at work on these early ethnographic writers.Poised at the intersection of medieval studies, anthropology, and visual culture, In Light of Another's Word is an innovative departure from each, extending existing studies of medieval travel writing into the realm of poetics, of ethnographic form into the premodern realm, and of early visual culture into the realm of ethnographic encounter.

This is the first scholarly study to explore the ever-expanding world of online Austen fandom and fan fiction writing. Using case studies from the Internet writing community and publisher, Wattpad, as well as dedicated fan websites, it illuminates the literary processes and products that have given Austen multiple afterlives in the digital arena.

Challenging the traditional conception of medieval Europe as insular and even xenophobic, Shirin A. Khanmohamadi's In Light of Another's Word looks to early ethnographic writers who were surprisingly aware of their own otherness, especially when faced with the far-flung peoples and cultures they meant to describe. These authors-William of Rubruck among the Mongols, "John Mandeville" cataloguing the world's diverse wonders, Geraldus Cambrensis describing the manners of the twelfth-century Welsh, and Jean de Joinville in his account of the various Saracens encountered on the Seventh Crusade-display an uncanny ability to see and understand from the perspective of the very strangers who are their subjects.Khanmohamadi elaborates on a distinctive late medieval ethnographic poetics marked by both a profound openness to alternative perspectives and voices and a sense of the formidable threat of such openness to Europe's governing religious and cultural orthodoxies. That we can hear the voices of medieval Europe's others in these narratives in spite of such orthodoxies allows us to take full measure of the productive forces of disorientation and destabilization at work on these early ethnographic writers.Poised at the intersection of medieval studies, anthropology, and visual culture, In Light of Another's Word is an innovative departure from each, extending existing studies of medieval travel writing into the realm of poetics, of ethnographic form into the premodern realm, and of early visual culture into the realm of ethnographic encounter.