Because of continuous changes in the market and the today’s competitiveness world, most of manufacturing firms are competing for meeting demand, increasing quality and decreasing costs. Today, manufacturing firms are required to select a suitable flexible manufacturing system (FMS) to keep their share of the market. We propose a procedure for evaluating the flexible manufacturing systems based on a model incorporating two decision models namely “Data Envelopment Analysis (DEA)” and “Analytical Hierarchy Process (AHP)”. DEA helps us to categorize the Decision Making Units (DMUs) to only two classes of efficient and inefficient units, whereas by using an AHP, we can have a full rank of DMUs. Input and output factors considered for ranking FMSs are Capital and Operating Costs, Throughput Time, Work in Process, Labor Requirements, Required Floor Space, Product Mix Flexibility,Yield, and Volume Flexibility. We implement this approach for a Vehicle Manufacturing Company in Iran.
{"title":"Evaluating and Selecting Flexible Manufacturing Systems by Integrating Data Envelopment Analysis and Analytical Hierarchy Process Model","authors":"K. Rezaie, S. N. Shirkouhi, S. Alem","doi":"10.1109/AMS.2009.68","DOIUrl":"https://doi.org/10.1109/AMS.2009.68","url":null,"abstract":"Because of continuous changes in the market and the today’s competitiveness world, most of manufacturing firms are competing for meeting demand, increasing quality and decreasing costs. Today, manufacturing firms are required to select a suitable flexible manufacturing system (FMS) to keep their share of the market. We propose a procedure for evaluating the flexible manufacturing systems based on a model incorporating two decision models namely “Data Envelopment Analysis (DEA)” and “Analytical Hierarchy Process (AHP)”. DEA helps us to categorize the Decision Making Units (DMUs) to only two classes of efficient and inefficient units, whereas by using an AHP, we can have a full rank of DMUs. Input and output factors considered for ranking FMSs are Capital and Operating Costs, Throughput Time, Work in Process, Labor Requirements, Required Floor Space, Product Mix Flexibility,Yield, and Volume Flexibility. We implement this approach for a Vehicle Manufacturing Company in Iran.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"63 1","pages":"460-464"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80786951","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}
Sarina Sulaiman, S. Shamsuddin, F. Forkan, A. Abraham, S. Sulaiman
E-learning has been a common online service to support teaching and learning in education. Universiti Teknologi Malaysia (UTM) has been using such service that is known as e-Learning@UTM since 2005. The demand for e-learning content increases dramatically every semester. The performance of e-learning servers reduces when the number of users for each semester keeps growing. Hence users often experience poor performance in accessing the e-learning contents or downloading files. Such problems are due to the problem in the performance of servers, network infrastructure and majority of users tend to access the same piece of information repetitively. Web caching has been recognized as an effective scheme to reduce service bottleneck, users’ access latency and network traffic. Therefore this paper will discuss an alternative way to tackle these problems by implementing a log data detection tool. This tool is capable to automatically directing either to cache or not to cache the objects in a document based on the log data (number of object hits, script size of objects, and time to receive object) in e-Learning@UTM to enhance such Web access.
{"title":"Intelligent Web Caching for E-learning Log Data","authors":"Sarina Sulaiman, S. Shamsuddin, F. Forkan, A. Abraham, S. Sulaiman","doi":"10.1109/AMS.2009.88","DOIUrl":"https://doi.org/10.1109/AMS.2009.88","url":null,"abstract":"E-learning has been a common online service to support teaching and learning in education. Universiti Teknologi Malaysia (UTM) has been using such service that is known as e-Learning@UTM since 2005. The demand for e-learning content increases dramatically every semester. The performance of e-learning servers reduces when the number of users for each semester keeps growing. Hence users often experience poor performance in accessing the e-learning contents or downloading files. Such problems are due to the problem in the performance of servers, network infrastructure and majority of users tend to access the same piece of information repetitively. Web caching has been recognized as an effective scheme to reduce service bottleneck, users’ access latency and network traffic. Therefore this paper will discuss an alternative way to tackle these problems by implementing a log data detection tool. This tool is capable to automatically directing either to cache or not to cache the objects in a document based on the log data (number of object hits, script size of objects, and time to receive object) in e-Learning@UTM to enhance such Web access.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"10 1","pages":"136-141"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81979460","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}
Modjtaba Khalidji, Mohammad Zeiaee, Ali Taei, M. Jahed-Motlagh, H. Khaloozadeh
An adaptation of Ant Colony for Continuous Domains (ACOR) to bi-objective optimization problems is proposed and used to solve the optimal portfolio selection problem in Markowitz’s risk-return framework. The utilized risk measure is Value-at-Risk (VaR). In adapting ACOR to bi objective optimization, a dynamically weighted aggregation of objective values by a normalized Tchebychev norm is used to obtain a set of non-dominated Pareto optimal solutions to the problem. The proposed method (DW-ACOR) is tested on a set of past return data of 12 assets on Tehran Stock Exchange (TSE). Historical Simulation (HS) is utilized to obtain an estimate of the VaR. In order to compare the performance of DW-ACOR with a successful multi objective evolutionary algorithm (MOEA), NSGA-II is also used to solve the same portfolio selection problem. A comparison of the obtained results, shows that the proposed method offers high quality solutions and a wide range of risk-return trade-offs. While NSGA-II obtains a set of somewhat more widely spread solutions, the quality of the solutions obtained by DW-ACOR is higher as they are closer to the true Pareto front of the problem.
{"title":"Dynamically Weighted Continuous Ant Colony Optimization for Bi-Objective Portfolio Selection Using Value-at-Risk","authors":"Modjtaba Khalidji, Mohammad Zeiaee, Ali Taei, M. Jahed-Motlagh, H. Khaloozadeh","doi":"10.1109/AMS.2009.133","DOIUrl":"https://doi.org/10.1109/AMS.2009.133","url":null,"abstract":"An adaptation of Ant Colony for Continuous Domains (ACOR) to bi-objective optimization problems is proposed and used to solve the optimal portfolio selection problem in Markowitz’s risk-return framework. The utilized risk measure is Value-at-Risk (VaR). In adapting ACOR to bi objective optimization, a dynamically weighted aggregation of objective values by a normalized Tchebychev norm is used to obtain a set of non-dominated Pareto optimal solutions to the problem. The proposed method (DW-ACOR) is tested on a set of past return data of 12 assets on Tehran Stock Exchange (TSE). Historical Simulation (HS) is utilized to obtain an estimate of the VaR. In order to compare the performance of DW-ACOR with a successful multi objective evolutionary algorithm (MOEA), NSGA-II is also used to solve the same portfolio selection problem. A comparison of the obtained results, shows that the proposed method offers high quality solutions and a wide range of risk-return trade-offs. While NSGA-II obtains a set of somewhat more widely spread solutions, the quality of the solutions obtained by DW-ACOR is higher as they are closer to the true Pareto front of the problem.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"18 1","pages":"230-235"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78384148","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}
In this paper, we proved that Stable Matching problems are the same problems about Stable Configurations of Multi-stage Interconnection Networks (MINs). We solved the Stability Problem of Existing Regular Chained Multipath Cross Link Network using the approaches and solutions provided by the Stable Matching Problem. Specifically we have used Stable Marriage Problem as an example of Stable Matching. For MINs to prove Stable two existing algorithms are used: the first algorithm generates the MINs Preferences List in O(n^2) time and second algorithm produces a set of most Optimal Pairs of the Switching Elements (SEs) (derived from the MINs Preferences List)in O(n) time. The stability comparison of regular and irregular MINs concludes that fault-tolerant chained regular networks are more stable than fault-tolerant chained irregular networks.
{"title":"On a Stable Matching Problem of Hybrid Multi–stage Interconnection Networks","authors":"Nitin, Ruchi Verma","doi":"10.1109/AMS.2009.137","DOIUrl":"https://doi.org/10.1109/AMS.2009.137","url":null,"abstract":"In this paper, we proved that Stable Matching problems are the same problems about Stable Configurations of Multi-stage Interconnection Networks (MINs). We solved the Stability Problem of Existing Regular Chained Multipath Cross Link Network using the approaches and solutions provided by the Stable Matching Problem. Specifically we have used Stable Marriage Problem as an example of Stable Matching. For MINs to prove Stable two existing algorithms are used: the first algorithm generates the MINs Preferences List in O(n^2) time and second algorithm produces a set of most Optimal Pairs of the Switching Elements (SEs) (derived from the MINs Preferences List)in O(n) time. The stability comparison of regular and irregular MINs concludes that fault-tolerant chained regular networks are more stable than fault-tolerant chained irregular networks.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"12 1","pages":"590-595"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74318412","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}
If there are multiple objects attached with RFID tags within the interrogation zone of a reader, and more than one tags send their identification messages to the reader simultaneously to response the query from the reader, the tag-tag collision would happen and no tag is identified by the reader. The tag-tag collision leads to retransmission of tag IDs which results in wastage of bandwidth and an increase in the total delay in identifying all the objects. Several tag collision avoidance algorithms have been proposed. In this paper, a survey on tag collision avoidance algorithms is presented. The performance of two algorithms which are classic and widely used, Tree Split and Memoryless are studied. Simulation and comparison analysis of performance is performed.
{"title":"Study on the Performance of Tag-Tag Collision Avoidance Algorithms in RFID Systems","authors":"Zhiying Yang, Jun-Liang Chen, Z. Mao","doi":"10.1109/AMS.2009.37","DOIUrl":"https://doi.org/10.1109/AMS.2009.37","url":null,"abstract":"If there are multiple objects attached with RFID tags within the interrogation zone of a reader, and more than one tags send their identification messages to the reader simultaneously to response the query from the reader, the tag-tag collision would happen and no tag is identified by the reader. The tag-tag collision leads to retransmission of tag IDs which results in wastage of bandwidth and an increase in the total delay in identifying all the objects. Several tag collision avoidance algorithms have been proposed. In this paper, a survey on tag collision avoidance algorithms is presented. The performance of two algorithms which are classic and widely used, Tree Split and Memoryless are studied. Simulation and comparison analysis of performance is performed.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"35 4","pages":"757-760"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72613982","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}
Fabrications of single mode fiber coupling by heating fibers on a flame are very common and popular. However, controlling the output power of fiber coupling process is neither easy nor similar. Power losses occur at the coupling length due to geometrical change of the fibers after fusion. The power losses will affect sensor devices such as an optical switch. This paper proposes power splitting into the second fiber junction in terms of a new model by deriving the coupling power with two conditions of refractive index changes. First is the change in the vertical part and second is the change in the vertical and horizontal part simultaneously. Both conditions are studied by perpendicular and parallel directions. The model is examined where power absorption and reflection are accumulated by power losses. Simulation result shows that the power increases by superposition wave. These power losses are due to radiation out of the cladding and fiber heating.
{"title":"A Simplified Coupling Power Model of Single Mode Fiber Fusion at Coupling Length","authors":"Saktioto, J. Ali, M. Fadhali","doi":"10.1109/AMS.2009.44","DOIUrl":"https://doi.org/10.1109/AMS.2009.44","url":null,"abstract":"Fabrications of single mode fiber coupling by heating fibers on a flame are very common and popular. However, controlling the output power of fiber coupling process is neither easy nor similar. Power losses occur at the coupling length due to geometrical change of the fibers after fusion. The power losses will affect sensor devices such as an optical switch. This paper proposes power splitting into the second fiber junction in terms of a new model by deriving the coupling power with two conditions of refractive index changes. First is the change in the vertical part and second is the change in the vertical and horizontal part simultaneously. Both conditions are studied by perpendicular and parallel directions. The model is examined where power absorption and reflection are accumulated by power losses. Simulation result shows that the power increases by superposition wave. These power losses are due to radiation out of the cladding and fiber heating.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"66 5 1","pages":"671-675"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83071156","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}
This paper will introduce the theory and practice of DNA-based computing models (DNAbCM). Several models will be provided with the basic tools necessary to understand current research in DNAbCM. Discussion will focus on potential applications to artificial intelligence, scheduling problem, molecular memory and smart machines (or bio-robotics). Following a brief review of DNA structure, an overview of the basic tools from molecular biology utilized in biotechnology (e.g., DNA molecular annealing, ligation, polymerization, restriction enzyme, PCR and POA etc.) will be undertaken. A discussion of the major, basic computational architectures of classical DNA computing models (e.g., Adleman's algorithm for HPP, DNA Chip-based SAT, and etc.) will be provided in each presenting an animation detailing execution of a simple example. Attention will then turn to advanced topics related to molecular memory, hybrid artificial intelligence, in particular, a new semantic network and scheduling smart machine will be presented and implemented on a DNAbCM-inspired semantic model. This discussion on the models and implementations will be undertaken with attention to both theoretical and chemical points of view.
{"title":"DNA Computing Models and Practice","authors":"O. Ono","doi":"10.1109/AMS.2009.149","DOIUrl":"https://doi.org/10.1109/AMS.2009.149","url":null,"abstract":"This paper will introduce the theory and practice of DNA-based computing models (DNAbCM). Several models will be provided with the basic tools necessary to understand current research in DNAbCM. Discussion will focus on potential applications to artificial intelligence, scheduling problem, molecular memory and smart machines (or bio-robotics). Following a brief review of DNA structure, an overview of the basic tools from molecular biology utilized in biotechnology (e.g., DNA molecular annealing, ligation, polymerization, restriction enzyme, PCR and POA etc.) will be undertaken. A discussion of the major, basic computational architectures of classical DNA computing models (e.g., Adleman's algorithm for HPP, DNA Chip-based SAT, and etc.) will be provided in each presenting an animation detailing execution of a simple example. Attention will then turn to advanced topics related to molecular memory, hybrid artificial intelligence, in particular, a new semantic network and scheduling smart machine will be presented and implemented on a DNAbCM-inspired semantic model. This discussion on the models and implementations will be undertaken with attention to both theoretical and chemical points of view.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"19 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88639066","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}
This paper presents the design and control of a Stewart-Platform. The Stewart platform is designed based on a set of six independently prismatic actuators. The actuators translate through spherical joints which reside on a stationary platform. Each strut is driven by a DC motor. In this paper, kinematic characteristic and its limitation are discussed. Simulations and experiments are conducted to evaluate the controller performance.
{"title":"Design and Control of the Stewart Platform Robot","authors":"Indrawanto, A. Santoso","doi":"10.1109/AMS.2009.53","DOIUrl":"https://doi.org/10.1109/AMS.2009.53","url":null,"abstract":"This paper presents the design and control of a Stewart-Platform. The Stewart platform is designed based on a set of six independently prismatic actuators. The actuators translate through spherical joints which reside on a stationary platform. Each strut is driven by a DC motor. In this paper, kinematic characteristic and its limitation are discussed. Simulations and experiments are conducted to evaluate the controller performance.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"2020 1","pages":"475-480"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87796015","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}
Ali Rajabi, Aresh Dadlani, Ahmad Kianrad, A. Khonsari, Farzaneh Varaminian
With increase in time-critical applications over the Internet, the need for differentiating services has become a major endeavor in research communities. One promising paradigm proposed to support such traffic diversity in the next-generation Internet is Optical Burst Switching (OBS). In the literature, two simple but efficient approaches namely, threshold and wavelength-based techniques have been investigated under the resource allocation-based QoS management scheme as solutions to overcome the bandwidth requirement in the backbone. However, to the best of our knowledge, the wavelength-based technique has not been analytically studied for any arbitrary number of service classes. In this paper, we generalize the wavelength-based technique to support any number of classes. Firstly, we present a novel mathematical model for the wavelength-based technique for real-time and non-real-time service classes. The proposed model is then extended to support any arbitrary number of classes. Simulations conducted at the switch level validate the model.
{"title":"Mathematical Analysis of Wavelength-Based QoS Management in Optical Burst Switched Networks","authors":"Ali Rajabi, Aresh Dadlani, Ahmad Kianrad, A. Khonsari, Farzaneh Varaminian","doi":"10.1109/AMS.2009.39","DOIUrl":"https://doi.org/10.1109/AMS.2009.39","url":null,"abstract":"With increase in time-critical applications over the Internet, the need for differentiating services has become a major endeavor in research communities. One promising paradigm proposed to support such traffic diversity in the next-generation Internet is Optical Burst Switching (OBS). In the literature, two simple but efficient approaches namely, threshold and wavelength-based techniques have been investigated under the resource allocation-based QoS management scheme as solutions to overcome the bandwidth requirement in the backbone. However, to the best of our knowledge, the wavelength-based technique has not been analytically studied for any arbitrary number of service classes. In this paper, we generalize the wavelength-based technique to support any number of classes. Firstly, we present a novel mathematical model for the wavelength-based technique for real-time and non-real-time service classes. The proposed model is then extended to support any arbitrary number of classes. Simulations conducted at the switch level validate the model.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"16 1","pages":"655-660"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87998642","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}
M. Sebt, Amir Akrami, M. T. Banki, V. Shahhosseini
A project is a temporary organization; therefore, when a project starts, the organizational arrangement of human resources must change. This issue certainly will influence the operation processes and will need procedures such as allocation of personnel to the projects, releasing them from the project and assigning employees to project activities. In addition, expense of utilizing internal and outside worker forces could be different, which may force us to consider financial and duration limitation of the project for the specific time period. To do so and in order to maximize utilization of internal resources, in this study we present a linear integer programming model. Maximizing the project benefit function, this model shows the optimum allocation of experts in the project. In order to simulate this model, after gathering the information from a running project in Iran, the data of the project has been simulated by using CPLEX software with AMPL language, which the working hours of each employee in each time (map of engineers) will be the output, so that the project benefit would be maximum.
{"title":"Optimized Allocation of Expert Human Resources to Project","authors":"M. Sebt, Amir Akrami, M. T. Banki, V. Shahhosseini","doi":"10.1109/AMS.2009.146","DOIUrl":"https://doi.org/10.1109/AMS.2009.146","url":null,"abstract":"A project is a temporary organization; therefore, when a project starts, the organizational arrangement of human resources must change. This issue certainly will influence the operation processes and will need procedures such as allocation of personnel to the projects, releasing them from the project and assigning employees to project activities. In addition, expense of utilizing internal and outside worker forces could be different, which may force us to consider financial and duration limitation of the project for the specific time period. To do so and in order to maximize utilization of internal resources, in this study we present a linear integer programming model. Maximizing the project benefit function, this model shows the optimum allocation of experts in the project. In order to simulate this model, after gathering the information from a running project in Iran, the data of the project has been simulated by using CPLEX software with AMPL language, which the working hours of each employee in each time (map of engineers) will be the output, so that the project benefit would be maximum.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"7 1","pages":"386-391"},"PeriodicalIF":0.0,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84518171","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
扫码关注我们
求助内容：
应助结果提醒方式：