Pub Date : 2008-07-13DOI: 10.1109/IRI.2008.4583033
R. Kountchev, S. Rubin, M. Milanova, V. Todorov, R. Kountcheva
A new method for contours extraction in grayscale images for body language study is presented in this paper. The image processing is based on two kinds of image filtration, used to suppress the image textures and to smooth the image background, retaining the main contours. For the textures suppression, we use an adaptive fuzzy filter and for the background processing we use a 2D linear digital filter of a non-recursive kind. The contours extraction is done with image segmentation based on the “Triangle algorithm”, specially modified for this application. The intelligent contours extraction is very useful for multiple applications, such as body language understanding, sign-language representations for training of deaf people, etc. The contour images permit very efficient lossless compression with high compression ratio, which is a base for the development of various application tools for the mobile communications and distance learning.
{"title":"Extraction of objects contours for body language study","authors":"R. Kountchev, S. Rubin, M. Milanova, V. Todorov, R. Kountcheva","doi":"10.1109/IRI.2008.4583033","DOIUrl":"https://doi.org/10.1109/IRI.2008.4583033","url":null,"abstract":"A new method for contours extraction in grayscale images for body language study is presented in this paper. The image processing is based on two kinds of image filtration, used to suppress the image textures and to smooth the image background, retaining the main contours. For the textures suppression, we use an adaptive fuzzy filter and for the background processing we use a 2D linear digital filter of a non-recursive kind. The contours extraction is done with image segmentation based on the “Triangle algorithm”, specially modified for this application. The intelligent contours extraction is very useful for multiple applications, such as body language understanding, sign-language representations for training of deaf people, etc. The contour images permit very efficient lossless compression with high compression ratio, which is a base for the development of various application tools for the mobile communications and distance learning.","PeriodicalId":169554,"journal":{"name":"2008 IEEE International Conference on Information Reuse and Integration","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126537817","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}
Pub Date : 2008-07-13DOI: 10.1109/IRI.2008.4583012
Adriana Leite, R. Girardi, Uiratan Cavalcante
The application of ontologies in Software Engineering presents several advantages. Ontologies allow for the formalized and integrated representation of models and their documentation in a same knowledge base, making the selection of these artifacts more precise through semantics inferences. They are also easily expandable and integrable. This paper introduces ONTORMAS, an ontology-driven tool for multi-agent systems development which integrates concepts from Multi-agent Domain and Application Engineering following the guidelines of the MADEM and MAAEM methodologies.
{"title":"An ontology for Multi-Agent Domain and Application Engineering","authors":"Adriana Leite, R. Girardi, Uiratan Cavalcante","doi":"10.1109/IRI.2008.4583012","DOIUrl":"https://doi.org/10.1109/IRI.2008.4583012","url":null,"abstract":"The application of ontologies in Software Engineering presents several advantages. Ontologies allow for the formalized and integrated representation of models and their documentation in a same knowledge base, making the selection of these artifacts more precise through semantics inferences. They are also easily expandable and integrable. This paper introduces ONTORMAS, an ontology-driven tool for multi-agent systems development which integrates concepts from Multi-agent Domain and Application Engineering following the guidelines of the MADEM and MAAEM methodologies.","PeriodicalId":169554,"journal":{"name":"2008 IEEE International Conference on Information Reuse and Integration","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122665561","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}
Pub Date : 2008-07-13DOI: 10.1109/IRI.2008.4583026
Chorng-Shyong Ong, Min-Yuh Day, W. Hsu
Question Answering Systems (QAS) are receiving increasing attention from information systems researchers, particularly those in the information retrieval and natural language processing communities. Evaluation of an information system’s success and user satisfaction are important issues in information systems research, especially for emerging online service systems on the Internet. Although many QAS have been implemented, little work has been done on the development of an evaluation model for them. The purpose of this study is to develop an evaluation model for question answering systems from user’s perspective. We have established the theoretical foundation and conceptualization of the constructs for user satisfaction with question answering systems. We have developed a general instrument capable of reliably and accurately measuring user satisfaction in the context of question answering systems. The proposed evaluation model provides a framework for the design of question answering systems from the user’s perspective to enhance user satisfaction and acceptance of QAS.
{"title":"Development of an evaluation model for Question Answering Systems","authors":"Chorng-Shyong Ong, Min-Yuh Day, W. Hsu","doi":"10.1109/IRI.2008.4583026","DOIUrl":"https://doi.org/10.1109/IRI.2008.4583026","url":null,"abstract":"Question Answering Systems (QAS) are receiving increasing attention from information systems researchers, particularly those in the information retrieval and natural language processing communities. Evaluation of an information system’s success and user satisfaction are important issues in information systems research, especially for emerging online service systems on the Internet. Although many QAS have been implemented, little work has been done on the development of an evaluation model for them. The purpose of this study is to develop an evaluation model for question answering systems from user’s perspective. We have established the theoretical foundation and conceptualization of the constructs for user satisfaction with question answering systems. We have developed a general instrument capable of reliably and accurately measuring user satisfaction in the context of question answering systems. The proposed evaluation model provides a framework for the design of question answering systems from the user’s perspective to enhance user satisfaction and acceptance of QAS.","PeriodicalId":169554,"journal":{"name":"2008 IEEE International Conference on Information Reuse and Integration","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130363495","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}
Pub Date : 2008-07-13DOI: 10.1109/IRI.2008.4583003
K. Pu, Ying Zhu
We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state machine and graph-based approaches to the problem of service composition, tree automata offers a more flexible and faithful modeling of multi-input services and their admissible compositions. In our framework, tree automata is used to express both type signature constraints of individual services as well as constraints on the order in which services must be invoked. To synthesize service compositions, users may provide optional specifications on the desired composite service. The user specifications are also expressed as tree automata. We employ a combination of tree automata algorithms to compute the set of all possible valid service compositions which satisfy the user specifications.
{"title":"Modeling and synthesis of service composition using tree automata","authors":"K. Pu, Ying Zhu","doi":"10.1109/IRI.2008.4583003","DOIUrl":"https://doi.org/10.1109/IRI.2008.4583003","url":null,"abstract":"We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state machine and graph-based approaches to the problem of service composition, tree automata offers a more flexible and faithful modeling of multi-input services and their admissible compositions. In our framework, tree automata is used to express both type signature constraints of individual services as well as constraints on the order in which services must be invoked. To synthesize service compositions, users may provide optional specifications on the desired composite service. The user specifications are also expressed as tree automata. We employ a combination of tree automata algorithms to compute the set of all possible valid service compositions which satisfy the user specifications.","PeriodicalId":169554,"journal":{"name":"2008 IEEE International Conference on Information Reuse and Integration","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129901547","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}
Pub Date : 2008-07-13DOI: 10.1109/IRI.2008.4583025
Cheng-Lung Sung, Cheng-Wei Lee, H. Yen, W. Hsu
In this paper, we propose an alignment-based surface pattern approach, called ABSP, which integrates semantic information into syntactic patterns for question answering (QA). ABSP uses surface patterns to extract important terms from questions, and constructs the terms’ relations from sentences in the corpus. The relations are then used to filter appropriate answer candidates. Experiments show that ABSP can achieve high accuracy and can be incorporated into other QA systems that have high coverage. It can also be used in cross-lingual QA systems. The approach is both robust and portable to other domains.
{"title":"An alignment-based surface pattern for a question answering system","authors":"Cheng-Lung Sung, Cheng-Wei Lee, H. Yen, W. Hsu","doi":"10.1109/IRI.2008.4583025","DOIUrl":"https://doi.org/10.1109/IRI.2008.4583025","url":null,"abstract":"In this paper, we propose an alignment-based surface pattern approach, called ABSP, which integrates semantic information into syntactic patterns for question answering (QA). ABSP uses surface patterns to extract important terms from questions, and constructs the terms’ relations from sentences in the corpus. The relations are then used to filter appropriate answer candidates. Experiments show that ABSP can achieve high accuracy and can be incorporated into other QA systems that have high coverage. It can also be used in cross-lingual QA systems. The approach is both robust and portable to other domains.","PeriodicalId":169554,"journal":{"name":"2008 IEEE International Conference on Information Reuse and Integration","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131064859","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}
Pub Date : 2008-07-13DOI: 10.1109/IRI.2008.4583015
Y. Wiseman, J. Isaacson, Eliad Lubovsky
The Linux kernel stack has a fixed size. There is no mechanism to prevent the kernel from overflowing the stack. Hackers can exploit this bug to put unwanted information in the memory of the operating system and gain control over the system. In order to prevent this problem, we introduce a dynamically sized kernel stack that can be integrated into the standard Linux kernel. The well-known paging mechanism is reused with some changes, in order to enable the kernel stack to grow.
{"title":"Eliminating the threat of kernel stack overflows","authors":"Y. Wiseman, J. Isaacson, Eliad Lubovsky","doi":"10.1109/IRI.2008.4583015","DOIUrl":"https://doi.org/10.1109/IRI.2008.4583015","url":null,"abstract":"The Linux kernel stack has a fixed size. There is no mechanism to prevent the kernel from overflowing the stack. Hackers can exploit this bug to put unwanted information in the memory of the operating system and gain control over the system. In order to prevent this problem, we introduce a dynamically sized kernel stack that can be integrated into the standard Linux kernel. The well-known paging mechanism is reused with some changes, in order to enable the kernel stack to grow.","PeriodicalId":169554,"journal":{"name":"2008 IEEE International Conference on Information Reuse and Integration","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129296644","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}
Pub Date : 2008-07-13DOI: 10.1109/IRI.2008.4583042
Jaewook Kim, Yun Peng, B. Kulvatunyou, N. Ivezic, Albert T. Jones
One of the most critical steps to integrating heterogeneous e-Business applications using different XML schemas is schema mapping, which is known to be costly and error-prone. Past research on schema mapping has not fully utilized semantic information in the XML schemas. In this paper, we propose a semantic similarity analysis approach to facilitate XML schema mapping, merging and reuse. Several key innovations are introduced to better utilize available semantic information. These innovations, including: 1) a layered semantic structure of XML schema, 2) layered specific similarity measures using an information content based approach, and 3) a scheme for integrating similarities at all layers. Experimental results using two different schemas from an real world application demonstrate that the proposed approach is valuable for addressing difficulties in XML schema mapping.
{"title":"A layered approach to semantic similarity analysis of XML schemas","authors":"Jaewook Kim, Yun Peng, B. Kulvatunyou, N. Ivezic, Albert T. Jones","doi":"10.1109/IRI.2008.4583042","DOIUrl":"https://doi.org/10.1109/IRI.2008.4583042","url":null,"abstract":"One of the most critical steps to integrating heterogeneous e-Business applications using different XML schemas is schema mapping, which is known to be costly and error-prone. Past research on schema mapping has not fully utilized semantic information in the XML schemas. In this paper, we propose a semantic similarity analysis approach to facilitate XML schema mapping, merging and reuse. Several key innovations are introduced to better utilize available semantic information. These innovations, including: 1) a layered semantic structure of XML schema, 2) layered specific similarity measures using an information content based approach, and 3) a scheme for integrating similarities at all layers. Experimental results using two different schemas from an real world application demonstrate that the proposed approach is valuable for addressing difficulties in XML schema mapping.","PeriodicalId":169554,"journal":{"name":"2008 IEEE International Conference on Information Reuse and Integration","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128038316","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}
Pub Date : 2008-07-13DOI: 10.1109/IRI.2008.4582995
Taher Naser, R. Alhajj, M. Ridley
This paper handles the conversion from an existing XML-Schema into object-oriented database. The major motivation for this work is to store XML-Schema into object oriented database. There are more common features between the object-oriented model and XML, and thus it is more attractive to map from XML into object-oriented database; such mapping preserves database specifics. To achieve the mapping, what we call the object graph is derived based on characteristics of the XML-Schema; it simply summarizes and includes all complex and simple elements and the links, which are the basics of the XML-Schema. Then, the links are simulated in terms of nesting to get a simulated object graph. This way, everything in a simulated object graph is directly representable in object-oriented database. Finally, we handle the mapping of the actual data from XML document(s) into the corresponding object-oriented database.
{"title":"Reengineering XML into object-oriented database","authors":"Taher Naser, R. Alhajj, M. Ridley","doi":"10.1109/IRI.2008.4582995","DOIUrl":"https://doi.org/10.1109/IRI.2008.4582995","url":null,"abstract":"This paper handles the conversion from an existing XML-Schema into object-oriented database. The major motivation for this work is to store XML-Schema into object oriented database. There are more common features between the object-oriented model and XML, and thus it is more attractive to map from XML into object-oriented database; such mapping preserves database specifics. To achieve the mapping, what we call the object graph is derived based on characteristics of the XML-Schema; it simply summarizes and includes all complex and simple elements and the links, which are the basics of the XML-Schema. Then, the links are simulated in terms of nesting to get a simulated object graph. This way, everything in a simulated object graph is directly representable in object-oriented database. Finally, we handle the mapping of the actual data from XML document(s) into the corresponding object-oriented database.","PeriodicalId":169554,"journal":{"name":"2008 IEEE International Conference on Information Reuse and Integration","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124117659","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}
Pub Date : 2008-07-13DOI: 10.1109/IRI.2008.4583002
Xutao Du, Chunxiao Xing, Lizhu Zhou
We use WCFA (Web Service Interface Control Flow Automata) to model web service interfaces. Global behaviors of web service compositions are captured by abstract reachability graph(ARG). A polynomial time algorithm for the construction of ARG is presented. The algorithm uses a reachability analysis to verify both safety and call stack inspection properties. Both kinds of properties are expressed by assertions at control points of ARG. Each control point is equipped with a state formula and a call stack. Verification is done by a SAT solver which checks whether the assertions are logical consequences of the state formulas(or the call stacks).
{"title":"Reachability analysis of Web service interfaces","authors":"Xutao Du, Chunxiao Xing, Lizhu Zhou","doi":"10.1109/IRI.2008.4583002","DOIUrl":"https://doi.org/10.1109/IRI.2008.4583002","url":null,"abstract":"We use WCFA (Web Service Interface Control Flow Automata) to model web service interfaces. Global behaviors of web service compositions are captured by abstract reachability graph(ARG). A polynomial time algorithm for the construction of ARG is presented. The algorithm uses a reachability analysis to verify both safety and call stack inspection properties. Both kinds of properties are expressed by assertions at control points of ARG. Each control point is equipped with a state formula and a call stack. Verification is done by a SAT solver which checks whether the assertions are logical consequences of the state formulas(or the call stacks).","PeriodicalId":169554,"journal":{"name":"2008 IEEE International Conference on Information Reuse and Integration","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128470149","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}
Pub Date : 2008-07-13DOI: 10.1109/IRI.2008.4583027
Ryan T. K. Lin, J. Chiu, Hong-Jie Dai, Min-Yuh Day, Richard Tzong-Han Tsai, W. Hsu
Specific information on biomolecular events such as protein-protein and gene-protein interactions is essential for molecular biology researchers. However, the results derived by current keyword-based information retrieval engine contain a great deal of noisy information, which forces biologists to use a combination of several keywords to locate information. To resolve this problem, we propose a question answering (QA) system that offers more efficient and user-friendly ways to retrieve desired information. In addition, QA system measurements may suffer from the same score problem, so the evaluation of a QA system may be unfair. An improved mean reciprocal rank (MRR) measurement, mean average reciprocal rank (MARR), and an efficient formula to reduce the computational complexity of the MARR are proposed to address the same score problem. With our syntactic and semantic features, our system achieves a Top-1 MARR of 74.11% and Top-5 MARR of 76.68%. Compared to the baseline system, Top-1 MARR and Top-5 MARR increase by 16.17% and 18.61% respectively.
{"title":"Biological question answering with syntactic and semantic feature matching and an improved mean reciprocal ranking measurement","authors":"Ryan T. K. Lin, J. Chiu, Hong-Jie Dai, Min-Yuh Day, Richard Tzong-Han Tsai, W. Hsu","doi":"10.1109/IRI.2008.4583027","DOIUrl":"https://doi.org/10.1109/IRI.2008.4583027","url":null,"abstract":"Specific information on biomolecular events such as protein-protein and gene-protein interactions is essential for molecular biology researchers. However, the results derived by current keyword-based information retrieval engine contain a great deal of noisy information, which forces biologists to use a combination of several keywords to locate information. To resolve this problem, we propose a question answering (QA) system that offers more efficient and user-friendly ways to retrieve desired information. In addition, QA system measurements may suffer from the same score problem, so the evaluation of a QA system may be unfair. An improved mean reciprocal rank (MRR) measurement, mean average reciprocal rank (MARR), and an efficient formula to reduce the computational complexity of the MARR are proposed to address the same score problem. With our syntactic and semantic features, our system achieves a Top-1 MARR of 74.11% and Top-5 MARR of 76.68%. Compared to the baseline system, Top-1 MARR and Top-5 MARR increase by 16.17% and 18.61% respectively.","PeriodicalId":169554,"journal":{"name":"2008 IEEE International Conference on Information Reuse and Integration","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126626201","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：