2014 International Conference on Control, Decision and Information Technologies (CoDIT)最新文献

筛选
英文 中文
Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags 最小和最大时滞置换流水车间调度问题的拉格朗日松弛
Imen Hamdi, T. Loukil
{"title":"Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags","authors":"Imen Hamdi, T. Loukil","doi":"10.1109/CoDIT.2014.6996865","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996865","url":null,"abstract":"In this research, we are interested in the permutation flowshop scheduling problem with minimal and maximal time lags while minimizing the total tardiness. The processing order of jobs is to be the same for each machine. The time lag is defined as the waiting time between two consecutive operations of each job. It is greater than or equal to a prescribed value called minimal time lag and smaller than or equal to a prescribed value called maximal time lag. A new mathematical formulation is proposed. Then, a new lower bound is derived by applying the Lagrangian relaxation. In order to make this technique a viable approach to the considered problem, an auxiliary formulation is adopted and the Lagrangian multipliers are updated using the sub-gradient algorithm. Then, results of the computational experiments are reported.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128513273","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
Efficient segmentation of sub-words within handwritten arabic words 在手写的阿拉伯语单词子词的有效分割
F. Khan, A. Bouridane, F. Khelifi, Rasheed Almotaeryi, Sumaya Almaadeed
{"title":"Efficient segmentation of sub-words within handwritten arabic words","authors":"F. Khan, A. Bouridane, F. Khelifi, Rasheed Almotaeryi, Sumaya Almaadeed","doi":"10.1109/CoDIT.2014.6996979","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996979","url":null,"abstract":"Segmentation is considered as a core step for any recognition or classification method and for the text within any document to be effectively recognized it must be segmented accurately. In this paper a text and writer independent algorithm for the segmentation of sub-words in Arabic words has been presented. The concept is based around the global binarization of an image at various thresholding levels. When each sub-word or Part of Arabic Word (PAW) within the image being investigated is processed at multiple threshold levels a cluster graph is obtained where each cluster represents the individual sub-words of that word. Once the clusters are obtained the task of segmentation is managed by simply selecting the respective cluster automatically which is achieved using the 95% confidence interval on the processed data generated by the accumulated graph. The presented algorithm was tested on 537 randomly selected words from the AHTID/MW database and the results showed that 95.3% of the sub-words or PAW were correctly segmented and extracted. The proposed method has shown considerable improvement over the projection profile method which is commonly used to segment sub-words or PAW.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131841894","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}
引用次数: 5
Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment 二部完全匹配顶点截断问题:在鲁棒护士分配中的应用
Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka
{"title":"Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment","authors":"Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Róka","doi":"10.1109/CoDIT.2014.6996890","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996890","url":null,"abstract":"In this paper, we consider the Robust Nurse Assignment Problem. This consists in finding the maximum number of absences of qualified nurses still permitting an optimal treatment of patients, leading us to the notion of critical jobs. We introduce the Bipartite Complete Matching Vertex Interdiction Problem as the graph formulation of this problem. We show that it can be solved in polynomial time thanks to the integer polytope of an associated sub-problem. Then, we study the polytope associated with the Bipartite Complete Matching Vertex Interdiction Problem. We also extend the well-known Hall theorem to this problem.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131891255","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
Branch-and-cut strategies for a multi-period network design and routing problem 多周期网络设计与路由问题的分支切断策略
B. Fortz, D. Papadimitriou
{"title":"Branch-and-cut strategies for a multi-period network design and routing problem","authors":"B. Fortz, D. Papadimitriou","doi":"10.1109/CoDIT.2014.6996881","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996881","url":null,"abstract":"The combined network design and (distributed) traffic routing problem can be formulated as a large-scale multi-period mixed integer optimization problem. This problem combines network design decisions and routing decisions, with time-dependent traffic demands. In this paper, we consider different branch-and-cut strategies for solving the problem with the base and extended formulations proposed in our prior work.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122712956","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 negative selection algorithm applied to helicopter actuator fault detection 负选择算法在直升机执行机构故障检测中的应用
T. Rakotomamonjy, Morgane Le Boulanger
{"title":"A negative selection algorithm applied to helicopter actuator fault detection","authors":"T. Rakotomamonjy, Morgane Le Boulanger","doi":"10.1109/CoDIT.2014.6996912","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996912","url":null,"abstract":"In order to detect the failure of an actuator of a helicopter swashplate, a simple detection method based on a negative selection algorithm (NSA) is developed. This technique, inspired by existing rules found in the biological immunity, rely on a set of elemental detectors which have been trained in order to recognize only the non-self (i.e. faulty) behaviors of the system, without needing an explicit model of the system dynamics. A simple model for the actuator failure is developed and coupled with a helicopter flight dynamics model, and some trajectories for the algorithm training and validation are simulated. A procedure for improving the efficiency of the algorithm by introducing weighting coefficients to the detection function is proposed and successfully tested. Moreover, the performance of the algorithm is slightly improved by observing the covariance of the flight dynamics states, instead of the variables themselves.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127918071","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}
引用次数: 1
Optimization of a reliable Network on Chip dedicated to partial reconfiguration 一个可靠的网络芯片上的优化专用于部分重新配置
C. Tanougast, C. Killian
{"title":"Optimization of a reliable Network on Chip dedicated to partial reconfiguration","authors":"C. Tanougast, C. Killian","doi":"10.1109/CODIT.2014.6996996","DOIUrl":"https://doi.org/10.1109/CODIT.2014.6996996","url":null,"abstract":"We present an optimization of reliable Network on Chip (NoC) structure dedicated to dynamic reconfigurable systems (DRS) based on FPGA. The originality of our approach is based on a strategic placement of router incorporating elements of dependability. The solution is a factorization of these reliable routers encompassing routers without any error detection block. This ensures the global reliability of the network and reduce the cost of area, the latency of the data packets and the power consumption. The proposed approach can be applied to the majority NoC topologies.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121453901","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}
引用次数: 1
A hybrid approach combining fuzzy consensus-based goal programming and TOPSIS 一种基于模糊共识的目标规划与TOPSIS相结合的混合方法
Idris Igoulalene, L. Benyoucef
{"title":"A hybrid approach combining fuzzy consensus-based goal programming and TOPSIS","authors":"Idris Igoulalene, L. Benyoucef","doi":"10.1109/CoDIT.2014.6996873","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996873","url":null,"abstract":"In hotly competitive international industrial and economic environments, supply chain coordination (SCC) is one of active research topics in production and operation management. In this research work, we present a new consensus-based fuzzy goal programming approach for supply chain coordination problem. It is formulated as a multi-criteria group decision making (MCGDM) problem and solved by combining consensus-based goal programming with TOPSIS method in a fuzzy environment. To demonstrate the applicability of the proposed approach, an example of robot selection problem is presented and the numerical results analyzed.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128594463","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
Multi-Model Predictive Control strategies for an activated sludge model 活性污泥模型的多模型预测控制策略
Lamia Matoug, Tarek Khadir
{"title":"Multi-Model Predictive Control strategies for an activated sludge model","authors":"Lamia Matoug, Tarek Khadir","doi":"10.1109/CoDIT.2014.6996945","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996945","url":null,"abstract":"This paper investigates the use of Generalized Predictive Control (GPC) on an Activated Sludge Reactor. The reduced bio-reactor activated sludge ASM1 model, which describes the biological degradation of an activate sludge reactor, is designed based on several simplifications, as a Takagi Sugeno fuzzy model (TS). The TS model structure is based on a set of linear sub models, covering the process input-output space, interpolated by a nonlinear weighting function. In the case of the ASM1 model, as specified in this paper, the linear sub models turn out to be non minimal phase, and therefore the system needs to be decoupled prior to design the control formulation. The classical Multi- Input Multi-Output (MIMO) GPC formulation is then modified to integrate the TS formulation as the controller internal model. The simulation results show the effectiveness of the proposed GPC controller compared to benchmark PID in terms of error and response dynamics.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115709225","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
Novel experimental synchronization technique for embedded chaotic communications 嵌入式混沌通信实验同步新技术
S. Sadoudi, M. S. Azzaz, C. Tanougast
{"title":"Novel experimental synchronization technique for embedded chaotic communications","authors":"S. Sadoudi, M. S. Azzaz, C. Tanougast","doi":"10.1109/CoDIT.2014.6996976","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996976","url":null,"abstract":"In this paper, we propose an interesting and original solution to the problem of chaotic synchronization which is focused in its high sensitivity to channel noise. We demonstrate through experimental design, the synchronization of tow embedded hyperchaotic Lorenz generators implemented separately in two FPGA circuits. The basic idea of the proposed solution consists of synchronizing two hyperchaotic systems without perturbing the hyperchaotic dynamic of the slave system. This means that, in an eventual wireless hyperchaotic communication system, whatever the perturbations suffered by the transmitted hyperchaotic carrier (drive signal) through the channel, our solution permits to generate an identical copy of the hyperchaotic carrier at the receiver and then recover the information signal correctly.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127141905","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
A Mixed Integer Linear Programming approach for a new form of facility layout problem 一种新型设施布局问题的混合整数线性规划方法
Yipei Zhang, A. Che
{"title":"A Mixed Integer Linear Programming approach for a new form of facility layout problem","authors":"Yipei Zhang, A. Che","doi":"10.1109/CoDIT.2014.6996869","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996869","url":null,"abstract":"This paper aims to study a new form of facility layout problem, in which the building has already been constructed and the specific room layout inside has been determined. Unlike the traditional facility layout problem, what we take into account is how to assign a certain number of rooms to a given number of departments with the purpose of maximizing the utilization rate of the rooms. This is equivalent to minimizing the total difference value between the extra area of different departments after satisfying their required area, thus reducing the space waste. To solve this special combinatorial optimization problem, we develop a Mixed-Integer Linear Programming (MILP) model. The model is solved using commercial software CPLEX12.6. Computational results on several randomly generated instances demonstrate the effectiveness of the proposed approach.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125991571","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}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信