2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)最新文献_第8页

Modelling Complex Timing Requirements with Refinement 建模复杂的时间要求与细化

2016 IEEE 17th International Conference on Information Reuse and Integration (IRI) Pub Date : 2016-07-01 DOI: 10.1109/IRI.2016.23

Gintautas Sulskus, M. Poppleton, A. Rezazadeh

引用次数: 5

Rapid Prototyping of a Text Mining Application for Cryptocurrency Market Intelligence 用于加密货币市场情报的文本挖掘应用的快速原型设计

2016 IEEE 17th International Conference on Information Reuse and Integration (IRI) Pub Date : 2016-06-21 DOI: 10.2139/ssrn.2798486

M. Laskowski, Henry M. Kim

引用次数: 19

Data Analytics Using Ontologies of Management Theories: Towards Implementing "From Theory to Practice" (Application Paper) 运用管理理论本体论的数据分析:迈向“从理论到实践”(应用论文)

2016 IEEE 17th International Conference on Information Reuse and Integration (IRI) Pub Date : 2016-06-21 DOI: 10.1109/IRI.2016.62

Henry M. Kim, J. H. F. Cheung, M. Laskowski, I. Gel

引用次数: 0

Modular Verification of Termination and Execution Time Bounds Using Separation Logic 使用分离逻辑的终止和执行时间界限的模块化验证

2016 IEEE 17th International Conference on Information Reuse and Integration (IRI) Pub Date : 2016-04-01 DOI: 10.1109/IRI.2016.22

J. Hamin, B. Jacobs

{"title":"Modular Verification of Termination and Execution Time Bounds Using Separation Logic","authors":"J. Hamin, B. Jacobs","doi":"10.1109/IRI.2016.22","DOIUrl":"https://doi.org/10.1109/IRI.2016.22","url":null,"abstract":"This paper presents a formal method to verify execution time bounds of programs at the source level, where timing constraints along with other functional requirements are specified in the routines' contracts and are verified in a modular manner. The approach works based on a countdown time budget mechanism to guarantee the termination of the input program, and incorporates the concepts of separation logic, making it integrable with verification approaches for pointer-manipulating programs and applicable for concurrent programs where time resource needs to be passed among different threads. We selected the MSP430 microcontroller as well as a simple non-optimizing compiler as a case study and defined a co-inductive concrete semantics to model time consumption and potential non-termination of commands based on this platform. Accordingly, we developed the corresponding symbolic execution and proved that it is sound, i.e., if a program does not fail in the symbolic execution, then it respects the specified time bounds in the concrete execution too. Our preliminary results show that the proposed approach can be used to verify time bounds of programs involving separation logic based specifications.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114577630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

An Approach to Ontology Integration for Ontology Reuse 面向本体重用的本体集成方法

2016 IEEE 17th International Conference on Information Reuse and Integration (IRI) Pub Date : 2015-10-25 DOI: 10.1145/2857218.2857219

E. G. Caldarola, A. M. Rinaldi

引用次数: 67

Query-Driven Sampling for Collective Entity Resolution 集体实体解析的查询驱动抽样

2016 IEEE 17th International Conference on Information Reuse and Integration (IRI) Pub Date : 2015-08-13 DOI: 10.1109/IRI.2016.34

Christan Earl Grant, D. Wang, Michael L. Wick

{"title":"Query-Driven Sampling for Collective Entity Resolution","authors":"Christan Earl Grant, D. Wang, Michael L. Wick","doi":"10.1109/IRI.2016.34","DOIUrl":"https://doi.org/10.1109/IRI.2016.34","url":null,"abstract":"Entity Resolution is the process of determining records (mentions) in a database that correspond to the same real-world entity. Traditional pairwise ER methods can lead to inconsistencies and low accuracy due to localized decisions. Leading ER systems solve this problem by collectively resolving all records using a probabilistic graphical model and Markov chain Monte Carlo (MCMC) inference. However, for large datasets, this is an extremely expensive process. One key observation is that such exhaustive ER process incurs a huge up-front cost, which is wasteful in practice because most users are interested in only a small subset of entities. In this paper, we advocate pay-as-you-go entity resolution by developing a number of query-driven collective ER techniques. We introduce two classes of SQL queries that involve ER operators - selection-driven ER and join-driven ER. We implement novel variations of the MCMC Metropolis-Hastings algorithm to generate biased samples and selectivity-based scheduling algorithms to support the two classes of ER queries. Finally, we show that query-driven ER algorithms can converge and return results within minutes over a database populated with the extraction from a newswire dataset containing 71 million mentions.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131519306","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Object-to-Object Relationship-Based Access Control: Model and Multi-Cloud Demonstration (Invited Paper) 基于对象对对象关系的访问控制:模型和多云演示(特邀论文)

2016 IEEE 17th International Conference on Information Reuse and Integration (IRI) Pub Date : 1900-01-01 DOI: 10.1109/IRI.2016.47

Tahmina Ahmed, Farhan Patwa, R. Sandhu

{"title":"Object-to-Object Relationship-Based Access Control: Model and Multi-Cloud Demonstration (Invited Paper)","authors":"Tahmina Ahmed, Farhan Patwa, R. Sandhu","doi":"10.1109/IRI.2016.47","DOIUrl":"https://doi.org/10.1109/IRI.2016.47","url":null,"abstract":"Relationship Based Access Control (ReBAC) has been recognized as a distinctive form of access control since the advent of online social networks (OSNs). In the OSN context, ReBAC typically expresses authorization policy in terms of interpersonal relationship between users. OSN-inspired ReBAC models primarily focus on user-to-user relationships, although some have also considered user-to-resource and resource-to-resource relationships. An OSN has very specific type of resources (photos, comments, notes etc.) which are closely related to users, so it is natural to consider resource relationships in OSNs as occurring through users. However user-independent resource-to-resource (or object-to-object) relationships have been around for decades in information systems. For instance, object-oriented systems maintain inheritance, composition and association relationships among objects, version control systems use derived-from relationships between different versions, and digital content management systems use fundamental-relationships between different media files. To our knowledge no existing ReBAC model considers user-independent generic relationships between objects, as a useful means to express authorization policies. This paper proposes a novel Object-to-Object ReBAC model (OOReBAC) which uses object relationships for controlling access to objects. We build a proof-of-concept implementation of OOReBAC using the open source OpenStack cloud platform and specifically its Swift object storage service.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"482 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116521777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Classifying Questions into Fine-Grained Categories Using Topic Enriching 使用主题丰富将问题分类为细粒度类别

2016 IEEE 17th International Conference on Information Reuse and Integration (IRI) Pub Date : 1900-01-01 DOI: 10.1109/IRI.2016.29

Zhao Lu, Y. Lin, Qing Zhang, Mengwei Chen

{"title":"Classifying Questions into Fine-Grained Categories Using Topic Enriching","authors":"Zhao Lu, Y. Lin, Qing Zhang, Mengwei Chen","doi":"10.1109/IRI.2016.29","DOIUrl":"https://doi.org/10.1109/IRI.2016.29","url":null,"abstract":"The lasting popularity of many social Q&A websites, such as Yahoo! Answers and ResearchGate, has become valuable knowledge repositories for people to search for answers to questions in various aspects in life. Finding the most relevant questions is often a non-trivial task, and a fine-grained classification system of questions will be an important aid. Existing work mainly focused on classifying questions into different major categories (e.g., \"Health\",\"Computer\", etc.) without further dealing with the fine-grained categories (e.g., \"Dental\",\"Skin Conditions\", etc.). Identifying questions' finegrained categories is challenging due to the limited length of a question and insufficient content information available in these social Q&A websites. In this work, we propose a novel framework to classify questions into fine-grained categories based on enriching the related topics of questions. We leverage word embedding feature representation with topic modelings to determine the extended feature terms, i.e., terms that do not appeared in original question content. The enriched features then are used for fine-grained category classification. Extensive experiment results based on three large data collections showcase the effectiveness of our proposed approach.","PeriodicalId":319129,"journal":{"name":"2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133946369","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

A Computational Model for Dyadic Relationships (Invited Paper) 二矢关系的计算模型(特邀论文)

2016 IEEE 17th International Conference on Information Reuse and Integration (IRI) Pub Date : 1900-01-01 DOI: 10.1109/IRI.2016.83

Clio Andris

引用次数: 0

Information Fusion Using Characteristic Linear System in Multi-robot Search and Rescue Task 基于特征线性系统的多机器人搜救任务信息融合

2016 IEEE 17th International Conference on Information Reuse and Integration (IRI) Pub Date : 1900-01-01 DOI: 10.1109/IRI.2016.59

Pei-Ju Lee, V. Zadorozhny

引用次数: 0