发布求助
文献互助 智能选刊 最新文献

2010 Second International Conference on Computational Intelligence and Natural Computing最新文献

筛选
英文 中文
Optimal switch placement in distribution networks under different conditions using improved GA 基于改进遗传算法的配电网开关配置优化
2010 Second International Conference on Computational Intelligence and Natural Computing Pub Date : 2010-11-22 DOI: 10.1109/CINC.2010.5643849
Lixing Ma, Xinhui Lv, Shouzheng Wang, H. Miyajima
{"title":"Optimal switch placement in distribution networks under different conditions using improved GA","authors":"Lixing Ma, Xinhui Lv, Shouzheng Wang, H. Miyajima","doi":"10.1109/CINC.2010.5643849","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643849","url":null,"abstract":"This paper presents an optimization methodology for placement of switches in medium-voltage loop distribution networks. The primary objective is to minimize the total cost with consideration of achieving high distribution reliability levels. In this paper, four possible states are con-sidered and discussed, and the improved genetic algorithm is adopted to determine the optimal number and locations of sectionalizing switches and interconnection switches. The feasibility and superiority of the proposed algorithm is demonstrated by application to main feeder F1 and F2 among RBTS-BUS 5 system.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126660139","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}
引用次数: 14
Comparison of SC-FDMA and NC-OFDM schemes for cognitive radio networks 认知无线网络中SC-FDMA和NC-OFDM方案的比较
2010 Second International Conference on Computational Intelligence and Natural Computing Pub Date : 2010-11-22 DOI: 10.1109/CINC.2010.5643725
Haizhou Gao
{"title":"Comparison of SC-FDMA and NC-OFDM schemes for cognitive radio networks","authors":"Haizhou Gao","doi":"10.1109/CINC.2010.5643725","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643725","url":null,"abstract":"In order to implement cognitive radio (CR) in the future, the choice of a physical layer data transmission scheme is very important. In this paper, we compare two agile transmission schemes employed for CR networks: Single Carrier Frequency Division Multiple Access (SC-FDMA) and non-contiguous OFDM (NC-OFDM). First, a qualitative comparison is provided by analyzing the advantages and disadvantages of each scheme. Then the performances of both schemes are compared by simulation. The simulation results and corresponding analyses demonstrate that the performance of SC-FDMA is generally better than NC-OFDM in CR networks. Therefore, SC-FDMA can be a promising alternative to NC-OFDM for CR networks.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126509379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Topology optimization design of the bracket of a special vehicle based on FEA method 基于有限元法的某特种车辆支架拓扑优化设计
2010 Second International Conference on Computational Intelligence and Natural Computing Pub Date : 2010-11-22 DOI: 10.1109/CINC.2010.5643717
Wu Yong-hai, Liu Xiao-mei, Wang Feng
{"title":"Topology optimization design of the bracket of a special vehicle based on FEA method","authors":"Wu Yong-hai, Liu Xiao-mei, Wang Feng","doi":"10.1109/CINC.2010.5643717","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643717","url":null,"abstract":"In allusion to a certain kind of bracket of work cabin overhead support equipment components of the special vehicle, taking OptiStruct software as optimization design platform, the topology optimization of the bracket is carried out by using variable density method. The geometry model of the bracket is rebuilt and the finite element analysis of the bracket is carried out, then the stress and deformation of before and after optimization are compared. The results show that the topology optimization method is an effective optimization method to carry out topology optimization of mechanical loading structure with FEA method. The model and approach adopted in this paper provide an important design reference to the mechanical structure and components lightweighting design.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127899270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Case retrieval strategies of tabu-based artificial fish swarm algorithm 基于禁忌的人工鱼群算法案例检索策略
2010 Second International Conference on Computational Intelligence and Natural Computing Pub Date : 2010-11-22 DOI: 10.1109/CINC.2010.5643817
Long-qin Xu, Shuang-yin Liu
{"title":"Case retrieval strategies of tabu-based artificial fish swarm algorithm","authors":"Long-qin Xu, Shuang-yin Liu","doi":"10.1109/CINC.2010.5643817","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643817","url":null,"abstract":"In terms of some problems existing in the process of large case base retrieval, combining tabu search method and the advantages of artificial fishschool algorithm, this paper proposes multilevel search strategy based on tabu artificial fishswarm algorithm. Tabu artificial fishswarm algorithm applies tabu table with a memory function to artificial fishswarm algorithm and uses different computing model in the similarity calculation according to properties of different types, effectively to avoid premature and blind search and other issues. Simulation results show that the algorithm outperforms other algorithms, it not only improves the retrieval accuracy and retrieval efficiency of the casebased reasoning system, but also is characterized by requiring not much with the initial values and parameters, diversity search and overcoming the local maximum, better coordinate the overall and local search capabilities and provides an effective retrieval method to retrieve the case of large case base.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121401132","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}
引用次数: 4
A new super-memory gradient method for unconstrained optimization 一种新的无约束优化的超记忆梯度方法
2010 Second International Conference on Computational Intelligence and Natural Computing Pub Date : 2010-11-22 DOI: 10.1109/CINC.2010.5643886
Jingyong Tanga, Li Dong
{"title":"A new super-memory gradient method for unconstrained optimization","authors":"Jingyong Tanga, Li Dong","doi":"10.1109/CINC.2010.5643886","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643886","url":null,"abstract":"In this paper, we propose a new super-memory gradient method for unconstrained optimization problems. The global convergence and linear convergence rate are proved under some mild conditions. The method uses the current and previous iterative information to generate a new search direction and uses Wolfe line search to define the step-size at each iteration. It has a possibly simple structure and avoids the computation and storage of some matrices, which is suitable to solve large scale optimization problems. Numerical experiments show that the new algorithm is effective in practical computation in many situations.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114652334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computing all longest common subsequences on MPI cluster 计算MPI集群上所有最长公共子序列
2010 Second International Conference on Computational Intelligence and Natural Computing Pub Date : 2010-11-22 DOI: 10.1109/CINC.2010.5643814
Jinxian Lin, Yiqing Lv
{"title":"Computing all longest common subsequences on MPI cluster","authors":"Jinxian Lin, Yiqing Lv","doi":"10.1109/CINC.2010.5643814","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643814","url":null,"abstract":"Finding out the longest common subsequences (LCS) is one of the most important problems of Bioengineering. But there is still not excellent algorithm for computing all of the longest common subsequences (ALCS). An existing fast algorithm for LCS was studied and improved in this paper. We combined the algorithm with MPI cluster and computed all the longest common subsequences of two random generate gene sequences on MPI cluster. The experiment results show that computing ALCS on MPI cluster is an efficient and practicality method.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127551087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Low carbon economy and innovative management 低碳经济和创新管理
2010 Second International Conference on Computational Intelligence and Natural Computing Pub Date : 2010-11-22 DOI: 10.1109/CINC.2010.5643718
Liu XiFa
{"title":"Low carbon economy and innovative management","authors":"Liu XiFa","doi":"10.1109/CINC.2010.5643718","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643718","url":null,"abstract":"Low carbon economy has been becoming the mainstream in the development of world economy. The paper elaborates the close relationship between low carbon economy and advancing the innovative management, and sets forth about increasing efficiency and profit to achieve sustainable development through the innovation in thinking, technology, system and integration which would help reduce consumption, emission and pollution.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126714554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Tuning SVM hyperparameters in the primal 优化SVM超参数
2010 Second International Conference on Computational Intelligence and Natural Computing Pub Date : 2010-11-22 DOI: 10.1109/CINC.2010.5643857
Huang Dongyuan, Chen Xiaoyun
{"title":"Tuning SVM hyperparameters in the primal","authors":"Huang Dongyuan, Chen Xiaoyun","doi":"10.1109/CINC.2010.5643857","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643857","url":null,"abstract":"Choosing optimal hyperparameters for Support Vector Machines(SVMs) is quite difficult but extremely essential in SVM design. This is usually done by minimizing estimates of generalization error such as the k-fold cross-validation error or the upper bound of leave-one-out(LOO) error. However, most of the approaches concentrate on the dual optimization problem of SVM. In this paper, we would like to consider the task of tuning hyperparameters in the primal. We derive a smooth validation function from the k-fold cross-validation, then tune hyperparameters by minimizing the smooth validation function using Quasi- Newton optimization technique. Experimental results not only show that our approach is much faster and provides more precise results than grid search method, but also demonstrate that tuning hyperparameters in the primal would be more efficient than in the dual due to advantages provided by the primal.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127505326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Research on ecological security prediction in mountain areas based on the artificial neural network —Taken western mountain areas in Shijiazhuang District for example 基于人工神经网络的山区生态安全预测研究——以石家庄区西部山区为例
2010 Second International Conference on Computational Intelligence and Natural Computing Pub Date : 2010-11-22 DOI: 10.1109/CINC.2010.5643781
Li Yan-qing, Huang Zhi-ying, Ge Jing-feng, Jia Qiang, Chen Jing, Fan Yu-zhong
{"title":"Research on ecological security prediction in mountain areas based on the artificial neural network —Taken western mountain areas in Shijiazhuang District for example","authors":"Li Yan-qing, Huang Zhi-ying, Ge Jing-feng, Jia Qiang, Chen Jing, Fan Yu-zhong","doi":"10.1109/CINC.2010.5643781","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643781","url":null,"abstract":"Ecological environment security had aroused more and more attentions, and became the focus of human society. The thesis took western mountain areas in Shijiazhuang District for study area, established ecological security prediction indexes under the model of Pressure-State-Response(PSR), and predicted standardized value of each index by using artificial neural network model, then predicted the development trend of ecological security condition in the next 9 years through ecological security calculation and trend curve. Results were as follows: the overall ecological security degree would present rising trend, it would be “better” state in 2007∼2015, and the maximum value would be 0.6940 in 2015, increased by 74.96% than that of 1996 and 21.58% than that of 2006. However, the ecological security degrees would be less than 0.8 each year, showing that the regional ecological environment problems were not completely solved, should take further measures to protect the ecological environment.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126431611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Study of diagonalization on skew self-conjugate matrix in quaternion field 四元数域中斜自共轭矩阵对角化的研究
2010 Second International Conference on Computational Intelligence and Natural Computing Pub Date : 2010-11-22 DOI: 10.1109/CINC.2010.5643889
Lieya Yan, L. Xu
{"title":"Study of diagonalization on skew self-conjugate matrix in quaternion field","authors":"Lieya Yan, L. Xu","doi":"10.1109/CINC.2010.5643889","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643889","url":null,"abstract":"This paper made a further research based on the extended unitary diagonalization of skew self-conjugate matrix. Based on the definition of skew selfconjugate matrix, we discussed some properties of skew self-conjugate matrix, and gave the necessary and sufficient condition for determining whether ; is a right eigenvalue of matrix in the quaternion field. By means of the Schur theorem in real quaternion field, we proved that skew self-conjugate can be extended unitary diagonalized. Furthermore, if A and B are invertible and commutative, then A + B and A−1 + B−1 can be extended unitary diagonalized at the same time.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123692517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信