With the development of network, more and more broadcast television information transfers from simulation to digit, and increasingly transmits in the network. Therefore the media information security question is imminent, is a pending issue. This paper is from the perspective of intrusion detection to consider security issues. This paper adopts the technology of text classification, designing an improved SVM algorithm to identify intrusion information. The experiment results show that this method has high classification precision and efficiency.
{"title":"Improved SVM Algorithm and its Application in Media Information Security System","authors":"Wenqian Shang, Tong Wang, Hongbin Dong","doi":"10.1109/CSO.2010.60","DOIUrl":"https://doi.org/10.1109/CSO.2010.60","url":null,"abstract":"With the development of network, more and more broadcast television information transfers from simulation to digit, and increasingly transmits in the network. Therefore the media information security question is imminent, is a pending issue. This paper is from the perspective of intrusion detection to consider security issues. This paper adopts the technology of text classification, designing an improved SVM algorithm to identify intrusion information. The experiment results show that this method has high classification precision and efficiency.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"14 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132899790","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 Moving Least Square(MLS) is used to solve as approximate function in meshless methods. The accuracy of solution will be affected by the right selected of the weight function. The Cubic B-spline wavelet function has many good natures, such as recursion, local positive supported, multi-scale and the smallest compact supported. This paper attempted to study it as the weight function and design a practical algorithm of meshless. With the one-dimensional pole and two-dimensional plate structures as example, three functions which are Gauss function, the constructed Cubic B-spline wavelet function and Cubic spline function are studied as weight function in meshless methods. Through the comparison of approximate and exact solutions of displacement and stress, results show that the proposed Cubic B-spline wavelet function possesses high fitting solution based on multi-scale and good stability, while exploiting application area to select the weight function in meshless methods.
{"title":"Study on Weight Function of Meshless Method Based on B-spline Wavelet Function","authors":"Tao Xu, Peng Zou, Tianshuang Xu, Chenmeng Jiye","doi":"10.1109/CSO.2010.136","DOIUrl":"https://doi.org/10.1109/CSO.2010.136","url":null,"abstract":"The Moving Least Square(MLS) is used to solve as approximate function in meshless methods. The accuracy of solution will be affected by the right selected of the weight function. The Cubic B-spline wavelet function has many good natures, such as recursion, local positive supported, multi-scale and the smallest compact supported. This paper attempted to study it as the weight function and design a practical algorithm of meshless. With the one-dimensional pole and two-dimensional plate structures as example, three functions which are Gauss function, the constructed Cubic B-spline wavelet function and Cubic spline function are studied as weight function in meshless methods. Through the comparison of approximate and exact solutions of displacement and stress, results show that the proposed Cubic B-spline wavelet function possesses high fitting solution based on multi-scale and good stability, while exploiting application area to select the weight function in meshless methods.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"87 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":"132450932","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 accurate parameter estimation for Muskingum model is to be useful to give the flood forecasting for flood control in water resources planning and management. Although some methods have been used to estimate the parameters for Muskingum model, an efficient method for parameter estimation in the calibration process is still lacking. In order to reduce the computational amount and improve the computational precision for parameter estimation, a modified particle swarm algorithm (MPSO) is presented for parameter optimization of Muskingum model. The technique found the best parameter values compared to previous results in terms of the sum of least residual absolute value. Empirical results that involve historical data from existed paper reveal the proposed MPSO outperforms other approaches in the literature.
{"title":"Optimal Parameter Estimation for Muskingum Model Using a Modified Particle Swarm Algorithm","authors":"Wenchuan Wang, Y. Kang, Lin Qiu","doi":"10.1109/CSO.2010.143","DOIUrl":"https://doi.org/10.1109/CSO.2010.143","url":null,"abstract":"The accurate parameter estimation for Muskingum model is to be useful to give the flood forecasting for flood control in water resources planning and management. Although some methods have been used to estimate the parameters for Muskingum model, an efficient method for parameter estimation in the calibration process is still lacking. In order to reduce the computational amount and improve the computational precision for parameter estimation, a modified particle swarm algorithm (MPSO) is presented for parameter optimization of Muskingum model. The technique found the best parameter values compared to previous results in terms of the sum of least residual absolute value. Empirical results that involve historical data from existed paper reveal the proposed MPSO outperforms other approaches in the literature.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"52 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":"124172765","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}
Differential evolution (DE) is a heuristic optimization method used to solve many optimization problems in real-valued search space. It has the advantage of incorporating a relatively simple and efficient form of mutation and crossover. However, the operator of DE is primarily based on floating-point representation only and is difficult to apply to binary-based optimization problems. In this paper, a modified binary differential evolution with a simple and new binary mutation mechanism based on a logical operation is proposed. The developed binary mutation strategy is suitable for dealing with discrete and parametric engineering optimization problems. Two different types of engineering problems consisting of optimal shape design of heat bonder and topology optimization of structure are used to illustrate the high viability of the proposed algorithm in engineering optimization.
{"title":"Engineering Optimization Using Modified Binary Differential Evolution Algorithm","authors":"Chun-Yin Wu, K. Tseng","doi":"10.1109/CSO.2010.185","DOIUrl":"https://doi.org/10.1109/CSO.2010.185","url":null,"abstract":"Differential evolution (DE) is a heuristic optimization method used to solve many optimization problems in real-valued search space. It has the advantage of incorporating a relatively simple and efficient form of mutation and crossover. However, the operator of DE is primarily based on floating-point representation only and is difficult to apply to binary-based optimization problems. In this paper, a modified binary differential evolution with a simple and new binary mutation mechanism based on a logical operation is proposed. The developed binary mutation strategy is suitable for dealing with discrete and parametric engineering optimization problems. Two different types of engineering problems consisting of optimal shape design of heat bonder and topology optimization of structure are used to illustrate the high viability of the proposed algorithm in engineering optimization.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"131 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":"124252652","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, the necessity of ranking of the enterprise’s informatization capacity maturity is researched on the basis of EICMM (Enterprise Informatization Capacity Maturity Model). Based on the EICMM, we adopt the proper method (Cluster Analytical Method) for the empirical research, commence from the evaluated index system, design the questionnaires and collect the related data of informatization, and handle and analyze the collated findings of the surveys and questionnaires by means of CABOSFV (Clustering Algorithm Based on Sparse Feature Vector) algorithm and explain the holds of the assumption of stratification and ranking of EICMM by resorting to the conclusion of such empirical analysis.
本文在EICMM(企业信息化能力成熟度模型)的基础上，研究了对企业信息化能力成熟度进行排序的必要性。在EICMM的基础上，采用适当的方法(聚类分析法)进行实证研究，从评价指标体系入手，设计问卷，收集信息化的相关数据;利用CABOSFV (Clustering Algorithm Based on Sparse Feature Vector)算法对调查问卷的整理结果进行处理和分析，并根据实证分析的结论解释EICMM分层和排序假设的成立。
{"title":"Empirically Analyzing the Necessity of EICMM Ranking by Clustering","authors":"Hui Ma, Yiping Yang, Yan Zhu, Mingxia Zhao","doi":"10.1109/CSO.2010.209","DOIUrl":"https://doi.org/10.1109/CSO.2010.209","url":null,"abstract":"In this paper, the necessity of ranking of the enterprise’s informatization capacity maturity is researched on the basis of EICMM (Enterprise Informatization Capacity Maturity Model). Based on the EICMM, we adopt the proper method (Cluster Analytical Method) for the empirical research, commence from the evaluated index system, design the questionnaires and collect the related data of informatization, and handle and analyze the collated findings of the surveys and questionnaires by means of CABOSFV (Clustering Algorithm Based on Sparse Feature Vector) algorithm and explain the holds of the assumption of stratification and ranking of EICMM by resorting to the conclusion of such empirical analysis.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"15 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":"124281434","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 propose a framework for autonomic failure management with hierarchical failure prediction functionality for coalition clusters. It analyzes node, cluster and system wide failure behaviors and forecasts the prospective failure occurrences based on quantified failure dynamics. Failure correlations are inspected by the predictor. Experimental results in a computational grid on campus show the offline and online predictions by our predictors accurately forecast the failure trend and capture failure correlations in a coalition clusters environment.
{"title":"Proactive Failure Management for High Availability Computing in Computer Clusters","authors":"Ziming Zhang, Song Fu","doi":"10.1109/CSO.2010.71","DOIUrl":"https://doi.org/10.1109/CSO.2010.71","url":null,"abstract":"In this paper, we propose a framework for autonomic failure management with hierarchical failure prediction functionality for coalition clusters. It analyzes node, cluster and system wide failure behaviors and forecasts the prospective failure occurrences based on quantified failure dynamics. Failure correlations are inspected by the predictor. Experimental results in a computational grid on campus show the offline and online predictions by our predictors accurately forecast the failure trend and capture failure correlations in a coalition clusters environment.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"52 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":"114752415","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}
We propose a new trust region method that employs both the modified BFGS update and Amijio line search. The method exploits the information of function and gradient, and ensures the Hessian matrix of trust region subproblem positive-definite. At some assumptions, the global convergence and superlinear convergence property are proposed. Finally, numerical experiments show that the method is efficient.
{"title":"A Modified BFGS Trust Region Method","authors":"Yunlong Lu, Xiaowei Jiang, Yueting Yang","doi":"10.1109/CSO.2010.106","DOIUrl":"https://doi.org/10.1109/CSO.2010.106","url":null,"abstract":"We propose a new trust region method that employs both the modified BFGS update and Amijio line search. The method exploits the information of function and gradient, and ensures the Hessian matrix of trust region subproblem positive-definite. At some assumptions, the global convergence and superlinear convergence property are proposed. Finally, numerical experiments show that the method is efficient.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"14 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":"116405974","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 three types of learning behaviors with complete information, partial information and no information respectively, and thus models travelers’ route choice for investigating the impact of memory on the evolution of transportation system. Simulation results on a three-parallel-route network show that it is uncertain whether the information released by advanced traveler information systems (ATIS) can make the flow pattern evolve to a logit stochastic user equilibrium, which depends on the length of memory. If memory length is larger than a threshold value, the provided information drives the flow pattern to a stochastic user equilibrium state; otherwise, the logit stochastic user equilibrium is unattainable and the system evolution can not converge to a stable state. Furthermore, it is also shown that the fluctuation of traffic flow under full information exceeds that under partial information on the same route, when the length of memory remains unchanged.
{"title":"The Impact of Memory on Travelers' Behaviour and the Evolution of Transportation System","authors":"Wen-Xiang Wu","doi":"10.1109/CSO.2010.91","DOIUrl":"https://doi.org/10.1109/CSO.2010.91","url":null,"abstract":"This paper presents three types of learning behaviors with complete information, partial information and no information respectively, and thus models travelers’ route choice for investigating the impact of memory on the evolution of transportation system. Simulation results on a three-parallel-route network show that it is uncertain whether the information released by advanced traveler information systems (ATIS) can make the flow pattern evolve to a logit stochastic user equilibrium, which depends on the length of memory. If memory length is larger than a threshold value, the provided information drives the flow pattern to a stochastic user equilibrium state; otherwise, the logit stochastic user equilibrium is unattainable and the system evolution can not converge to a stable state. Furthermore, it is also shown that the fluctuation of traffic flow under full information exceeds that under partial information on the same route, when the length of memory remains unchanged.","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":"123995823","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}
Fixed point theorems have been applied to economic analysis. In this paper, the well-known Brouwer fixed point theorem is discussed to a class of nonconvex sets and a globally convergent homotopy method is developed for computing the fixed-point on this class of nonconvex sets. In addition, a simple example is given to show the effectiveness of the modified method.
{"title":"Homotopy Method for a Class of Fixed-Point Problems","authors":"Jia-wei Tan, Jia Chen, Qing-huai Liu","doi":"10.1109/CSO.2010.236","DOIUrl":"https://doi.org/10.1109/CSO.2010.236","url":null,"abstract":"Fixed point theorems have been applied to economic analysis. In this paper, the well-known Brouwer fixed point theorem is discussed to a class of nonconvex sets and a globally convergent homotopy method is developed for computing the fixed-point on this class of nonconvex sets. In addition, a simple example is given to show the effectiveness of the modified method.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"104 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":"124043514","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 is devoted to the study of an embedding method for semi definite programming problems using Extended Lagrange-Slater dual (ELSD) and its Lagrangian dual. A theorem proved by de Clerk et al. in 1996 is revisited. A new proof is provided utilizing a result regarding the weak feasibility of a conic linear programming problem.
{"title":"Self-Dual Embedding for SDP Using ELSD and its Lagrangian Dual","authors":"Qinghong Zhang, Gang Chen, Ting Zhang","doi":"10.1109/CSO.2010.139","DOIUrl":"https://doi.org/10.1109/CSO.2010.139","url":null,"abstract":"This paper is devoted to the study of an embedding method for semi definite programming problems using Extended Lagrange-Slater dual (ELSD) and its Lagrangian dual. A theorem proved by de Clerk et al. in 1996 is revisited. A new proof is provided utilizing a result regarding the weak feasibility of a conic linear programming problem.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"52 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":"129417573","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
扫码关注我们
求助内容：
应助结果提醒方式：