The Experts below are selected from a list of 42891 Experts worldwide ranked by ideXlab platform

Cleotilde Gonzalez - One of the best experts on this subject based on the ideXlab platform.

  • how people do Relational reasoning role of Problem complexity and domain familiarity
    Computers in Human Behavior, 2014
    Co-Authors: Shikhar Kumar, Iliano Cervesato, Cleotilde Gonzalez
    Abstract:

    The goal of this paper is to study how people do Relational reasoning.We present two studies that look at human performance in Relational Problems.Our results present the first evidence toward the role of Problem complexity on performance.We did not find any evidence suggesting any role of familiarity with spreadsheets. The goal of this paper is to study how people do Relational reasoning, such as selecting the grade of all students in a class with GPA (Grade Point Average) greater than 3.5. Literature in the field of psychology of human reasoning offer little insight as to how people solve Relational Problems. We present two studies that look at human performance in Relational Problems that use basic Relational operators. Our results present the first evidence toward the role of Problem complexity on performance as determined by the accuracy and discrimination rates. We also look at the role of familiarity with tabular representation of information, as found in spreadsheets for example, and other factors for Relational reasoning, and show that familiarity does not play a significant role in determining performance in Relational Problem solving, which we found counterintuitive.

  • how people do Relational reasoning role of Problem complexity and domain familiarity
    Qatar Foundation Annual Research Conference Proceedings Volume 2014 Issue 1, 2014
    Co-Authors: Shikhar Kumar, Iliano Cervesato, Cleotilde Gonzalez
    Abstract:

    The goal of this paper is to study how people do Relational reasoning, such as selecting the grade of all students in a class with GPA greater than 3.5. Literature in the field of psychology of human reasoning offer little insight as to how people solve Relational Problems. We present two studies that look at human performance in Relational Problems that use basic Relational operators. Our results present the first evidence towards the role of Problem complexity on performance as determined by the accuracy and discrimination rates. We also look at the role of familiarity with tabular representation of information, as found in spreadsheets for example, and other factors for Relational reasoning, and show that familiarity does not play a significant role in determining performance in Relational Problem solving, which we found counterintuitive.

Shikhar Kumar - One of the best experts on this subject based on the ideXlab platform.

  • how people do Relational reasoning role of Problem complexity and domain familiarity
    Computers in Human Behavior, 2014
    Co-Authors: Shikhar Kumar, Iliano Cervesato, Cleotilde Gonzalez
    Abstract:

    The goal of this paper is to study how people do Relational reasoning.We present two studies that look at human performance in Relational Problems.Our results present the first evidence toward the role of Problem complexity on performance.We did not find any evidence suggesting any role of familiarity with spreadsheets. The goal of this paper is to study how people do Relational reasoning, such as selecting the grade of all students in a class with GPA (Grade Point Average) greater than 3.5. Literature in the field of psychology of human reasoning offer little insight as to how people solve Relational Problems. We present two studies that look at human performance in Relational Problems that use basic Relational operators. Our results present the first evidence toward the role of Problem complexity on performance as determined by the accuracy and discrimination rates. We also look at the role of familiarity with tabular representation of information, as found in spreadsheets for example, and other factors for Relational reasoning, and show that familiarity does not play a significant role in determining performance in Relational Problem solving, which we found counterintuitive.

  • how people do Relational reasoning role of Problem complexity and domain familiarity
    Qatar Foundation Annual Research Conference Proceedings Volume 2014 Issue 1, 2014
    Co-Authors: Shikhar Kumar, Iliano Cervesato, Cleotilde Gonzalez
    Abstract:

    The goal of this paper is to study how people do Relational reasoning, such as selecting the grade of all students in a class with GPA greater than 3.5. Literature in the field of psychology of human reasoning offer little insight as to how people solve Relational Problems. We present two studies that look at human performance in Relational Problems that use basic Relational operators. Our results present the first evidence towards the role of Problem complexity on performance as determined by the accuracy and discrimination rates. We also look at the role of familiarity with tabular representation of information, as found in spreadsheets for example, and other factors for Relational reasoning, and show that familiarity does not play a significant role in determining performance in Relational Problem solving, which we found counterintuitive.

Iliano Cervesato - One of the best experts on this subject based on the ideXlab platform.

  • how people do Relational reasoning role of Problem complexity and domain familiarity
    Computers in Human Behavior, 2014
    Co-Authors: Shikhar Kumar, Iliano Cervesato, Cleotilde Gonzalez
    Abstract:

    The goal of this paper is to study how people do Relational reasoning.We present two studies that look at human performance in Relational Problems.Our results present the first evidence toward the role of Problem complexity on performance.We did not find any evidence suggesting any role of familiarity with spreadsheets. The goal of this paper is to study how people do Relational reasoning, such as selecting the grade of all students in a class with GPA (Grade Point Average) greater than 3.5. Literature in the field of psychology of human reasoning offer little insight as to how people solve Relational Problems. We present two studies that look at human performance in Relational Problems that use basic Relational operators. Our results present the first evidence toward the role of Problem complexity on performance as determined by the accuracy and discrimination rates. We also look at the role of familiarity with tabular representation of information, as found in spreadsheets for example, and other factors for Relational reasoning, and show that familiarity does not play a significant role in determining performance in Relational Problem solving, which we found counterintuitive.

  • how people do Relational reasoning role of Problem complexity and domain familiarity
    Qatar Foundation Annual Research Conference Proceedings Volume 2014 Issue 1, 2014
    Co-Authors: Shikhar Kumar, Iliano Cervesato, Cleotilde Gonzalez
    Abstract:

    The goal of this paper is to study how people do Relational reasoning, such as selecting the grade of all students in a class with GPA greater than 3.5. Literature in the field of psychology of human reasoning offer little insight as to how people solve Relational Problems. We present two studies that look at human performance in Relational Problems that use basic Relational operators. Our results present the first evidence towards the role of Problem complexity on performance as determined by the accuracy and discrimination rates. We also look at the role of familiarity with tabular representation of information, as found in spreadsheets for example, and other factors for Relational reasoning, and show that familiarity does not play a significant role in determining performance in Relational Problem solving, which we found counterintuitive.

Ronald De Wolf - One of the best experts on this subject based on the ideXlab platform.

  • Simultaneous Communication Protocols with Quantum and Classical Messages
    Chicago Journal of Theoretical Computer Science, 2008
    Co-Authors: Dmitry Gavinsky, Oded Regev, Ronald De Wolf
    Abstract:

    We study the simultaneous message passing (SMP) model of communication complexity, for the case where one party is quantum and the other is classical. We show that in an SMP protocol that computes some function with the first party sending q qubits and the second sending c classical bits, the quantum message can be replaced by a randomized message of O(qc) classical bits, as well as by a deterministic message of O(qclogq) classical bits. Our proofs rely heavily on earlier results due to Scott Aaronson [1, 2]. In particular, our results imply that quantum-classical protocols need to send ( p n/logn) bits/qubits to compute Equality on n-bit strings, and hence are not significantly better than classical-classical protocols (and are much worse than quantum-quantum protocols such as quantum fingerprinting). This essentially answers a recent question of Wim van Dam [7]. Our results also imply, more generally, that there are no superpolynomial separations between quantumclassical and classical-classical SMP protocols for functional Problems. This contrasts with the situation for Relational Problems, where exponential gaps between quantum-classical and classical-classical SMP protocols are known. We show that this surprising situation cannot arise in purely classical models: there, an exponential separation for a Relational Problem can be converted into an exponential separation for a functional Problem.

  • Simultaneous Communication Protocols with Quantum and Classical Messages
    arXiv: Quantum Physics, 2008
    Co-Authors: Dmitry Gavinsky, Oded Regev, Ronald De Wolf
    Abstract:

    We study the simultaneous message passing (SMP) model of communication complexity, for the case where one party is quantum and the other is classical. We show that in an SMP protocol that computes some function with the first party sending q qubits and the second sending c classical bits, the quantum message can be replaced by a randomized message of O(qc) classical bits, as well as by a deterministic message of O(q c log q) classical bits. Our proofs rely heavily on earlier results due to Scott Aaronson. In particular, our results imply that quantum-classical protocols need to send Omega(sqrt{n/log n}) bits/qubits to compute Equality on n-bit strings, and hence are not significantly better than classical-classical protocols (and are much worse than quantum-quantum protocols such as quantum fingerprinting). This essentially answers a recent question of Wim van Dam. Our results also imply, more generally, that there are no superpolynomial separations between quantum-classical and classical-classical SMP protocols for functional Problems. This contrasts with the situation for Relational Problems, where exponential gaps between quantum-classical and classical-classical SMP protocols are known. We show that this surprising situation cannot arise in purely classical models: there, an exponential separation for a Relational Problem can be converted into an exponential separation for a functional Problem.

Rob Kitchin - One of the best experts on this subject based on the ideXlab platform.

  • Code, space and everyday life
    2004
    Co-Authors: Martin Dodge, Rob Kitchin
    Abstract:

    In this paper we examine the role of code (software) in the spatial formation of collective life. Taking the view that human life and coded technology are folded into one another, we theorise space as ontogenesis. Space, we posit, is constantly being bought into being through a process of transduction – the constant making anew of a domain in reiterative and transformative practices - as an incomplete solution to a Relational Problem. The Relational Problem we examine is the ongoing encounter between individuals and environment where the solution, to a greater or lesser extent, is code. Code, we posit, is diversely embedded in collectives as coded objects, coded infrastructure, coded processes and coded assemblages. These objects, infrastructure, processes and assemblages possess technicity, that is, unfolding or evolutive power to make things happen; the ability to mediate, supplement, augment, monitor, regulate, operate, facilitate, produce collective life. We contend that when the technicity of code is operationalised it transduces one of three forms of hybrid spatial formations: code/space, coded space and backgrounded coded space. These formations are contingent, Relational, extensible and scaleless, often stretched out across networks of greater or shorter length. We demonstrate the coded transduction of space through three vignettes – each a day in the life of three people living in London, UK, tracing the technical mediation of their interactions, transactions and mobilities. We then discuss how code becomes the Relational solution to five different classes of Problems – domestic living, travelling, working, communicating, and consuming.

  • Code, spaceand everyday life. CASA Working Paper 81
    2004
    Co-Authors: Martin Dodge, Rob Kitchin
    Abstract:

    In this paper we examine the role of code (software) in the spatial formation of collective life. Taking the view that human life and coded technology are folded into one another, we theorise space as ontogenesis. Space, we posit, is constantly being bought into being through a process of transduction – the constant making anew of a domain in reiterative and transformative practices - as an incomplete solution to a Relational Problem. The Relational Problem we examine is the ongoing encounter between individuals and environment where the solution, to a greater or lesser extent, is code. Code, we posit, is diversely embedded in collectives as coded objects, coded infrastructure, coded processes and coded assemblages. These objects, infrastructure, processes and assemblages possess technicity, that is, unfolding or evolutive power to make things happen; the ability to mediate, supplement, augment, monitor, regulate, operate, facilitate, produce collective life. We contend that when the technicity of code is operationalised it transduces one of three forms of hybrid spatial formations: code/space, coded space and backgrounded coded space. These formations are contingent, Relational, extensible and scaleless, often stretched out across networks of greater or shorter length. We demonstrate the coded transduction of space through three vignettes – each a day in the life of three people living in London, UK, tracing the technical mediation of their interactions, transactions and mobilities. We then discuss how code becomes the Relational solution to five different classes of Problems – domestic living, travelling, working, communicating, and consuming.