{"title":"Generating Semantics for the Life Sciences via Text Analytics","authors":"E. Buyko, U. Hahn","doi":"10.1109/ICSC.2011.75","DOIUrl":"https://doi.org/10.1109/ICSC.2011.75","url":null,"abstract":"The life sciences have a strong need for carefully curated, semantically rich fact repositories. Knowledge harvesting from unstructured textual sources is currently performed by highly skilled curators who manually feed semantics into such databases as a result of deep understanding of the documents chosen to populate such repositories. As this is a slow and costly process, we here advocate an automatic approach to the generation of database contents which is based on JREX, a high performance relation extraction system. As a real-life example, we target REGULONDB, the world's largest manually curated reference database for the transcriptional regulation network of E. coli. We investigate in our study the performance of automatic knowledge capture from various literature sources, such as PUBMED abstracts and associated full text articles. Our results show that we can, indeed, automatically re-create a considerable portion of the REGULONDB database by processing the relevant literature sources. Hence, this approach might help curators widen the knowledge acquisition bottleneck in this field.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124519683","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}
{"title":"Ubiquitous Semantics: How to Create and Navigate a Personal Semantic Network","authors":"Oliver Brdiczka","doi":"10.1109/ICSC.2011.13","DOIUrl":"https://doi.org/10.1109/ICSC.2011.13","url":null,"abstract":"Pervasive computing systems including smart phones, home computing systems, or intelligent home appliances collect and store more and more information about users. The amount of information that is constantly being accumulated for each user is enormous. Collected information comprises the user's digital data like messages, online social network connections, or tweets and the user's physical context data like user location, physical proximity to other people, or physical activities. Increasingly powerful content analysis and physical context inference technologies enable the extraction of relationships among places, people, and events, and use the resulting context to construct a personal semantic network (PSN) of the contextual relationships across one's digital and physical interactions. Entities representing locations, people, events, activities etc. serve as pivotal elements empowering the user to navigate their PSN. This paper will discuss and detail both the construction and navigation of a PSN integrating a user's physical and digital content.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128429252","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}
{"title":"Feature Distance-Based Framework for Classification of Low-Frequency Semantic Relations","authors":"Andre Kenji Horie, M. Ishizuka","doi":"10.1109/ICSC.2011.9","DOIUrl":"https://doi.org/10.1109/ICSC.2011.9","url":null,"abstract":"In the relation extraction of semantic relations, it is not uncommon to face settings in which the training data provides very few instances of some relation classes. This is mostly due to the high cost of producing such data and to the class imbalance problem, which may result in some classes presenting small frequencies even with a large annotated corpus. This work thus presents a semi-supervised bootstrapped method to expand this initial training dataset, using pattern matching to extract new candidate instances from the Web. The core of this process uses a multi view feature distance-based framework, which allows quantitative and qualitative analysis of intermediate steps of the process. Experimental results show that this framework provides better results in the relation classification task than the baseline, and the bootstrapped architecture improves the relation classification task as a whole for these low-frequency semantic relations settings.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116270085","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}
{"title":"Spatiotemporal Annotation: Interaction between Standards and other Formats","authors":"Ineke Schuurman, Vincent Vandeghinste","doi":"10.1109/ICSC.2011.31","DOIUrl":"https://doi.org/10.1109/ICSC.2011.31","url":null,"abstract":"Standards and the need for standards, for example for annotation purposes, only emerge after a period of time. Before, people just did what they thought was right. This may have resulted in large amounts of data in a format that in the end did not turn out to be on speaking terms with the (new) standard. This format may even have become a de facto standard for a particular language or in a particular domain. In this paper we discuss an approach for situations in which ISOcat is used to mediate between such formats. Another task for ISOcat is to indicate the possible re-use of the output of semantic annotation X using format Y for a new annotation Z. These possibilities are to a large extent determined by the compatibility of the (definitions of the) data categories used in both. The spatiotemporal annotation schema STEx, as used in the SoNaR-corpus, is central to this paper. Its input consists of other (semantic) annotations. In the TTNWW-project1 STEx is related to relevant standards, like ISO-Time ML, and state-of-the-art formats, like Spatial ML. We describe which conditions should be met and how ISOcat can offer a helping hand.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123393803","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}
{"title":"An Ontology for Resource Sharing","authors":"K. Rohloff, J. Loyall","doi":"10.1109/ICSC.2011.11","DOIUrl":"https://doi.org/10.1109/ICSC.2011.11","url":null,"abstract":"We describe an ontology for resource sharing in integrated systems. We call this ontology the \"Resource Sharing Ontology.\" This ontology addresses one of the main challenges for system and service integration: the management of resource sharing interactions. These interactions, whether explicit or implicit, are difficult to model and manage, but they are critical for safe and efficient system designs. Our resource sharing ontology also covers performance assessments on resource sharing for online and offline control and diagnosis. We discuss ontology extensions for specific resource sharing scenarios such as the assessment of resource sharing complexity. We provide examples of using the ontology to model applications, such as an RLC circuit and for the assessment of a resource contention complexity metric for the maintenance of a prototype hybrid vehicle.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124752613","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}
{"title":"Optimizing a Semantic Comparator Using CUDA-enabled Graphics Hardware","authors":"Aalap Tripathy, S. Mohan, R. Mahapatra","doi":"10.1109/ICSC.2011.56","DOIUrl":"https://doi.org/10.1109/ICSC.2011.56","url":null,"abstract":"Emerging semantic search techniques require fast comparison of large \"concept trees\". This paper addresses the challenges involved in fast computation of similarity between two large concept trees using a CUDA-enabled GPGPU co-processor. We propose efficient techniques for the same using fast hash computations, membership tests using Bloom Filters and parallel reduction. We show how a CUDA-enabled mass produced GPU can form the core of a semantic comparator for better semantic search. We experiment run-time, power and energy consumed for similarity computation on two platforms: (1) traditional sever class Intel x86 processor (2) CUDA enabled graphics hardware. Results show 4x speedup with 78% overall energy reduction over sequential processing approaches. Our design can significantly reduce the number of servers required in a distributed search engine data center and can bring an order of magnitude reduction in energy consumption, operational costs and floor area.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122114731","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}
Daniela Oliveira, D. Murthy, H. Johnson, S. F. Wu, R. Nia, J. Rowe
{"title":"A Socially-Aware Operating System for Trustworthy Computing","authors":"Daniela Oliveira, D. Murthy, H. Johnson, S. F. Wu, R. Nia, J. Rowe","doi":"10.1109/ICSC.2011.45","DOIUrl":"https://doi.org/10.1109/ICSC.2011.45","url":null,"abstract":"Traditional security models based on distinguishing trusted from untrusted pieces of data and program behavior continue to face difficulties keeping up with attackers' levels of sophistication and ingenuity. In this position paper, we present a novel computing paradigm for trustworthy computing whose application, operating system (OS) and architecture can leverage social trust to enhance the robustness and diversity of security mechanisms of any Internet-based computing environment. Our model would allow online social network (OSN) users to assign trust values to her friends in a privacy-preserving fashion and maintain a trust repository with trust values for objects like URLs, email addresses, IP addresses and other pieces of data that can be consumed by a socially-aware OS, allowing for fine-grained trust decisions that take into account user context and add diversity to host behavior. Our model also automatically infer trust values for people a user is not directly connected. In this paper we sketch the design of a socially-aware operating system kernel and identify several research challenges for this new paradigm.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115026343","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}
{"title":"Symmetric Paths: Their Structures and Relations","authors":"Seungho Nam","doi":"10.1109/ICSC.2011.62","DOIUrl":"https://doi.org/10.1109/ICSC.2011.62","url":null,"abstract":"The goal of this paper is two-fold: (i) the paper aims to characterize unique semantics of so called \"symmetric\" locatives like across the street -- this will provide a guiding semantics for annotating a variety of paths, and (ii) the paper claims that we need \"symmetric\" paths to give a unified account of the various semantic effects of symmetric locatives. The paper illustrates several semantic effects induced by symmetric locatives: (i) symmetric under specification, (ii) path-/event-quantification, (iii) static symmetric relations, and (iv) the symmetric inference by the adverb back. The paper defines the semantic class of symmetric locatives, and accounts for the symmetry effects in terms of properties and relations of Path Structure proposed by Nam (1995).","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129955418","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}
{"title":"A Comprehensive Study of Feature Representations for Semantic Concept Detection","authors":"Duy-Dinh Le, S. Satoh","doi":"10.1109/ICSC.2011.92","DOIUrl":"https://doi.org/10.1109/ICSC.2011.92","url":null,"abstract":"In this paper, we study the performance of global features and local features for the semantic concept detection problem, which is a crucial task for video indexing and retrieval applications. We have performed a comprehensive evaluation of these features on TRECVID datasets that are used in the concept detection benchmark from 2005 to 2009. The experimental results show that with appropriate choice of parameters, global features such as local binary patterns and edge orientation histogram can achieve reasonable performance compared with local features using BoW model while requiring fewer number of parameters to be tuned and lower computational cost. Furthermore, we also investigate on how to design a compact concept detection system that can balance between computational cost and accuracy.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133292487","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}
{"title":"Link Discovery: A Comprehensive Analysis","authors":"Nicolai Erbs, Torsten Zesch, Iryna Gurevych","doi":"10.1109/ICSC.2011.63","DOIUrl":"https://doi.org/10.1109/ICSC.2011.63","url":null,"abstract":"We present a comprehensive analysis of link discovery approaches. We classify them with regard to the type of knowledge being used, and identify three commonly used sources of knowledge: The text of a document, the document title, and already existing links. We analyze the influence of the knowledge source as well as of the amount of training data used. Results show that the link-based approach performs best if the amount of training data is huge. In a more realistic setting with fewer training data, the text-based approach yields better results.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132327856","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}