{"title":"Determining Supply Chain Flexibility Using Statistics and Nueral Networks: A Comparative Study","authors":"Ananda Jeeva, William W. Guo","doi":"10.1109/NSS.2009.87","DOIUrl":"https://doi.org/10.1109/NSS.2009.87","url":null,"abstract":"The purpose of this paper is to examine the application of neural networks as a flexibility and performance measure in supplier-manufacturer activities. The dimensions of information exchange, supplier integration, product delivery, logistics, and organisational structure are used as determinants factors affecting this supply chain flexibility. The data set was collected from more than 200 Australian manufacturing firms evaluating their suppliers. Our study shows that neural networks can accurately determine a supplier’s flexibility with an error within 1%, which is more accurate than the conventional multivariate regression can.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126618821","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":"Significance of Computional Intelligence Method in Computer Networks","authors":"Reginald Lal, A. Chiou","doi":"10.1109/NSS.2009.92","DOIUrl":"https://doi.org/10.1109/NSS.2009.92","url":null,"abstract":"The increase in network traffic has lead to the concept of congestion in computer networks. The problem of network congestion control remains a major issue in today’s computer networks. Despite various methods and algorithms that has been proposed, however due to the dynamic nature of computer networks, no universal control method has been widely accepted. This paper reviews various conventional methods proposed to avoid network congestion and compares it to computational intelligence (CI) method. A demonstrative simulation is setup to measure congestion in a LAN environment. In addition, the methods of computational intelligence and its efficiency in network congestion management have been addressed in-depth.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124042264","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 Information Filtering Approach","authors":"Nasim Vatani, A. Rahmani, M. Shiri","doi":"10.1109/NSS.2009.45","DOIUrl":"https://doi.org/10.1109/NSS.2009.45","url":null,"abstract":"Web mining is used to automatically discover and extract information from Web-related data source such as documents, services and user profiles. Although standard data mining methods are applied for mining on the web, specific algorithms need to be developed and applied for Web based information processing in Web resources. In our paper, we develop a method to filter the relevant information to users based on user profile. Our methods reduce the probability of filtering out the relevant boundary documents and increase the probability of filtering out the irrelevant boundary documents. In this paper, for filtering the documents, first, the user profile is presented as a set of weighted concepts; then, mapping the words onto concepts is done so that all the words representing user profile’s concepts can be found. Later, the documents are weighted based on the presence of the user profile’s concepts according to their weights and with respect to the location of the concepts; finally, after the filtering process, user profile is updated. The results clearly show further improvements and the accomplishment of the present goal.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127967920","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 Messaging-Based System for Remote Server Administration","authors":"M. Ramilli, M. Prandini","doi":"10.1109/NSS.2009.34","DOIUrl":"https://doi.org/10.1109/NSS.2009.34","url":null,"abstract":"The most common method of system administration is accessing the remote system through the network by means of some client-server protocol, giving access to a privileged service always listening on the target system. There are important security and flexibility limitations deriving from the usage of a predictable access port for such a critical application, which can be summarized as the impossibility of attaining a satisfactory trade-off between attack rejection capability and service availability. This work illustrates an alternative solution based on the presence of an intermediate system, acting as a meeting place in between the remote server and its administrator. The resulting architecture eliminates the predictable management port on the server, enhances the availability of the management service by exploiting widespread communication platforms that are likely to be accessible from anywhere, and exhibits a modular structure enabling promising future extensions aimed at overcoming many other issues of the current administration techniques.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121770993","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}
Shui Yu, Theerasak Thapngam, Jianwen Liu, Su Wei, Wanlei Zhou
{"title":"Discriminating DDoS Flows from Flash Crowds Using Information Distance","authors":"Shui Yu, Theerasak Thapngam, Jianwen Liu, Su Wei, Wanlei Zhou","doi":"10.1109/NSS.2009.29","DOIUrl":"https://doi.org/10.1109/NSS.2009.29","url":null,"abstract":"Discriminating DDoS flooding attacks from flash crowds poses a tough challenge for the network security community. Because of the vulnerability of the original design of the Internet, attackers can easily mimic the patterns of legitimate network traffic to fly under the radar. The existing fingerprint or feature based algorithms are incapable to detect new attack strategies. In this paper, we aim to differentiate DDoS attack flows from flash crowds. We are motivated by the following fact: the attack flows are generated by the same prebuilt program (attack tools), however, flash crowds come from randomly distributed users all over the Internet. Therefore, the flow similarity among DDoS attack flows is much stronger than that among flash crowds. We employ abstract distance metrics, the Jeffrey distance, the Sibson distance, and the Hellinger distance to measure the similarity among flows to achieve our goal. We compared the three metrics and found that the Sibson distance is the most suitable one for our purpose. We apply our algorithm to the real datasets and the results indicate that the proposed algorithm can differentiate them with an accuracy around 65%.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132369652","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":"Real-Time Data Mining Methodology and a Supporting Framework","authors":"Xiong Deng, M. Ghanem, Yike Guo","doi":"10.1109/NSS.2009.49","DOIUrl":"https://doi.org/10.1109/NSS.2009.49","url":null,"abstract":"The need for real-time data mining has long been recognized in various application domains. However existing methodologies are still limited to the optimization of single classical data mining algorithms. In this paper, we investigate the development of a general purpose methodology for real-time data mining and propose a novel supporting framework. In the methodology, definition, characteristics and principles of real-time data mining are finely studied. The framework is proposed based on the novel dynamic data mining process model. The model offers the ability to incrementally update data mining knowledge and synchronously execute data mining tasks; an implementation of the framework and a case study are also presented.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132765597","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}
Burcu Yurekli, Gökhan Çapan, Baris Yilmazel, Özgür Yilmazel
{"title":"Guided Navigation Using Query Log Mining through Query Expansion","authors":"Burcu Yurekli, Gökhan Çapan, Baris Yilmazel, Özgür Yilmazel","doi":"10.1109/NSS.2009.27","DOIUrl":"https://doi.org/10.1109/NSS.2009.27","url":null,"abstract":"We introduce a method to help people to refine their search queries based on other people’s similar queries. We compared two different methods of collaborative filtering on search logs of a popular e-commerce site to do query expansion. In item-based method, by identifying similarities between different items, and in user-based method, by identifying similarities between different users, we compute recommendations for users. The experimental results show that item-based query expansion method provides better performance than the user-based method. While the user-based method improved the system performance 20%, the item-based method provided success of 73%. Also, item-based method recommended better expansion terms than the user-based method, which is important in helping web users to easily access information needs by formulating qualified queries. This document is a comparison of these two methods, and their effects on system performance.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117077877","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":"Integrating Palmprint and Fingerprint for Identity Verification","authors":"Y. J. Chin, T. Ong, M. G. K. Ong, B. Hiew","doi":"10.1109/NSS.2009.25","DOIUrl":"https://doi.org/10.1109/NSS.2009.25","url":null,"abstract":"In this paper, we propose a multimodal biometrics system that combines fingerprint and palmprint features to overcome several limitations of unimodal biometrics—such as the inability to tolerate noise, distorted data and etc.—and thus able to improve the performance of biometrics for personal verification. The quality of fingerprint and palmprint images are first enhanced using a series of pre-processing techniques. Following, a bank of 2D Gabor filters is used to independently extract fingerprint and palmprint features, which are then concatenated into a single feature vector. We conclude that the proposed methodology has better performance and is more reliable compared to unimodal approaches using solely fingerprint or palmprint biometrics. This is supported by our experiments which are able to achieve equal error rate (EER) as low as 0.91% using the combined biometrics features.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128248678","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":"Contextual Analysis Methods Capturing Knowledge Representation Related to the Reputation","authors":"Miho Itoh","doi":"10.1109/NSS.2009.36","DOIUrl":"https://doi.org/10.1109/NSS.2009.36","url":null,"abstract":"The architecture of a system able to interpret multiple knowledge representations throughout context, by capturing coherence of sequential foci arising in contextual sentences, disambiguating lexical meaning and specifying anaphor/cataphora/antecedent, is presented in this paper. The system can detect cohesion of structure of complicated contents, thanks to the construction of four novel sentence patterns¿any Japanese sentence being classifiable into one of these¿that clarify role relations between words related with an absolute expression called CEE within the predicate. For instance, having a “big heart”, a tolerant mind, and the expression \"pretty girl\", are both usually understood as positives; whereas the expressions “big words\" and \"pretty boy\", or effeminate boy, have rather a pejorative connotation. To resolve such ambiguity, the system achieves an accurate contextual analysis, by identifying role relations between words. Our system evaluated correctly “positive” or “negative” nuance for 75.0 % of those.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127282849","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 Efficient Certificateless Encryption Scheme in the Standard Model","authors":"Hua Guo, Xiyong Zhang, Y. Mu, Zhoujun Li","doi":"10.1109/NSS.2009.31","DOIUrl":"https://doi.org/10.1109/NSS.2009.31","url":null,"abstract":"We propose an efficient Certificateless Public Key Encryption (CL-PKE) scheme which is provably secure against chosen ciphertext attacks without random oracles. Our scheme is more computationally efficient than the existing schemes and provides the shortest public key length compared to other existing CL-PKEs with random oracles. We also propose a practical Self-Generated-Certificate Encryption (SGC-PKE) scheme based on our CL-PKE scheme. One of merits of such cryptographic systems is that it can be applied to countermeasure ``Denial-of-Decryption (DoD) Attacks\" that is inherent in CL-PKE.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127993591","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}