{"title":"Knowledge Elicitation and Acquisition for Simulation Validation","authors":"Jun-Tao Wang, Feiyan Min","doi":"10.1109/CIS.WORKSHOPS.2007.100","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.100","url":null,"abstract":"The validation of simulation relies heavily on the opinions of domain experts, and it makes the validation task exhaustive and time-consuming. The knowledge-based methods can be applied for these problems. One of the main issues around this method is the elicitation and acquisition of the knowledge. Our knowledge elicitation approach falls in three phases, namely, position, description and discussion phase. Within each phase, the available acquisition techniques are introduced.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124046555","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}
{"title":"An Algorithm for Classifying Incomplete Data with Selective Bayes Classifiers","authors":"Jingnian Chen, Xiaoping Xue, Fengzhan Tian, Houkuan Huang","doi":"10.1109/CIS.WORKSHOPS.2007.160","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.160","url":null,"abstract":"Actual data sets are often incomplete because of various kinds of reason. Although many algorithms for classification have been proposed, most of them deal with complete data. So methods of constructing classifiers for incomplete data deserve more attention. By analyzing main methods of processing incomplete data for classification, this paper presents a selective Bayes classifier for classifying incomplete data. The proposed algorithm needs no assumption about data sets that are necessary for previous methods of processing incomplete data. Experiments on twelve benchmark incomplete data sets show that this algorithm can greatly improve the accuracy of classification. Furthermore, it can also sharply reduce the number of attributes and so can greatly simplify the data sets and classifiers.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128593526","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}
{"title":"Research on the Problem of Contact Characteristic Finite Strip and Its Characteristic Agent","authors":"Guo-chang Li, De-bin Zhang, Chun-e Zhang, Cai Liu","doi":"10.1109/CIS.WORKSHOPS.2007.153","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.153","url":null,"abstract":"The deformation mechanism of cold-formed steel is very complex, the relation between the deforming forces exerted and the deformation of steel strap can not be described by simple function. In order to reduce data redundancy, adopt the characteristic finite strip method which can solve primary illogicality. The characteristic finite strip can be divided into 3 kinds, thereinto, \"the characteristic finite strip contacted with roller\" can parse the effect roller energy to steel strap deform and the influence steel strap and roller friction to deformation. So, research on this kind of finite strip looks very important. Making this kind of characteristic of finite strip has informatization and intelligentize have instructed effect to the intelligence of pass design. Adopt characteristic Agent is the relative good method of making the characteristic finite strip has intelligence.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129049413","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}
{"title":"A New Multi-objective Fully-Informed Particle Swarm Algorithm for Flexible Job-Shop Scheduling Problems","authors":"Zhao Jia, Hua-ping Chen, Jun Tang","doi":"10.1109/CISW.2007.4425477","DOIUrl":"https://doi.org/10.1109/CISW.2007.4425477","url":null,"abstract":"A novel Pareto-based multi-objective fully-informed particle swarm algorithm (FIPS) is proposed to solve flexible job-shop problems in this paper. Firstly, the population is ranked based on Pareto optimal concept. And the neighborhood topology used in FIPS is based on the Pareto rank. Secondly, the crowding distance of individuals is computed in the same Pareto level for the secondary rank. Thirdly, addressing the problem of trapping into the local optimal, the mutation operators based on the coding mechanism are introduced into our algorithm. Finally, the performance of the proposed algorithm is demonstrated by applying it to several benchmark instances and comparing the experimental results.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116752348","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}
{"title":"Towards Improving Ant-Based Clustering - An Chaotic Ant Clustering Algorithm","authors":"X. Huang, Yixian Yang, Xinxin Niu","doi":"10.1109/CIS.WORKSHOPS.2007.90","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.90","url":null,"abstract":"Ant-based clustering as a nature-inspired heuristic algorithm has been applied in a data-mining context to perform both clustering and topographic mapping. It is derived from a basic model of behavior observed in real ant colonies. Early works demonstrated some promising characteristics of the ant-based clustering, but they did not extend to improve its performance, stability, convergence, and other key features. In this paper, we describe an improved version, called CACAS, adopting an important strategy of using chaotic perturbation to improve individual quality and utilized chaos perturbation to avoid the search being trapped in local optimum. We compare its performance with the K-means approach and ant-based clustering by evaluation functions and topographic mapping using a set of analytical data. Our results demonstrate CACAS is a robust and viable approach.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114847797","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}
{"title":"A Protecting Protocol of Mobile Agent Integrity","authors":"Huanmei Guan, Huanguo Zhang, Ping Chen, Yajie Zhou","doi":"10.1109/CIS.WORKSHOPS.2007.51","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.51","url":null,"abstract":"The integrity of mobile agent means that its state and partial results can not be modified by a malicious host or such modifications could be found. The paper proposes an integrity protocol. It provides strong identity authentication and strong integrity protection. It can detect most attacks.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125384502","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}
{"title":"A Novel Method for Solving Fuzzy Programming Based on Hybrid Particle Swarm Optimization","authors":"Zhenkui Pei, Shengfeng Tian, Houkuan Huang","doi":"10.1109/CIS.WORKSHOPS.2007.135","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.135","url":null,"abstract":"Fuzzy programming offers a powerful means of handling optimization problems with fuzzy parameters. Fuzzy programming has been used in different ways in the past. The particle swarm optimization (PSO) has been applied successfully to continuous nonlinear constrained optimization problems, neural network, etc. But we have not been found to use PSO for fuzzy programming in literature. In this paper, we combined with fuzzy simulation, neural network and PSO to produce a hybrid intelligent algorithm. Based on this hybrid intelligent algorithm, we introduced for solving fuzzy expected value models. Some numerical examples are given to illustrate the algorithm is effective and powerful.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125588216","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}
{"title":"An Active Data Integration Model Based on P2P Routing Service","authors":"Wuling Ren, Ping Han, Pan Zhou","doi":"10.1109/CIS.WORKSHOPS.2007.39","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.39","url":null,"abstract":"To provide more efficient and active data integration service in network manufacturing environment for cooperated enterprises, a 5-layered active data integration model was proposed. Core of the model are layer 2, 3 and 4, which separately defines the description of data resources, data routing service and active data exchange service. Data router which provides data routing service uses P2P technique to locate application nodes which possess resources required and select the optimal path to download the resources among original resource provider and the nodes having the designated resources. The data pump that provides active data exchange service uses XML-based and remote controlled data exchange technique to perform data syntax analysis and semantic check, and then draws data from local applications or loads data into the applications with data exchange specifications. With this model, the shared data resources may have more adaptability and activeness, resource transmission delay will be shortened, and the effect of data integration will be enhanced.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126165154","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}
{"title":"A Dynamic Pricing Model for Postponement Supply Chain: The Bi-level Programming Approach","authors":"Shou-Ping Gui, Niu Baozhuang","doi":"10.1109/CIS.WORKSHOPS.2007.47","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.47","url":null,"abstract":"The paper proposes a dynamic pricing model based on bi-level programming approach: firstly, we establish a two-stage distributed control model for postponement supply chain, which is the basis of the pricing model. Then, according to the pricing mechanism, we find that there is Stackelberg game feature in the process. Aimed at the feature, we propose a dynamic bi-level programming model, taking the centered warehousing & manufacturing point (CWMP) as the leader, and hence, the model is calculated and verified using the investigation data. We take chaos coverage hunting algorithm to solve the model, based on its features. Research shows: the dynamic pricing model is helpful to obtain the maximum profit of the whole supply chain, which is under the assumption of a two-stage distributed control system; we obtain steady equilibrium prices (EP), which verify the efficiency of the decision-making model. The pricing model is proved to be useful to give reasonable prices of goods traded on postponement supply chain, and it is also an effective decision-making tool of supply chain coordination.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125866447","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}
{"title":"Selection on Wavelet Base for the Detection of Ship Pitching Movement Disturbances","authors":"Sun Li-hong, Shen Ji-hong","doi":"10.1109/CIS.WORKSHOPS.2007.169","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.169","url":null,"abstract":"Wavelet analysis is becoming a useful tool because it allows the decomposition of data functions into different frequency or scale components. Accordingly wavelet transforms are to be suited to analyze short-timed high-frequency phenomena. The remarkable ability of wavelets to highlight the singularities associated with shocks present in the ship pitch field is explored. In the detection of ship pitch disturbance, It was observed in the singularity signal the sharp points were located at the position responding to the end or the start of disturbances. Singularity theory of detecting signal based on wavelet transform was applied to the local detection of these sharp points, the mother wavelet option method is studied .Simulations verify the detecting validity and accuracy of the selected mother wavelet.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126596589","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}