Pub Date : 2012-09-01DOI: 10.1109/INTECH.2012.6457795
A. Kabiri, D. Chiadmi
In Data warehouse (DW) environment, Extraction-Transformation-Loading (ETL) processes constitute the integration layer which aims to pull data from data sources to targets, via a set of transformations. ETL is responsible for the extraction of data, their cleaning, conforming and loading into the target. At the beginning of DW project, one of the most important tasks is to construct conceptual design of ETL processes. Several solutions have been proposed to support ETL designer in this task. Nevertheless few methods have accompanied these proposals. In this paper, we present a method for modeling and organizing ETL processes based on our experience in real world. The proposed approach takes four inputs and produces a conceptual model of ETL processes using a graphical notation of our framework KANTARA.
{"title":"A method for modelling and organazing ETL processes","authors":"A. Kabiri, D. Chiadmi","doi":"10.1109/INTECH.2012.6457795","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457795","url":null,"abstract":"In Data warehouse (DW) environment, Extraction-Transformation-Loading (ETL) processes constitute the integration layer which aims to pull data from data sources to targets, via a set of transformations. ETL is responsible for the extraction of data, their cleaning, conforming and loading into the target. At the beginning of DW project, one of the most important tasks is to construct conceptual design of ETL processes. Several solutions have been proposed to support ETL designer in this task. Nevertheless few methods have accompanied these proposals. In this paper, we present a method for modeling and organizing ETL processes based on our experience in real world. The proposed approach takes four inputs and produces a conceptual model of ETL processes using a graphical notation of our framework KANTARA.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124394219","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457781
A. Amirat, A. Bouchouk, M. O. Yeslem, N. Gasmallah
Software in use needs to be adapted to changing requirements and this involves changing the architecture of the system. Software architecture usually suffers from problems known as architectural bad smells, e.g. dependency cycles, duplicate design artifacts and so on. Architecture refactoring can be considered as the first step in the quest of maintaining system quality during evolution, and a process of eliminating architectural bad smells. In this respect, to improve quality and decrease complexity, software artifacts need to be restructured and refactored. The impact of refactoring on the architecture level can be very useful by leading to the architectural stability of the system, and can keep software architecture clean, easy to maintain and easy to evolve. In this paper, we introduce an approach for refactoring component based software architecture artifacts using graph transformations; we use a specific graph transformation tool called AGG (Attribute Graph Grammar) in order to get rid of architectural bad smells.
{"title":"Refactor Software architecture using graph transformation approach","authors":"A. Amirat, A. Bouchouk, M. O. Yeslem, N. Gasmallah","doi":"10.1109/INTECH.2012.6457781","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457781","url":null,"abstract":"Software in use needs to be adapted to changing requirements and this involves changing the architecture of the system. Software architecture usually suffers from problems known as architectural bad smells, e.g. dependency cycles, duplicate design artifacts and so on. Architecture refactoring can be considered as the first step in the quest of maintaining system quality during evolution, and a process of eliminating architectural bad smells. In this respect, to improve quality and decrease complexity, software artifacts need to be restructured and refactored. The impact of refactoring on the architecture level can be very useful by leading to the architectural stability of the system, and can keep software architecture clean, easy to maintain and easy to evolve. In this paper, we introduce an approach for refactoring component based software architecture artifacts using graph transformations; we use a specific graph transformation tool called AGG (Attribute Graph Grammar) in order to get rid of architectural bad smells.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125342459","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457808
M. Madkour, A. Maach, E. Driss, A. Hasbi
The idea presented in paper is inspired from the wide prospect given by the integration of fuzzy sets and linguistic quantifiers in the modeling of context and quantification of similarities measurement. In pervasive services retrieval, dealing with context in a flexible and efficient way is extremely important. In this paper we propose a practical classification of context into functional and non functional context. We use the first type in the service discovery with an ontology based model supporting fuzzy context predicates and fuzzy reasoning, while the second type is used for the best-fitting service selection based on the linguistic quantifier “almost all”. Finally, the listed scenario example illustrates the realization and the effectiveness of our approach.
{"title":"Fuzzy-based approach for context-aware service retrieval","authors":"M. Madkour, A. Maach, E. Driss, A. Hasbi","doi":"10.1109/INTECH.2012.6457808","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457808","url":null,"abstract":"The idea presented in paper is inspired from the wide prospect given by the integration of fuzzy sets and linguistic quantifiers in the modeling of context and quantification of similarities measurement. In pervasive services retrieval, dealing with context in a flexible and efficient way is extremely important. In this paper we propose a practical classification of context into functional and non functional context. We use the first type in the service discovery with an ontology based model supporting fuzzy context predicates and fuzzy reasoning, while the second type is used for the best-fitting service selection based on the linguistic quantifier “almost all”. Finally, the listed scenario example illustrates the realization and the effectiveness of our approach.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122033079","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457818
A. Chergui, A. Bekkhoucha, W. Sabbar
Extraction methods of points of interest in image characterization are many and diverse. In general the process of characterization follows a construction of a detector/descriptor schema. The detection allows selecting some points of interest as primitives who capture important structural information about the image. These detected points are then described by characteristic vectors to form a representative signature of the image. We find many applications of these methods in systems of classification, indexing and search by content in the images databases. While most of detection methods offer descriptors related both to the detection phase and the destination application. For the FAST (Features from Accelerated Segment Test) method, it remains one of the fastest methods currently, and located many application in the tasks of instant characterization. However, the authors of this method offer only a detection approach, without explicitly giving the approach of description to let this part for future application methods. On the other hand, others methods based on graphs, bringing structural aspects over the statistical methods of characterization. In this paper, we propose a method of characterization of the image by the graph that uses points of interest detected by the FAST algorithm to construct the structure of graphs of characterization. Thus the image similarity transforms into a problem of graphs matching. We then describe the advantage offered by this method over conventional characterization approaches.
图像表征中兴趣点的提取方法多种多样。一般来说，描述过程遵循检测器/描述符模式的构造。检测允许选择一些感兴趣的点作为捕捉图像重要结构信息的原语。然后用特征向量描述这些检测到的点，形成图像的代表性签名。我们发现这些方法在图像数据库的分类、索引和按内容搜索系统中有很多应用。虽然大多数检测方法都提供了与检测阶段和目标应用程序相关的描述符。对于FAST (Features from Accelerated Segment Test)方法来说，它仍然是目前最快的方法之一，在即时表征任务中有很多应用。但是，该方法的作者只提供了一种检测方法，并没有明确给出方法的描述，让这部分方法用于以后的应用。另一方面，其他方法基于图，带来结构方面的特征优于统计方法。在本文中，我们提出了一种利用FAST算法检测到的兴趣点来构造表征图结构的图像图表征方法。这样，图像相似性问题就转化为图形匹配问题。然后，我们描述了这种方法比传统表征方法提供的优势。
{"title":"Construction of an image descriptor from graph representation based on a primitives detected by FAST","authors":"A. Chergui, A. Bekkhoucha, W. Sabbar","doi":"10.1109/INTECH.2012.6457818","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457818","url":null,"abstract":"Extraction methods of points of interest in image characterization are many and diverse. In general the process of characterization follows a construction of a detector/descriptor schema. The detection allows selecting some points of interest as primitives who capture important structural information about the image. These detected points are then described by characteristic vectors to form a representative signature of the image. We find many applications of these methods in systems of classification, indexing and search by content in the images databases. While most of detection methods offer descriptors related both to the detection phase and the destination application. For the FAST (Features from Accelerated Segment Test) method, it remains one of the fastest methods currently, and located many application in the tasks of instant characterization. However, the authors of this method offer only a detection approach, without explicitly giving the approach of description to let this part for future application methods. On the other hand, others methods based on graphs, bringing structural aspects over the statistical methods of characterization. In this paper, we propose a method of characterization of the image by the graph that uses points of interest detected by the FAST algorithm to construct the structure of graphs of characterization. Thus the image similarity transforms into a problem of graphs matching. We then describe the advantage offered by this method over conventional characterization approaches.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123497263","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457748
R. M. Kongo, Lhousaine Masmoudi, Nadia Idrissi, N. Hassanain, M. Cherkaoui, A. Roukhe
A combined dual-tree transform wavelet (DT-CWT) and Bivariate Shrinkage for medical image watermarking is proposed in this paper. For this suggested approach, security issues for medical information and technical solution to protect these data in medical information are examined. A solution is proposed, which consisted in watermarking image areas that are not relevant for the diagnosis. The main part of this paper is devoted to exploit the exceptional quality of DTT combined with Bivariate Shrinkage with Local Variance Estimation at the extracted step of the watermark in the medical images. The experimental results showed much improved performance of the proposed technique for DT-CWT in comparison with DWT. The system is transparent to the user and allows image integrity control, in addition, it provide information on the location of potential alterations and evaluation of image modifications which is of major importance in medico-legal frame work. In addition the proposed scheme presented a flexible robustness against and favorably preserves the visual quality.
{"title":"A medical image watermarking scheme based on dual-tree wavelet transform","authors":"R. M. Kongo, Lhousaine Masmoudi, Nadia Idrissi, N. Hassanain, M. Cherkaoui, A. Roukhe","doi":"10.1109/INTECH.2012.6457748","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457748","url":null,"abstract":"A combined dual-tree transform wavelet (DT-CWT) and Bivariate Shrinkage for medical image watermarking is proposed in this paper. For this suggested approach, security issues for medical information and technical solution to protect these data in medical information are examined. A solution is proposed, which consisted in watermarking image areas that are not relevant for the diagnosis. The main part of this paper is devoted to exploit the exceptional quality of DTT combined with Bivariate Shrinkage with Local Variance Estimation at the extracted step of the watermark in the medical images. The experimental results showed much improved performance of the proposed technique for DT-CWT in comparison with DWT. The system is transparent to the user and allows image integrity control, in addition, it provide information on the location of potential alterations and evaluation of image modifications which is of major importance in medico-legal frame work. In addition the proposed scheme presented a flexible robustness against and favorably preserves the visual quality.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114558202","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457819
A. E. Bouchti, A. Haqiq
High Speed Downlink Packet Access (HSDPA) is being increasingly deployed to enhance UMTS Radio Access Networks. Scheduling of Node B (base station) buffered user data for transmission over a shared radio channel is a key HSDPA functionality which enables queue management techniques to be utilized to improve Quality of Service (QoS) for mixed `multimedia' services. In this paper, we study a control access scheme of multimedia stream in HSDPA channel. The control scheme consists in putting thresholds in the channel in order to well manage the access of the various packets by giving priority of access to the packets at real time. The RT arrival is modeled by a Poisson process and the NRT arrival by a Markovian Arrival Process (MAP) with two states. We use stochastic reward Nets (SRN) approach to derive QoS metrics of this control. Obtained results show the impact of workload aspects (e.g., arrival rate and service rate) and system capacity on two performance measures: mean response delay and job blocking probability.
{"title":"Quality of Service analysis of control access scheme of multimedia traffic in HSDPA channel using Markovian Arrival Process and stochastic reward Nets","authors":"A. E. Bouchti, A. Haqiq","doi":"10.1109/INTECH.2012.6457819","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457819","url":null,"abstract":"High Speed Downlink Packet Access (HSDPA) is being increasingly deployed to enhance UMTS Radio Access Networks. Scheduling of Node B (base station) buffered user data for transmission over a shared radio channel is a key HSDPA functionality which enables queue management techniques to be utilized to improve Quality of Service (QoS) for mixed `multimedia' services. In this paper, we study a control access scheme of multimedia stream in HSDPA channel. The control scheme consists in putting thresholds in the channel in order to well manage the access of the various packets by giving priority of access to the packets at real time. The RT arrival is modeled by a Poisson process and the NRT arrival by a Markovian Arrival Process (MAP) with two states. We use stochastic reward Nets (SRN) approach to derive QoS metrics of this control. Obtained results show the impact of workload aspects (e.g., arrival rate and service rate) and system capacity on two performance measures: mean response delay and job blocking probability.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130262815","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457755
S. Ousguine, F. Essanouni, L. Essanouni, D. Aboutajdine
The sharpness of image is an important parameter to interpreting and extracting the information of image which it contains, for increasing the resolution of image. In this paper we present a framework for motion estimation of high-resolution image using the sub-pixel registration. In the simulation we need a set of low-resolution images created from a high-resolution image to perform the sub-pixel registration using the phase correlation, to estimate the shift motion between each low-resolution image and the reference image. A high-resolution image is then reconstructed using bicubic interpolation. Finally, this framework is tested and compared to other frequency methods of shift estimation, the simulation results show the performance of our framework than the other frequency methods of super-resolution.
{"title":"Motion estimation of aliased images using the phase correlation","authors":"S. Ousguine, F. Essanouni, L. Essanouni, D. Aboutajdine","doi":"10.1109/INTECH.2012.6457755","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457755","url":null,"abstract":"The sharpness of image is an important parameter to interpreting and extracting the information of image which it contains, for increasing the resolution of image. In this paper we present a framework for motion estimation of high-resolution image using the sub-pixel registration. In the simulation we need a set of low-resolution images created from a high-resolution image to perform the sub-pixel registration using the phase correlation, to estimate the shift motion between each low-resolution image and the reference image. A high-resolution image is then reconstructed using bicubic interpolation. Finally, this framework is tested and compared to other frequency methods of shift estimation, the simulation results show the performance of our framework than the other frequency methods of super-resolution.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133613075","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457771
M. Radgui, R. Saidi, S. Mouline
During the last years, companies are developing a growing interest in improving the efficiency and quality of their internal business processes. The need of reuse of some business part to fulfill compagnie's requirements leads to the need of extracting business fragments from business process model. The aim of this paper is to propose an approach for identifying business fragments from business process model using BPMN. Our approach is based on variability which is expressed in terms of variants and variation points. Applying this approach we can analyze variability in the model in order to extract business fragments that can be reused.
{"title":"Extracting reusable fragments from business process using BPMN","authors":"M. Radgui, R. Saidi, S. Mouline","doi":"10.1109/INTECH.2012.6457771","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457771","url":null,"abstract":"During the last years, companies are developing a growing interest in improving the efficiency and quality of their internal business processes. The need of reuse of some business part to fulfill compagnie's requirements leads to the need of extracting business fragments from business process model. The aim of this paper is to propose an approach for identifying business fragments from business process model using BPMN. Our approach is based on variability which is expressed in terms of variants and variation points. Applying this approach we can analyze variability in the model in order to extract business fragments that can be reused.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114581193","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457813
H. Souraya, K. Okba, A. Youssef
Additively to the emergence of wireless networking, high technology and reliability of mobile devices have enabled the widespread use of mobile computing. Currently, this last is in vogue and booming. Today, the combination of mobile networks with Web Services called "Mobile Web Service", opening a promising horizon for the economy. They offer (Mobile Web Service) new personalized services to consumers on their mobile devices. In this paper, we propose the integration of two modern service technologies: Web Services and Mobile Agents. This integration enables wireless users to access and invoke semantically enriched Web services without the need for simultaneous and online presence of the service requestor. Furthermore, in order to improve the capabilities of Service registries, we exploit the advantages offered by the Semantic Web framework. Specifically, we use enhanced registries enriched with semantic information that provide semantic matching to service queries and published service descriptions. In addition, we will consider the information defining the context of the user and the Web service in order to best satisfy the user request.
{"title":"Integration of Mobile Agent and Semantic Web Service in a mobile environment","authors":"H. Souraya, K. Okba, A. Youssef","doi":"10.1109/INTECH.2012.6457813","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457813","url":null,"abstract":"Additively to the emergence of wireless networking, high technology and reliability of mobile devices have enabled the widespread use of mobile computing. Currently, this last is in vogue and booming. Today, the combination of mobile networks with Web Services called \"Mobile Web Service\", opening a promising horizon for the economy. They offer (Mobile Web Service) new personalized services to consumers on their mobile devices. In this paper, we propose the integration of two modern service technologies: Web Services and Mobile Agents. This integration enables wireless users to access and invoke semantically enriched Web services without the need for simultaneous and online presence of the service requestor. Furthermore, in order to improve the capabilities of Service registries, we exploit the advantages offered by the Semantic Web framework. Specifically, we use enhanced registries enriched with semantic information that provide semantic matching to service queries and published service descriptions. In addition, we will consider the information defining the context of the user and the Web service in order to best satisfy the user request.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129518360","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457773
Djalila Boughareb, Nadir Farah
In this paper, we propose a contextual modelling of the user browsing behaviour aiming to identify the user's information needs from his real-time context focusing on two parameters that are the recent interests and the temporal events that may influence the user browsing behaviour. Modelling the search behaviour of the user through these parameters gave good preliminary results which encouraged us to continue our research in this pathway.
{"title":"Contextual modelling of the user browsing behaviour to identify the user's information need","authors":"Djalila Boughareb, Nadir Farah","doi":"10.1109/INTECH.2012.6457773","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457773","url":null,"abstract":"In this paper, we propose a contextual modelling of the user browsing behaviour aiming to identify the user's information needs from his real-time context focusing on two parameters that are the recent interests and the temporal events that may influence the user browsing behaviour. Modelling the search behaviour of the user through these parameters gave good preliminary results which encouraged us to continue our research in this pathway.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130091492","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
扫码关注我们
求助内容：
应助结果提醒方式：