Pub Date : 2013-04-28DOI: 10.1109/ICMSAO.2013.6552627
Kobibi Y. I. Djilani, H. Samir, Z. Ahmed, Mohammed Abdeldjalil Djehaf
The maintenance and reliability of the power system has become a major aspect of study. The encouragement to the construction of HV lines, the amount of power transmission/km on HV line and the amount of power transaction as seen from economic side is much responsible for concern towards congestion in power system. The solution is the use of FACTS devices especially the use of UPFC. In this paper the study of UPFC with its various modes of operation is understood. Second, the operation of control system used in its converters is also studied. Finally Using the UPFC simulation model established in SIMULINK, a dynamic simulation tool in MATLAB, take a simple power system with UPFC as an example. The simulation test has been conducted on a simple system composed of synchronous generator and infinite capacity bus, the steady state and transient characteristics of UPFC in this system are researched.
{"title":"Modelling a unified power flow controller for the study of power system steady state and dynamic characteristics","authors":"Kobibi Y. I. Djilani, H. Samir, Z. Ahmed, Mohammed Abdeldjalil Djehaf","doi":"10.1109/ICMSAO.2013.6552627","DOIUrl":"https://doi.org/10.1109/ICMSAO.2013.6552627","url":null,"abstract":"The maintenance and reliability of the power system has become a major aspect of study. The encouragement to the construction of HV lines, the amount of power transmission/km on HV line and the amount of power transaction as seen from economic side is much responsible for concern towards congestion in power system. The solution is the use of FACTS devices especially the use of UPFC. In this paper the study of UPFC with its various modes of operation is understood. Second, the operation of control system used in its converters is also studied. Finally Using the UPFC simulation model established in SIMULINK, a dynamic simulation tool in MATLAB, take a simple power system with UPFC as an example. The simulation test has been conducted on a simple system composed of synchronous generator and infinite capacity bus, the steady state and transient characteristics of UPFC in this system are researched.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130498382","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 : 2013-04-28DOI: 10.1109/ICMSAO.2013.6552625
Soufien Gdaim, A. Mtibaa, M. Mimouni
This work, presents a design method of Direct Torque Control (DTC) of induction machine. Then a hardware description based on VHDL hardware description language of the design is presented and discussed. The techniques of parallel architecture, direct computation and modular architecture are adopted for the design of the controller. The Direct Torque Control is designed using Xilinx ISE software tool in addition to a Modelsim 6.5 software tool which is used for simulation purposes. The same algorithm is designed and simulated using MATLAB software tool to make a comparison with the proposed design on FPGA.
{"title":"Design and implementation of Direct Torque Control of induction machine on FPGA","authors":"Soufien Gdaim, A. Mtibaa, M. Mimouni","doi":"10.1109/ICMSAO.2013.6552625","DOIUrl":"https://doi.org/10.1109/ICMSAO.2013.6552625","url":null,"abstract":"This work, presents a design method of Direct Torque Control (DTC) of induction machine. Then a hardware description based on VHDL hardware description language of the design is presented and discussed. The techniques of parallel architecture, direct computation and modular architecture are adopted for the design of the controller. The Direct Torque Control is designed using Xilinx ISE software tool in addition to a Modelsim 6.5 software tool which is used for simulation purposes. The same algorithm is designed and simulated using MATLAB software tool to make a comparison with the proposed design on FPGA.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129206247","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 : 2013-04-28DOI: 10.1109/ICMSAO.2013.6552596
N. Saxena, N. Chaudhari, Jaya Thomas
Short Message Service (SMS) is one of the mobile phone services widely used by the public worldwide. One of the main issues during the communication is information security and privacy. Digital Signature algorithms can be applied with the SMS cipher to prevent the message information from the repudiation attack. There are various existing algorithms for digital signature like RSA, DSA and ECDSA. Out of these, ECDSA has been proved and found the best algorithm in terms of efficiency and cryptanalysis. But ECDSA has some drawbacks also, and because of that some authors have proposed variant algorithms of ECDSA. In this paper, we propose solutions to an attack on digital signature that has been found on a variant of ECDSA. At the end of this paper, conclusion with the suitable solution approach with its security analysis is summarized.
{"title":"Solution to an attack on digital signature in SMS security","authors":"N. Saxena, N. Chaudhari, Jaya Thomas","doi":"10.1109/ICMSAO.2013.6552596","DOIUrl":"https://doi.org/10.1109/ICMSAO.2013.6552596","url":null,"abstract":"Short Message Service (SMS) is one of the mobile phone services widely used by the public worldwide. One of the main issues during the communication is information security and privacy. Digital Signature algorithms can be applied with the SMS cipher to prevent the message information from the repudiation attack. There are various existing algorithms for digital signature like RSA, DSA and ECDSA. Out of these, ECDSA has been proved and found the best algorithm in terms of efficiency and cryptanalysis. But ECDSA has some drawbacks also, and because of that some authors have proposed variant algorithms of ECDSA. In this paper, we propose solutions to an attack on digital signature that has been found on a variant of ECDSA. At the end of this paper, conclusion with the suitable solution approach with its security analysis is summarized.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123950964","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 : 2013-04-28DOI: 10.1109/ICMSAO.2013.6552718
M. Ghanim, G. Abu-Lebdeh, K. Ahmed
Transit signal priority (TSP) is a control strategy that provides preferential treatments for transit vehicles. This strategy has shown potential to minimize delay with negligible or slight impact on non-transit vehicles. It is also an important strategy for improving and promoting schedule adherence and service reliability. This paper shows a microscopic simulation study to identify the impact of implementing TSP strategies on an arterial corridor segment at Michigan State University. The chosen segment is one of the busiest corridors on campus. It experiences vehicular traffic, pedestrian movements, and transit routes. It has four signalized intersection, and one pedestrian semi-actuated signal. Three peak periods were modeled; morning, midday, and evening. Microscopic simulation modeling is done in VISSIM microscopic simulation environment. TSP functions are programmed using vehicle actuated programming (VAP) to evaluate different TSP parameters, such as maximum green extension and red truncation. Simulation results show that transit vehicles benefit from the provided preferential treatment. On the other hand, TSP has minimal negative impact for on general traffic. In terms of TSP impact on pedestrians, TSP has no negative impact on pedestrians. The study also shows that the expected benefits from TSP depend on the congestion level, where less benefit could be gained when the congestion level is higher.
{"title":"Microscopic simulation study of transit signal priority implementation along an arterial corridor","authors":"M. Ghanim, G. Abu-Lebdeh, K. Ahmed","doi":"10.1109/ICMSAO.2013.6552718","DOIUrl":"https://doi.org/10.1109/ICMSAO.2013.6552718","url":null,"abstract":"Transit signal priority (TSP) is a control strategy that provides preferential treatments for transit vehicles. This strategy has shown potential to minimize delay with negligible or slight impact on non-transit vehicles. It is also an important strategy for improving and promoting schedule adherence and service reliability. This paper shows a microscopic simulation study to identify the impact of implementing TSP strategies on an arterial corridor segment at Michigan State University. The chosen segment is one of the busiest corridors on campus. It experiences vehicular traffic, pedestrian movements, and transit routes. It has four signalized intersection, and one pedestrian semi-actuated signal. Three peak periods were modeled; morning, midday, and evening. Microscopic simulation modeling is done in VISSIM microscopic simulation environment. TSP functions are programmed using vehicle actuated programming (VAP) to evaluate different TSP parameters, such as maximum green extension and red truncation. Simulation results show that transit vehicles benefit from the provided preferential treatment. On the other hand, TSP has minimal negative impact for on general traffic. In terms of TSP impact on pedestrians, TSP has no negative impact on pedestrians. The study also shows that the expected benefits from TSP depend on the congestion level, where less benefit could be gained when the congestion level is higher.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121265197","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 : 2013-04-28DOI: 10.1109/ICMSAO.2013.6552572
Ayse Sena Eruguz, Z. Jemai, E. Sahin, Y. Dallery
The Guaranteed-Service Model (GSM) aims at determining the optimal placement and amount of safety stocks in a guaranteed-service supply chain. In the GSM, safety stocks are used to protect against demand variability up to specified demand bounds. The model does not address what happens when demand exceeds these bounds while in practice, companies might take extraordinary measures to handle the excess demand. For guaranteed-service supply chains, assessing the service level that results from carrying safety stocks is crucial to estimate the real frequency of extraordinary measures to be deployed. In the GSM literature, demand bounds are usually defined in terms of Cycle-Service-Level (CSL). Simulation studies we carried for realworld supply chains show that the effectively observed CSL at final customer stages may be less than the one used to define the demand bounds and the absolute gap may be up to 4.76%.
{"title":"Cycle-Service-Level in Guaranteed-Service supply chains","authors":"Ayse Sena Eruguz, Z. Jemai, E. Sahin, Y. Dallery","doi":"10.1109/ICMSAO.2013.6552572","DOIUrl":"https://doi.org/10.1109/ICMSAO.2013.6552572","url":null,"abstract":"The Guaranteed-Service Model (GSM) aims at determining the optimal placement and amount of safety stocks in a guaranteed-service supply chain. In the GSM, safety stocks are used to protect against demand variability up to specified demand bounds. The model does not address what happens when demand exceeds these bounds while in practice, companies might take extraordinary measures to handle the excess demand. For guaranteed-service supply chains, assessing the service level that results from carrying safety stocks is crucial to estimate the real frequency of extraordinary measures to be deployed. In the GSM literature, demand bounds are usually defined in terms of Cycle-Service-Level (CSL). Simulation studies we carried for realworld supply chains show that the effectively observed CSL at final customer stages may be less than the one used to define the demand bounds and the absolute gap may be up to 4.76%.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126277104","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 : 2013-04-28DOI: 10.1109/ICMSAO.2013.6552673
Hiba Yahyaoui, S. Krichen, B. Derbel, E. Talbi
In this paper a Variable Neighborhood Descent (VND) approach, is developed to solve the Single Machine Total Weighted Tardiness Problem (SMTWTP). New strategy was proposed to select iteratively the accurate neighborhood. Our approach was compared to VND state-of-the-art approaches. Statistical tests were also applied on the empirical results, to show that the DR_VND outperforms the proposed approaches for 72 % of instances for the SMTWTP. The proposed approach was applied on a real case.
{"title":"A Variable Neighborhood Descent for solving the Single Machine Total Weighted Tardiness Problem","authors":"Hiba Yahyaoui, S. Krichen, B. Derbel, E. Talbi","doi":"10.1109/ICMSAO.2013.6552673","DOIUrl":"https://doi.org/10.1109/ICMSAO.2013.6552673","url":null,"abstract":"In this paper a Variable Neighborhood Descent (VND) approach, is developed to solve the Single Machine Total Weighted Tardiness Problem (SMTWTP). New strategy was proposed to select iteratively the accurate neighborhood. Our approach was compared to VND state-of-the-art approaches. Statistical tests were also applied on the empirical results, to show that the DR_VND outperforms the proposed approaches for 72 % of instances for the SMTWTP. The proposed approach was applied on a real case.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"319 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132055423","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 : 2013-04-28DOI: 10.1109/ICMSAO.2013.6552658
P. Pereira, M. Kotti, H. Fino, M. Fakhfakh
The goal of this paper is to present a comparison among three known metaheuristics: Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Simulated Annealing (SA). For the comparison, the design of an LC - Voltage Controlled Oscillator (LC-VCO) is considered, where the minimization of both VCO phase noise and power consumption is envisaged. The objective of this comparison is to find the algorithm yielding the best solution. The validity of the solution obtained with each metaheuristic algorithm is checked against HSPICE/RF simulation results. Robustness checks for each algorithm are presented at the end of this paper.
{"title":"Metaheuristic algorithms comparison for the LC - Voltage controlled oscillators optimal design","authors":"P. Pereira, M. Kotti, H. Fino, M. Fakhfakh","doi":"10.1109/ICMSAO.2013.6552658","DOIUrl":"https://doi.org/10.1109/ICMSAO.2013.6552658","url":null,"abstract":"The goal of this paper is to present a comparison among three known metaheuristics: Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Simulated Annealing (SA). For the comparison, the design of an LC - Voltage Controlled Oscillator (LC-VCO) is considered, where the minimization of both VCO phase noise and power consumption is envisaged. The objective of this comparison is to find the algorithm yielding the best solution. The validity of the solution obtained with each metaheuristic algorithm is checked against HSPICE/RF simulation results. Robustness checks for each algorithm are presented at the end of this paper.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"749 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132367368","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 : 2013-04-28DOI: 10.1109/ICMSAO.2013.6552556
Olfa Limam, F. Ben Abdelaziz
One of the most challenging task in image analysis is to identify correctly tissues where boundaries are generally not clear. Fuzzy clustering is supposed to be the most appropriate to model this situation in applications such as tissue classification, tumor detection. While, image segmentation using fuzzy clustering technique classifies correctly pixels of an image with a great extent of accuracy [1], recent works have shown that fuzzy clustering techniques considers a single objective may not provide a good result since no single validity measure works well on different kinds of data sets. Moreover, a wrong choice of a validity measure leads to poor results [2]. In this paper, we introduce a multiobjective fuzzy clustering approach producing a set of Pareto solutions among which the best solution, based on I-index validation measure, is chosen to be the final clustering solution. First, a spatial information is considered to deal more effectively with the noise and intensity inhomogeneities introduced in imaging process. Second, we propose to use a variable string length encoding technique to automatically identify the number of clusters, given that it does not require a prior knowledge about number of clusters present in a data set. Therefore, an initializing method based on a center approximation approach is proposed to accelerate the clustering process and make results more robust. Applied to normal and multiple sclerosis lesion magnetic resonance image brain images, our method shows better performance than competing algorithms.
{"title":"Multicriteria fuzzy clustering for brain image segmentation","authors":"Olfa Limam, F. Ben Abdelaziz","doi":"10.1109/ICMSAO.2013.6552556","DOIUrl":"https://doi.org/10.1109/ICMSAO.2013.6552556","url":null,"abstract":"One of the most challenging task in image analysis is to identify correctly tissues where boundaries are generally not clear. Fuzzy clustering is supposed to be the most appropriate to model this situation in applications such as tissue classification, tumor detection. While, image segmentation using fuzzy clustering technique classifies correctly pixels of an image with a great extent of accuracy [1], recent works have shown that fuzzy clustering techniques considers a single objective may not provide a good result since no single validity measure works well on different kinds of data sets. Moreover, a wrong choice of a validity measure leads to poor results [2]. In this paper, we introduce a multiobjective fuzzy clustering approach producing a set of Pareto solutions among which the best solution, based on I-index validation measure, is chosen to be the final clustering solution. First, a spatial information is considered to deal more effectively with the noise and intensity inhomogeneities introduced in imaging process. Second, we propose to use a variable string length encoding technique to automatically identify the number of clusters, given that it does not require a prior knowledge about number of clusters present in a data set. Therefore, an initializing method based on a center approximation approach is proposed to accelerate the clustering process and make results more robust. Applied to normal and multiple sclerosis lesion magnetic resonance image brain images, our method shows better performance than competing algorithms.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134058695","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 : 2013-04-28DOI: 10.1109/ICMSAO.2013.6552652
Ines Meftehi, Mehdi Mrad
We consider a two dimensional guillotine cutting stock problem with variable size of stocks. We have a set of items that have to be cut out of stock sheets with different sizes and costs. We aim to minimize the total cost of used stocks. We propose an arc flow model to handle this problem based on the work of Marcedo et al.[14]. The model was implemented in CPLEX and tested on variety of instances.
{"title":"An arc flow model for the two stages variable size cutting stock problem","authors":"Ines Meftehi, Mehdi Mrad","doi":"10.1109/ICMSAO.2013.6552652","DOIUrl":"https://doi.org/10.1109/ICMSAO.2013.6552652","url":null,"abstract":"We consider a two dimensional guillotine cutting stock problem with variable size of stocks. We have a set of items that have to be cut out of stock sheets with different sizes and costs. We aim to minimize the total cost of used stocks. We propose an arc flow model to handle this problem based on the work of Marcedo et al.[14]. The model was implemented in CPLEX and tested on variety of instances.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133973005","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 : 2013-04-28DOI: 10.1109/ICMSAO.2013.6552614
Latreche Fateh, Sebih Hacene, B. Faiza
Web services are modular, self-descriptive and loosely coupled applications; they provide a simple programming and deployment model. Besides, they are designed to interact with other services to form larger applications. From a software engineering point of view, the construction of new services by composing existing services raises a number of challenges. One of them is the ability to efficiently and effectively select and integrate inter-organizational and heterogeneous services on the Web at runtime. Recently, several formal methods, most of them with a semantics based on transition systems, have been used to guarantee correct service compositions without insisting on its automation. The main goal of this work is to propose a Rewriting Logic based framework in order to enhance automatic Web services composition. The proposed model execution allows to discover services automatically and guarantee the correct interaction of independent pieces of software in a transparent manner.
{"title":"Automatic Web services composition using maude strategies","authors":"Latreche Fateh, Sebih Hacene, B. Faiza","doi":"10.1109/ICMSAO.2013.6552614","DOIUrl":"https://doi.org/10.1109/ICMSAO.2013.6552614","url":null,"abstract":"Web services are modular, self-descriptive and loosely coupled applications; they provide a simple programming and deployment model. Besides, they are designed to interact with other services to form larger applications. From a software engineering point of view, the construction of new services by composing existing services raises a number of challenges. One of them is the ability to efficiently and effectively select and integrate inter-organizational and heterogeneous services on the Web at runtime. Recently, several formal methods, most of them with a semantics based on transition systems, have been used to guarantee correct service compositions without insisting on its automation. The main goal of this work is to propose a Rewriting Logic based framework in order to enhance automatic Web services composition. The proposed model execution allows to discover services automatically and guarantee the correct interaction of independent pieces of software in a transparent manner.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134298445","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
扫码关注我们
求助内容：
应助结果提醒方式：