{"title":"Research on Supplier Selection Tactic Model and Algorithm of Special Steel Enterprise for Strategic Purchasing","authors":"L. Xiaobing, Lv Qiang","doi":"10.1109/CIS.WORKSHOPS.2007.13","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.13","url":null,"abstract":"By the analyzing and study on the problem about JIT procurement and supplier selection of Special Steel enterprise group, a supplier selection tactic model structure of enterprise group was firstly constructed. The constructing process of the model is basically based on the procurement cost and the delivery time. On the basis of adaptive genetic algorithm, an original algorithm for multi-constraint supplier selection tactic mathematical model was then proposed. The procurement cost and the delivery time was chose as the optimization objective in the proposed mathematical mode, the model and the algorithm is applied to solve a given practical problem of Special Steel enterprise group , the validity and efficiency of the model and the algorithm is then verified by the solving results. Finally some lacking place of the multi-constraint supplier selection tactic mathematical model was discussed.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"131 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":"124261477","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":"DT-CWT Feature Based Face Recognition Using Supervised Kernel ONPP","authors":"Yuehui Sun","doi":"10.1109/CIS.WORKSHOPS.2007.204","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.204","url":null,"abstract":"A novel DT-CWT feature-kernel face recognition method is proposed in this paper. This involves transforming a face image with DT-CWT on feature extraction stage, and supervised kernel Orthogonal Neighborhood Preserving Projections (ONPP) being then automatically applied to the feature vectors. Numerical experiments are reported to illustrate the performance of our algorithm and to compare it with a few competing methods.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"24 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":"123432557","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}
Lidong Zhai, Xiao-lei Ma, Jinchun Gao, Yuan'an Liu
{"title":"PSMR: Publish/Subscribe Multi-cast Routing for Wireless Ad Hoc Networks","authors":"Lidong Zhai, Xiao-lei Ma, Jinchun Gao, Yuan'an Liu","doi":"10.1109/CIS.WORKSHOPS.2007.41","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.41","url":null,"abstract":"With the widespread deployment and use of wireless data communications in the mobile computing domain, middleware as a mobile connector applied in distributed and potentially heterogeneous environments is in great need. Pub/sub scheme with the strength of asynchronously, loosely coupled form of interaction between multi-points, so the middleware based on pub/sub scheme is well adapted to the dynamic, distributed interaction in large-scale mobile computing applications. In this paper, we describe the integration of the middleware based on pub/sub scheme and the multicast routing protocol of mobile ad-hoc network, and present a multi-hop routing subscription (publish / subscribe multi-hop routing) protocol, named PSMR. PSMR helps to distribute the publisher's data to subscribers and establish a pub/sub multi-hops network at the same time, and cooperate the layer of pub/sub scheme and the layer of routing work to distribute the data to make the transmission more reliable.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"8 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":"122461636","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 Effective Algorithm for Mining Weighted Association Rules in Telecommunication Networks","authors":"Tongyan Li, Xingming Li, H. Xiao","doi":"10.1109/CIS.WORKSHOPS.2007.130","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.130","url":null,"abstract":"The algorithms of weighted association rules mining and weights confirming were studied in alarm correlation analysis. A novel method named Neural Network based WFP-Tree (NNWFP) for mining association rules was proposed. NNWFP differs from the classical weighted association rules mining algorithm MINWAL (O). It is an efficient algorithm based on weighted frequent pattern tree, and the weights of the items are confirmed by the neural network. Experiments on a large alarm data set show that the approach is efficient and practical for finding frequent patterns in the alarm correlation analysis of telecommunication networks, and the performance of NNWFP is better than MINWAL (O).","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"85 2 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":"124782763","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":"Unambiguous Measurements Based Quantum Cryptography","authors":"Wei Yang, Liusheng Huang, Yonglong Luo","doi":"10.1109/CIS.WORKSHOPS.2007.117","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.117","url":null,"abstract":"A new quantum cryptography (quantum key distribution) scheme based on unambiguous measurements is presented, which is secure against any individual attack allowed by quantum physics. By carefully constructing the unambiguous measurements elements a higher efficiency than previous protocols is achieved. Furthermore, an equality for the probability of the participant's reliable measurement outcome and the polarization angle that he chooses when distinguishing between two non-orthogonal states is also derived in this paper.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"88 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":"125170702","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 TPM Authentication Scheme for Mobile IP","authors":"Liu Jing-sen, Dai Guan-zhong, Li Yu","doi":"10.1109/CIS.WORKSHOPS.2007.69","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.69","url":null,"abstract":"In mobile IP scheme, if mobility agents and mobile nodes are trusted computing platforms (TCPs), the combination of mobile IP registration authentication and trusted platform module (TPM) authentication is expected. But neither the privacy CA scheme nor the direct anonymous attestation (DAA) scheme provides the authentication between TPMs that belong to different authenticating domains. This paper proposes an improved scheme based on the existing DAA scheme. The improved scheme adds a CA layer on the authenticating domains that could share the trusted relationship. It could achieve the authentication between TPMs that belong to different authenticating domains. This scheme has the security and anonymity identical to the DAA, and it can therefore satisfy the requirement of mobile IP authentication.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"115 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":"131448062","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":"Anonymous Agent with Anonymous Itinerary","authors":"F. Raji, B. T. Ladani, M. Brenjkoub","doi":"10.1109/CIS.WORKSHOPS.2007.157","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.157","url":null,"abstract":"The mobile agent is desired to be able to roam autonomously and anonymously from one agent platform to another one. To achieve this aim, a novel secure protocol is proposed to provide anonymity of the agent owner as well as the agent itinerary. In the presented method, a set of trusted auxiliary hosts named as mixers are employed to insert a transient fictitious owner in each step of the agent itinerary. The ability of the proposed protocol is analyzed and its resistance against traffic analysis attacks is illustrated.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"36 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":"126430796","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":"Blind Non-independent Image Separation Based on Independent Component Analysis","authors":"Wu Guo, Peng Zhang, Runsheng Wang","doi":"10.1109/CIS.WORKSHOPS.2007.170","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.170","url":null,"abstract":"Blind separation of mixture images which mutually independent has been solved efficiently by some independent component analysis(ICA) methods. But these methods often failed in case of the source images are statistically non-independent. A novel fixed-point FastICA algorithm based on complexity pursuit is presented in this paper and with the algorithm the mixed images which not mutually independent can be separated successfully. Experimental results demonstrate the efficiency of our proposed method.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"18 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":"125257841","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":"Quantum-Inspired Swarm Evolution Algorithm","authors":"Huang Yourui, Tang Chao-li, Wang Shuang","doi":"10.1109/CIS.WORKSHOPS.2007.233","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.233","url":null,"abstract":"This paper proposes a novel quantum swarm evolution algorithm, called a quantum-inspired swarm evolution algorithm (QSEA), which is based on the concept and principles of quantum computing. The proposed algorithm adopts quantum angle to express Q-bit and improved particle swarm optimization to update automatically. After the quantum-inspired swarm evolution algorithm is described, the experiment results on the benchmark functions are given to show its efficiency.","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":"130369250","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}
Guangjie Liu, Yue-wei Dai, Zhiquan Wang, Shiguo Lian
{"title":"Perceptual Steganography Based on Adaptive Quantization-Embedder","authors":"Guangjie Liu, Yue-wei Dai, Zhiquan Wang, Shiguo Lian","doi":"10.1109/CIS.WORKSHOPS.2007.195","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.195","url":null,"abstract":"A steganographic scheme based on adaptive quantization-embedder is proposed in this paper. The scheme uses the new constructed contrast-correlation distortion metric to optimally choose quantization steps for image blocks to guarantee more data being embedded in busy areas. Different form existing methods, our scheme embeds the AQE parameters together with message bits into the cover image. Simulation experiments show the proposed scheme can provide a good trade-off between the perceptibility and the capacity.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"37 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":"130896409","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}