{"title":"Separation of crosscutting concerns at the design level: An extension to the UML metamodel","authors":"Adam Przybyłek","doi":"10.1109/IMCSIT.2008.4747297","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747297","url":null,"abstract":"Aspect-oriented programming (AOP) was proposed as a way of improving the separation of concerns at the implementation level by introducing a new kind of modularization unit - an aspect. Aspects allow programmers to implement crosscutting concerns in a modular and well-localized way. As a result, the well-known phenomena of code tangling and scattering are avoided. After a decade of research, AOP has gained acceptance within bot academia and industry. The current challenge is to incorporate aspect-oriented (AO) concepts into the software design phase. Since AOP is built on top of OOP, it seems natural to adapt UML to AO design. In this context the author introduces an extension to the UML metamodel to support aspect-oriented modelling.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"23 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121013248","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 Semantic aware Access Control model with real time constraints on history of accesses","authors":"A. Ravari, M. Amini, R. Jalili","doi":"10.1109/IMCSIT.2008.4747338","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747338","url":null,"abstract":"With the advent of semantic technology, access control cannot be done in a safe way unless the access decision takes into account the semantic relationships among the entities in a semantic-aware environment. SBAC model considers this issue in its decision making process. However, time plays a crucial role in new computing environments which is not supported in the model. In this paper we introduce the Temporal Semantic Based Access Control model (TSBAC), as an extension of SBAC, which enhances the specification of user-defined authorization rules by constraining time interval and temporal expression over userspsila history of accesses. A formal semantics for temporal authorizations is provided and conflicting situations (due to the semantic relations of the SBAC model and a sub-interval relation between authorizations) are investigated and resolved in our proposed model. An architecture for the access control system based on the proposed model is presented, and finally, we discuss and evaluate TSBAC.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124485793","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":"CompactRIO embedded system in Power Quality Analysis","authors":"P. Bilik, L. Koval, Jiri Hajduk","doi":"10.1109/IMCSIT.2008.4747301","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747301","url":null,"abstract":"Electrical measurement department of VSB-Technical University has been involved for more than 14 years in research and development of power quality analyzer built on virtual instrumentation technology. PC-based power quality analyzer with National Instruments data acquisition board was designed and developed in this time frame. National Instruments LabVIEW is used as the development environment for all parts of power quality analyzer software running under MS Windows OS. Proved PC-based firmware was ported to new hardware platform for virtual instrumentation - National Instruments CompactRIO at the end of 2007. Platform change from PC to CompactRIO is not just code recompilation, but it brings up many needs for specific software redesigns. Paper describes how the monolithic executable for PC-based instruments was divided into three software layers to be ported on CompactRIO platform. The code for different parts of CompactRIO instrument is developed in a unified development environment no matter if the code is intended for FPGA, real-time processor of PC running Windows OS.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125448559","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 acquisition of wordnet relations by the morpho-syntactic patterns extracted from the corpora in Polish","authors":"Roman Kurc, Maciej Piasecki","doi":"10.1109/IMCSIT.2008.4747237","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747237","url":null,"abstract":"In the paper we present an adaptation of the Espresso algorithm of the extraction of lexical semantic relation to specific requirements of Polish. The introduced changes are of more technical character like the adaptation to the existing Polish language tools, but also we investigate the structure of the patterns that takes into account specific features of Polish as an inflectional language. A new method of the reliability measure computation is proposed. The modified version of the algorithm called Estratto was compared with the more direct reimplementation of Espresso on several corpora of Polish. We tested the influence of different algorithm parameters and different corpora on the received results.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125841068","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 differential evolution and exponential crossover","authors":"J. Tvrdík","doi":"10.1109/IMCSIT.2008.4747353","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747353","url":null,"abstract":"Several adaptive variants of differential evolution are described and compared in two sets of benchmark problems. The influence of exponential crossover on efficiency of the search is studied. The use of both types of crossover together makes the algorithms more robust. Such algorithms are convenient for the real-world problems, where we need an adaptive algorithm applicable without time-wasting parameter tuning.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134257446","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":"Multilevel localization for Mobile Sensor Network platforms","authors":"Jae-Young Park, H. Song","doi":"10.1109/IMCSIT.2008.4747320","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747320","url":null,"abstract":"For a set of mobile sensor network, a precise localization is required in order to maximize the utilization of mobile sensor network. As well, mobile robots also need a precise localization mechanism for the same reason. In this paper, we showed a combination of various localization mechanisms. Localization can be classified in three big categories: long distance localization with low accuracy, medium distance localization with medium accuracy, and short distance localization with high accuracy. In order to present localization methods, traditional map building technologies such as grid maps or topological maps can be used. We implemented mobile sensor vehicles and composed mobile sensor network with them. Each mobile sensor vehicles act as a mobile sensor node with the facilities such as autonomous driving, obstacle detection and avoidance, map building, communication via wireless network, image processing and extensibility of multiple heterogeneous sensors. For localization, each mobile sensor vehicle has abilities of the location awareness by mobility trajectory based localization, RSSI based localization and computer vision based localization. With this set of mobile sensor network, we have the possibility to demonstrate various localization mechanisms and their effectiveness. In this paper, the preliminary result of sensor mobility trail based localization and RSSI based localization will be presented.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129392258","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":"Image similarity detection in large visual data bases","authors":"J. Kulikowski","doi":"10.1109/IMCSIT.2008.4747236","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747236","url":null,"abstract":"A method of similarity clusters detection in large visual databases is described in this work. Similarity clusters have been defined on the basis of a general concept of similarity measure. The method is based also on the properties of morphological spectra as a tool for image presentation. In the proposed method similarity of selected spectral components in selected basic windows are used to similarity of images evaluation. Similarity clusters are detected in an iterative process in which non-perspective subsets of images are step-by-step removed from considerations. In the method similarity graphs and hyper-graphs also play an auxiliary role. The method is illustrated by an example of a collection of medical images in which similarity clusters have been detected.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131184571","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 robustness of the soft state for task scheduling in large-scale distributed computing environment","authors":"H. Tada, M. Imase, M. Murata","doi":"10.1109/IMCSIT.2008.4747285","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747285","url":null,"abstract":"In this paper, we consider task scheduling in distributed computing. In distributed computing, it is possible that tasks fail, and it is difficult to get accurate information about hosts and tasks. WQR (workqueue with replication), which was proposed by Cirne et al., is a good algorithm because it achieves a short job-completion time without requiring any information about hosts and tasks. However, in order to use WQR for distributed computing, we need to resolve some issues on task failure detection and task cancellation. For this purpose, we examine two approaches-the conventional task timeout method and the soft state method. Simulation results showed that the soft state method is more robust than the task timeout method.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"23 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132938128","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. Kotowski, W. Kosinski, Z. Michalewicz, P. Synak, Lukasz Brocki
{"title":"On classification tools for genetic algorithms","authors":"S. Kotowski, W. Kosinski, Z. Michalewicz, P. Synak, Lukasz Brocki","doi":"10.1109/IMCSIT.2008.4747234","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747234","url":null,"abstract":"Some tools to measure convergence properties of genetic algorithms are introduced. A classification procedure is proposed for genetic algorithms based on a conjecture: the entropy and the fractal dimension of trajectories produced by them are quantities that characterize the classes of the algorithms. The role of these quantities as invariants of the algorithm classes is discussed together with the compression ratio of points of the genetic algorithm.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"339 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133357569","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":"Improving Naïve Bayes models of insurance risk by unsupervised classification","authors":"A. Jurek, D. Zakrzewska","doi":"10.1109/IMCSIT.2008.4747230","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747230","url":null,"abstract":"In the paper application of Naive Bayes model, for evaluation of the risk connected with life insurance of customers, is considered. Clients are classified into groups of different insurance risk levels. There is proposed to improve the efficiency of classification by using cluster analysis in the preprocessing phase. Experiments showed that, however the percentage of correctly qualified instances is satisfactory in case of Naive Bayes classification, but the use of cluster analysis and building separate models for different groups of clients improve significantly the accuracy of classification. Finally, there is discussed increasing of efficiency by using cluster validation techniques or tolerance threshold that enables obtaining clusters of very good quality.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115580841","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}