Distributed Semantic Wiki: Kolflow Project -Task 5- State of the art (D5.1)

This paper presents the state of the art on Distributed Semantic Wikis. This work is part of the Kolflow project, more precisely it is part of the task 5, {\bf D(5.1)}

Interactive and zero-knowledge proofs

An interactive proof involves two parties, the prover and the verifier. The goal of the proof is for the prover to convince the verifier that some instance of a decision problem is true. A zero-knowledge proof is an interactive proof where the only information learned by the verifier of the proof is the outcome of the proof. This thesis contains a theoretical overview of interactive and zero-knowledge proofs and describes experiments with implementations of some of them. Two examples of interactive proofs from number theory are given, a protocol for quadratic non-residues and a protocol for subgroup non-membership. The third example of an interactive proof is a protocol for determining the truth value of a quantified Boolean formula. This interactive proof was implemented and the details of that implementation, plus a test of the implementation derived from game theory, are included. There is also a discussion of quantum interactive proofs. The two examples of perfect zero-knowledge proofs that are included are protocols for quadratic residues and for subgroup membership. These protocols were also implemented, and those details are included. For each protocol, there is a discussion of the complexity status of the problems addressed by the protocol. There is also a brief discussion of the history and applications of interactive and zero-knowledge proofs

Safe Generic Data Synchronizer

Rapport interne.Reconciliating divergent data is an important issue in concurrent engineering, mobile computing and software configuration management. Actually, a lot of synchronizers or merge tools perform reconciliations, however, which strategy they apply ? is it correct ? In this paper, we propose to use a transformational approach to build a safe generic data synchronizer

Re-presenting Muslim women: The difficulties of (un)veiling the Muslim woman in Muslim women\u27s autobiographies

Women, traditionally cloistered in private places, are invisible to the outside world. Yet, writing, which can take form even from within the private sphere, can be a means of resisting silence, rendering one\u27s story visible and demanding entrance into public view. From private places, women have written to free themselves of the constraints of womanhood, and to make their messages heard amongst deafening patriarchal discourse. While writing can be a means of resistance, a mode of speaking back against one\u27s oppressor and impacting change, it can inadvertently reproduce the oppression it seeks to speak back against. Autobiographical writing invites the reader into the author\u27s world of oppression. In granting readers access to experience the author\u27s oppression, to step into it and fight against it alongside the author, autobiographical resistance writing opens up a space which is particularly vulnerable to manipulation. Oppression described in the narrative is easily co-opted by the readership\u27 and used as a weapon to reinscribe varied forms of oppression on the author. In post 9~11America, as readers are bombarded with imagesof veiled, silenced, oppressed Muslim women by the media, Muslim women\u27s narratives have garnered particular interest amongst Western readers, promising them a peak behind the veil, a glance into the life of the Other. Using Helen Cixous\u27 model of feminine writing, I contend that Assia Djebar\u27s The Tongues Blood Does Not Run Dry reaches toward an effective iteration of Muslim women\u27s autobiographical resistance writing whereas Fatima Mernissi\u27s Dreams of Trespass: Tales of a Harem Girlhood reproduces Orientalist sentiments

Causal Broadcast: How to Forget?

Causal broadcast constitutes a fundamental communication primitive of many distributed protocols and applications. However, state-of-the-art implementations fail to forget obsolete control information about already delivered messages. They do not scale in large and dynamic systems. In this paper, we propose a novel implementation of causal broadcast. We prove that all and only obsolete control information is safely removed, at cost of a few lightweight control messages. The local space complexity of this protocol does not monotonically increase and depends at each moment on the number of messages still in transit and the degree of the communication graph. Moreover, messages only carry a scalar clock. Our implementation constitutes a sustainable communication primitive for causal broadcast in large and dynamic systems

Robust Math Fluency Routines to Support and Develop Students\u27 Emerging Skills of Fluency:

In elementary school, students are gaining a mathematical foundation that propels their procedural fluency. The problem is the current mathematical systems and routines do not lend themselves to fostering an environment that enables procedural fluency skills to be built. A review of literature focused on procedural math fluency systems and routines are needed to be structured in order for students to receive an equitable, enriching, and conceptual approach to learning mathematical concepts. Located in Ames, Iowa, Abbie Sawyer Elementary’s 2022-2023 math proficiency data indicates the need for thoughtful and intentional professional learning on math fluency terminology, practices, and strategies. In response to the results, this school improvement plan looks at how the implementation of mathematical fluency structures, routines, and practices can improve students’ understanding and benchmark proficiency scores. Additionally, teachers’ professional learning development of common knowledge and understanding of mathematical fluency became a key factor in the success in the implementation process. The improvement plan is designed from research and information from thirty-six sources. Implementation of structured fluency routines, common assessments, and professional learning on mathematica

Tracking Federated Queries in the Linked Data

Federated query engines allow data consumers to execute queries over the federation of Linked Data (LD). However, as federated queries are decomposed into potentially thousands of subqueries distributed among SPARQL endpoints, data providers do not know federated queries, they only know subqueries they process. Consequently, unlike warehousing approaches, LD data providers have no access to secondary data. In this paper, we propose FETA (FEderated query TrAcking), a query tracking algorithm that infers Basic Graph Patterns (BGPs) processed by a federation from a shared log maintained by data providers. Concurrent execution of thousand subqueries generated by multiple federated query engines makes the query tracking process challenging and uncertain. Experiments with Anapsid show that FETA is able to extract BGPs which, even in a worst case scenario, contain BGPs of original queries

Choose Your Own Ending: An Arts-Informed Action Research on Creating a “Good Death”

Concerns arise as we approach the final days, weeks, and months of our lives. Doctors may be able to give us a medical prognosis of our remaining time on this planet but how do we find the answers to the other questions we may have? Grounded in the literature on what makes a “good death” this arts informed action research project used control, fear, spirituality, relationships, and legacy to create a branching plot style book for dealing with end of life issues. This format is an accessible way for both patients and social workers to discuss and explore ways of discussing these important issues. Description and rationale for use of these methods as well as a preliminary version of the book is presented. Implications for social work practice and further research, which include field testing this research product, are also presented

BlueFinder: Recommending Wikipedia Links Using DBpedia Properties

International audienceDBpedia knowledge base has been built from data extracted from Wikipedia. However, many existing relations among resources in DBpedia are missing links among articles from Wikipedia. In some cases, adding these links into Wikipedia will enrich Wikipedia content and therefore will enable bet- ter navigation. In previous work, we proposed PIA algorithm that predicts the best link to connect two articles in Wikipedia corresponding to those related by a semantic property in DB- pedia and respecting the Wikipedia convention. PIA calcu- lates this link as a path query. After introducing PIA results in Wikipedia, most of them were accepted by the Wikipedia community. However, some were rejected because PIA pre- dicts path queries that are too general. In this paper, we report the BlueFinder collaborative filtering algorithm that fixes PIA miscalculation. It is sensible to the specificity of the resource types. According to the conducted experimentation we found out that BlueFinder is a better solution than PIA because it solves more cases with a better recall