Pub Date : 2012-09-01DOI: 10.1109/ICMCS.2012.6320192.
E. Sarhrouni, A. Hammouch, D. Aboutajdine
Hyperspectral images (HSI) classification is a high technical remote sensing tool. The main goal is to classify the point of a region. The HIS contains more than a hundred bidirectional measures, called bands (or simply images), of the same region called Ground Truth Map (GT). Unfortunately, some bands contain redundant information, others are affected by the noise, and the high dimensionalities of features make the accuracy of classification lower. All these bands can be important for some applications, but for the classification a small subset of these is relevant. In this paper we use mutual information (MI) to select the relevant bands; and the Normalized Mutual Information coefficient to avoid and control redundant ones. This is a feature selection scheme and a Filter strategy. We establish this study on HSI AVIRIS 92AV3C. This is effectiveness, and fast scheme to control redundancy.
{"title":"Band selection and classification of hyperspectral images by minimizing normalized mutual information","authors":"E. Sarhrouni, A. Hammouch, D. Aboutajdine","doi":"10.1109/ICMCS.2012.6320192.","DOIUrl":"https://doi.org/10.1109/ICMCS.2012.6320192.","url":null,"abstract":"Hyperspectral images (HSI) classification is a high technical remote sensing tool. The main goal is to classify the point of a region. The HIS contains more than a hundred bidirectional measures, called bands (or simply images), of the same region called Ground Truth Map (GT). Unfortunately, some bands contain redundant information, others are affected by the noise, and the high dimensionalities of features make the accuracy of classification lower. All these bands can be important for some applications, but for the classification a small subset of these is relevant. In this paper we use mutual information (MI) to select the relevant bands; and the Normalized Mutual Information coefficient to avoid and control redundant ones. This is a feature selection scheme and a Filter strategy. We establish this study on HSI AVIRIS 92AV3C. This is effectiveness, and fast scheme to control redundancy.","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":"131101097","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.6457814
H. Allouch, M. Belkasmi
The core of Next Generation Network(NGN) IP Multimedia subsystem(IMS) based on SIP as mechanism signaling, is an important challenge for supporting data communication services, voice, video, messaging and web-based technologies. In this work we present a novel design of architecture and turns up some challenges of new IMS architecture and security system. This architecture provides a robustness, reliability, scalability and strategy for extension in the future and responds to the security challenges. We introduced the architecture with clustering database HSS and automatic storage of data that give a secure database. This paper give a classification of security in IMS network, modulate the risk in IMS network and our comparison is giving by cost signaling interworking with and without securing Gateway (SEG). We show that there is a tradeoff between the level of increasing system security and the potential cost incurred. we conclude that this architecture is suitable for operators and services providers for the new business models.
{"title":"Design of distributed IMS by classification and evaluation of costs for secured architecture","authors":"H. Allouch, M. Belkasmi","doi":"10.1109/INTECH.2012.6457814","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457814","url":null,"abstract":"The core of Next Generation Network(NGN) IP Multimedia subsystem(IMS) based on SIP as mechanism signaling, is an important challenge for supporting data communication services, voice, video, messaging and web-based technologies. In this work we present a novel design of architecture and turns up some challenges of new IMS architecture and security system. This architecture provides a robustness, reliability, scalability and strategy for extension in the future and responds to the security challenges. We introduced the architecture with clustering database HSS and automatic storage of data that give a secure database. This paper give a classification of security in IMS network, modulate the risk in IMS network and our comparison is giving by cost signaling interworking with and without securing Gateway (SEG). We show that there is a tradeoff between the level of increasing system security and the potential cost incurred. we conclude that this architecture is suitable for operators and services providers for the new business models.","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":"133511380","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.6457817
T. Khan, T. Taj, M. K. Asif, I. Ijaz
Optimization techniques are getting importance in control and power system of sustainable energy technologies. Particle Swarm Optimization is aversatileoptimizing technique. Due to its diversity, it attracts many researchers to modify the algorithm itself and scrutinize different parameters to get precisely optimized results. PSO plays a vital role for finding solutions for continuous optimization problems and also acts as an alternative for global optimization. The designing of standard PSO is defined in this project which has been taken into account by the latest research and developments, and is used as a guideline for performance testing by different functions. The benchmarks we used are Sphere, Ackley, Rosenbrock, Schewfel's 2.26 and Rastrigin. We implemented the original algorithm, and obtained optimized results for every function and plot the graphs against Global best value and Function evaluation.
{"title":"Modeling of a standard Particle Swarm Optimization algorithm in MATLAB by different benchmarks","authors":"T. Khan, T. Taj, M. K. Asif, I. Ijaz","doi":"10.1109/INTECH.2012.6457817","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457817","url":null,"abstract":"Optimization techniques are getting importance in control and power system of sustainable energy technologies. Particle Swarm Optimization is aversatileoptimizing technique. Due to its diversity, it attracts many researchers to modify the algorithm itself and scrutinize different parameters to get precisely optimized results. PSO plays a vital role for finding solutions for continuous optimization problems and also acts as an alternative for global optimization. The designing of standard PSO is defined in this project which has been taken into account by the latest research and developments, and is used as a guideline for performance testing by different functions. The benchmarks we used are Sphere, Ackley, Rosenbrock, Schewfel's 2.26 and Rastrigin. We implemented the original algorithm, and obtained optimized results for every function and plot the graphs against Global best value and Function evaluation.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"475 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":"116687829","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.6457789
A. Elmelhi
The influences of coupling in a launch vehicle between longitudinal, yaw and roll channels are more serious in the region of powered or active flight phase. Due to large speed, the effect of undesired roll and yaw angles induced from coupling dynamics may cause fluctuations on the performance of a desired command tracking trajectory in the longitudinal motion. In this study, the moment of inertia and kinematic couplings are considered with two objectives in mind. First is to derive their mathematical models and study their affects on the tracking accuracy of the desired pitch angle command. Second, by applying fuzzy proportional derivative controller design, a significant degradation in the desired command tracking due to simultaneous effect of these two types of coupling can be addressed in comparing to the classical design approach. Linear simulation for a typical launch vehicle is carried out at the end of this paper to demonstrate the objectives of this study.
{"title":"Flight coupling model effect based fuzzy control logic","authors":"A. Elmelhi","doi":"10.1109/INTECH.2012.6457789","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457789","url":null,"abstract":"The influences of coupling in a launch vehicle between longitudinal, yaw and roll channels are more serious in the region of powered or active flight phase. Due to large speed, the effect of undesired roll and yaw angles induced from coupling dynamics may cause fluctuations on the performance of a desired command tracking trajectory in the longitudinal motion. In this study, the moment of inertia and kinematic couplings are considered with two objectives in mind. First is to derive their mathematical models and study their affects on the tracking accuracy of the desired pitch angle command. Second, by applying fuzzy proportional derivative controller design, a significant degradation in the desired command tracking due to simultaneous effect of these two types of coupling can be addressed in comparing to the classical design approach. Linear simulation for a typical launch vehicle is carried out at the end of this paper to demonstrate the objectives of this study.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"6 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":"133067046","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.6457792
Y. Oussalah, N. Zeghib
Web services composition is emerging as a new model for automated interactions among distributed and heterogeneous applications. However the reuse of web services raises composition issues since they present, most of the time, mismatching at different levels such as structural, behavioral and non-functional. The resulted mismatches require adaptation to insure the correct working between web services. In this paper we present a formal specification of operations which enable to compose and adapt services at runtime. This specification is given in Maude language as a logical framework. Thanks to many Maude tools, formal analysis may be easily performed.
{"title":"Maude specification of web service composition and adaptation","authors":"Y. Oussalah, N. Zeghib","doi":"10.1109/INTECH.2012.6457792","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457792","url":null,"abstract":"Web services composition is emerging as a new model for automated interactions among distributed and heterogeneous applications. However the reuse of web services raises composition issues since they present, most of the time, mismatching at different levels such as structural, behavioral and non-functional. The resulted mismatches require adaptation to insure the correct working between web services. In this paper we present a formal specification of operations which enable to compose and adapt services at runtime. This specification is given in Maude language as a logical framework. Thanks to many Maude tools, formal analysis may be easily performed.","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":"130364781","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.6457749
I. Diop, S. M. Farssi, Dakar Sénégal, M. Ba, H B Diouf
In this document, we study the construction of codes LDPC quasi cyclic based on a protograph. In addition to their large perimeters, the presented codes take profit from the advantages of bass coding and decoding complexity. The aim of this article is to make an improvement on the implementation of quasi-cyclic LDPC codes. Thus to respect the structure of the basic protograph we use an arithmetic progression to determine in advance the positions of certain nodes of control in the derived graph, which turn to some extent amounts generating a new model while proceeding to an enlarging of the basic protograph. Once this new model conceived we apply the usual techniques to build in an optimal way the derived graph.
{"title":"Construction of codes protographes LDPC quasi-cycliques based on an arithmetic progression","authors":"I. Diop, S. M. Farssi, Dakar Sénégal, M. Ba, H B Diouf","doi":"10.1109/INTECH.2012.6457749","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457749","url":null,"abstract":"In this document, we study the construction of codes LDPC quasi cyclic based on a protograph. In addition to their large perimeters, the presented codes take profit from the advantages of bass coding and decoding complexity. The aim of this article is to make an improvement on the implementation of quasi-cyclic LDPC codes. Thus to respect the structure of the basic protograph we use an arithmetic progression to determine in advance the positions of certain nodes of control in the derived graph, which turn to some extent amounts generating a new model while proceeding to an enlarging of the basic protograph. Once this new model conceived we apply the usual techniques to build in an optimal way the derived graph.","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":"128830285","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.6457800
Kingo Osaka, Hung-Hsuan Huang, K. Kawagoe
A novice researcher conducting research in a new field, must identify that the preeminent researchers in that field in order to obtain influential papers to refer to. Although some Internet services allow users to search for researchers, these services do not take coauthors and related papers into consideration. In this paper, we propose a new researcher search-and-ranking method that is based on a new matrix called the Author and Paper Matrix (APM). The APM allows coauthor and related-paper references to be embedded as the weight of an APM element. A preliminary evaluation of APM demonstrates that it can help to identify appropriate and influential researchers within a given field.
{"title":"Searching and ranking researchers by keywords based on author and paper matrix rank","authors":"Kingo Osaka, Hung-Hsuan Huang, K. Kawagoe","doi":"10.1109/INTECH.2012.6457800","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457800","url":null,"abstract":"A novice researcher conducting research in a new field, must identify that the preeminent researchers in that field in order to obtain influential papers to refer to. Although some Internet services allow users to search for researchers, these services do not take coauthors and related papers into consideration. In this paper, we propose a new researcher search-and-ranking method that is based on a new matrix called the Author and Paper Matrix (APM). The APM allows coauthor and related-paper references to be embedded as the weight of an APM element. A preliminary evaluation of APM demonstrates that it can help to identify appropriate and influential researchers within a given field.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"44 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":"127614524","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.6457796
T. Mountassir, B. Nassereddine, A. Haqiq
Wireless mesh networks have seen a real progress due to their implementation at a low cost. Thus, the planning of such networks presents many challenges for network operators. Our aim in this paper is to provide a new planning solution using a multi-objective optimization approach.
{"title":"An efficient model for nodes deployment optimization in wireless mesh networks","authors":"T. Mountassir, B. Nassereddine, A. Haqiq","doi":"10.1109/INTECH.2012.6457796","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457796","url":null,"abstract":"Wireless mesh networks have seen a real progress due to their implementation at a low cost. Thus, the planning of such networks presents many challenges for network operators. Our aim in this paper is to provide a new planning solution using a multi-objective optimization approach.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"10 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":"130469050","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.6457801
G. G. Granadillo, G. Jacob, Hervé Debar, L. Coppolino
As new and more sophisticated computer attacks appear across the Internet, sometimes with unknown dimensions and criticality, the implementation of individual security solutions become less effective and in some cases useless. Instead, a combined approach is required to guarantee an appropriate and cost-effective mitigation of such attacks. Most of the current work suggests the deployment of multiple countermeasures as a single treatment to mitigate the effects of complex attacks. However, the methodology to analyze and evaluate combined solutions is either hardly explained or very complicated to implement. This paper, therefore proposes a simple and well-structured approach to select the optimal combination of countermeasures by maximizing the cost-effectiveness ratio of the countermeasures, this ratio being measured by the Return on Response Investment (RORI) index. A case study is provided at the end of the document to show the applicability of the model over a critical infrastructure process control.
{"title":"Combination approach to select optimal countermeasures based on the RORI index","authors":"G. G. Granadillo, G. Jacob, Hervé Debar, L. Coppolino","doi":"10.1109/INTECH.2012.6457801","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457801","url":null,"abstract":"As new and more sophisticated computer attacks appear across the Internet, sometimes with unknown dimensions and criticality, the implementation of individual security solutions become less effective and in some cases useless. Instead, a combined approach is required to guarantee an appropriate and cost-effective mitigation of such attacks. Most of the current work suggests the deployment of multiple countermeasures as a single treatment to mitigate the effects of complex attacks. However, the methodology to analyze and evaluate combined solutions is either hardly explained or very complicated to implement. This paper, therefore proposes a simple and well-structured approach to select the optimal combination of countermeasures by maximizing the cost-effectiveness ratio of the countermeasures, this ratio being measured by the Return on Response Investment (RORI) index. A case study is provided at the end of the document to show the applicability of the model over a critical infrastructure process control.","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":"122812319","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.6457809
W. Sabbar, A. Chergui, A. Bekkhoucha
The video used by professionals from various fields and the general public is constantly growing, it's important to develop efficient systems to classify and index them. The video summarization is an essential step to construct a system of indexing and searching video, it's the process to create a short video presentation and a global vision on the important scenes of the video. This summarization consist to extract keyframes to present video content, it's similar to extract the keywords from text document. Mainly summarization methods apply clustering algorithms to all video frames. There are computations expensive because they use a dissimilarity matrix which implies a quadratic calculation. In this context, we present a new technique for extracting video summary using an adapted shot segmentation. We apply a hierarchical clustering in each shot to extract the keyframes; the number of these keyframes is proportional to variations and movements in the shot. We propose a local motion estimation, we use a co-occurrence matrix to measure the dissimilarity between shot frames and to take account the motion in the shot.
{"title":"Video summarization using shot segmentation and local motion estimation","authors":"W. Sabbar, A. Chergui, A. Bekkhoucha","doi":"10.1109/INTECH.2012.6457809","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457809","url":null,"abstract":"The video used by professionals from various fields and the general public is constantly growing, it's important to develop efficient systems to classify and index them. The video summarization is an essential step to construct a system of indexing and searching video, it's the process to create a short video presentation and a global vision on the important scenes of the video. This summarization consist to extract keyframes to present video content, it's similar to extract the keywords from text document. Mainly summarization methods apply clustering algorithms to all video frames. There are computations expensive because they use a dissimilarity matrix which implies a quadratic calculation. In this context, we present a new technique for extracting video summary using an adapted shot segmentation. We apply a hierarchical clustering in each shot to extract the keyframes; the number of these keyframes is proportional to variations and movements in the shot. We propose a local motion estimation, we use a co-occurrence matrix to measure the dissimilarity between shot frames and to take account the motion in the shot.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"70 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":"123036399","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
扫码关注我们
求助内容：
应助结果提醒方式：