Pub Date : 2013-04-22DOI: 10.1109/ISPS.2013.6581496
Benouis Mohamed, Scnouci B. Mohamed
In this paper, we present an new approach to face recognition based on the combination of feature extraction methods, such as two-dimensional DWT-2DPCA and DWT-2DLDA, with a probabilistic neural networks. The technique 2D-DWT is used to eliminate the illumination, noise and redundancy of a face in order to reduce calculations of the probabilistic neural network operations.
{"title":"Face recognition approach based on two-dimensional subspace analysis and PNN","authors":"Benouis Mohamed, Scnouci B. Mohamed","doi":"10.1109/ISPS.2013.6581496","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581496","url":null,"abstract":"In this paper, we present an new approach to face recognition based on the combination of feature extraction methods, such as two-dimensional DWT-2DPCA and DWT-2DLDA, with a probabilistic neural networks. The technique 2D-DWT is used to eliminate the illumination, noise and redundancy of a face in order to reduce calculations of the probabilistic neural network operations.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117036738","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 : 2013-04-22DOI: 10.1109/ISPS.2013.6581498
Amira Bouaziz, A. Draa, S. Chikhi
A Quantum-inspired Artificial Bee Colony algorithm (QABC) for numerical optimisation is proposed in this paper. A hybridisation is made between two paradigms: Artificial Bee Colony (ABC) optimisation on one hand and Quantum Computing (QC) principles on the other hand. Some quantum concepts including the quantum bit, states superposition and quantum interference are used to enhance the diversity and computing capabilities of standard ABC algorithm. The experimental results obtained from testing the proposed algorithm on a set of numerical benchmark functions have shown that the QABC is competitive to quantum swarms and evolutionary approaches. It outperforms conventional evolutionary algorithms and quantum-inspired particle swarm algorithm.
{"title":"A Quantum-inspired Artificial Bee Colony algorithm for numerical optimisation","authors":"Amira Bouaziz, A. Draa, S. Chikhi","doi":"10.1109/ISPS.2013.6581498","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581498","url":null,"abstract":"A Quantum-inspired Artificial Bee Colony algorithm (QABC) for numerical optimisation is proposed in this paper. A hybridisation is made between two paradigms: Artificial Bee Colony (ABC) optimisation on one hand and Quantum Computing (QC) principles on the other hand. Some quantum concepts including the quantum bit, states superposition and quantum interference are used to enhance the diversity and computing capabilities of standard ABC algorithm. The experimental results obtained from testing the proposed algorithm on a set of numerical benchmark functions have shown that the QABC is competitive to quantum swarms and evolutionary approaches. It outperforms conventional evolutionary algorithms and quantum-inspired particle swarm algorithm.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117201130","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 : 2013-04-22DOI: 10.1109/ISPS.2013.6581501
B. Alshaqaqi, Abdullah Salem Baquhaizel, Mohamed El Amine Ouis, M. Boumehed, A. Ouamri, M. Keche
Drowsiness of drivers is amongst the significant causes of road accidents. Every year, it increases the amounts of deaths and fatalities injuries globally. In this paper, a module for Advanced Driver Assistance System (ADAS) is presented to reduce the number of accidents due to drivers fatigue and hence increase the transportation safety; this system deals with automatic driver drowsiness detection based on visual information and Artificial Intelligence. We proposed an algorithm to locate, track, and analyze both the drivers face and eyes to measure PERCLOS, a scientifically supported measure of drowsiness associated with slow eye closure.
{"title":"Vision based system for driver drowsiness detection","authors":"B. Alshaqaqi, Abdullah Salem Baquhaizel, Mohamed El Amine Ouis, M. Boumehed, A. Ouamri, M. Keche","doi":"10.1109/ISPS.2013.6581501","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581501","url":null,"abstract":"Drowsiness of drivers is amongst the significant causes of road accidents. Every year, it increases the amounts of deaths and fatalities injuries globally. In this paper, a module for Advanced Driver Assistance System (ADAS) is presented to reduce the number of accidents due to drivers fatigue and hence increase the transportation safety; this system deals with automatic driver drowsiness detection based on visual information and Artificial Intelligence. We proposed an algorithm to locate, track, and analyze both the drivers face and eyes to measure PERCLOS, a scientifically supported measure of drowsiness associated with slow eye closure.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115388620","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 : 2013-04-22DOI: 10.1109/ISPS.2013.6581497
Samia Boulkrinat, A. Hadjali, A. Mokhtari
In this work, we propose a novel approach to deal with user preference relations instead of absolute ratings, in recommender systems. User's preferences are ratings expressed qualitatively by using linguistic terms. This is a suitable technique when preferences are imprecise and vague. Due to the fact that the overall item rating may hide the users' preferences heterogeneity and mislead the system when predicting the items (products / services) that users are interested in, we also choose to incorporate multi-criteria ratings, which is a promising technique to improve the recommender systems accuracy. User's items ratings are represented through a preference graph which highlight better items relationships. Similarity between users is performed on the basis of the similarity of their preference relations instead of their absolute ratings, since preference relations can better reflect similar users' ratings patterns. Our approach enhances somehow the classical recommender system precision because the graphs used for prediction are more informative and reflect user's initial ratings relations.
{"title":"Enhancing recommender systems prediction through qualitative preference relations","authors":"Samia Boulkrinat, A. Hadjali, A. Mokhtari","doi":"10.1109/ISPS.2013.6581497","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581497","url":null,"abstract":"In this work, we propose a novel approach to deal with user preference relations instead of absolute ratings, in recommender systems. User's preferences are ratings expressed qualitatively by using linguistic terms. This is a suitable technique when preferences are imprecise and vague. Due to the fact that the overall item rating may hide the users' preferences heterogeneity and mislead the system when predicting the items (products / services) that users are interested in, we also choose to incorporate multi-criteria ratings, which is a promising technique to improve the recommender systems accuracy. User's items ratings are represented through a preference graph which highlight better items relationships. Similarity between users is performed on the basis of the similarity of their preference relations instead of their absolute ratings, since preference relations can better reflect similar users' ratings patterns. Our approach enhances somehow the classical recommender system precision because the graphs used for prediction are more informative and reflect user's initial ratings relations.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116434119","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 : 2013-04-22DOI: 10.1109/ISPS.2013.6581502
Y. Djenouri, H. Drias, Z. Habbas, A. Chemchem
The effectiveness and the robustness of the existing association rule mining algorithms provides a huge number of high quality rules that the user can not understand. Consequently, thinking about another representation of the generated rules becomes vital task. For this, the present paper explores meta-rules discovery. It focuses on clustering association rules for large data sets. This allows the user better organizing and interpreting the rules. The main idea is to develop a clustering algorithm for the whole rules extracted by the association rule mining process (ARM). As a result, a set of meta-rules that the user or the data analyst can interpret are obtained, which permits to take a wise decision in a given domain. The issue for addressing such problem is to find an approach to perform clustering of association rules, which is a challenging problem not dealt with thus far. An adaptation of the k-means algorithm for association rules is proposed, by using new designed similarity measures and specific centroid computation. The clustering approach has been tested on a large data set obtained by merging three different public benchmarks. The result is promising. The proposed clustering generates three clusters, each includes one of the three benchmarks with a success rate varying from 70% to 90%.
{"title":"Organizing association rules with meta-rules using knowledge clustering","authors":"Y. Djenouri, H. Drias, Z. Habbas, A. Chemchem","doi":"10.1109/ISPS.2013.6581502","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581502","url":null,"abstract":"The effectiveness and the robustness of the existing association rule mining algorithms provides a huge number of high quality rules that the user can not understand. Consequently, thinking about another representation of the generated rules becomes vital task. For this, the present paper explores meta-rules discovery. It focuses on clustering association rules for large data sets. This allows the user better organizing and interpreting the rules. The main idea is to develop a clustering algorithm for the whole rules extracted by the association rule mining process (ARM). As a result, a set of meta-rules that the user or the data analyst can interpret are obtained, which permits to take a wise decision in a given domain. The issue for addressing such problem is to find an approach to perform clustering of association rules, which is a challenging problem not dealt with thus far. An adaptation of the k-means algorithm for association rules is proposed, by using new designed similarity measures and specific centroid computation. The clustering approach has been tested on a large data set obtained by merging three different public benchmarks. The result is promising. The proposed clustering generates three clusters, each includes one of the three benchmarks with a success rate varying from 70% to 90%.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"15 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132580607","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 : 2013-04-22DOI: 10.1109/ISPS.2013.6581481
Djalel Abdeli, Saoussan Zelit, S. Moussaoui
Recently, Wireless Sensor Networks (WSNs) grow to be one of the dominant technology trends; new needs are continuously emerging and demanding more complex constraints, such as the real time communication. The MAC layer plays a crucial role in these networks; it controls the communication module and manages the medium sharing. In this work, we describe the Real Time Hybrid MAC (RTH-MAC) protocol for WSNs. It combines the advantages of both TDMA and FDMA in order to offer a soft real time communication to a converge-cast WSN randomly deployed. It schedules nodes communication in a central manner that eliminates collisions, minimizes interferences, and ensures a small bounded end-to-end delay. Moreover, this protocol offers a probabilistic end-to-end reliability guarantee using an acknowledgment mechanism, and offers to the end user the possibility of adapting the duty cycling ratio. Simulation results show that RTH-MAC presents good performances in term of the end-to-end delay, reliability and scalability.
{"title":"RTH-MAC: A real time hybrid MAC protocol for WSN","authors":"Djalel Abdeli, Saoussan Zelit, S. Moussaoui","doi":"10.1109/ISPS.2013.6581481","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581481","url":null,"abstract":"Recently, Wireless Sensor Networks (WSNs) grow to be one of the dominant technology trends; new needs are continuously emerging and demanding more complex constraints, such as the real time communication. The MAC layer plays a crucial role in these networks; it controls the communication module and manages the medium sharing. In this work, we describe the Real Time Hybrid MAC (RTH-MAC) protocol for WSNs. It combines the advantages of both TDMA and FDMA in order to offer a soft real time communication to a converge-cast WSN randomly deployed. It schedules nodes communication in a central manner that eliminates collisions, minimizes interferences, and ensures a small bounded end-to-end delay. Moreover, this protocol offers a probabilistic end-to-end reliability guarantee using an acknowledgment mechanism, and offers to the end user the possibility of adapting the duty cycling ratio. Simulation results show that RTH-MAC presents good performances in term of the end-to-end delay, reliability and scalability.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114075033","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 : 2013-04-22DOI: 10.1109/ISPS.2013.6581482
Fouzia Angucl, A. Amirat, N. Bounour
Model Driven Software Engineering has matured over the last few years and is now becoming an established technology. As a consequence dealing with evolving metamodels and the necessary co-evolution of instances of this metamodel is becoming increasingly important. Several approaches have been proposed to solve model co-evolution problem. In this paper, Firstly, existing approaches in this area are analyzed to define requirements of our approach, namely automaticity, reuse, expressiveness and intelligence. After that we present a new approach CBRMig towards a solution to metamodel and model co-evolution problem. The core of our proposal is using a case based reasoning system that automates the process of creation and selection of cases to assist with the generation of a migration algorithm used for adapting models in response to metamodel evolution.
{"title":"Towards models and metamodels co-evolution approach","authors":"Fouzia Angucl, A. Amirat, N. Bounour","doi":"10.1109/ISPS.2013.6581482","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581482","url":null,"abstract":"Model Driven Software Engineering has matured over the last few years and is now becoming an established technology. As a consequence dealing with evolving metamodels and the necessary co-evolution of instances of this metamodel is becoming increasingly important. Several approaches have been proposed to solve model co-evolution problem. In this paper, Firstly, existing approaches in this area are analyzed to define requirements of our approach, namely automaticity, reuse, expressiveness and intelligence. After that we present a new approach CBRMig towards a solution to metamodel and model co-evolution problem. The core of our proposal is using a case based reasoning system that automates the process of creation and selection of cases to assist with the generation of a migration algorithm used for adapting models in response to metamodel evolution.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133302992","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 : 2013-04-22DOI: 10.1109/ISPS.2013.6581480
Pierre Olivier, Jalil Boukhobza, E. Senn
This paper presents a methodology for modeling performance and power consumption of NAND flash memory I/O operations. This study focuses on embedded systems executing the Linux Operating System (OS), equipped with bare flash chips (e.g, smartphones, tablets, routers, etc). Bare flash chips are fully managed by the Linux OS through some specific flash file systems. Indeed, embedded Linux became the de facto OS for many embedded systems, and predicting the performance and energy consumption of I/O operations is critical for many application domains such as multimedia and embedded databases. The presented model is designed at the driver level, and each elementary NAND flash key-operation is modeled. As a case study, the methodology presented was applied and validated on a test hardware / software platform. The modeling methodology relies on a generic and reusable parameter extraction process and tools. Their purpose is to characterize flash power consumption and performance in order to specialize the model for various platforms. This work is a first step toward modeling the performance and the power consumption for all the embedded Linux I/O storage hierarchy: from the applicative layer and down to the storage media.
{"title":"Modeling driver level NAND flash memory I/O performance and power consumption for embedded Linux","authors":"Pierre Olivier, Jalil Boukhobza, E. Senn","doi":"10.1109/ISPS.2013.6581480","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581480","url":null,"abstract":"This paper presents a methodology for modeling performance and power consumption of NAND flash memory I/O operations. This study focuses on embedded systems executing the Linux Operating System (OS), equipped with bare flash chips (e.g, smartphones, tablets, routers, etc). Bare flash chips are fully managed by the Linux OS through some specific flash file systems. Indeed, embedded Linux became the de facto OS for many embedded systems, and predicting the performance and energy consumption of I/O operations is critical for many application domains such as multimedia and embedded databases. The presented model is designed at the driver level, and each elementary NAND flash key-operation is modeled. As a case study, the methodology presented was applied and validated on a test hardware / software platform. The modeling methodology relies on a generic and reusable parameter extraction process and tools. Their purpose is to characterize flash power consumption and performance in order to specialize the model for various platforms. This work is a first step toward modeling the performance and the power consumption for all the embedded Linux I/O storage hierarchy: from the applicative layer and down to the storage media.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131628234","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 : 2013-04-22DOI: 10.1109/ISPS.2013.6581478
Hafed Zarzour, M. Sellami
An important topic within Computer Supported Collaborative Work is collaborative editing or authoring system, which has been an interesting research area by the release of Web 2.0 products including Social Networks, Wikipedia, CMS, Google Docs, Blogs and many, many more. SPARQL/UPDATE is emerging as a reaction to this challenge. However, the current standard allows only a single authoring of triple-stores and does not provide transparent mechanism to support collaborative authoring. Furthermore, maintaining consistency between distributed triple-stores executing concurrent operations is a difficult problem. To solve this problem, this paper proposes a novel p2pCoSU solution that supports collaborative authoring for P2P semantic triple-stores and ensures causality, consistency and intention preservation criteria. We evaluate and compare the performance of the proposed p2pCoSU and related approaches by simulation; the results show that our solution is efficient and scalable.
{"title":"p2pCoSU: A P2P Sparql/update for collaborative authoring of triple-stores","authors":"Hafed Zarzour, M. Sellami","doi":"10.1109/ISPS.2013.6581478","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581478","url":null,"abstract":"An important topic within Computer Supported Collaborative Work is collaborative editing or authoring system, which has been an interesting research area by the release of Web 2.0 products including Social Networks, Wikipedia, CMS, Google Docs, Blogs and many, many more. SPARQL/UPDATE is emerging as a reaction to this challenge. However, the current standard allows only a single authoring of triple-stores and does not provide transparent mechanism to support collaborative authoring. Furthermore, maintaining consistency between distributed triple-stores executing concurrent operations is a difficult problem. To solve this problem, this paper proposes a novel p2pCoSU solution that supports collaborative authoring for P2P semantic triple-stores and ensures causality, consistency and intention preservation criteria. We evaluate and compare the performance of the proposed p2pCoSU and related approaches by simulation; the results show that our solution is efficient and scalable.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122914902","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 : 2013-04-22DOI: 10.1109/ISPS.2013.6581495
Loutfi Zerarga, Y. Djouadi
With the large increase of collections of structured documents (e.g. XML, HTML, ...), the need to retrieve different granules (fragments, sub-units, ...) of such documents, instead of the whole structure, becomes obvious. Nowadays, all existing Formal Concept Analysis-based Information Retrieval approaches address exclusively unstructured documents. They rely on the use of dyadic formal contexts (i.e. binary Documents × Terms relations). In this paper an original approach which consists of enlarging FCA-based IR paradigm to structured documents is proposed. Our approach stands from the idea of modeling structured documents by means of triadic formal contexts (i.e. ternary Documents × Terms × Structure relation). This allows to retrieve sub-units or fragments of structured documents. In structured information retrieval, queries may be of different types. This paper deals with content-only queries and gives a theoretical framework for both conjunctive as well as disjunctive forms.
{"title":"Content-only querying structured contexts using formal concept analysis","authors":"Loutfi Zerarga, Y. Djouadi","doi":"10.1109/ISPS.2013.6581495","DOIUrl":"https://doi.org/10.1109/ISPS.2013.6581495","url":null,"abstract":"With the large increase of collections of structured documents (e.g. XML, HTML, ...), the need to retrieve different granules (fragments, sub-units, ...) of such documents, instead of the whole structure, becomes obvious. Nowadays, all existing Formal Concept Analysis-based Information Retrieval approaches address exclusively unstructured documents. They rely on the use of dyadic formal contexts (i.e. binary Documents × Terms relations). In this paper an original approach which consists of enlarging FCA-based IR paradigm to structured documents is proposed. Our approach stands from the idea of modeling structured documents by means of triadic formal contexts (i.e. ternary Documents × Terms × Structure relation). This allows to retrieve sub-units or fragments of structured documents. In structured information retrieval, queries may be of different types. This paper deals with content-only queries and gives a theoretical framework for both conjunctive as well as disjunctive forms.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125307388","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
扫码关注我们
求助内容：
应助结果提醒方式：