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

2011 Fourth International Symposium on Computational Intelligence and Design最新文献

筛选
英文 中文
A Simple and Heuristic Model of Tag Recommendation 一个简单的启发式标签推荐模型
2011 Fourth International Symposium on Computational Intelligence and Design Pub Date : 2011-10-28 DOI: 10.1109/ISCID.2011.142
Dihua Xu, Zhijian Wang, Liping He, Weidong Huang
{"title":"A Simple and Heuristic Model of Tag Recommendation","authors":"Dihua Xu, Zhijian Wang, Liping He, Weidong Huang","doi":"10.1109/ISCID.2011.142","DOIUrl":"https://doi.org/10.1109/ISCID.2011.142","url":null,"abstract":"Compared to the high computational complexity of many tag recommenders, a simple and heuristic approach of tag recommendation is proposed, based on tag user and item tag co-occurrences in parallel. Firstly, we use aspect model PLSA to set up a probabilistic model. We find that the probability of the recommended tags to an item for a specific user is determined by two factors: the preferences in choosing tags for the user and the tags reflecting the feature of the item. Then we immerge the two factors into a unified representation. The experiments show that our approach not only has better reliability and precision, but also is very simple and more practical than other algorithms.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"3 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130081846","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
Three Dimensional DNA Self-Assembly Model for the Minimum Vertex Cover Problem 最小顶点覆盖问题的三维DNA自组装模型
2011 Fourth International Symposium on Computational Intelligence and Design Pub Date : 2011-10-28 DOI: 10.1109/ISCID.2011.94
Xuncai Zhang, Wenjun Song, Ruili Fan, Guangzhao Cui
{"title":"Three Dimensional DNA Self-Assembly Model for the Minimum Vertex Cover Problem","authors":"Xuncai Zhang, Wenjun Song, Ruili Fan, Guangzhao Cui","doi":"10.1109/ISCID.2011.94","DOIUrl":"https://doi.org/10.1109/ISCID.2011.94","url":null,"abstract":"DNA self-assembly technology has brought novel inspiration to the development of DNA computing. Diversified computational models based on DNA self-assembly have been used to solve various NP problems. In this paper, a three-dimensional (3D) DNA self-assembly model is presented to solve the minimum vertex cover problem. With the capacity of DNA molecules in massive parallel computation, the model can simulate a non-deterministic algorithm and solve the problem in polynomial time. Meanwhile, the computation space of the model is O(n3) and the number of distinct tiles is O(1).","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133864823","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
Research on Architecture of Collaborative Agreement Signing System 协同协议签署系统体系结构研究
2011 Fourth International Symposium on Computational Intelligence and Design Pub Date : 2011-10-28 DOI: 10.1109/ISCID.2011.79
Ning Qiu, Hexin Lv, Guoyong Dai
{"title":"Research on Architecture of Collaborative Agreement Signing System","authors":"Ning Qiu, Hexin Lv, Guoyong Dai","doi":"10.1109/ISCID.2011.79","DOIUrl":"https://doi.org/10.1109/ISCID.2011.79","url":null,"abstract":"Online agreement signing is an important part of the whole electronic employment process. According to the technology characteristics of service-oriented architecture (SOA) and the requirements of online agreement signing, this paper proposes an architecture design of SOA-based online collaborative agreement signing system. Comparing with traditional software architectures, this architecture has many advantages such as loose coupling, scalability and flexible combination of services. This paper also shows how the system interacts with other external systems or software, and describes web service model of the system in the last part.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133615210","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
The Analysis on Posture Control of Micro Quadrotor Based on PID 基于PID的微型四旋翼飞行器姿态控制分析
2011 Fourth International Symposium on Computational Intelligence and Design Pub Date : 2011-10-28 DOI: 10.1109/ISCID.2011.173
Shu Fang, Yan Xu, Jingxue Jiang, B. Hu, Xinggui Que
{"title":"The Analysis on Posture Control of Micro Quadrotor Based on PID","authors":"Shu Fang, Yan Xu, Jingxue Jiang, B. Hu, Xinggui Que","doi":"10.1109/ISCID.2011.173","DOIUrl":"https://doi.org/10.1109/ISCID.2011.173","url":null,"abstract":"The posture control of micro quadrotor is the key point in flying stability, in this paper, the structure of quadrotor is analyzed, and the kinetic equation has been deduced, a new proportional-integral-derivative controller (PID) control algorithm has been set up based on the velocity matrix, the parameters are simplified and divide to eight classification due to the value of the error. The simulation experiment has made, and experimental results demonstrate the practicability and effectiveness of the new PID algorithm.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127461777","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
A Modified Harmony Search for Multi-mode Resource Constrained Project Scheduling Problem 多模式资源约束项目调度问题的改进和谐搜索
2011 Fourth International Symposium on Computational Intelligence and Design Pub Date : 2011-10-28 DOI: 10.1109/ISCID.2011.54
Fang Fu, Chao Zhang
{"title":"A Modified Harmony Search for Multi-mode Resource Constrained Project Scheduling Problem","authors":"Fang Fu, Chao Zhang","doi":"10.1109/ISCID.2011.54","DOIUrl":"https://doi.org/10.1109/ISCID.2011.54","url":null,"abstract":"A harmony search is modified to optimize typical multi-mode resource constrained project scheduling problem, which aims to minimize the project make span. In order to inherit elitist solution and maintain population's diversity based on distance simultaneously, we add a selection operator when the harmony memory is initialized and modify the replacement operator. A new solution can be improvised by three options, i.e. usage of harmony memory, pitch adjusting and randomization. The first option is adjusted to select solutions from harmony memory based on average objective value, and the second is only to justify mode selection. Finally, the harmony search is compared with the genetic algorithm which has better performance. The numerical experiments based on benchmark test sets of 20 and 30 activities with three modes show that harmony search can obtain high-quality and robust solutions.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115464913","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
An Implementation Scheme of Electronic Aircraft Maintenance Card Based on Network 基于网络的电子飞机维修卡实现方案
2011 Fourth International Symposium on Computational Intelligence and Design Pub Date : 2011-10-28 DOI: 10.1109/ISCID.2011.19
Yigang Sun, Ze Liu, Qiang Li
{"title":"An Implementation Scheme of Electronic Aircraft Maintenance Card Based on Network","authors":"Yigang Sun, Ze Liu, Qiang Li","doi":"10.1109/ISCID.2011.19","DOIUrl":"https://doi.org/10.1109/ISCID.2011.19","url":null,"abstract":"Maintenance card is the key to aircraft maintenance. The article designs a network implementation scheme of electronic aircraft maintenance card according to the research of electronic maintenance card, presenting definite network topology and describing in great detail. At last, data synchronization, system security as well as access control is discussed and corresponding solutions are given. After experimental testing, the scheme has been tested to be quite feasible.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116401064","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 Novel Bi-level Programming Model for Capabilities-based Weapon System of Systems Planning 基于能力的武器系统系统规划新二层规划模型
2011 Fourth International Symposium on Computational Intelligence and Design Pub Date : 2011-10-28 DOI: 10.1109/ISCID.2011.74
B. Cheng, Xu Tan, Yuejin Tan, Yan-jing Lu, Peng Wang
{"title":"A Novel Bi-level Programming Model for Capabilities-based Weapon System of Systems Planning","authors":"B. Cheng, Xu Tan, Yuejin Tan, Yan-jing Lu, Peng Wang","doi":"10.1109/ISCID.2011.74","DOIUrl":"https://doi.org/10.1109/ISCID.2011.74","url":null,"abstract":"Capabilities-based weapon system of systems planning (CBWSoSP) problem is widely researched in defense domain nowadays. To solve this problem, a tri-level mission-capability-project analysis framework is proposed. This framework mainly focuses on relationship analyses, which are mission-capability relationship and capability-project relationship. Then a bi-level programming model is presented to solve CBWSoSP problem. In the upper layer of the model, the objectives are maximizing the possibilities of mission achievement with the amount of resources as decision vectors. In the lower layer, the maximization of capabilities is formulated as objective functions with resources allocation as decision vectors. A SPEA2-based algorithm is used to solve the model under some hypothesis. The difficulty of the model building in real world and future work are discussed finally.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123649982","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
Evaluation for Micro Surface Topography Based on Multi-fractal Spectrum 基于多重分形谱的微表面形貌评价
2011 Fourth International Symposium on Computational Intelligence and Design Pub Date : 2011-10-28 DOI: 10.1109/ISCID.2011.191
M. Chui, Youqian Feng, Wei Wang, P. Li, Xiaodong Xu
{"title":"Evaluation for Micro Surface Topography Based on Multi-fractal Spectrum","authors":"M. Chui, Youqian Feng, Wei Wang, P. Li, Xiaodong Xu","doi":"10.1109/ISCID.2011.191","DOIUrl":"https://doi.org/10.1109/ISCID.2011.191","url":null,"abstract":"Aiming at the deficiency of traditional method in evaluating micro surface topography, an evaluation method is advanced based on multi-fractal spectrum. In this method, the probability measure of the gray image of micro surface topography is counted in the improved box-counting method, and the multi-fractal spectrums are extracted by the Legendre transformation of scale exponent. Based on the multi-fractal spectrum, the spectrum width, height interval and asymmetry degree are extracted, and micro surface topography are evaluated according to the parameters. Evaluation experiments of surface topographies are carried out to prove the value of multi-fractal spectrums, and the result shows that multi-fractal spectrum can overcome the deficiency of traditional method, and surface topography can be evaluated accurately by its parameters.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122098755","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 Improved Contract Net Protocol Based on Concurrent Trading Mechanism 基于并发交易机制的改进合约网协议
2011 Fourth International Symposium on Computational Intelligence and Design Pub Date : 2011-10-28 DOI: 10.1109/ISCID.2011.182
Changyou Liu, Haiyan Wang
{"title":"An Improved Contract Net Protocol Based on Concurrent Trading Mechanism","authors":"Changyou Liu, Haiyan Wang","doi":"10.1109/ISCID.2011.182","DOIUrl":"https://doi.org/10.1109/ISCID.2011.182","url":null,"abstract":"This paper analyses the principle and problems of the classical contract net in the application, it is proposed that contract business extension contract nets based on the concurrent trading mechanism. This mechanism makes the task allocation realize quickly. It reduces network communication cost between the agents, improves the efficiency of multi-agent system collaboration and the overall system performance maximizly. Finally, the simulation of aircraft ground deicing verifies the effectiveness of the mechanism.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124074196","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 Family of Autoregressive Conditional Duration Model under Random Environment 随机环境下一类自回归条件持续时间模型
2011 Fourth International Symposium on Computational Intelligence and Design Pub Date : 2011-10-28 DOI: 10.1109/ISCID.2011.129
Junhong Miao, Yanying Wang
{"title":"A Family of Autoregressive Conditional Duration Model under Random Environment","authors":"Junhong Miao, Yanying Wang","doi":"10.1109/ISCID.2011.129","DOIUrl":"https://doi.org/10.1109/ISCID.2011.129","url":null,"abstract":"This article contains two novelties. First, we propose a new type of augmented ACD model under random environment. It turns out that flexible disturbance of the news impact function are necessary to appropriately model financial durations. The ACD model under random environment proposed in this paper seem to be a valuable alternative to existing approaches and have the best overall performance. Second, we give the transition probability of the process. Moreover by employing the transition probability, we give the probability properties of the ACD model under random environment, and give rigorous proofs of the probability properties.","PeriodicalId":224504,"journal":{"name":"2011 Fourth International Symposium on Computational Intelligence and Design","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124783073","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
首页 上一页 下一页 尾页
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学术官方微信