To the demand of product quality control among enterprises, based on holons theory, the product quality control holonic structure is constructed by research to the similarity characteristic of inter-enterprise quality control function. In the structure, the quality control holons that has autonomy and cooperation ability are established, and by the analysis of holon cooperation operation, by means of the definition and description the cooperation relations among holons, the structure can complete complex cooperation in internal and external cooperation holons to improve the ability and efficiency of product quality control. By finite state Markov chains, the structure can dynamically describe cooperation relationship, and forecast the dynamic cooperation tendency to serve for quality decision.
{"title":"The Cooperation Method of Product Quality Control Based on Holonic Structure","authors":"Linghong Lai","doi":"10.1109/BIFE.2009.141","DOIUrl":"https://doi.org/10.1109/BIFE.2009.141","url":null,"abstract":"To the demand of product quality control among enterprises, based on holons theory, the product quality control holonic structure is constructed by research to the similarity characteristic of inter-enterprise quality control function. In the structure, the quality control holons that has autonomy and cooperation ability are established, and by the analysis of holon cooperation operation, by means of the definition and description the cooperation relations among holons, the structure can complete complex cooperation in internal and external cooperation holons to improve the ability and efficiency of product quality control. By finite state Markov chains, the structure can dynamically describe cooperation relationship, and forecast the dynamic cooperation tendency to serve for quality decision.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125272697","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 has brought about a novel method based on multi-view algorithms for learning from positive and unlabeled examples (LPU). First we, with an improved 1-DNF method, split the text feature into a positive feature set (PF) and a negative feature set (NF). And we project each text vector on the two feature sets in turn. Then we use the co-EM SVM algorithm, which was previously used for semi-supervised learning. Finally, we select the better classifier for the result. Comprehensive evaluation has been performed on the Reuers-21578 collection which shows that our method is efficient and effective.
{"title":"Co-EM Support Vector Machine Based Text Classification from Positive and Unlabeled Examples","authors":"Bang-zuo Zhang, W. Zuo","doi":"10.1109/ICINIS.2008.29","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.29","url":null,"abstract":"This paper has brought about a novel method based on multi-view algorithms for learning from positive and unlabeled examples (LPU). First we, with an improved 1-DNF method, split the text feature into a positive feature set (PF) and a negative feature set (NF). And we project each text vector on the two feature sets in turn. Then we use the co-EM SVM algorithm, which was previously used for semi-supervised learning. Finally, we select the better classifier for the result. Comprehensive evaluation has been performed on the Reuers-21578 collection which shows that our method is efficient and effective.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117163467","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}
A novel method to detect small target embedded in sea clutter is presented for high frequency (HF) radar. The method is rooted in different characters between instantaneous radial velocity of sea current and moving target, and relies on the neural network for its implementation. By estimating the instantaneous velocity of sea current and target, we find that a spatial nonlinear model rather than deterministic chaos model is more appropriate to describe the relationship among radial velocities of neighbor sea areas. Then we built a neural network model to approach to a predictor for sea clutter. So an incoming target will be detected for its more predicted error than a certain threshold. The method performs well on ocean echo data acquired by the HF radar system OSMAR2003.
{"title":"Target Detection Based on Sea Clutter Model Using Neural Network","authors":"Qing Liu, Songhua Yan, Wanling Wang","doi":"10.1109/ICINIS.2008.168","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.168","url":null,"abstract":"A novel method to detect small target embedded in sea clutter is presented for high frequency (HF) radar. The method is rooted in different characters between instantaneous radial velocity of sea current and moving target, and relies on the neural network for its implementation. By estimating the instantaneous velocity of sea current and target, we find that a spatial nonlinear model rather than deterministic chaos model is more appropriate to describe the relationship among radial velocities of neighbor sea areas. Then we built a neural network model to approach to a predictor for sea clutter. So an incoming target will be detected for its more predicted error than a certain threshold. The method performs well on ocean echo data acquired by the HF radar system OSMAR2003.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117197258","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}
Biao Cai, Zhishu Li, Die Fu, Jian Hu, Peng Ou, Qing Li
The particle swarm optimization (PSO) is an algorithm to find out optimal solution in search space by interactions of individuals among particle population. Even though the hierarchical PSO (HPSO) algorithm, which is consisted of fast position convergence particle swarm optimization (fPSO) layer and mutation layer, has been shown to perform well,but the analysis of convergent condition of fPSO hasn't been given by the authors. In this paper, the convergent sufficient condition of fPSO in is derived mathematically, and a HPSO like mutated fPSO (mfPSO) is constructed too. Results of experiments show that the introduced mfPSO performed superiority to HPSO on benchmarks.
{"title":"Mutated Fast Convergent Particle Swarm Optimization and Convergence Analysis","authors":"Biao Cai, Zhishu Li, Die Fu, Jian Hu, Peng Ou, Qing Li","doi":"10.1109/ICINIS.2008.13","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.13","url":null,"abstract":"The particle swarm optimization (PSO) is an algorithm to find out optimal solution in search space by interactions of individuals among particle population. Even though the hierarchical PSO (HPSO) algorithm, which is consisted of fast position convergence particle swarm optimization (fPSO) layer and mutation layer, has been shown to perform well,but the analysis of convergent condition of fPSO hasn't been given by the authors. In this paper, the convergent sufficient condition of fPSO in is derived mathematically, and a HPSO like mutated fPSO (mfPSO) is constructed too. Results of experiments show that the introduced mfPSO performed superiority to HPSO on benchmarks.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125299064","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}
Network virtualization provides the feasibility of running multiple architectures on a shared physical infrastructure. Within a virtual network, customized routing protocol can be implemented and deployed in the programmable router. This paper presents the design and evaluation of a service prototype over a virtual network, which provides bandwidth guaranteed multi-path routing with a bandwidth allocation algorithm. The basic idea of our design is that certain route computation could be provided as a service, and not be integrated as a part of the infrastructure. The service chiefly consists of a bandwidth guaranteed multi-path routing mechanism and a bandwidth allocation algorithm. Our simulation experiments show a massive increase in throughput with low loss tolerance and resource utilization compared with the conventional routing protocol OSPF.
{"title":"Bandwidth Guaranteed Multi-Path Routing as a Service over a Virtual Network","authors":"Yongtao Wei, Jinkuan Wang, Cuirong Wang","doi":"10.1109/ICINIS.2008.90","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.90","url":null,"abstract":"Network virtualization provides the feasibility of running multiple architectures on a shared physical infrastructure. Within a virtual network, customized routing protocol can be implemented and deployed in the programmable router. This paper presents the design and evaluation of a service prototype over a virtual network, which provides bandwidth guaranteed multi-path routing with a bandwidth allocation algorithm. The basic idea of our design is that certain route computation could be provided as a service, and not be integrated as a part of the infrastructure. The service chiefly consists of a bandwidth guaranteed multi-path routing mechanism and a bandwidth allocation algorithm. Our simulation experiments show a massive increase in throughput with low loss tolerance and resource utilization compared with the conventional routing protocol OSPF.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125430675","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}
Evolvable hardware (EHW) is a novel technique to design circuits automatically. One of the main difficulties of EHW applying real-world applications is its scalability. This paper focuses on decreasing computation complexity to improve the scalability of combinational logic circuit evolutionary design and proposes a novel mutation strategy - SLP-mutation (short link priority mutation). The mutation operator encourages short link and multi-layer, which meets the structure characteristic of relatively complex circuit. Evolution strategy introducing SLP-mutation (SLP-mutation ES) reduces search space of the evolution design and the computation complexity. Experimental results demonstrate the validity of SLP-mutation ES.
可进化硬件是一种自动设计电路的新技术。EHW应用于实际应用的主要困难之一是其可扩展性。本文着眼于降低计算复杂度以提高组合逻辑电路进化设计的可扩展性，提出了一种新的突变策略——短链路优先级突变(SLP-mutation, short - link priority mutation)。突变算子鼓励短链路和多层，满足了相对复杂电路的结构特点。引入slp -突变的进化策略(SLP-mutation ES)减少了进化设计的搜索空间和计算复杂度。实验结果证明了slp突变ES的有效性。
{"title":"A Novel Mutation Strategy to Accelerate Evolutionary Design of Circuits","authors":"Yong Lin","doi":"10.1109/ICINIS.2008.125","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.125","url":null,"abstract":"Evolvable hardware (EHW) is a novel technique to design circuits automatically. One of the main difficulties of EHW applying real-world applications is its scalability. This paper focuses on decreasing computation complexity to improve the scalability of combinational logic circuit evolutionary design and proposes a novel mutation strategy - SLP-mutation (short link priority mutation). The mutation operator encourages short link and multi-layer, which meets the structure characteristic of relatively complex circuit. Evolution strategy introducing SLP-mutation (SLP-mutation ES) reduces search space of the evolution design and the computation complexity. Experimental results demonstrate the validity of SLP-mutation ES.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"354 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116464287","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 probabilistic neural network (PNN) model plays a very important role for ship detection in synthetic aperture radar (SAR) imagery, however there are still some detection parameter need to improve for the requirement of detection accuracy and speed. This paper presents a new method based on combinatorial PNN model for ship detection in SAR imagery. The method includes 8-bit and 16-bit image processing models, and an improved probabilistic neural network model is proposed, a new constant false alarm rate (CFAR) calculation algorithms is adopted. Compared with convention PNN-based ship detection method, the new method based on combinatorial PNN model performs well.
{"title":"A New Method for Ship Detection in SAR Imagery Based on Combinatorial PNN Model","authors":"Zhenhong Du, Ren-yi Liu, Nan Liu, Peng Chen","doi":"10.1109/ICINIS.2008.176","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.176","url":null,"abstract":"The probabilistic neural network (PNN) model plays a very important role for ship detection in synthetic aperture radar (SAR) imagery, however there are still some detection parameter need to improve for the requirement of detection accuracy and speed. This paper presents a new method based on combinatorial PNN model for ship detection in SAR imagery. The method includes 8-bit and 16-bit image processing models, and an improved probabilistic neural network model is proposed, a new constant false alarm rate (CFAR) calculation algorithms is adopted. Compared with convention PNN-based ship detection method, the new method based on combinatorial PNN model performs well.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122953417","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}
To enable accessing deep web information at semantic level, this paper develops a semantic query rewriting mechanism on heterogeneous database enabled web information system with complex ontology mapping technology. It discusses the procedure of converting database schema and instances to ontologies at first, and then the patterns of complex ontology mappings, and the ontology-based query planning in Mediator-Wrapper based environment with GAV style querying request. The relational algebra rewriting is discussed in detail.
{"title":"Semantic Query for Integrated Heterogeneous Database Systems","authors":"Ping Liang, Yunsheng Liu, Shu-qin Liang, Heping Chen","doi":"10.1109/ICINIS.2008.166","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.166","url":null,"abstract":"To enable accessing deep web information at semantic level, this paper develops a semantic query rewriting mechanism on heterogeneous database enabled web information system with complex ontology mapping technology. It discusses the procedure of converting database schema and instances to ontologies at first, and then the patterns of complex ontology mappings, and the ontology-based query planning in Mediator-Wrapper based environment with GAV style querying request. The relational algebra rewriting is discussed in detail.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117073057","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 proposes an approach for automated composition of Web services using the And/Or graph and designs a corresponding layered architecture. The composition approach which decomposes tasks into smaller And, Or subtasks in And/Or graph bases on the similarity algorithm to find out optimized solution graph. Additionally, we embed the sequence-and node to support the transition from the And/Or solution graph to executable workflow, and interface node to provide user preferences and correctness inspection during the composition execution. The architecture corresponding to the composition approach above consists of four layers including the knowledge ontology, task template, mediator, and Web service from up to bottom in the order. A motivation example throughout this paper provides a preliminary experimental illustration which clearly shows the benefits of our approach.
{"title":"Efficient Service Composition Architecture Using AND/OR Graph","authors":"Hui-tong Jia, Xin Wang","doi":"10.1109/ICINIS.2008.92","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.92","url":null,"abstract":"This paper proposes an approach for automated composition of Web services using the And/Or graph and designs a corresponding layered architecture. The composition approach which decomposes tasks into smaller And, Or subtasks in And/Or graph bases on the similarity algorithm to find out optimized solution graph. Additionally, we embed the sequence-and node to support the transition from the And/Or solution graph to executable workflow, and interface node to provide user preferences and correctness inspection during the composition execution. The architecture corresponding to the composition approach above consists of four layers including the knowledge ontology, task template, mediator, and Web service from up to bottom in the order. A motivation example throughout this paper provides a preliminary experimental illustration which clearly shows the benefits of our approach.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129614795","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}
VCN was a novel broad concept of numbers that created by YE Qiu-Sun in 1995. FCN is only some special circumstances of the VCN. Todays, in International Mathematics and Computer Science, the basic reasons of puzzled realm in which numbers have been deeply studied and developed at a standstill are, all researches on numbers only confined to a same computation rule of the FCN, we call it FCR. But the computation rule of the VCN may be artificially designed in a great difference & intelligence very much, we call it VCR. This paper points out that, the application of VCN for n-figures is wider than that of FCN for n-figures, and it gives out three applied examples of practice.
{"title":"Research & Application of AI-Fuzzy VCN","authors":"Ye Qiu-sun, Zhang Ting-fang","doi":"10.1109/ICINIS.2008.28","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.28","url":null,"abstract":"VCN was a novel broad concept of numbers that created by YE Qiu-Sun in 1995. FCN is only some special circumstances of the VCN. Todays, in International Mathematics and Computer Science, the basic reasons of puzzled realm in which numbers have been deeply studied and developed at a standstill are, all researches on numbers only confined to a same computation rule of the FCN, we call it FCR. But the computation rule of the VCN may be artificially designed in a great difference & intelligence very much, we call it VCR. This paper points out that, the application of VCN for n-figures is wider than that of FCN for n-figures, and it gives out three applied examples of practice.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128243915","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
扫码关注我们
求助内容：
应助结果提醒方式：