Pub Date : 2012-09-01DOI: 10.1109/INTECH.2012.6457767
A. Mansour, N. Enneya, M. Ouadou, D. Aboutajdine
One of the biggest challenges of Next-generation wireless network (4G) is to integrate different wireless access technologies, each with its own characteristics, into a common IP-based core network to provide mobile user with service continuity and seamless roaming. Nowadays there are different wireless access technologies allowing users to stay “always on”, of which one of the most important is WiFi because of the range of its utilization (used in standard personal devices, like laptop, mobile devices...) to connect to the Internet. But its range is very limited, contrary to WiMax, who is a relatively new but very promising standard for wireless communication because it provides the speed of WiFi and the coverage of UMTS (Universal Mobile Telecommunications System). Hence it is natural to combine WiMax and WiFi and create a better wireless solution to provide high speed Internet for mobile users. Currently, the mobility of a terminal is a requirement of great importance, supported by a procedure known as handover. One of the major issues for the converged heterogeneous networks is providing a seamless handover with QoS support.
{"title":"Handoff between WiMax and WiFi networks","authors":"A. Mansour, N. Enneya, M. Ouadou, D. Aboutajdine","doi":"10.1109/INTECH.2012.6457767","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457767","url":null,"abstract":"One of the biggest challenges of Next-generation wireless network (4G) is to integrate different wireless access technologies, each with its own characteristics, into a common IP-based core network to provide mobile user with service continuity and seamless roaming. Nowadays there are different wireless access technologies allowing users to stay “always on”, of which one of the most important is WiFi because of the range of its utilization (used in standard personal devices, like laptop, mobile devices...) to connect to the Internet. But its range is very limited, contrary to WiMax, who is a relatively new but very promising standard for wireless communication because it provides the speed of WiFi and the coverage of UMTS (Universal Mobile Telecommunications System). Hence it is natural to combine WiMax and WiFi and create a better wireless solution to provide high speed Internet for mobile users. Currently, the mobility of a terminal is a requirement of great importance, supported by a procedure known as handover. One of the major issues for the converged heterogeneous networks is providing a seamless handover with QoS support.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"19 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":"123699727","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.6457799
K. Kitaya, Hung-Hsuan Huang, K. Kawagoe
People who collect content by human power and create criticism are called curators. Recently, the number of music curators has been increasing. However, it is often difficult to discover a music curator suited to the user's personal taste. Fortunately, linked data, which involve a large network structure to link data, exist. Using a Linked Data Semantic Distance algorithm that utilized linked data, Passant calculated the distance between different pieces of music. In this paper, we propose a method for recommending a music curator who suits the user's taste using linked data. A link structure is formed using the listening history of the user, the music curator's musical criticism data, and music information data. We calculate the distance between the user and the music curator using the linked data.
{"title":"Music curator recommendations using linked data","authors":"K. Kitaya, Hung-Hsuan Huang, K. Kawagoe","doi":"10.1109/INTECH.2012.6457799","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457799","url":null,"abstract":"People who collect content by human power and create criticism are called curators. Recently, the number of music curators has been increasing. However, it is often difficult to discover a music curator suited to the user's personal taste. Fortunately, linked data, which involve a large network structure to link data, exist. Using a Linked Data Semantic Distance algorithm that utilized linked data, Passant calculated the distance between different pieces of music. In this paper, we propose a method for recommending a music curator who suits the user's taste using linked data. A link structure is formed using the listening history of the user, the music curator's musical criticism data, and music information data. We calculate the distance between the user and the music curator using the linked data.","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":"132603827","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.6457812
R. V. Deshmukh
RADIUS Accounting Server is used for receiving an accounting request and returning a response to a client. When the client is configured to use RADIUS Accounting, it will generate accounting requests towards accounting server. In a system where there are multiple servers configured in round-robin fashion, if some of the servers go down, it takes more time to reach the actual active server after retransmissions to the non-responsive server get exhausted. In case of accounting server not responding or dead, client keeps on archiving the requests until certain point. Once the server becomes active, client will flush all the archived requests. In this process, there are chances that some of the requests may get lost. Also it takes large amount of time to flush all the archived requests. Here we propose a new approach to make Accounting-On and Accounting-off requests to be sent by Accounting Server to Network Access Server for better communication.
{"title":"RADIUS accounting server behavior with interactive model","authors":"R. V. Deshmukh","doi":"10.1109/INTECH.2012.6457812","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457812","url":null,"abstract":"RADIUS Accounting Server is used for receiving an accounting request and returning a response to a client. When the client is configured to use RADIUS Accounting, it will generate accounting requests towards accounting server. In a system where there are multiple servers configured in round-robin fashion, if some of the servers go down, it takes more time to reach the actual active server after retransmissions to the non-responsive server get exhausted. In case of accounting server not responding or dead, client keeps on archiving the requests until certain point. Once the server becomes active, client will flush all the archived requests. In this process, there are chances that some of the requests may get lost. Also it takes large amount of time to flush all the archived requests. Here we propose a new approach to make Accounting-On and Accounting-off requests to be sent by Accounting Server to Network Access Server for better communication.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"98 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":"132821015","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.6457779
K. Omar, C. Loubna, E. Mostapha, E. Mohammad
Processes of itinerary calculation in graphs have been, and still are, an interesting research topic. Despite the great interest that this topic has drawn in the research community, the proposed algorithms in the literature reveal certain limits to compute the itinerary in the graphs which parameters (vertices, edges) could be varying and could have a big graph order. The purpose main of this paper is to present the solution that resolve the issue in question and final results will be operated for the benefit of humans (included people with visual, auditory and mobile disabilities) to guide them in the presence of the unexpected of navigation that cause the variability of graph parameters. The presented solution can also be operated in a wide range of applications fields.
{"title":"Research of an event process designed for event & voluminous graphs to compute customized itinerary","authors":"K. Omar, C. Loubna, E. Mostapha, E. Mohammad","doi":"10.1109/INTECH.2012.6457779","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457779","url":null,"abstract":"Processes of itinerary calculation in graphs have been, and still are, an interesting research topic. Despite the great interest that this topic has drawn in the research community, the proposed algorithms in the literature reveal certain limits to compute the itinerary in the graphs which parameters (vertices, edges) could be varying and could have a big graph order. The purpose main of this paper is to present the solution that resolve the issue in question and final results will be operated for the benefit of humans (included people with visual, auditory and mobile disabilities) to guide them in the presence of the unexpected of navigation that cause the variability of graph parameters. The presented solution can also be operated in a wide range of applications fields.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"22 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":"133639815","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.6457783
M. Schraagen, W. Kosters
Automatic record linkage of data containing personal names is difficult in the presence of name variation and spelling errors. This paper presents a standardization procedure for personal names to address the variation problem. A classification tree based model is constructed using a training set of 65,002 name-variant pairs. The method provides an efficient procedure for record linkage (3500 records per second, F-measure 0.96 on a sample of Dutch historical civil records). The results include links with large edit distance between the records, however recall is lower for this category. A bootstrapping procedure is used to improve recall.
{"title":"Data-driven name reduction for record linkage","authors":"M. Schraagen, W. Kosters","doi":"10.1109/INTECH.2012.6457783","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457783","url":null,"abstract":"Automatic record linkage of data containing personal names is difficult in the presence of name variation and spelling errors. This paper presents a standardization procedure for personal names to address the variation problem. A classification tree based model is constructed using a training set of 65,002 name-variant pairs. The method provides an efficient procedure for record linkage (3500 records per second, F-measure 0.96 on a sample of Dutch historical civil records). The results include links with large edit distance between the records, however recall is lower for this category. A bootstrapping procedure is used to improve recall.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"35 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":"128205770","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.6457763
S. Bouaicha, Z. Boufaida
Generally the reasoning on ontologies uses simple inference engine. But in view of insufficiencies of the supported languages, ontologies are extended by SWRL rules. The problem is absence of reasoners capable to interoperate ontologies and rules. The SWRL rules combine the individuals of ontology and don't change the concepts and the knowledge base. So the reasoning stays incomplete. In this paper, we propose enriching the comportment of the concepts of an ontology by rules. This enrichment is effected in two manners: 1) Binding attributes and roles of concepts with conditions. This aspect constitutes the major contribution of this work. 2) Creating rules for combining individuals and atoms of concepts. To overcome these, we propose an approach of extending SWRL by adding new keywords as OWL ontology classes and properties, and post-translating them using rewrite meta-rules. These internal and external enrichments of the concepts leads to hybrid ontology which makes it possible to improve, in terms of results, the quality of the reasoning. To mention and clarify the interest of this kind of reasoning, we use a case study inherent to interpretation of check up in preventive medicine.
{"title":"Extending SWRL rules for rules/concepts integration in hybrid ontologies","authors":"S. Bouaicha, Z. Boufaida","doi":"10.1109/INTECH.2012.6457763","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457763","url":null,"abstract":"Generally the reasoning on ontologies uses simple inference engine. But in view of insufficiencies of the supported languages, ontologies are extended by SWRL rules. The problem is absence of reasoners capable to interoperate ontologies and rules. The SWRL rules combine the individuals of ontology and don't change the concepts and the knowledge base. So the reasoning stays incomplete. In this paper, we propose enriching the comportment of the concepts of an ontology by rules. This enrichment is effected in two manners: 1) Binding attributes and roles of concepts with conditions. This aspect constitutes the major contribution of this work. 2) Creating rules for combining individuals and atoms of concepts. To overcome these, we propose an approach of extending SWRL by adding new keywords as OWL ontology classes and properties, and post-translating them using rewrite meta-rules. These internal and external enrichments of the concepts leads to hybrid ontology which makes it possible to improve, in terms of results, the quality of the reasoning. To mention and clarify the interest of this kind of reasoning, we use a case study inherent to interpretation of check up in preventive medicine.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"85 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":"124912188","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.6457805
I. Lassoued, E. Zagrouba, Y. Chahir
Automated characterization of human actions plays an important role in video indexing and retrieval for many applications. Action change detection is considered among the most necessary element to ensure a good video description. However, it is quite challenging to achieve detection without prior knowledge or training. Usually humans are practicing different actions in the same video and their silhouettes give significant information for characterizing human poses in each video frame. We have developed an approach based on pose descriptors of these silhouettes, cross correlations matrices and Kullback-Leibler distance to detect action changes. In this paper, we will focus firstly on the specific problem of change detection in videos. After that, the proposed approach for action change detection will be detailed and tested on Weizman dataset. Finally, experimental results has been analyzed and showed the good performance of our approach.
{"title":"A new method using moments correlation for action change detection in videos","authors":"I. Lassoued, E. Zagrouba, Y. Chahir","doi":"10.1109/intech.2012.6457805","DOIUrl":"https://doi.org/10.1109/intech.2012.6457805","url":null,"abstract":"Automated characterization of human actions plays an important role in video indexing and retrieval for many applications. Action change detection is considered among the most necessary element to ensure a good video description. However, it is quite challenging to achieve detection without prior knowledge or training. Usually humans are practicing different actions in the same video and their silhouettes give significant information for characterizing human poses in each video frame. We have developed an approach based on pose descriptors of these silhouettes, cross correlations matrices and Kullback-Leibler distance to detect action changes. In this paper, we will focus firstly on the specific problem of change detection in videos. After that, the proposed approach for action change detection will be detailed and tested on Weizman dataset. Finally, experimental results has been analyzed and showed the good performance of our approach.","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":"129002410","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
扫码关注我们
求助内容：
应助结果提醒方式：