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

2010 International Conference on Computational Intelligence and Security最新文献

筛选
英文 中文
A BCH Code with the Distance 11 for Sensornets 距离为11的传感器BCH代码
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.152
Gaochang Zhao, Xiaolin Yang
{"title":"A BCH Code with the Distance 11 for Sensornets","authors":"Gaochang Zhao, Xiaolin Yang","doi":"10.1109/CIS.2010.152","DOIUrl":"https://doi.org/10.1109/CIS.2010.152","url":null,"abstract":"Many application scenarios have been revealed with Sensornets. An Error Correcting Code (ECC) will be advantageous to communications in these applications. With the different expecting on efficiency, security, usability, etc, different codes have been constructed for various purposes. The methods based on algebra theory can work well for constructing simple and usability codes. The theory of algebraic geometry can help construct more complex codes with different properties. With the applications of these codes, it is convenient to arrive the purpose in digital communications.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123046066","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
Neural Network Method for Solving Linear Fractional Programming 求解线性分式规划的神经网络方法
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.15
Li Xiao
{"title":"Neural Network Method for Solving Linear Fractional Programming","authors":"Li Xiao","doi":"10.1109/CIS.2010.15","DOIUrl":"https://doi.org/10.1109/CIS.2010.15","url":null,"abstract":"This paper presents a neural network method for solving a class of linear fractional optimization problems with linear equality constraints. The proposed neural network model have the following two properties. First, it is demonstrated that the set of optima to the problems coincides with the set of equilibria of the neural network models which means the proposed model is complete. Second, it is also shown that the model globally converges to an exact optimal solution for any starting point from the feasible region.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132418320","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
Industrial Clusters Evolution Research Based on the SGA 基于SGA的产业集群演化研究
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.33
Ya-juan Yang, Pingan Wang, Wenxue Niu
{"title":"Industrial Clusters Evolution Research Based on the SGA","authors":"Ya-juan Yang, Pingan Wang, Wenxue Niu","doi":"10.1109/CIS.2010.33","DOIUrl":"https://doi.org/10.1109/CIS.2010.33","url":null,"abstract":"From the evolution view point, the evolving rules of industry clusterings are investigated by multi-agent system modeling method and the genetic algorithms is employed as the learning algorithm of an agent. Firstly, industrial clusterings is formed as a conceptual model which is a virtual multi-agent system, Secondly, the basic genetic algorithm is established for identifying an agent's intelligent learning, Thirdly, simulation results are carried out based on Matlab2007b for the evolving of this multi-agent system, Finally, the research results feedbacks the industrial clusterings: analysis made for the evolution rules of the industry clusters being brought on the interactions of individual agent. The study in this paper shows that the evolution of industrial clusters comes from the complex interaction of agents so as to adapt the environment. Driver for the evolution of industrial clusters is the leading action of initiative enterprize. It is the case that the innovations of these enterprisers drives the whole industry going forward as well as the other members of industry clusterings.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130886330","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
Improved Electromagnetism-Like Mechanism Algorithm for Constrained Optimization Problem 约束优化问题的改进类电磁机构算法
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.42
Yun Shang, Jing Chen, Qun Wang
{"title":"Improved Electromagnetism-Like Mechanism Algorithm for Constrained Optimization Problem","authors":"Yun Shang, Jing Chen, Qun Wang","doi":"10.1109/CIS.2010.42","DOIUrl":"https://doi.org/10.1109/CIS.2010.42","url":null,"abstract":"To move the sample points towards the optimality according to an attraction-repulsion mechanism, an improved heuristic is proposed. Firstly, the constrained optimization problem is transformed into an unconstrained optimization problem by external point method. Secondly, the formula of the particle charge is re-defined to decrease the amount of calculation and improve the efficiency. Then the formula of the total force vector is also improved in order to reduce the amount of computation and computer overflow. Finally, the improved EM Algorithm is proposed. The numerical results demonstrate that the proposed algorithm is efficient and robust.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129695574","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 Volume Rendering Algorithm of Data Field 一种新的数据域体绘制算法
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.62
Xiaofeng Feng, Xiong Shi, Jun Chen
{"title":"A New Volume Rendering Algorithm of Data Field","authors":"Xiaofeng Feng, Xiong Shi, Jun Chen","doi":"10.1109/CIS.2010.62","DOIUrl":"https://doi.org/10.1109/CIS.2010.62","url":null,"abstract":"Through constructing an average opacity buffer with the same size of opacity buffer, the visibility of data cell could be estimated by the value of gravity center of this data cell in average opacity buffer. That could make the data cell which completely located in the average opacity buffer cut during the process of volume rendering in object space sequenced irregular data field and could dramatically reduce the data volume and accelerate the rendering process.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129985407","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 Scenario-Based Architecture for Reliability Design of Artificial Intelligent Software 基于场景的人工智能软件可靠性设计体系结构
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.9
Juguo Wang, Guoqi Li, Y. Pu
{"title":"A Scenario-Based Architecture for Reliability Design of Artificial Intelligent Software","authors":"Juguo Wang, Guoqi Li, Y. Pu","doi":"10.1109/CIS.2010.9","DOIUrl":"https://doi.org/10.1109/CIS.2010.9","url":null,"abstract":"Artificial Intelligent is well invested both in industry and academic fields. However, the software reliability design for the applications is a big challenge. In this paper, we present a scenario-based architecture for reliability design of artificial intelligent Software. Scenarios are divided into environmental scenarios and structured scenarios. Both of the two kinds of scenarios are considered in the framework. The quantitative reliability of the software based on the framework could be evaluated and predicted.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"324 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132977871","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
Design Verification of BJUT Library Management System with PVS 基于PVS的北京工业大学图书馆管理系统设计验证
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.142
Jingang Niu, Shenghui Su
{"title":"Design Verification of BJUT Library Management System with PVS","authors":"Jingang Niu, Shenghui Su","doi":"10.1109/CIS.2010.142","DOIUrl":"https://doi.org/10.1109/CIS.2010.142","url":null,"abstract":"Formal methods are effective in improving the safety and reliability during the development of software. PVS (Prototype Verification System) provides an integrated environment for development and analysis of formal specifications. It consists of a higher order logical specification language integrated with support tools and a powerful theorem prover. In this paper, we specify and verify the design of the library management system of Beijing University of Technology (BJUT) using PVS. Firstly, we describe the requirements of the system and give its Entity Relationship (E-R) model, then design the formal specification of the E-R model and database operations based on the requirement analysis. Some properties essential to the correctness of the system are also given as axioms. Finally, we verify the design by proving some critical properties according to the specifications. In addition, some experiences and skills in using PVS are also described.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132533541","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
A Novel GEP-Based Multiple-Layers Association Rule Mining Algorithm 一种新的基于gep的多层关联规则挖掘算法
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.22
Hong-guo Cai, Chang-an Yuan, Jin-Guang Luo, Jin-de Huang
{"title":"A Novel GEP-Based Multiple-Layers Association Rule Mining Algorithm","authors":"Hong-guo Cai, Chang-an Yuan, Jin-Guang Luo, Jin-de Huang","doi":"10.1109/CIS.2010.22","DOIUrl":"https://doi.org/10.1109/CIS.2010.22","url":null,"abstract":"To mine popular accessed Web pages items and find out their association rule from the Web server Log database for junior users providing recommendation service. A novel GEP-based algorithm for mining multiple-layers association rules was presented. Firstly, takes generalizing technology as a way to value fitness function in GEP (Gene Expression Programming). Then, relying on the significant self-search function of GEP, the most optional species was evolved. The frequent items and association rules in the next deeper layers can be mined by using traditional support-confidence method in sub-database. The algorithm improves on the frame of traditional association rule mining and uses a new evolutionary algorithm for mining association rules. Finally, the validity and efficiency of the method are presented by the application in the paper.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130755481","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}
引用次数: 3
IMP-Filters of R0-Algebras r0 -代数的imp -过滤器
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.158
Yong-lin Liu, Mei-ying Ren
{"title":"IMP-Filters of R0-Algebras","authors":"Yong-lin Liu, Mei-ying Ren","doi":"10.1109/CIS.2010.158","DOIUrl":"https://doi.org/10.1109/CIS.2010.158","url":null,"abstract":"The notion of implication $MP$-filters (briefly, $IMP$-filters) in $R_0$-algebras is introduced. The characteristic properties and extension property of $IMP$-filters are obtained. The relations among $IMP$-filters, $PIMP$-filters and $NMP$-filters of $R_0$-algebras are established. Finally, the implicative $R_0$-algebra is completely described by its $IMP$-filters.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133784534","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 New Kind of Handling Constraint Method for Optimization 一种新的优化处理约束方法
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.30
Jiechang Wen, Xue-fei Yao
{"title":"A New Kind of Handling Constraint Method for Optimization","authors":"Jiechang Wen, Xue-fei Yao","doi":"10.1109/CIS.2010.30","DOIUrl":"https://doi.org/10.1109/CIS.2010.30","url":null,"abstract":"This paper proposes a new kind of constraint handling method for optimization. In the proposed method, a transformation of constraint functions to be another objective function will be discussed in details. With this technique we can transform the constraint problem to be unconstraint multiobjective optimization and use the multi-objective optimization methods to find feasible solutions. The performance of the algorithm is tested on 13 benchmark functions in the literature. The results show that we can find very good solutions by this approach.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"8 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114131656","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
首页 上一页
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学术官方微信