Browsing
     by title


0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:   
OK
See detailIntroducción
Tröhler, Daniel UL; Barbu, Ragnhild UL

in Los sistemas educativos: perspectiva histórica, cultural y sociológica (2012)

Detailed reference viewed: 55 (2 UL)
Full Text
Peer Reviewed
See detailIntroducción Sección Especial: el viaje peripatético de la educación en un mundo globalizado y “educacionalizado”
Bruno-Jofré, Rosa; Tröhler, Daniel UL

in Pensamiento Educativo: Revista de Investigación Educacional Latinoamericana (2014), 51(1), 1-5

Detailed reference viewed: 137 (4 UL)
Full Text
Peer Reviewed
See detailIntroducing Abstract Argumentation with Many Lives
Gabbay, Dov M. UL

in Journal of Applied Logic (2020), 2631(3), 295

Detailed reference viewed: 61 (8 UL)
Full Text
See detailIntroducing African literacies
Juffermans, Kasper UL; Asfaha, Yonas Mesfun; Kurvers, Jeanne

in van de Craats, Ineke; Kurvers, Jeanne (Eds.) Low-educated adult second language and literacy acquisition: Proceedings of the 4th symposium in Antwerp (2009)

Detailed reference viewed: 46 (0 UL)
Full Text
Peer Reviewed
See detailIntroducing aspects of transformative justice to the International Criminal Court through plea negotiation
Oyugi, Phoebe; Owiso, Owiso UL

in Fraser, Julie; Leyh, Brianne McGonigle (Eds.) Intersections of law and culture at the International Criminal Court (2020)

Detailed reference viewed: 114 (9 UL)
Full Text
Peer Reviewed
See detailIntroducing automated GUI testing and observing its benefits: an industrial case study in the context of law-practice management software
Garousi, Vahid UL; Yıldırım, Erdem

in Proceedings of ACM/IEEE International Symposium on Empirical Software Engineering and Measurement (ESEM) (2017)

Motivated by a real-world industrial need in the context of a large IT solutions company based in Turkey, the authors and their colleagues developed and introduced automated test suites for GUI testing of ... [more ▼]

Motivated by a real-world industrial need in the context of a large IT solutions company based in Turkey, the authors and their colleagues developed and introduced automated test suites for GUI testing of two large-scale law-practice management software (comprising of 414 and 105 KLOC). We report in this paper our experience in developing and introducing a set of large automated test suites (more than 50 KLOC in total), using best practices in state-of-the art and –practice, and to report its observed benefits by conducting cost-benefit analysis in the specific industrial context. The project was conducted based on the principles of case-study and “action research” in which the real industrial needs drove the research. Among the best practices that we used are the followings: (1) the page-object test pattern, (2) modularity in test code, (3) creating test-specific libraries, and (4) using systematic guidelines to decide when and what (test cases) to automate. To assess the cost-benefit and Return On Investment (ROI) of test automation, we followed a hybrid measurement approach to assess both the quantitative and qualitative (intangible) benefits of test automation. The empirical findings showed that the automated GUI testing approach has indeed benefitted the test and QA team in the company under study and automation has been highly welcome by the test engineers. By serving as a success story and experience report in development and introduction of automated test suites in an industrial setting, this paper adds to the body of evidence in this area and it aims at sharing both technical (e.g., using automated test patterns) and process aspects (e.g., test process improvement) of our project with other practitioners and researchers with the hope of encouraging more industry-academia collaborations in test automation. [less ▲]

Detailed reference viewed: 186 (7 UL)
Full Text
Peer Reviewed
See detailIntroducing Bayesian Argumentation Networks
Gabbay, Dov M. UL; Rodrigues, O.

in IfCoLog Journal of Logics and Their Applications (2016)

Detailed reference viewed: 59 (2 UL)
Full Text
Peer Reviewed
See detailIntroducing Conviviality as a New Paradigm for Interactions among IT Objects
Moawad, Assaad UL; Efthymiou, Vasileios UL; Caire, Patrice UL et al

in Proceedings of the Workshop on AI Problems and Approaches for Intelligent Environments (2012, August), 907

The Internet of Things allows people and objects to seamlessly interact, crossing the bridge between real and virtual worlds. Newly created spaces are heterogeneous; social relations naturally extend to ... [more ▼]

The Internet of Things allows people and objects to seamlessly interact, crossing the bridge between real and virtual worlds. Newly created spaces are heterogeneous; social relations naturally extend to smart objects. Conviviality has recently been introduced as a social science concept for ambient intelligent systems to highlight soft qualitative requirements like user friendliness of systems. Roughly, more opportunities to work with other people increase the conviviality. In this paper, we first propose the conviviality concept as a new interaction paradigm for social exchanges between humans and Information Technology (IT) objects, and extend it to IT objects among themselves. Second, we introduce a hierarchy for IT objects social interactions, from low-level one-way interactions to high-level complex interactions. Then, we propose a mapping of our hierarchy levels into dependence networks-based conviviality classes. In particular, low levels without cooperation among objects are mapped to lower conviviality classes, and high levels with complex cooperative IT objects are mapped to higher conviviality classes. Finally, we introduce new conviviality measures for the Internet of Things, and an iterative process to facilitate cooperation among IT objects, thereby the conviviality of the system. We use a smart home as a running example. [less ▲]

Detailed reference viewed: 188 (12 UL)
Full Text
Peer Reviewed
See detailIntroducing Conviviality as a property of Multi-Context Systems
Bikakis, Antonis; Efthymiou, Vasileios UL; Caire, Patrice UL et al

in The 4th International Workshop on Acquisition, Representation and Reasoning with Contextualized Knowledge ARCOE-12 (2012, August 27)

Detailed reference viewed: 91 (0 UL)
Full Text
Peer Reviewed
See detailIntroducing Defeasibility into OWL Ontologies
Casini, Giovanni UL; Meyer, Thomas; Moodley, Kody et al

in Arenas, Marcelo; Corcho, Oscar; Simperl, Elena (Eds.) et al 14th International Semantic Web Conference. Bethlehem, PA, USA, October 11–15, 2015 Proceedings, Part II (2015)

In recent years, various approaches have been developed for representing and reasoning with exceptions in OWL. The price one pays for such capabilities, in terms of practical performance, is an important ... [more ▼]

In recent years, various approaches have been developed for representing and reasoning with exceptions in OWL. The price one pays for such capabilities, in terms of practical performance, is an important factor that is yet to be quantified comprehensively. A major barrier is the lack of naturally occurring ontologies with defeasible features - the ideal candidates for evaluation. Such data is unavailable due to absence of tool support for representing defeasible features. In the past, defeasible reasoning implementations have favoured automated generation of defeasible ontologies. While this suffices as a preliminary approach, we posit that a method somewhere in between these two would yield more meaningful results. In this work, we describe a systematic approach to modify real-world OWL ontologies to include defeasible features, and we apply this to the Manchester OWL Repository to generate defeasible ontologies for evaluating our reasoner DIP (Defeasible-Inference Platform). The results of this evaluation are provided together with some insights into where the performance bottle-necks lie for this kind of reasoning. We found that reasoning was feasible on the whole, with surprisingly few bottle-necks in our evaluation. [less ▲]

Detailed reference viewed: 128 (3 UL)
Full Text
Peer Reviewed
See detailIntroducing Equational Semantics for Argumentation Networks
Gabbay, Dov M. UL

in ECSQARU (2011)

This paper provides equational semantics for Dung’s argumentation networks. The network nodes get numerical values in [0,1], and are supposed to satisfy certain equations. The solutions to these equations ... [more ▼]

This paper provides equational semantics for Dung’s argumentation networks. The network nodes get numerical values in [0,1], and are supposed to satisfy certain equations. The solutions to these equations correspond to the “extensions” of the network. This approach is very general and includes the Caminada labelling as a special case, as well as many other so-called network extensions, support systems, higher level attacks, Boolean networks, dependence on time, etc, etc. The equational approach has its conceptual roots in the 19th century following the algebraic equational approach to logic by George Boole, Louis Couturat and Ernst Schroeder. [less ▲]

Detailed reference viewed: 105 (1 UL)
Peer Reviewed
See detailIntroducing Luxembourg: Ephemeral Sustainabilities
Carr, Constance UL

in Krueger, Rob; Freytag, Tim; Mössner, Samuel (Eds.) Adventures in Sustainable Urbanism (2019)

Table of Contents 1. Constructing Sustainable Development Robert Krueger, Tim Freytag and Samuel Mossner 2. The Rise of Sustainable Urban Development Robert Krueger, Tim Freytag, and Samuel Mossner 3. A ... [more ▼]

Table of Contents 1. Constructing Sustainable Development Robert Krueger, Tim Freytag and Samuel Mossner 2. The Rise of Sustainable Urban Development Robert Krueger, Tim Freytag, and Samuel Mossner 3. A Tale of Two Cities: Christchurch, New Zealand, and Sustainable Urban Disaster Recovery Tim Baird and C. Michael Hall 4. Reworking Newtown Creek Winifred Curran and Trina Hamilton 5. From Sprawling Cowtown to Social Sustainability Pioneer: The Sustainability Journey of Calgary, Alberta Freya Kristensen 6. The Greenest City Experience: Exploring Social Action and Social Sustainability in Vancouver, Canada Marit Rosol and Cristina Temenos 7. Introducing Luxembourg: Ephemeral Sustainabilities Constance Carr 8. Montpellier Écocité: From Growth Machine to Sustainability? David Giband 9. Building Ecopolis in the World’s Factory: A Field Note on Sino-Singapore Tianjin Eco-city I-Chun Catherine Chang 10. Sustainable Empire? Michal Kohout 11. Middle-Class Family Enclavism and Solidarity from a Distance Notes from a Field of Contradictions in Dortmund, Germany Susanne Frank 12. A Conclusion? Or, Toward a New Beginning? Robert Krueger, Tim Freytag, and Samuel Mossner [less ▲]

Detailed reference viewed: 143 (3 UL)
Peer Reviewed
See detailIntroducing MaFIN. A dynamic matrices finite state automata test
Kunze, Thiemo UL; Krieger, Florian UL; Stadler, Matthias UL et al

Scientific Conference (2018, July)

Detailed reference viewed: 134 (15 UL)
See detailIntroducing Multilingualism A Social Approach
Weber, Jean-Jacques UL; Horner, Kristine

Book published by Routledge (2012)

Detailed reference viewed: 389 (33 UL)
Full Text
See detailIntroducing new open science practices at EJPA. European Journal of Psychological Assessment
Greiff, Samuel UL; van der Westhuizen, Lindie UL; Mund, M et al

in European Journal of Psychological Assessment (2020), 36

Detailed reference viewed: 92 (0 UL)
Full Text
Peer Reviewed
See detailIntroducing reactive Kripke semantics and arc accessibility
Gabbay, Dov M. UL

in Annals of Mathematics & Artificial Intelligence (2012), 66(1-4), 7-53

Ordinary Kripke models are not reactive. When we evaluate (test/ measure) a formula A at a model m, the model does not react, respond or change while we evaluate. The model is static and unchanged. This ... [more ▼]

Ordinary Kripke models are not reactive. When we evaluate (test/ measure) a formula A at a model m, the model does not react, respond or change while we evaluate. The model is static and unchanged. This paper studies Kripke models which react to the evaluation process and change themselves during the process. The additional device we add to Kripke semantics to make it reactive is to allow the accessibility relation to access itself. Thus the accessibility relation R of a reactive Kripke model contains not only pairs (a,b)∈R of possible worlds (b is accessible to a, i.e., there is an accessibility arc from a to b) but also pairs of the form (t ,(a,b))∈R, meaning that the arc (a,b) is accessible to t, or even connections of the form((a,b),(c,d))∈R. This new kind of Kripke semantics allows us to characterise more axiomatic modal logics (with one modality) by a class of reactive frames. There are logics which cannot be characterised by ordinary frames but which can be characterised by reactive frames. We also discuss the manifestation of the ‘reactive’ idea in the context of automata theory, where we allow the automaton to react and change it’s own definition as it responds to input, and in graph theory, where the graph can change under us as we manipulate it. [less ▲]

Detailed reference viewed: 111 (4 UL)
Full Text
Peer Reviewed
See detailIntroducing Reactive Kripke Semantics and Arc Accessibility
Gabbay, Dov M. UL

in Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday (2008)

Ordinary Kripke models are not reactive. When we evaluate (test/ measure) a formula A at a model m, the model does not react, respond or change while we evaluate. The model is static and unchanged. This ... [more ▼]

Ordinary Kripke models are not reactive. When we evaluate (test/ measure) a formula A at a model m, the model does not react, respond or change while we evaluate. The model is static and unchanged. This paper studies Kripke models which react to the evaluation process and change themselves during the process. The additional device we add to Kripke semantics to make it reactive is to allow the accessibility relation to access itself. Thus the accessibility relation R of a reactive Kripke model contains not only pairs (a,b)∈R of possible worlds (b is accessible to a, i.e., there is an accessibility arc from a to b) but also pairs of the form (t,(a,b))∈R, meaning that the arc (a,b) is accessible to t, or even connections of the form ((a,b), (c,d))∈R. This new kind of Kripke semantics allows us to characterise more axiomatic odal logics (with one modality []) by a class of reactive frames. There are logics which cannot be characterised by ordinary frames but which can be characterised by reactive frames. We also discuss the manifestation of the ‘reactive’ idea in the context of automata theory, where we allow the automaton to react and change it’s own definition as it responds to input, and in graph theory, where the graph can change under us as we manipulate it. [less ▲]

Detailed reference viewed: 106 (0 UL)
Full Text
Peer Reviewed
See detailIntroducing reactive modal tableaux
Gabbay, Dov M. UL

in Annals of Mathematics & Artificial Intelligence (2012), 66(1-4), 55-79

This paper introduces the idea of reactive semantics and reactive Beth tableaux for modal logic and quotes some of its applications. The reactive idea is very simple. Given a system with states and the ... [more ▼]

This paper introduces the idea of reactive semantics and reactive Beth tableaux for modal logic and quotes some of its applications. The reactive idea is very simple. Given a system with states and the possibility of transitions moving from one state to another, we can naturally imagine a path beginning at an initial state and moving along the path following allowed transitions. If our starting point is s0, and the path is s0,s1,...,sn, then the system is ordinary non-reactive system if the options available at sn (i.e., which states t we can go to from sn) do not depend on the path s0,...,sn (i.e., do not depend on how we got to sn). Otherwise if there is such dependence then the system is reactive. It seems that the simple idea of taking existing systems and turning them reactive in certain ways, has many new applications. The purpose of this paper is to introduce reactive tableaux in particular and illustrate and present some of the applications of reactivity in general. Mathematically one can take a reactive system and turn it into an ordinary system by taking the paths as our new states. This is true but from the point of view of applications there is serious loss of information here as the applicability of the reactive system comes from the way the change occurs along the path. In any specific application, the states have meaning, the transitions have meaning and the paths have meaning. Therefore the changes in the system as we go along a path can have very important meaning in the context, which enhances the usability of the model. [less ▲]

Detailed reference viewed: 103 (4 UL)
Full Text
Peer Reviewed
See detailIntroducing SOR: SSH-based Onion Routing
Egners, Andre; Gatzen, Dominic; Panchenko, Andriy UL et al

in 26th IEEE International Conference on Advanced Information Networking and Applications (2012)

Detailed reference viewed: 182 (1 UL)