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

2010 International Conference on Computational Intelligence and Software Engineering最新文献

筛选
英文 中文
Research and Application on the Q-NM Computing Mode Q-NM计算模式的研究与应用
2010 International Conference on Computational Intelligence and Software Engineering Pub Date : 2010-12-30 DOI: 10.1109/CISE.2010.5676803
Zhonglin Jiang
{"title":"Research and Application on the Q-NM Computing Mode","authors":"Zhonglin Jiang","doi":"10.1109/CISE.2010.5676803","DOIUrl":"https://doi.org/10.1109/CISE.2010.5676803","url":null,"abstract":"The article establish an computing mode according to the Q-NM(Q-Nonlinear Mapping)theory and design a responsible program software and application flat. The theory and mode has been successfully applied to the testing device of car high energy dry mode ignition coin.","PeriodicalId":232832,"journal":{"name":"2010 International Conference on Computational Intelligence and Software Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117325745","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
A Matrix-Form LSQR Iterative Method for Solving the Second-Order Sylvester Matrix Equation EXF2+AXF+CX+BY=D 求解二阶Sylvester矩阵方程EXF2+AXF+CX+BY=D的矩阵形式LSQR迭代法
2010 International Conference on Computational Intelligence and Software Engineering Pub Date : 2010-12-30 DOI: 10.1109/CISE.2010.5676729
Sheng-Kun Li
{"title":"A Matrix-Form LSQR Iterative Method for Solving the Second-Order Sylvester Matrix Equation EXF2+AXF+CX+BY=D","authors":"Sheng-Kun Li","doi":"10.1109/CISE.2010.5676729","DOIUrl":"https://doi.org/10.1109/CISE.2010.5676729","url":null,"abstract":"In this paper, an iterative method is proposed to solve the second-order Sylvester matrix equation EXF^{2}+AXF+CX+BY=D with unknown matrix pair [X, Y], based on a matrix form of LSQR algorithm. By this iterative method, we can obtain the minimum Frobenius norm solution pair or the minimum Frobenius norm least squares solution pair over some constrained matrices, such as symmetric, generalized bisymmetric and (R, S)-symmetric matrices.","PeriodicalId":232832,"journal":{"name":"2010 International Conference on Computational Intelligence and Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117345725","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
On an Inverse Problem for Complex Network with Circuit Edges 一类带电路边的复杂网络的反问题
2010 International Conference on Computational Intelligence and Software Engineering Pub Date : 2010-12-30 DOI: 10.1109/CISE.2010.5677040
Lei Wang, G. Xu
{"title":"On an Inverse Problem for Complex Network with Circuit Edges","authors":"Lei Wang, G. Xu","doi":"10.1109/CISE.2010.5677040","DOIUrl":"https://doi.org/10.1109/CISE.2010.5677040","url":null,"abstract":"In this paper, we introduce a new approach in reconstruction of the generic complex network based on the system test. Firstly, using this method, we obtain that the state can be expressed by the Green function matrix through the Laplace transform. Next, we study the properties of Green function matrix, and give not only the conditions that the entries of the Green function matrix should have but also the relationship between the Green function matrix and the edge-edge intersection matrix. Finally, we get the Green function matrix of the system using the method of picture mosaic.","PeriodicalId":232832,"journal":{"name":"2010 International Conference on Computational Intelligence and Software Engineering","volume":"298 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121966650","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
Forecasting Deformation Time Series of Surrounding Rock for Tunnel Using Gaussian Process 利用高斯过程预测隧道围岩变形时间序列
2010 International Conference on Computational Intelligence and Software Engineering Pub Date : 2010-12-30 DOI: 10.1109/CISE.2010.5676987
Guo-shao Su, Yan Zhang, Guo-qing Chen
{"title":"Forecasting Deformation Time Series of Surrounding Rock for Tunnel Using Gaussian Process","authors":"Guo-shao Su, Yan Zhang, Guo-qing Chen","doi":"10.1109/CISE.2010.5676987","DOIUrl":"https://doi.org/10.1109/CISE.2010.5676987","url":null,"abstract":"Forecasting deformation of surrounding rock for tunnel is a highly complicated nonlinear problem which is hard to be solved by using conventional methods. A novel method based on Gaussian Process (GP) machine learning is proposed for solving the problem of deformation prediction of surrounding rock for tunnel. GP is a newly developed machine learning method based on the strict statistical learning theory. It has excellent capability for solving the highly nonlinear problem with small samples and high dimension. A GP model for deformation time series prediction of surrounding rock for tunnel is established. The results of a case study show that the model is feasible. It can forecast deformation of surrounding rock for tunnel efficiently and precisely. The results of studies also show that GP are very suitable for solving small samples prediction problems.","PeriodicalId":232832,"journal":{"name":"2010 International Conference on Computational Intelligence and Software Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122089294","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
The Optimization of Xen-Based Display Virtualization 基于xen的显示虚拟化优化
2010 International Conference on Computational Intelligence and Software Engineering Pub Date : 2010-12-30 DOI: 10.1109/CISE.2010.5677201
Fagui Liu, Gang Wu, Ran Xie
{"title":"The Optimization of Xen-Based Display Virtualization","authors":"Fagui Liu, Gang Wu, Ran Xie","doi":"10.1109/CISE.2010.5677201","DOIUrl":"https://doi.org/10.1109/CISE.2010.5677201","url":null,"abstract":"Virtualization technology can reuse the hardware platform to provide multiple isolated virtual system environments; however, this also causes unsatisfactory performance of the virtual guest system, especially the display in virtual guest system. In this paper, we study the virtual device model and improve the way of original virtual device implement based on Xen virtualization. A new display method is adopted which does improve the display environment of virtual guest system effectively.","PeriodicalId":232832,"journal":{"name":"2010 International Conference on Computational Intelligence and Software Engineering","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117082976","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
An Novel Optimal PID Tuning and On-Line Tuning Based on Artificial Bee Colony Algorithm 一种新的基于人工蜂群算法的最优PID整定和在线整定
2010 International Conference on Computational Intelligence and Software Engineering Pub Date : 2010-12-30 DOI: 10.1109/CISE.2010.5677047
Fei Gao, Yibo Qi, Q. Yin, JiaQing Xiao
{"title":"An Novel Optimal PID Tuning and On-Line Tuning Based on Artificial Bee Colony Algorithm","authors":"Fei Gao, Yibo Qi, Q. Yin, JiaQing Xiao","doi":"10.1109/CISE.2010.5677047","DOIUrl":"https://doi.org/10.1109/CISE.2010.5677047","url":null,"abstract":"This paper is concerned with PID controller, which is an extremely important type of controller. However the optimal PID parameters is difficult to determined, their performance are highly sensitive to the initial guess of the solution. An artificial bee colony (ABC) algorithm approach is introduced in PID tuning and on-line tuning as a novel technique for optimum adaptive control in a non-Lyapunov way. The controller {u(k)}, parameters {k_P,k_i, k_d}'s resolving is converted to a series of multi-modal nonnegative functions' minimization, whose minimums can be optimally determined by ABC. The details of applying the proposed method are given and the experiments done show the proposed strategy is effective and robust.","PeriodicalId":232832,"journal":{"name":"2010 International Conference on Computational Intelligence and Software Engineering","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117214582","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}
引用次数: 24
Segmenting Internal Brain Nuclei in MRI Brain Image Using Morphological Operators 形态学算子在MRI脑图像中的脑内核分割
2010 International Conference on Computational Intelligence and Software Engineering Pub Date : 2010-12-30 DOI: 10.1109/CISE.2010.5677218
D. Selvaraj, R. Dhanasekaran
{"title":"Segmenting Internal Brain Nuclei in MRI Brain Image Using Morphological Operators","authors":"D. Selvaraj, R. Dhanasekaran","doi":"10.1109/CISE.2010.5677218","DOIUrl":"https://doi.org/10.1109/CISE.2010.5677218","url":null,"abstract":"We present a new technique for segmenting brain nuclei from MRI brain images. Our method performs the segmentation using a combination approach of thresholding with morphological operators. The MRI brain image contains skull and noisy background. The latter have to be removed for further analysis. Elimination of any obstacles and noise from the image is the primary function of the morphological operators. We use simple morphological operators like dilation, erosion, opening and closing to the binarized MRI brain image. The results of skull stripped MR image with the use of disk shaped structuring elements are presented in the paper. The proposed method has been applied to a large number of MR images showing promising results for various image qualities, encouraging for future.","PeriodicalId":232832,"journal":{"name":"2010 International Conference on Computational Intelligence and Software Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124504771","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
A Contour-Based Method on Image Retrieval 一种基于轮廓的图像检索方法
2010 International Conference on Computational Intelligence and Software Engineering Pub Date : 2010-12-30 DOI: 10.1109/CISE.2010.5677223
Minqing Zhang, Xiaonan Chen, Xiaoyuan Yang, Juanli Sun
{"title":"A Contour-Based Method on Image Retrieval","authors":"Minqing Zhang, Xiaonan Chen, Xiaoyuan Yang, Juanli Sun","doi":"10.1109/CISE.2010.5677223","DOIUrl":"https://doi.org/10.1109/CISE.2010.5677223","url":null,"abstract":"Compared to color and texture, contour is closer to human vision. So contour-based image retrieval has been a hot topic. However, existing methods can't obtain object contour effectively, which makes contour description and matching more difficult. To address these problems, this paper uses KPAC (Kernel-based Parametric Active Contour) to obtain the object contour, and proposes a novel method called LICS (Local Important Contour Sequence) for feature description and matching. Experimental results demonstrate that this approach achieves state-of-the-art performance in image retrieval.","PeriodicalId":232832,"journal":{"name":"2010 International Conference on Computational Intelligence and Software Engineering","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125929520","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}
引用次数: 1
An Experimental Study on Number of Support Vectors in N-bit Parity Problem n位奇偶校验问题中支持向量个数的实验研究
2010 International Conference on Computational Intelligence and Software Engineering Pub Date : 2010-12-30 DOI: 10.1109/CISE.2010.5677041
Xun Liang
{"title":"An Experimental Study on Number of Support Vectors in N-bit Parity Problem","authors":"Xun Liang","doi":"10.1109/CISE.2010.5677041","DOIUrl":"https://doi.org/10.1109/CISE.2010.5677041","url":null,"abstract":"Support vector machine (SV machine, SVM) is a genius invention with many merits, such as the non-existence of local minima, the largest separating margins of different clusters, as well as the solid theoretical foundation. However, it is also well-noted that SVMs are frequently with a large number of SVs. In this paper, we investigate the number of SVs in a benchmark problem, the parity problem experimentally. With a large variety of kernel functions, the exhaustive experiments using LibSVM discover that for the N-bit parity problems all 2N points are created as SVs. The study in this paper indicates that the SMO-based LibSVM training candidly incorporate every point in the parity problem. Since any two neighbored points in the N-bit parity problem are with the opposite signs, the SMO creates an SV each time in iterations for fast satisfying the Lagrangian conditions. As a corollary, the SMO-based SVM training is pretty much entangled into the local information and is therefore a greedy algorithm.","PeriodicalId":232832,"journal":{"name":"2010 International Conference on Computational Intelligence and Software Engineering","volume":"10 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125996365","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
A View about Cloud Data Security from Data Life Cycle 从数据生命周期看云数据安全
2010 International Conference on Computational Intelligence and Software Engineering Pub Date : 2010-12-30 DOI: 10.1109/CISE.2010.5676895
Xiaojun Yu, Q. Wen
{"title":"A View about Cloud Data Security from Data Life Cycle","authors":"Xiaojun Yu, Q. Wen","doi":"10.1109/CISE.2010.5676895","DOIUrl":"https://doi.org/10.1109/CISE.2010.5676895","url":null,"abstract":"Data security has become one of core problems of cloud computing. Many security solutions have been proposed, however, most of them only focus one stage of data life cycle, such as storage stage, which is not enough to solve cloud data security problem as threats exist in whole data life cycle. In this paper, we argue that the cloud data security problem should be solved form data life cycle. After detail analysis of data life cycle model and data security threats, a suggested design process of data security solution is given. The proposed idea is simple but important to create the complete security solution to cloud data security.","PeriodicalId":232832,"journal":{"name":"2010 International Conference on Computational Intelligence and Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128692545","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}
引用次数: 78
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信