{"title":"Intrusion Detection System Based on Matching Pursuit","authors":"R. Renk, L. Saganowski, W. Holubowicz, M. Choraś","doi":"10.1109/ICINIS.2008.68","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.68","url":null,"abstract":"In this paper we present our original methodology, in which Matching Pursuit is used for networks anomaly and intrusion detection. We propose to use mean projection of the reconstructed network signal to determine if the examined trace is normal or attacked. Experimental results confirm the efficiency of our method.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"2016 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":"125780767","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":"On Necessary Conditions for Scale-Freedom in Complex Networks with Applications to Computer Communication Systems","authors":"W. Xiao, Weidong Chen, B. Parhami","doi":"10.1080/00207720903267841","DOIUrl":"https://doi.org/10.1080/00207720903267841","url":null,"abstract":"Many complex networks exhibit a scale-free, power-law distribution of vertex degrees. This common feature is a consequence of two generic mechanisms relating to the formation of real networks: (i) Networks tend to expand over time through the addition of new vertices, and (ii) New vertices attach preferentially to those that are already well connected. We show that for many natural or man-made complex networks possessing a scale-free power-law distribution with the exponent gamma > 2, the number of degree-1 vertices, when nonzero, is of the same order as the network size N and that the average degree is of order log N. Our results expose another necessary characteristic of such networks. Furthermore, our method has the benefit of relying only on conditions that are static and easily verified for arbitrary networks. We use the preceding results to derive a closed-form formula approximating the distance distribution in scale-free networks. Such distributions find extensive applications in computer communication networks and software architecture.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"49 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":"126124973","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 Model of Self-Adaptive Task Allocation for Multi-Agents Inspired by Social Insects","authors":"X. Zhuang, B. Yin","doi":"10.1109/ICINIS.2008.93","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.93","url":null,"abstract":"The bee-ant task allocation method is proposed as a model for multi-agent task allocation, which is inspired by the swarm intelligence mechanism of social insects. The bee-ant task allocation method is a variation of the ant colony optimization, in which the task selection model of honeybees is adopted. Experimental results indicate the adaptability and robustness of the bee-ant task allocation method.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"24 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":"122200326","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":"Multi-View Face Detection Based on AdaBoost and Skin Color","authors":"Peng Deng, Mingtao Pei","doi":"10.1109/ICINIS.2008.60","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.60","url":null,"abstract":"This paper describes a multi-view face detection method which combined skin color information and AdaBoost-based face detection technique together to improve the detection accuracy and detection speed. First the input image is converted into YCbCr color space, then the image is binarized according to skin threshold and a binary image was obtained in which pixels with value 1 are skin-pixels and pixels with value 0 are non-skin pixels. After that only the skin regions are scanned by multi-AdaBoost detectors which were also trained on skin binarized face images. Before scanned by the multi-AdaBoost detectors, the sub windows are filtered by the ratio of the skin- pixels in the sub windows which can eliminate most of the false face regions .The experimental results show that the proposed method can achieve high detection accuracy with fast detection speed.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"24 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":"125932157","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":"Design and Application of Trusted Character in Security Kernel of PERSEUS Architecture","authors":"Xu Ning, Yang Mengmeng, Z. Tao, Wang Yadi","doi":"10.1109/ICINIS.2008.51","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.51","url":null,"abstract":"This paper aims to unite trusted computing techniques with PERSEUS security kernel, it introduces the definition of trusted character, and puts forward security kernel layer based on trusted character. This method can solve the problem of data protection, integrality control and resource snippet protection by setting trusted character entry points at sensitive position in the kernel. Lastly, it describes how to solve upgrading problem by sealing technology based on trusted character.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"41 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":"124119067","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":"Design of an Educational Support System for Self-Learning","authors":"K. Eguchi, S. Kurebayashi, Hongbing Zhu","doi":"10.1109/ICINIS.2008.129","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.129","url":null,"abstract":"An educational support system for self-learning of a pupil is proposed in this paper. The features of the proposed system are that 1. appropriate questions which depend on the ability level of the pupil are provided by using a fuzzy scheme and 2. learning situation and weak points of the pupil are given by employing a principal component analysis (PCA). Therefore, different from conventional support systems, the proposed system enables the teacher to obtain analytical data for giving suitable advice about study. As one of the simplest examples, the proposed system for arithmetic training is realized by using Visual Basic. The experimental results show that the proposed system can provide appropriate questions depending on the ability level of pupil.","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":"129010734","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 Priority Based Dynamic Adaptive Routing Protocol for Wireless Sensor Networks","authors":"Jian Chen, Mi Zhou, Deshi Li, Tao Sun","doi":"10.1109/ICINIS.2008.171","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.171","url":null,"abstract":"Wireless sensor networks (WSNs) are becoming a viable tool for many monitoring applications. In many cases these applications may be of critical nature where the transmitting of vital information from sensors to base station or sink is crucial, and data loss cannot be tolerated. As a result, the information transmission of wireless sensor networks has various different requirements in performance, such as real-time, reliability and delay. Traditional ad hoc network routing protocols are lack of a priority scheduling routing selection strategy, and are mainly based on the condition ldquoshortest pathrdquo, so after the load increase to a certain extent, a vital packet may be dropped in order to send an ordinary message. To this point, across-layer design method is used to present a new routing protocol which is named as priority based dynamic adaptive routing (PDAR), PDAR uses a priority scheduling adaptive routing mechanism to improve the reliability of sending a packet with high priority and the performance of WSNs. Simulation results show that PDAR significantly decreases end-to end delays by 40.3% and packet loss ratio by 15.3% for high-priority flows without starvation of ordinary traffic, which performs much better than dynamic source routing (DSR) protocol.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"102 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":"121480845","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}
Jianfeng Yang, Hong Zheng, Yinbo Xie, Jolly Wang, N. Bao
{"title":"Adding TBB Contents to the Multi-Core Related Curriculums","authors":"Jianfeng Yang, Hong Zheng, Yinbo Xie, Jolly Wang, N. Bao","doi":"10.1109/ICINIS.2008.185","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.185","url":null,"abstract":"With the progress of semiconductor technologies and then the advent of multi-core processors, the age of Serial Computing is over and parallel computing technology is now emerging as mainstream. Parallel programming models are needed to change and the education is need to help sequential programmers adapt to the requirements of this new technology and architecture. Now multi-core related contents have been adopted into curricula syllabus of more than 100 universities in China and about 20,000 undergraduate students will benefit from that each year, those contents be taught are similar among universities. Threading Building Blocks(TBB), a new and will be the best solution for parallel computing on the future many-core processor, is a C++ template library for parallelism that extents C++ template by abstracting away thread management and mapping tasks to threads automatically. TBB represents a higher-level parallelism for performance and scalability. This paper aim at adopting the into university curriculums by introducing the important role of TBB in teaching multi-core related contents. The paper also presents how to integrate TBB with some other program tools such as OpenMP or MPI in the curricula \"Multi-core Architecture and Multi-threaded Programming Technologies\" of Wuhan University.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"131 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":"122747359","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 Technique of Image-Based Camera Calibration in Depth-from-Defocus","authors":"Quanbing Zhang, Y. Gong","doi":"10.1109/ICINIS.2008.95","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.95","url":null,"abstract":"In this paper, a novel camera parameters calibration algorithm is proposed by exploiting defocus information. The proposed algorithm is based on two defocus images of the same scene obtained by changing camera's aperture numbers. Both images can be arbitrarily blurred. The blur difference between the two defocused images was estimated. Combining with imaging geometry of the thin lens, the corresponding camera parameters can be calibrated. This proposed algorithm remove the limit of calibration algorithm given by Soon-Yong Park that one of the images used in calibration must be focused. And it is valid without process of scale normalization. The calibrated parameters yield consistent results in depth estimation. Experimental results on synthetic and real images are presented to demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"72 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":"115927861","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":"Adaptive Threshold De-Noising Algorithm of Roll Eccentricity Signal","authors":"L. Daoping, Yao Xiaolan, Wu Qinghe, Z. Xiaodong","doi":"10.1109/ICINIS.2008.98","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.98","url":null,"abstract":"To solve the problem of roll eccentricity signal with the noise in the HAGC system, a new method based on adaptive threshold de-noising algorithm of roll eccentricity signal is proposed. The new method can self-adaptively decide the threshold of wavelet analysis and make the SNR as a function of the parameter of the filter to acquire the optimal threshold parameter by using midpoint method. This method has the properties of self-adaptation, strong robustness, low calculation, simple arithmetic and so on. Simulation shows that the result of de-noising with this new method is much better than soft-thresholding algorithm and hard-thresholding algorithm and has a good de-noising result for roll eccentricity signal in HAGC system.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"9 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":"115972748","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}