Pub Date : 2012-09-01DOI: 10.1109/INTECH.2012.6457793
M. E. Ouaazizi, N. Chenfour
Within the efforts of publishing online digital libraries, we propose in this paper a new model of a collaborative semantic annotation platform of digitized old documents, which is based on using new technologies of the Semantic Web. In our model, annotations associated with a digitized document are realized by a group of annotators interested in its documentary content to accelerate the Semantic Annotation Process. The annotations are expressed as a set of RDF tripks and stored in a data repository as an RDF graph. The data repositories are managed by an annotation server. With this generic structure of annotations, the available documents resources in the library are accessible and exploitable by various Semantic Web Applications using the same protocol and query language SPARQL, in contrast to the `classic libraries' where access to the documentary resources is limited by specialized web services.
{"title":"Collaborative semantic annotation of digitized old documents","authors":"M. E. Ouaazizi, N. Chenfour","doi":"10.1109/INTECH.2012.6457793","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457793","url":null,"abstract":"Within the efforts of publishing online digital libraries, we propose in this paper a new model of a collaborative semantic annotation platform of digitized old documents, which is based on using new technologies of the Semantic Web. In our model, annotations associated with a digitized document are realized by a group of annotators interested in its documentary content to accelerate the Semantic Annotation Process. The annotations are expressed as a set of RDF tripks and stored in a data repository as an RDF graph. The data repositories are managed by an annotation server. With this generic structure of annotations, the available documents resources in the library are accessible and exploitable by various Semantic Web Applications using the same protocol and query language SPARQL, in contrast to the `classic libraries' where access to the documentary resources is limited by specialized web services.","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":"128826569","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.6457765
C. Reddy, P. V. Krishna
Wireless mesh networks (WMNs) offer dependable and scalable solutions for services utilizing large bandwidth. Enhancement in the deployed number of applications based on wireless mesh networks necessitated a corresponding increased demand for higher bandwidth. This paper proposes a framework for effective management of bandwidth in WMNs making use of the concepts of cross layer design and ant colony methods.
{"title":"An efficient bandwidth management framework for wireless mesh networks","authors":"C. Reddy, P. V. Krishna","doi":"10.1109/INTECH.2012.6457765","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457765","url":null,"abstract":"Wireless mesh networks (WMNs) offer dependable and scalable solutions for services utilizing large bandwidth. Enhancement in the deployed number of applications based on wireless mesh networks necessitated a corresponding increased demand for higher bandwidth. This paper proposes a framework for effective management of bandwidth in WMNs making use of the concepts of cross layer design and ant colony methods.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"65 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":"121106555","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.6457746
Naima El Haoudar, A. Maach
The Wireless Mesh Network (WMN) is a highly capable technology that can offer low-cost and easy-deployable network connectivity to both small-size community networks and large-scale metropolitan networks. As a key emerging technology to provide the next generation broadband networking, WMN combines the advantages of both mobile ad hoc network (MANET) and traditional fixed network, attracting significant industrial and academic attentions. We present a new metric for routing in multi-radio, multihop wireless networks. We focus on wireless networks with stationary nodes, such as community wireless networks. The goal of the metric is to choose a high-throughput path between a source and a destination. Our metric assigns weights to individual links based on the Expected Transmission Time (ETT) of a packet over the link. The ETT is a function of the loss rate and the bandwidth of the link.
{"title":"Routing metric for Wireless Mesh Networks","authors":"Naima El Haoudar, A. Maach","doi":"10.1109/INTECH.2012.6457746","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457746","url":null,"abstract":"The Wireless Mesh Network (WMN) is a highly capable technology that can offer low-cost and easy-deployable network connectivity to both small-size community networks and large-scale metropolitan networks. As a key emerging technology to provide the next generation broadband networking, WMN combines the advantages of both mobile ad hoc network (MANET) and traditional fixed network, attracting significant industrial and academic attentions. We present a new metric for routing in multi-radio, multihop wireless networks. We focus on wireless networks with stationary nodes, such as community wireless networks. The goal of the metric is to choose a high-throughput path between a source and a destination. Our metric assigns weights to individual links based on the Expected Transmission Time (ETT) of a packet over the link. The ETT is a function of the loss rate and the bandwidth of the link.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"236 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":"127693424","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.6457760
A. El Janati El Idrissi, N. Zahid, M. Jedra
A optimised speed controller for permanent magnet synchronous motor (PMSM) is investigated in this paper, in which genetic algorithm (GA), direct torque control (DTC) concept, and neural networks space vector modulation (NNSVM) are integrated to achieve high performance. A GA is integrated to optimize the proportional integral (PI) controller. While NNSVM is contributed to reduce more the ripples of mechanical speed and torque of PMSM, like that combination elements of artificial intelligence, proposed control reacts as, ensemble of intelligent human is gathered to solve a mathematical or physical problem in a little time than one of them. Simulation results show that the proposed controller provides high-performance dynamic characteristics and is robust with regard to plant parameter variations. Furthermore, comparing with the other controller, the harmonic ripples is much reduced by the proposed controller.
{"title":"Optimized DTC by genetic speed controller and inverter based neural networks SVM for PMSM","authors":"A. El Janati El Idrissi, N. Zahid, M. Jedra","doi":"10.1109/INTECH.2012.6457760","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457760","url":null,"abstract":"A optimised speed controller for permanent magnet synchronous motor (PMSM) is investigated in this paper, in which genetic algorithm (GA), direct torque control (DTC) concept, and neural networks space vector modulation (NNSVM) are integrated to achieve high performance. A GA is integrated to optimize the proportional integral (PI) controller. While NNSVM is contributed to reduce more the ripples of mechanical speed and torque of PMSM, like that combination elements of artificial intelligence, proposed control reacts as, ensemble of intelligent human is gathered to solve a mathematical or physical problem in a little time than one of them. Simulation results show that the proposed controller provides high-performance dynamic characteristics and is robust with regard to plant parameter variations. Furthermore, comparing with the other controller, the harmonic ripples is much reduced by the proposed controller.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"80 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":"133646845","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.6457787
N. Hamzaoui, A. Sedqui, A. Lyhyaoui
Collaborative filtering algorithm (CF) is a personalized recommendation algorithm that is the most widely used in e-commerce. In the process of collaborative filtering recommendation, the most used information is the item rating. Item attribute information and other criteria of item evaluation are rarely used. In this paper, a collaborative filtering algorithm based on collaboration between rating item and item information is proposed. The objective is to consider, not only item rating information when we calculate similarity, but also the integration of the background of the item and the time-weight as criteria of the item assessment. In so doing, the calculation of the similarity between items, forming the neighborhood of item, performs the recommendation. This proposed CF algorithm is showing to avoid the problem of sparsity, and also reduces the influence of the former evaluation of the item.
{"title":"Multi-criteria collaborative recommender","authors":"N. Hamzaoui, A. Sedqui, A. Lyhyaoui","doi":"10.1109/INTECH.2012.6457787","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457787","url":null,"abstract":"Collaborative filtering algorithm (CF) is a personalized recommendation algorithm that is the most widely used in e-commerce. In the process of collaborative filtering recommendation, the most used information is the item rating. Item attribute information and other criteria of item evaluation are rarely used. In this paper, a collaborative filtering algorithm based on collaboration between rating item and item information is proposed. The objective is to consider, not only item rating information when we calculate similarity, but also the integration of the background of the item and the time-weight as criteria of the item assessment. In so doing, the calculation of the similarity between items, forming the neighborhood of item, performs the recommendation. This proposed CF algorithm is showing to avoid the problem of sparsity, and also reduces the influence of the former evaluation of the item.","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":"114678892","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.6457786
H. S. Mounine, H. K. Walid
Sharing data between autonomous and possibly heterogeneous decentralized systems on the Web gave rise to the concept of P2P database systems. In this paper, we propose a deadlock managing process for distributed and replicated database in P2P based on quorum system. This process is fully decentralized because each client decides if it has the priority to write access.
{"title":"A deadlock managing process for distributed and replicated database in P2P system","authors":"H. S. Mounine, H. K. Walid","doi":"10.1109/INTECH.2012.6457786","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457786","url":null,"abstract":"Sharing data between autonomous and possibly heterogeneous decentralized systems on the Web gave rise to the concept of P2P database systems. In this paper, we propose a deadlock managing process for distributed and replicated database in P2P based on quorum system. This process is fully decentralized because each client decides if it has the priority to write access.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"68 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":"114460155","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.6457797
M. Lahby, L. Cherkaoui, A. Adib
Nowadays, with the evolution of the mobile devices towards a multimode architecture, the users have the opportunity to utilize a wealth of services across a multitude of radio access technologies (RAT's). Variety of vertical handoff algorithms (VHA) have been proposed to help the user to select dynamically the best access network (BAN) in terms of quality of service. However, due to nature of VHA which is NP-Hard problem, the objective of this paper is to provide an optimal network selection algorithm that allow mobile users to choose the BAN with seamless manner. The optimized algorithm exploits a minimum of criteria and combines two multi attribute decision making (MADM) methods such as analytic network process (ANP) method to find the weights of the available networks, and the the grey relational analysis (GRA) method to rank the alternatives. Simulation results are presented to evaluate our optimized network selection decision.
{"title":"Reducing handover metrics for access network selection in heterogeneous wireless networks","authors":"M. Lahby, L. Cherkaoui, A. Adib","doi":"10.1109/INTECH.2012.6457797","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457797","url":null,"abstract":"Nowadays, with the evolution of the mobile devices towards a multimode architecture, the users have the opportunity to utilize a wealth of services across a multitude of radio access technologies (RAT's). Variety of vertical handoff algorithms (VHA) have been proposed to help the user to select dynamically the best access network (BAN) in terms of quality of service. However, due to nature of VHA which is NP-Hard problem, the objective of this paper is to provide an optimal network selection algorithm that allow mobile users to choose the BAN with seamless manner. The optimized algorithm exploits a minimum of criteria and combines two multi attribute decision making (MADM) methods such as analytic network process (ANP) method to find the weights of the available networks, and the the grey relational analysis (GRA) method to rank the alternatives. Simulation results are presented to evaluate our optimized network selection decision.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"7 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":"121401762","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.6457782
M. Menad, Z. A. Foitih
Modeling of the humanoid robot was and remains to this day an ambiguous model; several studies have been made by several approaches and methods. Some work has considered the joints of the humanoid robot like an arborescent structure, other as closed or open joint chain. Modeling methods are also different: the method of Denavit Hartenberg, the notion of modeling (father-child) uses the equation of Rodrigues and the method of state space [1]. The work presented in this article, is interested in modeling of a humanoid robot with 18 degree of freedom (DOF), three DOF in each arm and six DOF per foot.
{"title":"Modeling of a humanoid robot with 18 DOF in a virtual environment","authors":"M. Menad, Z. A. Foitih","doi":"10.1109/INTECH.2012.6457782","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457782","url":null,"abstract":"Modeling of the humanoid robot was and remains to this day an ambiguous model; several studies have been made by several approaches and methods. Some work has considered the joints of the humanoid robot like an arborescent structure, other as closed or open joint chain. Modeling methods are also different: the method of Denavit Hartenberg, the notion of modeling (father-child) uses the equation of Rodrigues and the method of state space [1]. The work presented in this article, is interested in modeling of a humanoid robot with 18 degree of freedom (DOF), three DOF in each arm and six DOF per foot.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"1940 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":"129301844","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.6457753
Youssef Baddi, Mohamed Dâfir Ech-Cherif El Kettani
Internet research community has proposed many different multicast routing protocols to support efficient multimedia application such as, IPTV, videoconferencing, group games. Nevertheless, the design of all these protocols does not take into account that group members may be mobile. Indeed, with the arrival of Mobile IPv6 by IETF providing mobile users with continuous access, group members in the network are very dynamic affecting on the quality of both routing protocol scheme and multicast tree used. The key idea of this work is to make the handover of multicast members transparent and avoid the reconstruction of the entire multicast-based tree, by using an architecture MC-PIM-SM based in PIM-SM multicast routing protocol with Multiple Cores Shared Multicast Tree to hide the mobility of mobile multicast members from the main multicast delivery tree. Simulation results show that good performance is achieved in terms of handoff latency, end-to-end delay, tree construction delay and others metrics.
{"title":"MC-PIM-SM: Multicast routing protocol PIM-SM with Multiple Cores Shared tree for mobile IPv6 environment","authors":"Youssef Baddi, Mohamed Dâfir Ech-Cherif El Kettani","doi":"10.1109/INTECH.2012.6457753","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457753","url":null,"abstract":"Internet research community has proposed many different multicast routing protocols to support efficient multimedia application such as, IPTV, videoconferencing, group games. Nevertheless, the design of all these protocols does not take into account that group members may be mobile. Indeed, with the arrival of Mobile IPv6 by IETF providing mobile users with continuous access, group members in the network are very dynamic affecting on the quality of both routing protocol scheme and multicast tree used. The key idea of this work is to make the handover of multicast members transparent and avoid the reconstruction of the entire multicast-based tree, by using an architecture MC-PIM-SM based in PIM-SM multicast routing protocol with Multiple Cores Shared Multicast Tree to hide the mobility of mobile multicast members from the main multicast delivery tree. Simulation results show that good performance is achieved in terms of handoff latency, end-to-end delay, tree construction delay and others metrics.","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":"130150214","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.6457785
M. L. Boucenna, M. Benslama
Game theoretic analysis is employed in `medium access control (MAC)' protocol systems for wireless data networks, where the Erasure coding is integrated to improve the reliability and the throughput level. The redundancy is thus introduced, and when it is structured in an exploitable manner, it will be then possible to correct important errors injected by the channel. We present a redundant packets control game to study the behavior of the network performances such the throughput and the cost of coding. A non-cooperative game model is introduced and its different characteristics are defined. We examine the network equilibrium by applying the Nash Equilibrium theorems, and we finish by evaluate our results by appropriate simulations and comparisons with those founded in the conventional model.
{"title":"Game in Aloha protocols for wireless data networks","authors":"M. L. Boucenna, M. Benslama","doi":"10.1109/INTECH.2012.6457785","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457785","url":null,"abstract":"Game theoretic analysis is employed in `medium access control (MAC)' protocol systems for wireless data networks, where the Erasure coding is integrated to improve the reliability and the throughput level. The redundancy is thus introduced, and when it is structured in an exploitable manner, it will be then possible to correct important errors injected by the channel. We present a redundant packets control game to study the behavior of the network performances such the throughput and the cost of coding. A non-cooperative game model is introduced and its different characteristics are defined. We examine the network equilibrium by applying the Nash Equilibrium theorems, and we finish by evaluate our results by appropriate simulations and comparisons with those founded in the conventional model.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":" 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120830607","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
扫码关注我们
求助内容：
应助结果提醒方式：