首页 > 最新文献

Second International Conference on the Innovative Computing Technology (INTECH 2012)最新文献

英文 中文
Classification of the metric in ISO model by oriented object properties ISO模型中度量的面向对象属性分类
Pub Date : 2012-09-01 DOI: 10.1109/INTECH.2012.6457816
Z. Bougroun, A. Zeaaraoui, M. Belkasmi, T. Bouchentouf
In this paper we present a new classification of object-oriented metrics, in order to facilitate software evaluation. This classification is based on standardized model “ISO 9126” and focuses on design and quality properties. The crux of this work is to make the relationship between sub-characteristics of ISO model and properties of object-oriented design and quality. Thus our purpose is to find a way to evaluate software without neglecting the properties of the object-oriented design such as: abstraction, inheritance, encapsulation etc.
为了便于软件评估,本文提出了一种新的面向对象度量的分类方法。该分类基于标准化模型“ISO 9126”,并侧重于设计和质量属性。该工作的关键是建立ISO模型的子特征与面向对象设计和质量属性之间的关系。因此,我们的目的是找到一种方法来评估软件,而不忽略面向对象设计的属性,如:抽象、继承、封装等。
{"title":"Classification of the metric in ISO model by oriented object properties","authors":"Z. Bougroun, A. Zeaaraoui, M. Belkasmi, T. Bouchentouf","doi":"10.1109/INTECH.2012.6457816","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457816","url":null,"abstract":"In this paper we present a new classification of object-oriented metrics, in order to facilitate software evaluation. This classification is based on standardized model “ISO 9126” and focuses on design and quality properties. The crux of this work is to make the relationship between sub-characteristics of ISO model and properties of object-oriented design and quality. Thus our purpose is to find a way to evaluate software without neglecting the properties of the object-oriented design such as: abstraction, inheritance, encapsulation etc.","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":"133271545","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}
引用次数: 2
Novel fully automated Computer Aided-Detection of suspicious regions within mammograms 新型全自动计算机辅助检测乳房x线照片中的可疑区域
Pub Date : 2012-09-01 DOI: 10.1109/INTECH.2012.6457756
S. Hamissi, H. Merouani
In this paper we present a novel fully automated scheme for detection of abnormal masses by anatomical segmentation of Breast Region and classification of regions of Interest (ROI). The system consists of three main processing steps, we perform essential pre-processing to remove noise, suppress artifacts and labels, enhance the breast region, extract breast region by the process of segmentation and remove unwanted parts as Pectoral Muscle. After segregating the breast region, we use an Adaptive Segmentation Procedure based on Kmeans Clustering followed by a Merging Regions method. With the obtained Regions of Interest, the extraction of Statistical and Textural Features is done by using gray level co-occurrence matrices (GLCM) and a Decision Tree Classification is performed to isolate normal and abnormal regions in the breast tissue. If any suspicious regions are present, they get accurately highlighted by this algorithm thus helping the radiologists to further investigate these regions. A set of Mini-MIAS mammograms is used to validate the effectiveness of the method. The precision of the method has been verified with the ground truth given in database and has obtained sensitivity as high as 90%. The CAD system proposed is fully autonomous and is able to isolate different types of abnormalities and it shows promising results.
在本文中,我们提出了一种新的全自动化方案,通过乳房区域的解剖分割和感兴趣区域(ROI)的分类来检测异常肿块。该系统包括三个主要的处理步骤,我们进行必要的预处理,去除噪声,抑制伪影和标签,增强乳房区域,通过分割过程提取乳房区域,去除不需要的部分,如胸肌。在分离出乳房区域后,我们使用了基于Kmeans聚类的自适应分割过程,然后使用了合并区域方法。利用获得的感兴趣区域,利用灰度共生矩阵(GLCM)提取统计特征和纹理特征,并进行决策树分类,分离乳腺组织中的正常和异常区域。如果存在任何可疑区域,该算法会准确地突出显示这些区域,从而帮助放射科医生进一步调查这些区域。一组Mini-MIAS乳房x光片用于验证该方法的有效性。该方法的精度与数据库给出的地面真实值进行了验证,灵敏度高达90%。所提出的CAD系统是完全自主的,能够隔离不同类型的异常,并显示出良好的结果。
{"title":"Novel fully automated Computer Aided-Detection of suspicious regions within mammograms","authors":"S. Hamissi, H. Merouani","doi":"10.1109/INTECH.2012.6457756","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457756","url":null,"abstract":"In this paper we present a novel fully automated scheme for detection of abnormal masses by anatomical segmentation of Breast Region and classification of regions of Interest (ROI). The system consists of three main processing steps, we perform essential pre-processing to remove noise, suppress artifacts and labels, enhance the breast region, extract breast region by the process of segmentation and remove unwanted parts as Pectoral Muscle. After segregating the breast region, we use an Adaptive Segmentation Procedure based on Kmeans Clustering followed by a Merging Regions method. With the obtained Regions of Interest, the extraction of Statistical and Textural Features is done by using gray level co-occurrence matrices (GLCM) and a Decision Tree Classification is performed to isolate normal and abnormal regions in the breast tissue. If any suspicious regions are present, they get accurately highlighted by this algorithm thus helping the radiologists to further investigate these regions. A set of Mini-MIAS mammograms is used to validate the effectiveness of the method. The precision of the method has been verified with the ground truth given in database and has obtained sensitivity as high as 90%. The CAD system proposed is fully autonomous and is able to isolate different types of abnormalities and it shows promising results.","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":"133914375","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}
引用次数: 4
A hybrid method for improving the SQD-PageRank algorithm 改进SQD-PageRank算法的混合方法
Pub Date : 2012-09-01 DOI: 10.1109/INTECH.2012.6457747
A. S. Djaanfar, B. Frikh, B. Ouhbi
The PageRank algorithm is used in the Google search engine to calculate a single list of popularity scores for each page in the Web. These popularity scores are used to rank query results when presented to the user. PageRank assigns to a page a score proportional to the number of times a random surfer would visit that page, if it surfed indefinitely from page to page, following all outlinks from a page with equal probability. Thereupon, several algorithms are introduced to improve the last one. In this paper, we introduce a more intelligent surfer model based on combining ontology, web contents and PageRank. Firstly, we propose a relevance measure of a web page relative to a multiple-term query. Then, we develop our performed intelligent surfer model. Efficient execution of our algorithm in a local database is performed. Results show that our algorithm significantly outperforms the existing algorithms in the quality of the pages returned, while remaining efficient enough to be used in today's large search engines.
PageRank算法在Google搜索引擎中用于计算Web中每个页面的单个受欢迎程度评分列表。这些流行度分数用于对呈现给用户的查询结果进行排序。PageRank给一个页面分配一个分数,这个分数与一个随机浏览者访问该页面的次数成正比,如果这个浏览者无限地从一个页面浏览到另一个页面,并以相同的概率跟随一个页面的所有外链。在此基础上,介绍了几种算法对最后一种算法进行改进。本文介绍了一种基于本体、网页内容和PageRank相结合的更智能的冲浪者模型。首先,我们提出了一个网页相对于多词查询的相关性度量。然后,我们开发了我们的智能冲浪者模型。算法在本地数据库中得到了有效的执行。结果表明,我们的算法在返回页面的质量上明显优于现有的算法,同时仍然足够高效,可以用于当今的大型搜索引擎。
{"title":"A hybrid method for improving the SQD-PageRank algorithm","authors":"A. S. Djaanfar, B. Frikh, B. Ouhbi","doi":"10.1109/INTECH.2012.6457747","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457747","url":null,"abstract":"The PageRank algorithm is used in the Google search engine to calculate a single list of popularity scores for each page in the Web. These popularity scores are used to rank query results when presented to the user. PageRank assigns to a page a score proportional to the number of times a random surfer would visit that page, if it surfed indefinitely from page to page, following all outlinks from a page with equal probability. Thereupon, several algorithms are introduced to improve the last one. In this paper, we introduce a more intelligent surfer model based on combining ontology, web contents and PageRank. Firstly, we propose a relevance measure of a web page relative to a multiple-term query. Then, we develop our performed intelligent surfer model. Efficient execution of our algorithm in a local database is performed. Results show that our algorithm significantly outperforms the existing algorithms in the quality of the pages returned, while remaining efficient enough to be used in today's large search engines.","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":"129196306","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}
引用次数: 8
An easy framework for an accurate estimation of the Structure From Motion 一个简单的框架,用于从运动中准确估计结构
Pub Date : 2012-09-01 DOI: 10.1109/INTECH.2012.6457772
A. El-Attar, H. Tairi, Mohammed Karim
In this paper we introduce a simple framework for the Structure From Motion problem resolution using the classical and general formulation of the problem. We propose a two steps algorithm that does not impose any constraints on the scene. The purpose of the first step is the extraction of a convenient “Projective Reconstruction” using a simple method. Indeed, it firstly initializes the projective calibration of the scene and then refines it using non-linear optimization. The extracted reconstruction is then integrated in the second step consisting on the upgrade of the reconstruction to a metric one; this is done through the research of the camera intrinsic parameters necessary for the upgrade stage. A multi-stage auto-calibration algorithm is proposed to iteratively estimate each parameter alone and finally refines all of them at once. Once these parameters are obtained, the 3D Euclidean reconstruction of the scene is extracted using a publicly available Multi-View Stereo software.
在本文中,我们利用经典的和一般的结构运动问题的表述,介绍了一个简单的结构运动问题求解框架。我们提出了一种不施加任何场景约束的两步算法。第一步的目的是使用简单的方法提取方便的“投影重建”。实际上,它首先初始化场景的投影校准,然后使用非线性优化对其进行细化。然后将提取的重构集成到第二步中,第二步包括将重构升级为度量重构;这是通过对相机升级阶段所需要的内在参数的研究来完成的。提出了一种多阶段自校正算法,对每个参数进行单独迭代估计,最后一次对所有参数进行精化。一旦获得这些参数,场景的3D欧几里得重建将使用公开的多视图立体软件进行提取。
{"title":"An easy framework for an accurate estimation of the Structure From Motion","authors":"A. El-Attar, H. Tairi, Mohammed Karim","doi":"10.1109/INTECH.2012.6457772","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457772","url":null,"abstract":"In this paper we introduce a simple framework for the Structure From Motion problem resolution using the classical and general formulation of the problem. We propose a two steps algorithm that does not impose any constraints on the scene. The purpose of the first step is the extraction of a convenient “Projective Reconstruction” using a simple method. Indeed, it firstly initializes the projective calibration of the scene and then refines it using non-linear optimization. The extracted reconstruction is then integrated in the second step consisting on the upgrade of the reconstruction to a metric one; this is done through the research of the camera intrinsic parameters necessary for the upgrade stage. A multi-stage auto-calibration algorithm is proposed to iteratively estimate each parameter alone and finally refines all of them at once. Once these parameters are obtained, the 3D Euclidean reconstruction of the scene is extracted using a publicly available Multi-View Stereo software.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"67 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":"115849846","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}
引用次数: 0
A decision algorithm for efficient hybrid burst retransmission and burst cloning scheme over star OBS networks 星型OBS网络中高效突发重传和突发克隆混合方案的决策算法
Pub Date : 2012-09-01 DOI: 10.1109/INTECH.2012.6457794
S. Riadi, A. Maach
In optical burst switched networks contention is the main source of burst loss. Burst retransmission is a reactive loss recovery mechanism that attempts to resolve contention by retransmitting the contended burst at the optical burst switching layer. Burst cloning is a proactive loss recovery mechanism that attempts to prevent burst loss by sending two copies of the same burst, if the first copy is lost, the second copy may still be able to reach the destination. Burst retransmission is better suited when the load is low, however burst cloning is better suited when the load is high. In this paper, we propose a hybrid scheme for star OBS networks that combines the advantages of burst retransmission at low load with the benefits of burst cloning at high load through a decision algorithm which aims to control the extra load due to the both loss recovery mechanisms. The results obtained from simulation confirm that our hybrid scheme through the decision algorithm can achieve better overall network performance than both burst retransmission scheme and burst cloning scheme.
在光突发交换网络中,争用是造成突发损耗的主要原因。突发重传是一种被动损失恢复机制,它试图通过在光突发交换层重传有争议的突发来解决争用。突发克隆是一种主动的损失恢复机制,它试图通过发送同一突发的两个副本来防止突发损失,如果第一个副本丢失,第二个副本仍然可以到达目的地。突发重传更适合于低负荷时,而突发克隆更适合于高负荷时。本文提出了一种星型OBS网络的混合方案,该方案结合了低负载时突发重传的优点和高负载时突发克隆的优点,通过一种决策算法来控制由于两种丢失恢复机制造成的额外负载。仿真结果表明,采用决策算法的混合方案比突发重传方案和突发克隆方案具有更好的整体网络性能。
{"title":"A decision algorithm for efficient hybrid burst retransmission and burst cloning scheme over star OBS networks","authors":"S. Riadi, A. Maach","doi":"10.1109/INTECH.2012.6457794","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457794","url":null,"abstract":"In optical burst switched networks contention is the main source of burst loss. Burst retransmission is a reactive loss recovery mechanism that attempts to resolve contention by retransmitting the contended burst at the optical burst switching layer. Burst cloning is a proactive loss recovery mechanism that attempts to prevent burst loss by sending two copies of the same burst, if the first copy is lost, the second copy may still be able to reach the destination. Burst retransmission is better suited when the load is low, however burst cloning is better suited when the load is high. In this paper, we propose a hybrid scheme for star OBS networks that combines the advantages of burst retransmission at low load with the benefits of burst cloning at high load through a decision algorithm which aims to control the extra load due to the both loss recovery mechanisms. The results obtained from simulation confirm that our hybrid scheme through the decision algorithm can achieve better overall network performance than both burst retransmission scheme and burst cloning scheme.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"23 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":"116657287","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}
引用次数: 3
Biometric cryptosystems based Fuzzy Vault approach: Security analysis 基于模糊保险库方法的生物识别密码系统:安全性分析
Pub Date : 2012-09-01 DOI: 10.1109/INTECH.2012.6457803
M. Lafkih, M. Mikram, S. Ghouzali, M. Haziti, D. Aboutajdine
Unlike traditional authentication based on passwords, biometric authentication is seen as an alternative solution because it offers facility, comfort and more security to users. However, biometric systems based on the storage of user model in a database are vulnerable to attacks because the stored model can be stolen or illegitimately used by an attacker to impersonate the user. To protect the users templates from attacks, two broad categories of methods are proposed in the literature: Transformation Biometric Characteristics, and Biometric Cryptosystems. Although biometric cryptosystems are used in several applications (e.g. smart cards), their major challenge is the lack of a security analysis and the limitation of the work on attacks against this type of methods. Hence the aim of this paper is to present criteria for security analysis and to demonstrate the vulnerability of Fuzzy Vault method; a famous approach in biometric cryptosystems.
与基于密码的传统身份验证不同,生物识别身份验证被视为一种替代解决方案,因为它为用户提供了便利、舒适和更高的安全性。然而,基于在数据库中存储用户模型的生物识别系统容易受到攻击,因为存储的模型可能被攻击者窃取或非法使用来冒充用户。为了保护用户模板免受攻击,文献中提出了两大类方法:转换生物特征和生物特征密码系统。虽然生物识别密码系统在许多应用中使用(例如智能卡),但它们的主要挑战是缺乏安全分析以及针对此类方法的攻击工作的限制。因此,本文的目的是提出安全分析的标准,并论证模糊保险库方法的脆弱性;生物识别密码系统中的一种著名方法。
{"title":"Biometric cryptosystems based Fuzzy Vault approach: Security analysis","authors":"M. Lafkih, M. Mikram, S. Ghouzali, M. Haziti, D. Aboutajdine","doi":"10.1109/INTECH.2012.6457803","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457803","url":null,"abstract":"Unlike traditional authentication based on passwords, biometric authentication is seen as an alternative solution because it offers facility, comfort and more security to users. However, biometric systems based on the storage of user model in a database are vulnerable to attacks because the stored model can be stolen or illegitimately used by an attacker to impersonate the user. To protect the users templates from attacks, two broad categories of methods are proposed in the literature: Transformation Biometric Characteristics, and Biometric Cryptosystems. Although biometric cryptosystems are used in several applications (e.g. smart cards), their major challenge is the lack of a security analysis and the limitation of the work on attacks against this type of methods. Hence the aim of this paper is to present criteria for security analysis and to demonstrate the vulnerability of Fuzzy Vault method; a famous approach in biometric cryptosystems.","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":"127206886","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}
引用次数: 3
Object-oriented analysis and design approach for requirements engineering 面向对象的需求工程分析和设计方法
Pub Date : 2012-09-01 DOI: 10.1109/INTECH.2012.6457759
A. Zeaaraoui, Z. Bougroun, M. Belkasmi, T. Bouchentouf
In software development process, developers feel the gap when moving from requirement engineering phase (using scenario-based approach) to construction phase; this is due to that models resulted in RE cannot be easily mapped to models in construction phase. This paper discusses this problem, and offers a new approach that handles this issue so that developers feel no break during all software development activities from RE to coding and testing.
在软件开发过程中,当从需求工程阶段(使用基于场景的方法)转移到构建阶段时,开发人员会感到差距;这是因为生成正则的模型不能很容易地映射到构建阶段的模型。本文讨论了这个问题,并提供了一种处理这个问题的新方法,以便开发人员在从RE到编码和测试的所有软件开发活动中都不会感到中断。
{"title":"Object-oriented analysis and design approach for requirements engineering","authors":"A. Zeaaraoui, Z. Bougroun, M. Belkasmi, T. Bouchentouf","doi":"10.1109/INTECH.2012.6457759","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457759","url":null,"abstract":"In software development process, developers feel the gap when moving from requirement engineering phase (using scenario-based approach) to construction phase; this is due to that models resulted in RE cannot be easily mapped to models in construction phase. This paper discusses this problem, and offers a new approach that handles this issue so that developers feel no break during all software development activities from RE to coding and testing.","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":"124437863","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}
引用次数: 7
Low rank MMSE channel estimation in MIMO-OFDM systems MIMO-OFDM系统中低阶MMSE信道估计
Pub Date : 2012-09-01 DOI: 10.1109/INTECH.2012.6457790
H. Krouma, M. Benslama, Farouk Othmani-Marabout
In this paper, we propose a low-rank minimum mean-square error (OLR-MMSE) channel estimator for multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. We evaluate the performance of the proposed low-rank channel estimator for slowly fading channel environments in terms of the symbol error rate (SER) by computer simulations. It is shown that the proposed channel estimator gives the best tradeoff between performance and complexity.
本文提出了一种用于多输入多输出正交频分复用(MIMO-OFDM)系统的低秩最小均方误差(OLR-MMSE)信道估计器。我们通过计算机模拟,从符号误差率(SER)的角度评估了所提出的低秩信道估计器在慢衰落信道环境下的性能。结果表明,所提出的信道估计器在性能和复杂度之间取得了最好的平衡。
{"title":"Low rank MMSE channel estimation in MIMO-OFDM systems","authors":"H. Krouma, M. Benslama, Farouk Othmani-Marabout","doi":"10.1109/INTECH.2012.6457790","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457790","url":null,"abstract":"In this paper, we propose a low-rank minimum mean-square error (OLR-MMSE) channel estimator for multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. We evaluate the performance of the proposed low-rank channel estimator for slowly fading channel environments in terms of the symbol error rate (SER) by computer simulations. It is shown that the proposed channel estimator gives the best tradeoff between performance and complexity.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"119 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":"123248273","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}
引用次数: 2
A constraint programming approach for coverage optimization problem in WSN 无线传感器网络覆盖优化问题的约束规划方法
Pub Date : 2012-09-01 DOI: 10.1109/INTECH.2012.6457791
Abderrazak Daoudi, Youssef Kerfi, Imade Benelallam, E. Bouyakhf
Wireless Sensor Networks (WSN) constitutes the platform of a broad range of applications related to surveillance such as military, and environmental monitoring. In these fields, the deployment of WSN to support optimal coverage is obviously a fastidious task, especially when a multiple coverage is needed. In this paper, we present a multi-objective constraints optimization approach for solving the above issue. Therefore, we investigate two main ideas: First, a pre-processing step with field analysis in three dimensions (3D) environment. Second, a robust based-constraint modeling approach with multi-objective function. Experimental results are presented to evaluate the effectiveness of our approach.
无线传感器网络(WSN)构成了与军事、环境监测等监控相关的广泛应用平台。在这些领域中,部署WSN以支持最优覆盖显然是一项艰巨的任务,特别是当需要多重覆盖时。本文提出了一种多目标约束优化方法来解决上述问题。因此,我们研究两个主要思路:首先,在三维(3D)环境中进行现场分析的预处理步骤。其次,基于多目标函数的鲁棒约束建模方法。实验结果验证了该方法的有效性。
{"title":"A constraint programming approach for coverage optimization problem in WSN","authors":"Abderrazak Daoudi, Youssef Kerfi, Imade Benelallam, E. Bouyakhf","doi":"10.1109/INTECH.2012.6457791","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457791","url":null,"abstract":"Wireless Sensor Networks (WSN) constitutes the platform of a broad range of applications related to surveillance such as military, and environmental monitoring. In these fields, the deployment of WSN to support optimal coverage is obviously a fastidious task, especially when a multiple coverage is needed. In this paper, we present a multi-objective constraints optimization approach for solving the above issue. Therefore, we investigate two main ideas: First, a pre-processing step with field analysis in three dimensions (3D) environment. Second, a robust based-constraint modeling approach with multi-objective function. Experimental results are presented to evaluate the effectiveness of our approach.","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":"125449933","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}
引用次数: 2
Quantum cryptography based on Grover's algorithm 基于Grover算法的量子密码学
Pub Date : 2012-09-01 DOI: 10.1109/INTECH.2012.6457788
Z. Sakhi, R. Kabil, A. Tragha, M. Bennai
Some cryptographic applications of quantum algorithm on many qubits system are presented. We analyze a basic concept of Grover algorithm and it's implementation in the case of four qubits system. We show specially that Grover algorithm allows as obtaining a maximal probability to get the result. Some features of quantum cryptography and Quantum Secret-Sharing protocol based on Grover's algorithm are also presented.
介绍了量子算法在多量子位系统中的一些密码学应用。本文分析了Grover算法的基本概念及其在四量子位系统中的实现。我们特别证明了Grover算法允许得到一个最大概率的结果。介绍了基于Grover算法的量子密码学和量子秘密共享协议的一些特点。
{"title":"Quantum cryptography based on Grover's algorithm","authors":"Z. Sakhi, R. Kabil, A. Tragha, M. Bennai","doi":"10.1109/INTECH.2012.6457788","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457788","url":null,"abstract":"Some cryptographic applications of quantum algorithm on many qubits system are presented. We analyze a basic concept of Grover algorithm and it's implementation in the case of four qubits system. We show specially that Grover algorithm allows as obtaining a maximal probability to get the result. Some features of quantum cryptography and Quantum Secret-Sharing protocol based on Grover's algorithm are also presented.","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":"130917750","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}
引用次数: 10
期刊
Second International Conference on the Innovative Computing Technology (INTECH 2012)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1