{"title":"E-mail user roles identification using OWL-based ontology approach","authors":"R. Brendel, H. Krawczyk","doi":"10.1109/INFTECH.2008.4621612","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621612","url":null,"abstract":"Social networks as structures reflecting social relations between individuals or organizations are often studied in order to identify roles of actors of the network. Classification of roles played by the actors can be very informative because it gives us the complete overview of the network allowing for understanding how the network is organized and how it is going to behave in front of certain external or internal events. In the paper we present how this task can be accomplished with support of OWL-based ontology and related tools. As a sample social structure we use a network of e-mail users.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122008686","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":"Geo-location of the commune of an IP user","authors":"K. Nowicki, T. Sikorski","doi":"10.1109/INFTECH.2008.4621634","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621634","url":null,"abstract":"This paper describes a system of geo-location of an IP user that would enable VoIP users to call 112. Basic requirement is fast (under 50 ms) determination of the commune of the subscriber. To obtain as accurate information as possible aggregation of several methods was proposed: using a database of locations of IP ranges created by specialized companies, traceroute and using history of the user locations to assume his current one. It is also explained how the concept described above was implemented and run on a testing platform along with the results of its operation. In the ending part of the article the directions of development were described.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129235230","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":"Attacker Skill Level distribution estimation in the system mean time-to-compromise","authors":"N. Paulauskas, E. Garsva","doi":"10.1109/INFTECH.2008.4621683","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621683","url":null,"abstract":"Computer system security evaluation by using mean time-to-compromise criteria is presented in this paper. The outcome of the attack highly depends on the attacker skill level. The attacker skill level distribution must be estimated, normal skill level distribution in the skill group is suggested in the model. The article concludes with simulation results and evaluation of the chosen attacker skill level distribution effect.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122961279","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 IPSec performance testing of IPv4/IPv6 IPSec gateway","authors":"M. Barylski","doi":"10.1109/INFTECH.2008.4621618","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621618","url":null,"abstract":"Ensuring that IP Security (IPSec) gateway meets its performance expectations is one of the most important objectives that IPSec gateway development team must face with. Only suitable validation approach may prove that IPSec gateway throughput is correct, Security Associationspsila adding/removing time is acceptable, IPSec gateway is capable of processing huge number of flows and IPSec rekeying works with required performance level. This paper puts forward a plan for IPSec gateway performance testing. Discussion is illustrated with several examples of test cases that can be used during IPv4/IPv6 IPSec gateway validation and verification.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121595808","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}
J. Błażewicz, M. Bryja, M. Figlerowicz, P. Gawron, M. Kasprzak, D. Platt, J. Przybytek, A. Świercz, L. Szajkowski
{"title":"A new algorithm for genome assembly from short reads","authors":"J. Błażewicz, M. Bryja, M. Figlerowicz, P. Gawron, M. Kasprzak, D. Platt, J. Przybytek, A. Świercz, L. Szajkowski","doi":"10.1109/INFTECH.2008.4621681","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621681","url":null,"abstract":"Progress in bioengineering brought a new approach to DNA sequencing, which aim is to give highly reliable output of low cost and in short time. It is 454 sequencing, based on the pyrosequencing protocol, owned by 454 Life Sciences Corporation. Because of the sequences reliability this method is much better than others for assembly purposes. However, produced sequences are much shorter and there are many more of them, which indicate that the problem is harder. Presented algorithm was created to process data from 454 sequencing method. Usefulness of the algorithm has been proven in tests on raw data generated during sequencing of the whole 1.84 Mbp genome of bacteria Prochlorococcus marinus.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122498927","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":"Optimization of geofield queries","authors":"P. Bajerski","doi":"10.1109/INFTECH.2008.4621632","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621632","url":null,"abstract":"In spatial analysis object- and field-oriented representations of spatial entities are needed. Geoobjects are used to model discrete entities such as districts or roads and geofields for continuous phenomena such as air pollution or temperature over a given region. The term geofield query denotes a query regarding geofields. This paper addresses geofield query processing by introducing: (a) PNR representation - relational representation of geofields and geoobjects based on Peano N space-filling curve and relation-valued attributes, (b) Peano algebra - a set of operations extending relational algebra with operations for processing geofields and geoobjects in PNR representation, and (c) geofield queries optimization rules. Presented Peano algebra and optimization rules made it possible to evaluate geofield queries much faster than in classical raster representation.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122528744","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 environment for modeling communicating reactive systems","authors":"A. Bhattacharjee, S. Dhodapkar, R. Shyamasundar","doi":"10.1109/INFTECH.2008.4621603","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621603","url":null,"abstract":"In this paper, we describe an environment which can be used to specify and implement distributed reactive system e.g., globally asynchronous, locally synchronous systems (GALS). We have extended state-charts called as communicating statecharts(CS), with primitives for handling synchronous and asynchronous communication through channels. We also show how to convert the CS specifications into Esterel which enable us to use code generation and verification capabilities in Esterel suite of tools.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115356615","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":"Some results on a trading model in a consensus list coloring","authors":"D. Bogdanowicz, K. Giaro","doi":"10.1109/INFTECH.2008.4621644","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621644","url":null,"abstract":"Let S(v) denote a nonempty set of integers assigned to vertex v of graph G = (V, E). Let us call S a list assignment for G. We look for a legal graph coloring f such that for every vertex v isin V we have f(v) isin S(v). A trade from a vertex u to v means that we remove color c from S(u) and add it to S(v). In the trading model we ask how many trades are required in order to obtain a list assignment that has a list coloring. So (G, S) is p-tradeable if this can be done in p or fewer trades. We show a polynomial algorithm for determining the minimal p for complete graphs. An analogous problem for trees is NP-hard. However, it is polynomial for partial k-trees with fixed k and fixed total number of colors.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126705147","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. Chybicki, M. Kulawiak, Z. Lubniewski, J. Dabrowski, M. luba, M. Moszynski, A. Stepnowski
{"title":"GIS for remote sensing, analysis and visualisation of marine pollution and other marine ecosystem components","authors":"A. Chybicki, M. Kulawiak, Z. Lubniewski, J. Dabrowski, M. luba, M. Moszynski, A. Stepnowski","doi":"10.1109/INFTECH.2008.4621628","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621628","url":null,"abstract":"Pollution detection, environment sensing and appropriate response strategies are important due to the marine ecosystemspsila continuous absorption of pollutants of various origins. Several approaches and techniques of measurements are available for marine environment monitoring including direct sampling, airborne and satellite imagery and underwater acoustics. The huge development in the information technology has provided the possibilities for much faster and more efficient access to survey data, allowing their remote, nearly real-time management, processing and visualisation. The proposed GIS is able to integrate many different types of marine pollution survey data, especially those acquired by various acoustic sensors like Multibeam Sonar Systems (MBSS), echosounder and Side Scan Sonars (SSS). It also supports instantaneous 2D and 3D visualisation in the form of thematic layers that can be overlaid. The system utilises the ArcSDE application server that facilitates storing and managing spatial data (raster, vector, and survey) in a database and ArcGIS Engine GlobeControl and MapControl components for georeferenced presentation of various objects. The set of geoprocessing and spatial analysis methods can be used in order to retrieve relevant information and analysis results.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113932456","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":"Clonal selection algorithm for vehicle routing","authors":"Jacek Da̧browski","doi":"10.1109/INFTECH.2008.4621697","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621697","url":null,"abstract":"Over the years several successful computing techniques have been inspired by biological mechanisms. Studies of the mechanisms that allow the immune systems of vertebrates to adapt and learn have resulted in a class of algorithms called artificial immune systems. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously un-encountered ones. This paper presents an algorithm based on the clonal selection principles for solving the capacitated vehicle routing problem.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114407909","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}