Karina Ruby Perez-Daniel, E. E. Hernández, M. Nakano-Miyatake, H. Meana
{"title":"An Atomic function-based approach of Harris Affine detector","authors":"Karina Ruby Perez-Daniel, E. E. Hernández, M. Nakano-Miyatake, H. Meana","doi":"10.1109/SoMeT.2013.6645678","DOIUrl":"https://doi.org/10.1109/SoMeT.2013.6645678","url":null,"abstract":"This paper propose a new interest point detector, denominated Atomic Harris-Affine detector, in which the Gaussian function is replaced by a 2D up(x,y) Atomic function (AF). Proposed scheme takes advantage of the desirable characteristics of AF, such as compact support and low spectral leakage. The simulation results show that proposed detector improves repeatability and convergence rate on, 15% and 20%, respectively, compared with the conventional one under several image conditions, such as illumination, viewpoints, blurring level, rotation angle, scaling factor and JPEG lossy compression rate. Also the detection accuracy of proposed detector allows a faster detection of interest points compared with the conventional one.","PeriodicalId":447065,"journal":{"name":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129871084","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":"Removing Code Duplication with Roles","authors":"Fernando Sérgio Barbosa, Ademar Aguiar","doi":"10.1109/SoMeT.2013.6645656","DOIUrl":"https://doi.org/10.1109/SoMeT.2013.6645656","url":null,"abstract":"The existence of replicated code in a system makes that system harder to maintain and evolve. To remove replicated code the usual way is to use refactorings. However there are always clones that cannot be removed by refactorings alone. Some are due to lack of composition mechanisms in the underlying programming language. We propose the use of roles to remove such clones since roles provide a finer degree of composition. We sketch four role refactorings to remove code clones and apply them in a case study using the JHotDraw framework. Results show that roles have a positive impact in clone reduction as they were able to remove almost all clones traditional refactorings could not.","PeriodicalId":447065,"journal":{"name":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131478302","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":"Ontology-based program shell for building and editing multilingual thesauri of subject domains","authors":"Y. Zagorulko, G. Zagorulko","doi":"10.1109/SOMET.2013.6645680","DOIUrl":"https://doi.org/10.1109/SOMET.2013.6645680","url":null,"abstract":"The paper presents a program shell for building and editing multilingual electronic thesauri, whose general structure, as well as composition of the thesaurus entries and the set of relations between the terms, meets the international and Russian standards. Using this shell, experts (i.e. specialists in a certain subject domain) can build multilingual thesauri for arbitrary languages and subject domains without the help of programmers and knowledge engineers. The shell is ontology-based, which provides not only the possibility of extending the set of relations between the terms and the integrity and consistency of the terminology system of the created thesaurus but also a convenient access to its content.","PeriodicalId":447065,"journal":{"name":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126055757","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":"Towards Design-by-Contract based software architecture design","authors":"M. Ozkaya, C. Kloukinas","doi":"10.1109/SoMeT.2013.6645654","DOIUrl":"https://doi.org/10.1109/SoMeT.2013.6645654","url":null,"abstract":"Design-by-Contract (DbC) gained wide familiarity among software developers for specifying software. It aids in documenting the behaviour of class methods as contracts between clients of the methods (pre-) and their suppliers (post-condition). This not only allows developers to document software behaviour precisely at such a high-level that can more easily be communicated, but also enables the formal verification of the behaviour. In this paper, we provide a comprehensive extension to DbC so that it can also be applied to the level of software architecture design. We illustrate this through our architecture description language XCD. Components in XCD have four different types of interfaces: provided and required interfaces of methods or emitter and consumer interfaces of events where methods/events are contractually specified. Contract specification is separated into functional and interaction contracts thus modularising the functional and interaction component behaviours. Furthermore, treating interaction protocols as connectors, XCD allows to specify connectors with interaction contracts that participating components adhere to. The formal semantics of XCD are defined using Finite State Process (FSP) thus enabling formal analysis of contractually specified software architectures for quality properties, e.g., deadlock.","PeriodicalId":447065,"journal":{"name":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114706839","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":"Service oriented movie-based programming environment","authors":"Ruth Cortez, Hayato Tan, A. Vazhenin, D. Vazhenin","doi":"10.1109/SoMeT.2013.6645648","DOIUrl":"https://doi.org/10.1109/SoMeT.2013.6645648","url":null,"abstract":"Movie-based (MB) programming environment is a visual programming platform for creating algorithms and programs applying animation frames with computational and sensible operations. It facilitates the user's understanding and debugging of a program by coloring correlated areas of structures, introducing appropriate computational formulas as well as specifying algorithmic and logical behavior of those areas. The goal of the presented work is adapting the current system to Service-oriented Architecture in order to organize a sharable storage and server-based execution of MB-programs and algorithms. Therefore, the MB-programs/algorithms could be shared and reused by different developers. In this paper, features of MB-programming paradigm and the corresponding software are presented, which are used to enhance capabilities for data/knowledge and execution management. In the framework of Virtual-MVC design pattern, the MB-management architecture, component's design steps and a prototype of service-oriented MB-programming environment are discussed, including concepts and examples of usage.","PeriodicalId":447065,"journal":{"name":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117110715","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":"Clustered Computing with NetLogo for the evaluation of asynchronous search techniques","authors":"I. Muscalagiu, H. Popa, J. Vidal","doi":"10.1109/SoMeT.2013.6645651","DOIUrl":"https://doi.org/10.1109/SoMeT.2013.6645651","url":null,"abstract":"Distributed Constraint programming is a programming approach used to describe and solve large classes of problems such as searching, combinatorial and planning problems. A Distributed Constraint Satisfaction is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Modelling and simulation are essential tools in many areas of science and engineering, including computer science. The purpose of this article is to present an open-source tools in NetLogo for implementation and evaluation of the asynchronous searching techniques for a great number of agents, tool that can be run on a cluster of computers. Also, in this paper we have developed a methodology to run the NetLogo models in a cluster computing environment or on a single machine, varying both parameter values and/or random number of agents. Such a tool allows using various search techniques also the evaluation and analysis of performances of the techniques for the asynchronous searching techniques, the study of agents behaviour in several situations, like the priority order of the agents, the synchronous and asynchronous case, apparition of delays in message transmission, leading, therefore, to identifying possible enhancements of the performances of asynchronous search techniques.","PeriodicalId":447065,"journal":{"name":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124731422","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":"Prediction of project problem effects on software risk factors","authors":"M. Ozgur Cingiz, Ahmet Unudulmaz, O. Kalipsiz","doi":"10.1109/SoMeT.2013.6645641","DOIUrl":"https://doi.org/10.1109/SoMeT.2013.6645641","url":null,"abstract":"Software risks can be defined as uncertainty and loss in project process. Software risk management consists of risk identification, estimation, refinement, mitigation, monitoring and maintenance steps. In our study we focus on prediction of project problem effects that can cause loss in software project in terms of their values on risk factors and also we want to rank our risk factors to observe how they can give detail about project problem effects separately. For these purpose five classification methods for prediction of problem impact and two filter feature selection methods for ranking importance of risk factors are used in this study.","PeriodicalId":447065,"journal":{"name":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123296729","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 reason to optimize information processing with a core property of natural language","authors":"A. Sciullo","doi":"10.1109/SoMeT.2013.6645660","DOIUrl":"https://doi.org/10.1109/SoMeT.2013.6645660","url":null,"abstract":"We focus on a property of natural language enabling the processing of information conveyed by linguistic expressions: structural asymmetry. We provide evidence that structural asymmetry is a property of argument structure. We focus on Information Retrieval and Question Answering systems and we provide evidence that these systems fail to recover natural language argument structure asymmetrical relations and thus they may fail to retrieve relevant documents from large databases and to provide relevant answers to questions. The processing of the underlying asymmetric relations will contribute to the optimization of Information Retrieval and Question Answering systems.","PeriodicalId":447065,"journal":{"name":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133711974","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":"Dependencies in business process rule hierarchies","authors":"E. Pulvermüller, A. Speck, Sven Feja, Sören Witt","doi":"10.1109/SoMeT.2013.6645663","DOIUrl":"https://doi.org/10.1109/SoMeT.2013.6645663","url":null,"abstract":"Automated checking concepts for business process models support human testers considerably by saving time. However, this new checking ability results in a comparatively large number of rules representing requirements. But without a comprehensible representation of the relations between the rules on the one hand its hard to keep track on the validated rules and on the other hand to correctly interpret the validation results. In this paper we propose an improvement for the automated validation of business process models by offering elements to create abstract rules and arranging these rules in hierarchies. Top-down and bottom-up testing are supported by stepwise activating (and validating) the rules starting from the top of the hierarchy (or bottom respectively). Moreover, the rule hierarchies may be reused when similar systems are to be validated by configuring a valid rule sub-set for the specific business process system.","PeriodicalId":447065,"journal":{"name":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116468803","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":"Visualization of movie features in collaborative filtering","authors":"B. Németh, G. Takács, I. Pilászy, D. Tikk","doi":"10.1109/SoMeT.2013.6645674","DOIUrl":"https://doi.org/10.1109/SoMeT.2013.6645674","url":null,"abstract":"In this paper we will describe a modification of the matrix factorization (MF) algorithm which allows visualizing the user and item characteristics. When applying MF for collaborative filtering, we get a model that represents the attributes of users and items by feature vectors. Some elements of these vectors may have understandable meaning for humans but due to the lack of internal connections between the feature vectors, these are difficult to visualize. In this paper we give a detailed description of a MF method enabling better visualization of features by arranging them into a 2D map, where via the calculation of the feature values we try to position features with similar “meaning” close to each other. To achieve this first we define a neighborhood relation on features, then we modify the MF so that we introduce a new term in the error function which penalize the difference between the neighbor features. We show that this modification slightly decrease the accuracy of the model but we get well visualized feature maps. On the feature maps meanings can be associated with regions, and so we can provide an interesting explanation for the user why he/she was recommended the movie. Such plausible explanations may result in that users will better understand how the system works, which can also increase customer loyalty towards the service provider.","PeriodicalId":447065,"journal":{"name":"2013 IEEE 12th International Conference on Intelligent Software Methodologies, Tools and Techniques (SoMeT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114178534","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}