<abstract xmlns="http://www.w3.org/1999/xhtml"><italic> - </italic>This paper focuses on the experimental analysts of Contract NET protocol for Multi-Robot task allocation. The problem domain consists of multiple vacuum cleaning robots that need to cooperate for cleaning an area that is beyond the capabilities of a single robot. A robot simulator has been used to experiment with various area and robot locations, and the summary of the effort required to process the tasks has been recorded. Experimental results show that using Contract NET protocol alone is not sufficient to achieve optimal results in task allocation. A more advanced strategy with or without involving the Contract NET protocol is required. Possible strategies are outlined and their analysis is the subject of the future work. </abstract>

Experimental analysis of contract net protocol in multi-robot task allocation

<abstract xmlns="http://www.w3.org/1999/xhtml"><italic>- </italic>Controlling robots using a multi-agent system is becoming an active research area which includes a lot of challenges regarding localization, management, coordination, task allocation, etc. It is a very important for a human to overview such a system visually - to monitor a robot status, performance and other characteristics. At the same time some concepts relate to all such systems - robots act in certain environment, where there are different kinds of obstacles and objects. In order to fasten initiation of such visualization tools, a new framework is proposed - “Mapclipse” which is based on the popular Eclipse framework. The purpose of the framework is to create a common domain model, API for its management (like reflecting object movements, environment modifications, etc.), a basis for common visualization tasks and provide a means to customize the figures of specific types of objects. This paper describes the concept of the system in detail, the current prototype of framework, some of its extensions, as well as highlights the main challenges in the future.</abstract>

The generic map visualization framework

<abstract xmlns="http://www.w3.org/1999/xhtml">An important prerequisite for creation of an autonomous robot is the ability to create the map of the environment. While the use of robot teams becomes more and more widely used, the issue of robot coordination becomes one of the central questions to be addressed. If multiple robots are used for the exploration of the environment, their collected information has to be fused into one general global map. This problem is called map merging. In the case, when more than two robots map the environment, it is possible that the order of map merging can influence the quality of the result - the global map. However, most researches in the map merging field address the problem as if the recommended order of map merging were known. The goal of this paper is to prove that the merging order can greatly influence the resulting global map and discuss the consequences this knowledge makes in the mapping process. </abstract>

The influence of the map merging order on the resulting global map in multi-robot mapping

<abstract xmlns="http://www.w3.org/1999/xhtml"><italic> - </italic>This paper proposes the approach to a concept map merging using methods and tools developed for the same task in the domain of ontologies. The developed method is based on ideas that concept maps and ontologies have structural similarities, and mutual transformations between them are possible therefore tools and methods suitable for ontologies can be applied to concept maps. Concept map merging is necessary to extend the functionality of intelligent concept map-based knowledge assessment system IKAS for reuse of captured concept maps. </abstract>

Ontology merging in the context of concept maps

<abstract xmlns="http://www.w3.org/1999/xhtml"><italic></italic>In concept map-based assessment an expert’s concept map can be expanded using graph patterns to add hidden and inverse relations. This helps to avoid forcing a learner to use certain structures and names. Graph patterns are subgraphs that describe combinations of concept map elements, from which extra relations can be inferred. In this paper an enriched set of graph patterns is described along with their respective IF...THEN rules which can be used for automated knowledge assessment. Some of them are already implemented in the intelligent and adaptive knowledge assessment system IKAS.</abstract>

Usage of graph patterns for concept map extension

<abstract xmlns="http://www.w3.org/1999/xhtml"><italic></italic>Modern intelligent systems are built from intelligent agents, but usually agent interaction mechanisms are described at the general level omitting design and implementation details. The paper presents aspects of practical implementation of agent interaction mechanisms in JADE platform on the basis of the set of agents for modelling student’s emotions in intelligent tutoring systems. The concepts of an intelligent and affective tutoring system, agent, and agent interaction are explained, as well. </abstract>

Design and implementation of agent interaction mechanisms for emotionally intelligent tutoring systems

<abstract xmlns="http://www.w3.org/1999/xhtml"><italic></italic>The tagging mechanism is a technique that can be used to implement the personalized collaboration in the e-Learning systems, thereby increasing the efficiency of such a system. Semantic Web technologies can be used to enhance tags with machine-readable annotations to improve the accuracy of tag-based recommendation services.The novelty of the proposed approach is the combined use of the Semantic Web technologies and the reuse-oriented model in the development of the e-Learning environment. </abstract>

Integration of the tagging mechanism in the collaborative e-learning system

<abstract xmlns="http://www.w3.org/1999/xhtml"><italic></italic>the article addresses the existing problems found in the area of Domain-Specific Languages (DSLs). Being a widely adopted programming technique, DSL grammar creation process still lacks desirable traceability and automation. The paper proposes a sequential model transformation process based on Model-Driven Architecture concepts as one of the potential solutions to stated problem. One of the main results of the research work is the implementation of prototype of the full-cycle model transformation chain starting from the UML domainmodel and ending with internal Java-based DSL grammar implementation. </abstract>

Transformation of UML class diagram to internal java domain-specific language

<abstract xmlns="http://www.w3.org/1999/xhtml"><italic></italic>The paper discusses application of the topological functioning model (TFM) of the system for its automated transformation to behavioural specifications such as UML Activity Diagram, BPMN diagrams, scenarios, etc. The paper addresses a lack of formal specification of causal relations between functional features of the TFM by using inference means suggested by classical logic. The result is reduced human participation in the transformation as well as additional check of analysis and specification of the system. </abstract>

Notion of causal relations of the topological functioning model

<abstract xmlns="http://www.w3.org/1999/xhtml">Geographic Information Systems (GIS) perform the computational processing of geographic data and store the geometry and the attributes of data that are geo-referenced, that is, situated on the earth surface and represented in a cartographic projection. Integral part of GIS functionality is an opportunity to make a complex analysis, which is able to integrate geo-referenced imagery as data layers or themes and link them to other data sets producing geospatial renderings of data. Based on Service-Oriented Architecture (SOA) GIS expose its capabilities as Web services with purpose to create a flexible and extensible GIS that can quickly respond to changing and future organizational needs. In that case client’s application sends specially formed requests to the GIS services and ensures visual processing of responses. But the drawback is the count of such requests, because imaginary data and data needed for analysis are received sequentially (not simultaneously). The purpose of this paper is to present the solution of decreasing the amount of geo-requests, enabling extensions to existing GIS visual analysis tools and bringing into GIS SOA synchronization mechanism designed on principles of concatenated steganography. This ensures that various geospatial data streams will be kept, transmitted and analytically processed together using concatenated steganography, strongly taking into account mutual relations between these streams. </abstract>

Using Concatenated Steganography for Visual Analysis in GIS SOA

AHEAD OF PRINT

Volume 28 (2023): Issue 2 (December 2023)

Volume 28 (2023): Issue 1 (June 2023)

Volume 27 (2022): Issue 2 (December 2022)

Volume 27 (2022): Issue 1 (June 2022)

Volume 26 (2021): Issue 2 (December 2021)

Volume 26 (2021): Issue 1 (May 2021)

Volume 25 (2020): Issue 2 (December 2020)

Volume 25 (2020): Issue 1 (May 2020)

Volume 24 (2019): Issue 2 (December 2019)

Volume 24 (2019): Issue 1 (May 2019)

Volume 23 (2018): Issue 2 (December 2018)

Volume 23 (2018): Issue 1 (May 2018)

Volume 22 (2017): Issue 1 (December 2017)

Volume 21 (2017): Issue 1 (May 2017)

Volume 20 (2016): Issue 1 (December 2016)

Volume 19 (2016): Issue 1 (May 2016)

Volume 18 (2015): Issue 1 (December 2015)

Volume 17 (2015): Issue 1 (May 2015)

Volume 16 (2014): Issue 1 (December 2014)

Volume 15 (2014): Issue 1 (July 2014)

Volume 14 (2013): Issue 1 (June 2013)

Volume 13 (2012): Issue 1 (October 2012)

Applied Computer Systems

 The Journal Applied Computer Systems is an open access scientific journal published biannually in May and December. The journal serves for experience generation in computer science and information technologies use in different applications and is a source of information for the industry practitioners, for academic personnel and students.  The journal publishes research papers describing new results, original ideas and applications or reports on the development and maintenance of actual systems addressing issues concerning theory, development, management and applications of advanced applied computer science.  The topics covered by the journal are:   Artificial Intelligence  Computer Applications  Data  Information Technology and Systems  Programming Technologies  Software Engineering   Besides, the reader will find papers on conception of framework for automated creation of graph visualisation systems, theoretical basis and practical usage of simulation for creating solutions for data management systems, modelling of software systems and business processes, comparison of programming languages, intelligent tutoring systems, semantic web development, applications of cloud-based services, issues of dynamic wireless networks, as well as surveys and papers focused on different other specific topics.  The aim of the publishers is to encourage the applied research by granting free publication possibilities to professionals in the software field, young scientists and doctoral students.  The authors of articles are researchers from various educational and research institutions and companies not only from different European countries, but also from Africa, North and South America, Asia and Australia.  Rejection Rate   47%   Publication History 　  Currently known as Applied Computer Systems 2012 – current, ISSN 2255-8683 (print), ISSN 2255-8691 (online).Formerly known as Scientific Journal of Riga Technical University, Series Computer Science. Applied Computer Systems 2000–2011, ISSN 1407-7493 (print).In 2012 the journal Applied Computer Systems separated from the RTU journal series Computer Science and the present volume numbering reflects the number of journals published within the series since 2000.   Archiving  Sciendo archives the contents of this journal in Portico - digital long-term preservation service of scholarly books, journals and collections.  Plagiarism Policy  The editorial board is participating in a growing community of Similarity Check System's users in order to ensure that the content published is original and trustworthy. Similarity Check is a medium that allows for comprehensive manuscripts screening, aimed to eliminate plagiarism and provide a high standard and quality peer-review process. 