8 research outputs found

    Semantic Web Datatype Inference: Towards Better RDF Matching

    Get PDF
    International audienceIn the context of RDF document matching/integration, the datatype information, which is related to literal objects, is an important aspect to be analyzed in order to better determine similar RDF documents. In this paper, we propose a datatype inference process based on four steps: (i) predicate information analysis (i.e., deduce the datatype from existing range property); (ii) analysis of the object value itself by a pattern-matching process (i.e., recognize the object lexical-space); (iii) semantic analysis of the predicate name and its context; and (iv) generalization of numeric and binary datatypes to ensure the integration. We evaluated the performance and the accuracy of our approach with datasets from DBpedia. Results show that the execution time of the inference process is linear and its accuracy can increase up to 97.10%. \textcopyright 2017, Springer International Publishing AG

    Improving conversations with digital assistants through extracting, recommending, and verifying user inputs

    Get PDF
    Digital assistants, including chat bots and voice assistants, suffer from discrepancies and uncertainty in human text and speech inputs. Human dialogue is often varied, ambiguous, and inconsistent, making data entry prone to error and difficult for digital assistants to process. Finding and extracting pertinent information from unstructured user inputs improves and expands the use of digital assistants on any platform. By confirming data entries and providing relevant recommendations when invalid information is provided, the digital assistant enables the use of natural language and introduces a higher degree of flow into the conversation.This paper describes a series of input logic codifiers that form a corrective method to overcome errors and ambiguity typical of voice and text inputs. When users make a common mistake or forget data, the digital assistant can bridge the gap by recommending the most similar data that is available. The assistant measures the delta between the user’s utterance and valid entries using fuzzy logic to identify the closest and next closest data that relates to the unstructured text.Furthermore, there are endless ways to denote dates, locations, etc., making it difficult for digital assistants to extract accurate and relevant data from the user’s natural language. However, the assistant may infer the desired data format or reference from the dialogue provided and validate this with the user as a follow-on question. The desired data format or type is inferred using fuzzy extraction methods, such as fuzzy date extraction, to isolate the desired data format from the unstructured text. This extracted information is then verified or confirmed by the user to maintain data accuracy and avoid downstream data quality issues

    Connecting targets to tweets: semantic attention-based model for target-specific stance detection

    Get PDF
    Understanding what people say and really mean in tweets is still a wide open research question. In particular, understanding the stance of a tweet, which is determined not only by its content, but also by the given target, is a very recent research aim of the community. It still remains a challenge to construct a tweet’s vector representation with respect to the target, especially when the target is only implicitly mentioned, or not mentioned at all in the tweet. We believe that better performance can be obtained by incorporating the information of the target into the tweet’s vector representation. In this paper, we thus propose to embed a novel attention mechanism at the semantic level in the bi-directional GRU-CNN structure, which is more fine-grained than the existing token-level attention mechanism. This novel attention mechanism allows the model to automatically attend to useful semantic features of informative tokens in deciding the target-specific stance, which further results in a conditional vector representation of the tweet, with respect to the given target. We evaluate our proposed model on a recent, widely applied benchmark Stance Detection dataset from Twitter for the SemEval-2016 Task 6.A. Experimental results demonstrate that the proposed model substantially outperforms several strong baselines, which include the state-of-the-art token-level attention mechanism on bi-directional GRU outputs and the SVM classifier

    A two authorities electronic vote scheme

    Full text link
    [EN] In this paper we propose a new electronic multi-authority voting system based on blind signatures. We focus on the open problem of the efficiency of electronic voting systems. Most of the proposed systems rely on complex architectures or expensive proofs, in this work we aim to reduce the time-complexity of the voting process, both for the voter and the authorities involved. Our system is focused on simplicity and it is based on the assumption of two unrelated entities. This simplicity makes our approach scalable and flexible to multiple kinds of elections. We propose a method that limits the number of authorities to only 2 of them; we reduce the overall number of modular operations; and, propose a method which cut downs the interactions needed to cast a vote. The result is a voting protocol whose complexity scales linearly with the number of votes.Larriba-Flor, AM.; Sempere Luna, JM.; López Rodríguez, D. (2020). A two authorities electronic vote scheme. Computers & Security. 97:1-12. https://doi.org/10.1016/j.cose.2020.101940S11297Bloom, B. H. (1970). Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7), 422-426. doi:10.1145/362686.362692Brams S., Fishburn P.C.. 2007. Approval voting Springer ScienceCarroll, T. E., & Grosu, D. (2009). A secure and anonymous voter-controlled election scheme. Journal of Network and Computer Applications, 32(3), 599-606. doi:10.1016/j.jnca.2008.07.010Chaum, D. L. (1981). Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2), 84-90. doi:10.1145/358549.358563Cramer, R., Gennaro, R., & Schoenmakers, B. (1997). A secure and optimally efficient multi-authority election scheme. European Transactions on Telecommunications, 8(5), 481-490. doi:10.1002/ett.4460080506Desmedt, Y. G. (2010). Threshold cryptography. European Transactions on Telecommunications, 5(4), 449-458. doi:10.1002/ett.4460050407Elgamal, T. (1985). A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4), 469-472. doi:10.1109/tit.1985.1057074Juang, W.-S. (2002). A Verifiable Multi-Authority Secret Election Allowing Abstention from Voting. The Computer Journal, 45(6), 672-682. doi:10.1093/comjnl/45.6.672Menezes A., van Oorschot P.C., Vanstone S.A.. 1996. Handbook of Applied Cryptography.Parhami, B. (1994). Voting algorithms. IEEE Transactions on Reliability, 43(4), 617-629. doi:10.1109/24.370218Rabin, M. O. (1980). Probabilistic Algorithms in Finite Fields. SIAM Journal on Computing, 9(2), 273-280. doi:10.1137/0209024Rabin, M. O. (1983). Transaction protection by beacons. Journal of Computer and System Sciences, 27(2), 256-267. doi:10.1016/0022-0000(83)90042-9Salazar, J. L., Piles, J. J., Ruiz-Mas, J., & Moreno-Jiménez, J. M. (2010). Security approaches in e-cognocracy. Computer Standards & Interfaces, 32(5-6), 256-265. doi:10.1016/j.csi.2010.01.004Nguyen, T. A. T., & Dang, T. K. (2013). Enhanced security in internet voting protocol using blind signature and dynamic ballots. Electronic Commerce Research, 13(3), 257-272. doi:10.1007/s10660-013-9120-5Wu, Z.-Y., Wu, J.-C., Lin, S.-C., & Wang, C. (2014). An electronic voting mechanism for fighting bribery and coercion. Journal of Network and Computer Applications, 40, 139-150. doi:10.1016/j.jnca.2013.09.011Yang, X., Yi, X., Nepal, S., Kelarev, A., & Han, F. (2018). A Secure Verifiable Ranked Choice Online Voting System Based on Homomorphic Encryption. IEEE Access, 6, 20506-20519. doi:10.1109/access.2018.2817518Yi, X., & Okamoto, E. (2013). Practical Internet voting system. Journal of Network and Computer Applications, 36(1), 378-387. doi:10.1016/j.jnca.2012.05.00

    SUVS: Secure Unencrypted Voting Scheme

    Full text link
    [EN] In this paper, we propose a light-weight electronic voting protocol. The approach used by our protocol to conceal the ballots does not imply encryption, and guarantees the privacy of the direction of the vote unless all the contestants (parties) agree to do so. Our method is based on the division of the ballot into different pieces of information, which separately reveal no information at all, and that can be latter aggregated to recover the original vote. We show that, despite its simplicity, this scheme is powerful, it does not sacrifice any of the security properties demanded in a formal electronic voting protocol, and, furthermore, even in post-quantum scenarios, neither the casted votes can be tampered with, nor the identity of any elector can be linked with the direction of her vote.Results related to Spanish Patent Application number P202131209.Larriba, AM.; LĂłpez RodrĂ­guez, D. (2022). SUVS: Secure Unencrypted Voting Scheme. Informatica. 33(4):749-769. https://doi.org/10.15388/22-INFOR50374976933

    Advancing Disambiguation of Actors Against Multiple Linked Open Data Sources

    Get PDF
    Disambiguation is an important step in the semantic data transformation process. In this scope, the process sought to eliminate the ambiguity of which person a record is describing. \emph{Constellation of Correspondence} or CoCo is a data integration project focused on historical epistolary data. In its data transformation flow, actor records from source data are linked to actor entities in an external linked open data source to enrich the actors' information with metadata found in external databases. This work presents an advanced disambiguation system for CoCo data transformation flow. The system has managed to deliver a reliable and flexible linking system that provides advantages,hi such as the incorporation of an additional external database, novel linking rule definition and implementation, and a more transparent linking result provenance presentation and management. This work also evaluates linking process performance in various linking cases by employing the help of a human expert judge to evaluate whether the proposed valid link made by the linking systems are indeed accurate or not. The system and the proposed rule configuration delivers a satisfactory performance on the easier, more common case but still struggles to deliver good precision on rarer edge cases. There are insightful observations made regarding the data that was observed during the development and evaluation of the system. Firstly is the importance of naming similarity in determining a link between two actors and the imperfection of name similarity in the majority of the valid linking case. This observation justifies the need for dissimilarity tolerance in naming comparison despite the importance of naming similarity. This imperfect state of the systems inspires the several future works that this work proposes. The proposed future works are the further fine-tuning of the linking rule and selection rule and the advancing the evaluation by increasing the completeness of the evaluation and the research of a more automated evaluation process

    Open Skies

    Get PDF
    This open access book on the history of the National Radio Astronomy Observatory covers the scientific discoveries and technical innovations of late 20th century radio astronomy with particular attention to the people and institutions involved. The authors have made extensive use of the NRAO Archives, which contain an unparalleled collection of documents pertaining to the history of radio astronomy, including the institutional records of NRAO as well as the personal papers of many of the pioneers of U.S. radio astronomy. Technical details and extensive citations to original sources are given in notes for the more technical readers, but are not required for an understanding of the body of the book. This book is intended for an audience ranging from interested lay readers to professional researchers studying the scientific, technical, political, and cultural development of a new science, and how it changed the course of 20th century astronomy

    Open Skies

    Get PDF
    This open access book on the history of the National Radio Astronomy Observatory covers the scientific discoveries and technical innovations of late 20th century radio astronomy with particular attention to the people and institutions involved. The authors have made extensive use of the NRAO Archives, which contain an unparalleled collection of documents pertaining to the history of radio astronomy, including the institutional records of NRAO as well as the personal papers of many of the pioneers of U.S. radio astronomy. Technical details and extensive citations to original sources are given in notes for the more technical readers, but are not required for an understanding of the body of the book. This book is intended for an audience ranging from interested lay readers to professional researchers studying the scientific, technical, political, and cultural development of a new science, and how it changed the course of 20th century astronomy
    corecore