In this paper, we propose a novel objective function called the adaptive Fuzzy Weighted Sum Validity Function(FWSVF), which is a merged weight of the several fuzzy cluster validity functions, including XB, PE, PC and PBMF. The improved validity function is more efficient than others. Furthermore, we present a Mixed Strategy Evolutionary Clustering Algorithm based adaptive validity function(AMSECA), which is merged from Evolutionary Algorithm along with Mixed Strategy and Fuzzy C-means Algorithm. Moreover, in the experiments, we show the effectiveness of AMSECA, AMSECA could find the proper number of clusters automatically as well as appropriate partitions of the data set and avoid local optima.
{"title":"An Evolutionary Clustering Algorithm Based on Adaptive Fuzzy Weighted Sum Validity Function","authors":"Hongbin Dong, Wei-gen Hou, Guisheng Yin","doi":"10.1109/CSO.2010.204","DOIUrl":"https://doi.org/10.1109/CSO.2010.204","url":null,"abstract":"In this paper, we propose a novel objective function called the adaptive Fuzzy Weighted Sum Validity Function(FWSVF), which is a merged weight of the several fuzzy cluster validity functions, including XB, PE, PC and PBMF. The improved validity function is more efficient than others. Furthermore, we present a Mixed Strategy Evolutionary Clustering Algorithm based adaptive validity function(AMSECA), which is merged from Evolutionary Algorithm along with Mixed Strategy and Fuzzy C-means Algorithm. Moreover, in the experiments, we show the effectiveness of AMSECA, AMSECA could find the proper number of clusters automatically as well as appropriate partitions of the data set and avoid local optima.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129465322","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}
Fuzzy relational equations have played an important role in fuzzy modeling and applied to many practical problems. Most theories of fuzzy relational equations based on a premise that the solution set is not empty. However, this is often not the case in practical applications. Recently, Chakraborty et al. presented an efficient algorithm to solve the best approximate solution for the fuzzy relational equations, XoA=I, with max-min composition, where I denotes the identity matrix. In this paper, new theoretical results are proposed for solving this particular problem. Hence, one simple procedure can be presented to find the best approximate solution quickly. A numerical example is provided to illustrate the procedure.
{"title":"One Simple Procedure to Finding the Best Approximate Solution for a Particular Fuzzy Relational Equation with Max-min Composition","authors":"Yak-Kuen Wu, Chia-Cheng Liu, Yung-Yih Lur, S. Guu","doi":"10.1109/CSO.2010.19","DOIUrl":"https://doi.org/10.1109/CSO.2010.19","url":null,"abstract":"Fuzzy relational equations have played an important role in fuzzy modeling and applied to many practical problems. Most theories of fuzzy relational equations based on a premise that the solution set is not empty. However, this is often not the case in practical applications. Recently, Chakraborty et al. presented an efficient algorithm to solve the best approximate solution for the fuzzy relational equations, XoA=I, with max-min composition, where I denotes the identity matrix. In this paper, new theoretical results are proposed for solving this particular problem. Hence, one simple procedure can be presented to find the best approximate solution quickly. A numerical example is provided to illustrate the procedure.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129691071","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}
Zhengtao Jiang, Yong-Bin Wang, Wen Liu, Chen-guang Yang
Identity-based encryption schemes simplify the problem of the management and maintenance of digital certificates in the PKI environment. If the number of identities is large enough in a KGC (key generation center) domain, a single KGC will be a bottleneck of computation and communication. HIBE (Hierarchical identity-based encryption) has been introduced to solve this problem. For the present HIBEs, the size of public parameters is large and is twice as the number of hierarchy, and the analysis method is unique. Most of the existing HIBEs are either proved secure under RO (random oracle) model, or complicated and proved secure under standard mode. This paper further investigates both efficient and provably secure HIBE schemes with small public key size under multi-models. The size of public parameters of the proposed scheme is small and is independent of bit representation of an identity, and is about the same size as the number of hierarchy. The proposed scheme also has the advantage of constant size of cipher text, which is composed of 4 group elements. At last, the proposed scheme is proved sID-IND-CCA secure under both RO and standard models based on the standard DBDH problem. Investigations on the method of cryptographic scheme design and proof of security under multi-models can improve the confidence on its security.
{"title":"Efficiently CCA Secure HIBE Schemes under Double Models with Constant Ciphersize","authors":"Zhengtao Jiang, Yong-Bin Wang, Wen Liu, Chen-guang Yang","doi":"10.1109/CSO.2010.56","DOIUrl":"https://doi.org/10.1109/CSO.2010.56","url":null,"abstract":"Identity-based encryption schemes simplify the problem of the management and maintenance of digital certificates in the PKI environment. If the number of identities is large enough in a KGC (key generation center) domain, a single KGC will be a bottleneck of computation and communication. HIBE (Hierarchical identity-based encryption) has been introduced to solve this problem. For the present HIBEs, the size of public parameters is large and is twice as the number of hierarchy, and the analysis method is unique. Most of the existing HIBEs are either proved secure under RO (random oracle) model, or complicated and proved secure under standard mode. This paper further investigates both efficient and provably secure HIBE schemes with small public key size under multi-models. The size of public parameters of the proposed scheme is small and is independent of bit representation of an identity, and is about the same size as the number of hierarchy. The proposed scheme also has the advantage of constant size of cipher text, which is composed of 4 group elements. At last, the proposed scheme is proved sID-IND-CCA secure under both RO and standard models based on the standard DBDH problem. Investigations on the method of cryptographic scheme design and proof of security under multi-models can improve the confidence on its security.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"218 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129832719","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}
Tao Xu, Yiwen Li, Qiang Li, Liang Hao, Wenjun Song
The frontal rail structure, which profoundly affect automotive frontal crashworthiness, must have an adjust deformation behavior and excellent energy absorbing ability. This work aims to explore the proper material distribution to improve its bending mode to axial crush mode. Since the nonlinear finite element analysis to obtain sensitivities is high computational complexity, the strain-energy-density (SED) method is put forward to calculate the stiffness distribution under equivalent static loads condition. Topology optimization approach is also investigated by considering different crush characteristics. Thus, the locations of the reinforcement plates and triggers can be distributed reasonably. The results demonstrate the capability and potential of the approach and process proposed in the crashworthiness design of auto body structure.
{"title":"Crashworthiness Design of Frontal Rail Using Strain-Energy-Density and Topology Optimization Approach","authors":"Tao Xu, Yiwen Li, Qiang Li, Liang Hao, Wenjun Song","doi":"10.1109/CSO.2010.92","DOIUrl":"https://doi.org/10.1109/CSO.2010.92","url":null,"abstract":"The frontal rail structure, which profoundly affect automotive frontal crashworthiness, must have an adjust deformation behavior and excellent energy absorbing ability. This work aims to explore the proper material distribution to improve its bending mode to axial crush mode. Since the nonlinear finite element analysis to obtain sensitivities is high computational complexity, the strain-energy-density (SED) method is put forward to calculate the stiffness distribution under equivalent static loads condition. Topology optimization approach is also investigated by considering different crush characteristics. Thus, the locations of the reinforcement plates and triggers can be distributed reasonably. The results demonstrate the capability and potential of the approach and process proposed in the crashworthiness design of auto body structure.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128654607","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 research involves a study of the existing carsharing services in Singapore. In this paper, a novel method to forecast and relocate vehicle resources for carsharing services was proposed. The proposed model consists of three main components, i.e., microscopic traffic simulation, focus forecasting and inventory replenishing. An actual suburban network of the Clementi area of Singapore and including several carsharing ports was used for the microscopic simulations conducted in this study. Based on the experimental results, the proposed method has the potential to improve the carsharing service currently operating in Singapore.
{"title":"Dynamic Relocating Vehicle Resources Using a Microscopic Traffic Simulation Model for Carsharing Services","authors":"Hao Wang, R. Cheu, Der-Horng Lee","doi":"10.1109/CSO.2010.98","DOIUrl":"https://doi.org/10.1109/CSO.2010.98","url":null,"abstract":"This research involves a study of the existing carsharing services in Singapore. In this paper, a novel method to forecast and relocate vehicle resources for carsharing services was proposed. The proposed model consists of three main components, i.e., microscopic traffic simulation, focus forecasting and inventory replenishing. An actual suburban network of the Clementi area of Singapore and including several carsharing ports was used for the microscopic simulations conducted in this study. Based on the experimental results, the proposed method has the potential to improve the carsharing service currently operating in Singapore.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127224683","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}
The paper proposes the problem reduction graph (PRG), an abstract model for discrete optimization problems which uses structural decomposition to reduce problem complexity and constructs the recurrence relations between the problem and its sub problems. We develop several important algorithm patterns for PRG construction, each leading to a special class of concrete problem-solving algorithms in a systematic way. The model supports logical transformation from specifications to algorithmic programs by deductive inference, and thus significantly promotes the automation and reusability of algorithm design.
{"title":"Problem Reduction Graph Model for Discrete Optimization Problems","authors":"Yujun Zheng, Jinyun Xue","doi":"10.1109/CSO.2010.202","DOIUrl":"https://doi.org/10.1109/CSO.2010.202","url":null,"abstract":"The paper proposes the problem reduction graph (PRG), an abstract model for discrete optimization problems which uses structural decomposition to reduce problem complexity and constructs the recurrence relations between the problem and its sub problems. We develop several important algorithm patterns for PRG construction, each leading to a special class of concrete problem-solving algorithms in a systematic way. The model supports logical transformation from specifications to algorithmic programs by deductive inference, and thus significantly promotes the automation and reusability of algorithm design.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129125067","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}
The vehicle routing problem with fuzzy demand at nodes is considered in this paper. The fuzzy possibility calculation approaches are presented to determine the preference strength to send the vehicle to next node, and the hybrid heuristics is proposed to determine a set of vehicle routes that minimizes vehicle number and total costs. Finally the computational results are presented to show the high effectiveness and performance of the solution approaches.
{"title":"Hybrid Heuristics for Vehicle Routing Problem with Fuzzy Demands","authors":"Changshi Liu, F. Huang","doi":"10.1109/CSO.2010.35","DOIUrl":"https://doi.org/10.1109/CSO.2010.35","url":null,"abstract":"The vehicle routing problem with fuzzy demand at nodes is considered in this paper. The fuzzy possibility calculation approaches are presented to determine the preference strength to send the vehicle to next node, and the hybrid heuristics is proposed to determine a set of vehicle routes that minimizes vehicle number and total costs. Finally the computational results are presented to show the high effectiveness and performance of the solution approaches.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130548673","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}
The parameters and schemes play an important role in a genetic algorithm (GA) and how to select them is still a controversial topic. This paper presents a study on the selection of the parameters and the schemes in the optimization of the fragment-type tag antenna, and gives the best schemes and the appropriate value ranges of the parameters. Results reveal that the scheme performance is closely related with the parameters and an appropriate selection may lead to a considerable computational saving.
{"title":"Parameters and Schemes Selection in the Optimization of the Fragment-Type Tag Antenna","authors":"Zusheng Jin, Hu Yang, Xingji Tang, J. Mao","doi":"10.1109/CSO.2010.100","DOIUrl":"https://doi.org/10.1109/CSO.2010.100","url":null,"abstract":"The parameters and schemes play an important role in a genetic algorithm (GA) and how to select them is still a controversial topic. This paper presents a study on the selection of the parameters and the schemes in the optimization of the fragment-type tag antenna, and gives the best schemes and the appropriate value ranges of the parameters. Results reveal that the scheme performance is closely related with the parameters and an appropriate selection may lead to a considerable computational saving.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125549256","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}
The main purpose of this paper is to test the degree of development of China's stock market, as well as its stage. Utilizing the GARCH amended model and the AR-X-GARCH (1, 1) model; we analyzed whether the opportunity for excess returns in China's stock markets exists, and tested the randomness of the returns' series in China's stock market. Finally, we concluded that China's two stock markets in Shenzhen and Shanghai have not reached the significant excess rate of return opportunities, but the stock markets as a whole have not reached the level of the weak-form efficiency. At the same time, we can see that China's stock market is gradually maturing. This can provide a good guide to understand the degree of development of China's stock market, as well as its stage.
{"title":"A Weak-Form Efficiency Testing of China's Stock Markets","authors":"Xianming Wen, K. Li, Lin Liang","doi":"10.1109/CSO.2010.131","DOIUrl":"https://doi.org/10.1109/CSO.2010.131","url":null,"abstract":"The main purpose of this paper is to test the degree of development of China's stock market, as well as its stage. Utilizing the GARCH amended model and the AR-X-GARCH (1, 1) model; we analyzed whether the opportunity for excess returns in China's stock markets exists, and tested the randomness of the returns' series in China's stock market. Finally, we concluded that China's two stock markets in Shenzhen and Shanghai have not reached the significant excess rate of return opportunities, but the stock markets as a whole have not reached the level of the weak-form efficiency. At the same time, we can see that China's stock market is gradually maturing. This can provide a good guide to understand the degree of development of China's stock market, as well as its stage.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122208207","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}
Accurate forecasting of rainfall has been one of the most important issues in hydrological research. Due to rainfall forecasting involves a rather complex nonlinear data pattern; there are lots of novel forecasting approaches to improve the forecasting accuracy. This paper proposes a Projection Pursuit Regression and Neural Networks (PPR--NNs) model for forecasting monthly rainfall in summer. First of all, we use the PPR technology to select input feature for NNs. Secondly, the Levenberg--Marquardt algorithm algorithm is used to train the NNs. Subsequently, example of rainfall values in August of Guangxi is used to illustrate the proposed PPR--NNs model. Empirical results indicate that the proposed method is better than the conventional neural network forecasting models which PPR--NNs model provides a promising alternative for forecasting rainfall application.
{"title":"Rainfall Forecasting Using Projection Pursuit Regression and Neural Networks","authors":"Fangqiong Luo, Jiansheng Wu","doi":"10.1109/CSO.2010.155","DOIUrl":"https://doi.org/10.1109/CSO.2010.155","url":null,"abstract":"Accurate forecasting of rainfall has been one of the most important issues in hydrological research. Due to rainfall forecasting involves a rather complex nonlinear data pattern; there are lots of novel forecasting approaches to improve the forecasting accuracy. This paper proposes a Projection Pursuit Regression and Neural Networks (PPR--NNs) model for forecasting monthly rainfall in summer. First of all, we use the PPR technology to select input feature for NNs. Secondly, the Levenberg--Marquardt algorithm algorithm is used to train the NNs. Subsequently, example of rainfall values in August of Guangxi is used to illustrate the proposed PPR--NNs model. Empirical results indicate that the proposed method is better than the conventional neural network forecasting models which PPR--NNs model provides a promising alternative for forecasting rainfall application.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122261234","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
扫码关注我们
求助内容：
应助结果提醒方式：