{"title":"The Operations and Properties of Reproducibility of the Empty Marking","authors":"Jianhong Ye, Shixin Sun, Wen Song, Lijie Wen","doi":"10.1109/CIS.2008.23","DOIUrl":"https://doi.org/10.1109/CIS.2008.23","url":null,"abstract":"Kurt Lautenbach presented sufficient and necessary conditions for reproducibility of the empty marking and proved that the empty marking is reproducible if and only if there is non-negative T-invariant, whose net representations have neither siphons nor traps, containing a positive entry for at least one fact and goal transition. This paper extends these results, we prove that composition, insertion, deletion and substitution do not influence reproducibility of the empty marking, and a net with reproducibility of the empty marking preserves the reproducibility in its backward net (N is a net, its backward net N-1 arises from N by reversing the direction of all arcs). We also show that the empty marking in acyclic P/T nets with a positive entry for at least one fact and goal transition is reproducible if and only if the net is covered by T-invariant.","PeriodicalId":255247,"journal":{"name":"2008 International Conference on Computational Intelligence and Security","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131794299","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 of Multi-Resource and Multi-Objective Emergency Scheduling Based on Fuzzy Ideal Point Method","authors":"Feihu Hu, Zefei Geng, Huimin Chen, Linyan Sun","doi":"10.1109/CIS.2008.60","DOIUrl":"https://doi.org/10.1109/CIS.2008.60","url":null,"abstract":"According to the characteristics of the multi-resource, multi-depot and multi-objective emergency scheduling problem, this paper establishes a multi-objective mathematical model with the goal of the shortest time and the smallest cost. We propose an algorithm for multi-objective fuzzy decision using the fuzzy ideal point method, which transforms the multi-objective decision into the single-objective programming question. This algorithm is applied in the provincial level emergency management information demonstration platform, and runs successfully.","PeriodicalId":255247,"journal":{"name":"2008 International Conference on Computational Intelligence and Security","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130901871","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 Local Watermarking Scheme in the Ridgelet Domain Combining Image Content and JND Model","authors":"Yan-li, Shengqian-Wang, Zhihua-Xie","doi":"10.1109/CIS.2008.12","DOIUrl":"https://doi.org/10.1109/CIS.2008.12","url":null,"abstract":"In this paper, a local watermarking scheme in the ridgelet domain combining image content and JND model is presented. Since the ridgelet transform (RT) can efficiently represent image with linear singularities and has directional sensitivity, the image is partitioned into small pieces. And these small pieces are classified into different characteristic categories (S1 with weak texture, S2 with strong texture). To improve the robustness of processing like noise or JPEG compressing attack, the lower and middle frequencies of RT subband are selected and the watermarking strength is adaptively determined by the JND values in RT domain. So it will ensure invisibilities of the watermarks. And eventually the watermarks are embedded in the most important energetic directions of the pieces with strong texture which are less sensitively to human¿s vision. Experimental results show that the proposed watermarked scheme is robust to noise, cut, JPEG compressing and other intensive attack.","PeriodicalId":255247,"journal":{"name":"2008 International Conference on Computational Intelligence and Security","volume":"443 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115938485","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}
R. Zhao, Yongqing Su, T. Knudsen, T. Bak, Wenzhong Shen
{"title":"Multi-Agent Model for Fatigue Control in Large Offshore Wind Farm","authors":"R. Zhao, Yongqing Su, T. Knudsen, T. Bak, Wenzhong Shen","doi":"10.1109/CIS.2008.131","DOIUrl":"https://doi.org/10.1109/CIS.2008.131","url":null,"abstract":"To control wind turbine fatigue and optimize the fatigue distribution for offshore wind farm, a control network model is proposed based on Multi-Agent theory. A typical model of large-scale offshore wind farm is described. Power fatigue of individual wind turbine is defined. In offshore wind farm, a fatigue distribution estimation approach is studied. The Multi-Agent network is modeled based on the current communication network. All wind turbines act as independent agents, and can self-organize into wind power delivery groups adaptively according to the real wind direction. A solution for automatic agent controller synthesis using Uppaal Tiga and Simulink is presented. The fatigue distribution can be optimized to prolong the service time of a wind farm. This approach can also save some of the maintenance cost due to the expensive logistic visit by helicopters. Finally, a typical simulation result illustrates the feasibility of this multi-agent model.","PeriodicalId":255247,"journal":{"name":"2008 International Conference on Computational Intelligence and Security","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124547026","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":"Learning through Decision Tree in Simulated Soccer Environment","authors":"F. Farahnakian, N. Mozayani","doi":"10.1109/CIS.2008.221","DOIUrl":"https://doi.org/10.1109/CIS.2008.221","url":null,"abstract":"The robotic soccer is one of the most complex multiagent systems in which agents play the role of soccer players. The characteristics of such systems are: realtime, noisy, collaborative and adversarial. Therefore, playing agents must be capable to making decisions. This paper describes the use of decision tree to kick and catch the ball for two simulated soccer agents. One player shoots towards the goal and the other plays the role of goalkeeper. Experimental results have shown that rules achieved from decision tree lead to more effective operations in simulated soccer agent.","PeriodicalId":255247,"journal":{"name":"2008 International Conference on Computational Intelligence and Security","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123564007","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":"Chattering-Free Support Vector Regression Sliding Mode Control","authors":"Linsheng Li, Jianning Li","doi":"10.1109/CIS.2008.99","DOIUrl":"https://doi.org/10.1109/CIS.2008.99","url":null,"abstract":"According to an uncertain discrete system with input saturation, a new chattering free support vector regression sliding mode control (SVR-SMC) law based on Linear Matrix Inequalities (LMIs) is presented. The output of SVR is used for replacing sign function of the reaching law in traditional sliding mode control (SMC). An equivalent matrix is constructed for input saturation condition in the scheme. The feasibility and effectiveness of the SVR-SMC scheme are demonstrated via numerical examples. As a result, compared with conventional SMC, the SVR-SMC is able to achieve the desire transient response with input saturation. And there is no chattering in steady state while unmatched parameter uncertainty exists.","PeriodicalId":255247,"journal":{"name":"2008 International Conference on Computational Intelligence and Security","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122087404","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":"Analysis, Specification and Modeling of Non-Functional Requirements for Translative Model-Driven Development","authors":"A. Fatwanto, C. Boughton","doi":"10.1109/CIS.2008.215","DOIUrl":"https://doi.org/10.1109/CIS.2008.215","url":null,"abstract":"Non-functional requirements (NFRs), apparently, have different characteristics from their functional counterparts. The ways to develop conceptual models of NFRs, therefore, do not akin to the one for functional requirements (FRs). This paper proposes a method to analyze, specify and modeling non-functional requirements especially the ones that can be manifested as operational/functional features, in the context of translative model-driven development. Our method employs two analysis approaches: NFR framework and uses-cases approach accompanied with our proposed specification technique: scenario-based specification. Results from the scenario-based specification will be used as an insight for developing NFRs conceptual models. In here, we present the way to model a security concern of Voter Tracking System (VTS), a system to mark voters using handheld electronic device.","PeriodicalId":255247,"journal":{"name":"2008 International Conference on Computational Intelligence and Security","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124677941","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":"Shape Constraint Incorporated Geometric Flows for Blood Vessels Segmentation","authors":"J. Hao, Jing-jing Zhao","doi":"10.1109/CIS.2008.84","DOIUrl":"https://doi.org/10.1109/CIS.2008.84","url":null,"abstract":"Flux maximizing geometric flows have been widely used to segment elongated structures such as blood vessels. Only using the magnitude and direction of an appropriate vector field to segment blood vessels often results in leakages at areas where the image information is ambiguous. To overcome this problem, we combine image statistics and shape information to derive a geometric flow to segment tubular structures and penalize leakages. To accelerate the segmentation speed, a two-stage segmentation framework is presented. Results on cases demonstrate it is the mostly accuracy and efficiency of the approach.","PeriodicalId":255247,"journal":{"name":"2008 International Conference on Computational Intelligence and Security","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127481294","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":"Gray S-Box for Advanced Encryption Standard","authors":"Minh Tran, Doan Khanh Bui, A. Duong","doi":"10.1109/CIS.2008.205","DOIUrl":"https://doi.org/10.1109/CIS.2008.205","url":null,"abstract":"We present Gray S-box for advanced encryption standard. Gray S-box is constructed by adding binary Gray code transformation as a preprocessing step to original AES S-box. Gray S-box corresponds to a polynomial with all 255 non-zero terms in comparison with 9-term polynomial of original AES S-box. This increases the security for S-box against algebraic attacks and interpolation attacks. Besides, as Gray S-box reuses AES S-box as a whole, Gray S-box inherits all advantages and efficiency of any existing optimized implementation of AES S-box. Gray S-box also achieves important cryptographic properties of AES S-box, including strict avalanche criterion, nonlinearity, and differential uniformity.","PeriodicalId":255247,"journal":{"name":"2008 International Conference on Computational Intelligence and Security","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128974712","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 Neural-Network Iteration Formula for the Simultaneous Inclusion of Polynomial Zeros","authors":"Chuangxin Wang, Zhezhao Zeng","doi":"10.1109/CIS.2008.59","DOIUrl":"https://doi.org/10.1109/CIS.2008.59","url":null,"abstract":"In this paper, we construct a neural-network iteration formula for simultaneously finding all roots of an algebraic polynomials with adaptive parameters. Its convergence was researched. The specific examples showed that the proposed method can simultaneously find all zeros of polynomials at a very rapid convergence and very high accuracy with less computation.","PeriodicalId":255247,"journal":{"name":"2008 International Conference on Computational Intelligence and Security","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130728007","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}