{"title":"Aspects modification in business logic of compiled Java programs","authors":"I. Bluemke, K. Billewicz","doi":"10.1109/INFTECH.2008.4621670","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621670","url":null,"abstract":"We propose aspect modification of compiled Java programs for which source code and documentation is not available. Aspect oriented programming is used to trace the program execution and identify points, in which aspects implementing new functionalities may be applied. A special tool supporting this approach was designed and implemented. A modification in business logic of an real, compiled program without source code and documentation is presented in this paper. Advantages and disadvantages of described concepts are pointed out.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"133 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":"127591886","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":"Programmable linearized CMOS OTA for fully differential continuous-time filter design","authors":"S. Szczepański, B. Pankiewicz, S. Koziel","doi":"10.1109/INFTECH.2008.4621688","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621688","url":null,"abstract":"In this paper, a feedforward linearization method for programmable CMOS transconductance operational amplifier (OTA) is described. The proposed circuit technique is developed using simple source-coupled differential pair transconductors and linear reference resistor (R). As a result, an efficient linearization of a transfer characteristic of the OTA is obtained. The gm - programmability of the developed OTA was obtained using a programmable current mirror array technique. SPICE simulations show that for 0.35 mum AMS CMOS process with a single +3 V power supply, total harmonic distortion (THD) at 1Vpp and temperature range from -30degC to +90degC is less than -35.8dB. Moreover the input voltage range of linear operation is increased. Power consumption of the linearized OTA circuit is 0.76 mW.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"2 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":"127627000","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}
N. Sánchez-Carnero, J. A. Francoso, Joaquín Márquez Pérez
{"title":"Development of an application to calculate marine crustacean migration routes","authors":"N. Sánchez-Carnero, J. A. Francoso, Joaquín Márquez Pérez","doi":"10.1109/INFTECH.2008.4621627","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621627","url":null,"abstract":"The knowledge about the migration movements of commercial species of crustaceans is of a great importance in the management of their fisheries. There is no complete technological solution for the research of detailed migration routes, but data loggers which record environmental parameters are broadly used and available at reasonable prices. The application developed in this work will allow researchers to infer migration routes of benthic animals, using depth recorded by data loggers in combination with bathymetry models of the study areas.","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":"116823375","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":"Inferring perfect phylogenies with restrictions on character state transitions","authors":"J. Truszkowski, K. Giaro","doi":"10.1109/INFTECH.2008.4621668","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621668","url":null,"abstract":"One of the important problems in evolutionary biology is inferring phylogenetic trees for sets of related species. We introduce a new model for inferring phylogenies which is a generalization of the widely studied perfect phylogeny model. The perfect phylogeny model assumes that a feature shared by a set of species cannot have evolved independently in any two of the species in the set, i.e. the species with this feature form a subtree in the correct phylogenetic tree. We briefly review earlier similar results on this subject and describe the difference between our model and the ones previously investigated. It turns out that the problem of finding a perfect phylogeny with restrictions is NP-complete even if the number of characters is 2. This contrasts with the complexity of finding unrestricted perfect phylogenies. On the other hand, the new model shows similar properties to the classical perfect phylogeny model in case where the number of cycles in each state transition graph is bounded by a small constant.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"55 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":"132529456","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":"New propagation model for wireless monitoring systems in the container terminal environment","authors":"R. Katulski, J. Sadowski, J. Stefanski","doi":"10.1109/INFTECH.2008.4621592","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621592","url":null,"abstract":"The problem of the propagation loss calculation of the mobile radio links working in container terminal areas has been analyzed. The analysis is based on the measurement investigations of the radio signal loss made for different propagation conditions of the container terminal environment. Two main types of the propagation environment have been take into account - i.e. LOS and NLOS conditions, as typical for the environment classification. New empirical formulas for the propagation loss calculations appropriate to these types of the propagation environment have been proposed. To obtain these formulas the measurement investigations have been made and the multidimensional regression analysis has been applied. The new propagation model has been verified by use of the measurement investigations. Finally, practical usefulness of the model for design procedures of the radio links in the container terminal areas has been concluded.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"62 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":"134020613","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":"Applying decision trees to the recognition of musical symbols","authors":"A. Kołakowska","doi":"10.1109/INFTECH.2008.4621624","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621624","url":null,"abstract":"The paper presents an experimental study on the recognition of printed musical scores. The first part of the study focuses on data preparation. Bitmaps containing musical symbols are converted to feature vectors using various methods. The vectors created in such a way are used to train classifiers which are the essential part of the study. Several decision tree classifiers are applied to this recognition task. These classifiers are created using different decision tree induction methods. The algorithms incorporate different criteria to select attributes in the nodes of the trees. Moreover, some of them apply stopping criteria, whereas the others perform tree pruning. The classification accuracy of the decision trees is estimated on data taken from musical scores. Eventually the usefulness of decision trees in the recognition of printed musical symbols is evaluated.","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":"133698540","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":"Koala graph coloring library: An open graph coloring library for real-world applications","authors":"T. Dobrowolski, D. Dereniowski, L. Kuszner","doi":"10.1109/INFTECH.2008.4621641","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621641","url":null,"abstract":"A lot of research has been done in the field of graph coloring, yet there are no publicly released libraries available. This paper introduces such a library. This library is designed to meet several important criteria for industrial applications. Most importantly, it is designed with performance in mind. Several heuristic algorithms are implemented to deal with the NP-completeness. Further optimizations are done at the code level. The library is written in C++ with components that can be used independently. Upon completion, Koala will be released as open source, and free for educational use.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"42 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":"124462722","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 use of radio frequency identification to track samples in bio-repositories","authors":"Atieh Zarabzadeh, R. Watson, J. Grimson","doi":"10.1109/INFTECH.2008.4621657","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621657","url":null,"abstract":"Bio-repositories are resources for storing biological samples and data to support the discovery of biomarkers, therapeutic targets, and the underlying causes of diseases. The success of this knowledge discovery process depends critically on the quality of samples and their associated data. Biological samples are expensive to collect and store. The samples and their associated data pass through a number of processes, generally in multiple locations, from data collection from the participant, to clinical laboratory analyses, to processing in the research laboratory (proteomics, metablomics, etc.) and ultimately to knowledge discovery. The samples are moved in and out of freezers at several different points in this workflow. The potential for errors in sample identification and linking the corresponding data to its sample is therefore very high. This paper describes a novel method based on Radio Frequency Identification (RFID) technology to support secure and reliable tracking of both samples and data which minimises the potential for error. The samples are labelled with RFID tags, which allow location-independent recording and updating of sample data as they move along the workflow. The system is linked to a web-based database, which provides the ability to identify and locate individual or group of samples rapidly.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"65 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":"115946718","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":"Description logic as a common software engineering artifacts language","authors":"Pawel Kaplanski","doi":"10.1109/INFTECH.2008.4621672","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621672","url":null,"abstract":"Description logic is proposed as a powerful language able to support chosen software engineering process tasks like: requirements engineering, software architecture definition, software design and configuration management. To do this there is presented a correspondence between description logic and UML. Description logic based integrated software engineering process framework is proposed which owing to automatic knowledge inferring systems (reasoners) that are able to preserve logical cohesion in described ontologies, makes full integration of artifacts created by software analyst, designer and programmer, possible. Strong logical connection between these artifacts is useful in other tasks like: reverse engineering or design constraints preservation.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"399 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":"115202135","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 the construction of Decisional DNA: A reflexive knowledge structure","authors":"C. Sanín, E. Szczerbicki","doi":"10.1109/INFTECH.2008.4621580","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621580","url":null,"abstract":"Some of the most complicated issues about knowledge are its acquisition and its conversion into explicit and usable knowledge. Nevertheless, among all knowledge forms, storing decisional experience in a knowledge-explicit way becomes an important advance. We introduce the decisional DNA as a reflexive knowledge structure able of capturing organizations' decisional fingerprints in the form of explicit decisional experience. The construction of the decisional DNA is a journey that starts with a decisional event. This decisional event builds up a Set of experience knowledge structure (SOEKS) establishing a decisional gene. Multiple decisional genes comprise decisional chromosomes, and multiple decisional chromosomes lead to the construction of the decisional DNA of an organization. In addition, current implementations and future trends of the decisional DNA are presented through the introduction of emerging semantic technologies and applications turning the decisional DNA into a reflexive knowledge structure.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"37 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":"127214298","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}