{"title":"Reputation-based methods for building secure P2P networks","authors":"Miroslav Novotny, F. Zavoral","doi":"10.1109/ICADIWT.2008.4664382","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664382","url":null,"abstract":"The P2P networkpsilas open and anonymous nature offers an almost ideal environment for malicious activities. In this paper, we categorize current reputation management schemes which offer defenses against many attacks. Our goal is to survey the present reputation management methods and propose a classification which facilitates a system analysis. We identify the main drawbacks which are common to all published methods and outline the possible solutions.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122212571","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":"Reliability of network connectivity","authors":"I. Obeidat, S. Berkovich","doi":"10.1109/ICADIWT.2008.4664388","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664388","url":null,"abstract":"One major benchmark of the network is to check its reliability. This can be completed by checking the graphs when the network is fully functioning but subject to failure. There is no known algorithm that can measure the reliability in a polynomial time, and hence measuring the reliability by means of simulation is a preferable choice. The goal of this paper is to check the network reliability, by means of simulation using different methods, first generating a network using the random graphs, and second generating a network using regular graphs. Within this paper, I will focus on the all-terminal problem in which a path between every pair of nodes is checked using the Union and Find method.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133359225","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":"Software video stabilization in a fixed point arithmetic","authors":"M. Ondrej, Z. Frantisek, D. Martin","doi":"10.1109/ICADIWT.2008.4664378","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664378","url":null,"abstract":"This paper discusses a new approach to the stabilization of video sequences. The input of a video stabilization system is a video sequence of relatively static scene, which is ragged due to a mechanical shaking of the camera. This type shaking is often amplified by a camera zoom. Because of this, the video stabilization algorithms are often useful in combination with the security monitoring systems, which often must deal with the zoomed scenes. The video stabilization means a correction of such video sequences, so the stabilized output appears as steady. Our algorithm is based on the fixed-point arithmetic. For this reason it is suitable for use on devices that are not optimized for fixed-point arithmetic, like the DSP architectures and other embedded systems.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133372967","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":"Automatic recognition of retinopathy diseases by using wavelet based neural network","authors":"F. Yagmur, B. Karlik, A. Okatan","doi":"10.1109/ICADIWT.2008.4664391","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664391","url":null,"abstract":"In this study, recognition of five types of retina disorders and normal retina has been studied. The names of these five different Retinopathies are: Diabetic Retinopathy, Hypertensive retinopathy, Macular Degeneration, Vein Branch Oclusion, Vitreus hemorrhage, and normal retina. A wavelet based neural network architecture has been used to diagnose retinopathy automatically. In the process, the retina images were pre-processed and resized. Later, feature extraction has been done before applying into classifier. The performance of proposed method has been found very high. The recognition rates were found %50, %70, %83, %90, %93 and %95 for testing five retinopathy cases respectively.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114077311","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}
S. Thorat, A.K. Khandelwal, Bruhadeshwar Bezawada, K. Kishore
{"title":"Payload Content based Network Anomaly Detection","authors":"S. Thorat, A.K. Khandelwal, Bruhadeshwar Bezawada, K. Kishore","doi":"10.1109/ICADIWT.2008.4664331","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664331","url":null,"abstract":"We present payload content based network anomaly detection, we call as PCNAD. PCNAD is an improvement to PAYL system which is considered one of the complete systems for payload based anomaly detection. PAYL takes into consideration the entire payload for profile calculation and effectively for anomaly detection. Payload length is very high on port numbers like 21 and 80. Hence it is difficult to apply PAYL on high speed, high bandwidth networks. We use CPP (content based payload partitioning) technique which divides the payload into different partitions depending on content of payload. PCNAD does payload based anomaly detection using a few CPP partitions. We demonstrate usefulness of the PCNAD on the 1999 DARPA IDS data set. We observed 97.06% accuracy on port 80 using only 62.64% packet payload length with small false positive rate. This is a significant improvement over PAYL approach which uses 100% of the packet payload for anomaly detection.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"24 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114034715","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":"The recognition of 2D partially occluded objects using curve moment invariants","authors":"K. Lichun, L. Bin, Yao Jin","doi":"10.1109/ICADIWT.2008.4664375","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664375","url":null,"abstract":"This paper puts forward an algorithm to recognize 2D partially occluded objects by using curve moment invariants. In this approach, images of both model objects and partially occluded unknown objects are firstly pre-processed. Then the objects in images are represented by their different order moment invariants based on boundary partitioning of the silhouettes. Afterwards, the match between the model objects and partially occluded unknown objects are implemented. Finally, the unknown objects can be recognized based on the feature calculating and matching. The experiment results show that this algorithm is effective in the recognition of partially occluded objects and robust in invariance to the transformation, scaling and rotation of the objects in images.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122697258","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 of velocity calculation methods in binary PSO on maintenance scheduling","authors":"Fatih Camci","doi":"10.1109/ICADIWT.2008.4664359","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664359","url":null,"abstract":"Even though binary optimization in Genetic Algorithm has been studied extensively, Binary Particle Swarm Optimization (BPSO) methods are relatively new in the literature. There are several binary PSO methods proposed in the literature. Firstly, binary PSO was presented by the father of the PSO method. Then several other methods have been proposed claiming better results. In this work, we analyzed these BPSO methods on maintenance scheduling problem for condition based maintenance system. Evaluation of these methods revealed that their difference mainly focuses on the calculation of velocity vector. Thus, we focus on/compare different velocity calculation methods in BPSO on maintenance scheduling problem in Condition Based Maintenance, which has been presented with Genetic Algorithm in our early work. The tradeoff between maintenance and failure is quantified in risk as the objective function to be minimized.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116060086","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}
A. Noraziah, A.S. Hafizulrahim, R. M. Ramiza, S. Junaida, M. N. Noorhuzaimi
{"title":"System Memory Monitoring through windows application programming interface","authors":"A. Noraziah, A.S. Hafizulrahim, R. M. Ramiza, S. Junaida, M. N. Noorhuzaimi","doi":"10.1109/ICADIWT.2008.4664372","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664372","url":null,"abstract":"System Memory Monitoring (SMM) has been developed to observe the current process usage and memory usage in Windows operating system in term to handle the problem that might be occurs such virus, spyware and the failure process that using abnormal usage. Currently available application such Window Task Manger has the weakness, which the running process does not provides detail information like process size, location path, product name and etc. Therefore, SMM is developed to enhance this application, while at the same provides an additional feature such as a graph flow to make the user more understand the computerpsilas memory flow. Windows Application Programming Interface (API) is used by SMM as the fundamental resources in Windows operating system. As a result, SMM able to recognize the running process by providing details information.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114800175","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}
S. El-Haddad, M. Girod Genet, B. El-Hassan, D. El-Nabbouch
{"title":"MDSAP simulation using TinyOs and hospital application modeling","authors":"S. El-Haddad, M. Girod Genet, B. El-Hassan, D. El-Nabbouch","doi":"10.1109/ICADIWT.2008.4664332","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664332","url":null,"abstract":"This paper focuses on sensor networks and specifically the routing part. Some enhancements were introduced to the directional source aware routing protocol (DSAP). This new algorithm, called MDSAP (modified DSAP), is simulated using TinyOs and compared to the standard DSAP protocol. MDSAP is used for building one complete structure that handles both fixed and mobile users. Some of the resulting concepts can be applied to the model of the hospital.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126081943","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":"Approximating images using minimum bounding rectangles","authors":"A. Sleit, I. Salah, R. Jabay","doi":"10.1109/ICADIWT.2008.4664379","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664379","url":null,"abstract":"In surveillance systems, video cameras record specific scenes for long times. However, by the end of the recording period, such tapes may hold many useless scenes which need to be eliminated. In order to reduce the time in reviewing these worthless scenes while seeking for a specific object, an approximation technique must be considered. In this article, we propose a new technique for finding the minimum bounding rectangle of objects which appear in a specific bitmap image. The minimum bounding rectangle of an image object is the Rectangle containing the object such that the sides of the rectangle touch the object boundaries. The dimensions and locations of the minimum bounding rectangle of an object can be utilized as features to identify the corresponding object.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127516687","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}