Rivista e Edizione

Volume 22 (2022): Edizione 3 (September 2022)

Volume 22 (2022): Edizione 2 (June 2022)

Volume 22 (2022): Edizione 1 (March 2022)

Volume 21 (2021): Edizione 4 (December 2021)

Volume 21 (2021): Edizione 3 (September 2021)

Volume 21 (2021): Edizione 2 (June 2021)

Volume 21 (2021): Edizione 1 (March 2021)

Volume 20 (2020): Edizione 6 (December 2020)
Special Edizione on New Developments in Scalable Computing

Volume 20 (2020): Edizione 5 (December 2020)
Special issue on Innovations in Intelligent Systems and Applications

Volume 20 (2020): Edizione 4 (November 2020)

Volume 20 (2020): Edizione 3 (September 2020)

Volume 20 (2020): Edizione 2 (June 2020)

Volume 20 (2020): Edizione 1 (March 2020)

Volume 19 (2019): Edizione 4 (November 2019)

Volume 19 (2019): Edizione 3 (September 2019)

Volume 19 (2019): Edizione 2 (June 2019)

Volume 19 (2019): Edizione 1 (March 2019)

Volume 18 (2018): Edizione 5 (May 2018)
Special Thematic Edizione on Optimal Codes and Related Topics

Volume 18 (2018): Edizione 4 (November 2018)

Volume 18 (2018): Edizione 3 (September 2018)

Volume 18 (2018): Edizione 2 (June 2018)

Volume 18 (2018): Edizione 1 (March 2018)

Volume 17 (2017): Edizione 5 (December 2017)
Special Edizione With Selected Papers From The Workshop “Two Years Avitohol: Advanced High Performance Computing Applications 2017

Volume 17 (2017): Edizione 4 (November 2017)

Volume 17 (2017): Edizione 3 (September 2017)

Volume 17 (2017): Edizione 2 (June 2017)

Volume 17 (2017): Edizione 1 (March 2017)

Volume 16 (2016): Edizione 6 (December 2016)
Special issue with selection of extended papers from 6th International Conference on Logistic, Informatics and Service Science LISS’2016

Volume 16 (2016): Edizione 5 (October 2016)
Edizione Title: Special Edizione on Application of Advanced Computing and Simulation in Information Systems

Volume 16 (2016): Edizione 4 (December 2016)

Volume 16 (2016): Edizione 3 (September 2016)

Volume 16 (2016): Edizione 2 (June 2016)

Volume 16 (2016): Edizione 1 (March 2016)

Volume 15 (2015): Edizione 7 (December 2015)
Special Edizione on Information Fusion

Volume 15 (2015): Edizione 6 (December 2015)
Special Edizione on Logistics, Informatics and Service Science

Volume 15 (2015): Edizione 5 (April 2015)
Special Edizione on Control in Transportation Systems

Volume 15 (2015): Edizione 4 (November 2015)

Volume 15 (2015): Edizione 3 (September 2015)

Volume 15 (2015): Edizione 2 (June 2015)

Volume 15 (2015): Edizione 1 (March 2015)

Volume 14 (2014): Edizione 5 (December 2014)
Special Edizione

Volume 14 (2014): Edizione 4 (December 2014)

Volume 14 (2014): Edizione 3 (September 2014)

Volume 14 (2014): Edizione 2 (June 2014)

Volume 14 (2014): Edizione 1 (March 2014)

Volume 13 (2013): Edizione Special-Edizione (December 2013)

Volume 13 (2013): Edizione 4 (December 2013)
The publishing of the present issue (Volume 13, No 4, 2013) of the journal “Cybernetics and Information Technologies” is financially supported by FP7 project “Advanced Computing for Innovation” (ACOMIN), grant agreement 316087 of Call FP7 REGPOT-2012-2013-1.

Volume 13 (2013): Edizione 3 (September 2013)

Volume 13 (2013): Edizione 2 (June 2013)

Volume 13 (2013): Edizione 1 (March 2013)

Volume 12 (2012): Edizione 4 (December 2012)

Volume 12 (2012): Edizione 3 (September 2012)

Volume 12 (2012): Edizione 2 (June 2012)

Volume 12 (2012): Edizione 1 (March 2012)

Dettagli della rivista
Formato
Rivista
eISSN
1314-4081
Pubblicato per la prima volta
13 Mar 2012
Periodo di pubblicazione
4 volte all'anno
Lingue
Inglese

Cerca

Volume 19 (2019): Edizione 4 (November 2019)

Dettagli della rivista
Formato
Rivista
eISSN
1314-4081
Pubblicato per la prima volta
13 Mar 2012
Periodo di pubblicazione
4 volte all'anno
Lingue
Inglese

Cerca

9 Articoli
Accesso libero

An Algorithm for Mining High Utility Sequential Patterns with Time Interval

Pubblicato online: 11 Dec 2019
Pagine: 3 - 16

Astratto

Abstract

Mining High Utility Sequential Patterns (HUSP) is an emerging topic in data mining which attracts many researchers. The HUSP mining algorithms can extract sequential patterns having high utility (importance) in a quantitative sequence database. In real world applications, the time intervals between elements are also very important. However, recent HUSP mining algorithms cannot extract sequential patterns with time intervals between elements. Thus, in this paper, we propose an algorithm for mining high utility sequential patterns with the time interval problem. We consider not only sequential patterns’ utilities, but also their time intervals. The sequence weight utility value is used to ensure the important downward closure property. Besides that, we use four time constraints for dealing with time interval in the sequence to extract more meaningful patterns. Experimental results show that our proposed method is efficient and effective in mining high utility sequential pattern with time intervals.

Parole chiave

  • Datamining
  • sequential pattern
  • time interval
  • high utility
Accesso libero

Agile Project Management Tools: A Brief Comprative View

Pubblicato online: 11 Dec 2019
Pagine: 17 - 25

Astratto

Abstract

Agile methodologies are becoming popular in software development. Managers are required to understand project’s progress and product quality without development documents. During Agile practices of the teams and organizations, Agile project management tools are frequently used. The use of such tools leads to achieving speed and efficiency, affects the quality of the software. The quality of final product is mostly related with to project management. Accordingly, the paper provides brief comparative perspective about the popular project management tools for agile projects. 16 popular Agile project management tools have been presented helping agile developers to plan and manage their tasks in an efficient manner. Taiga, Axosoft, Agielan, Planbox are more appropriate for start-up projects. The most twitted and most appreciated tools are reported as Jira, Trello, and VersionOne. SpiraTeam by Inflectra and Pivotal Tracker are other pricing and popular agile tools, providing flexibility to Agile developers and increase collaboration among team members.

Parole chiave

  • Agile Methodologies
  • Agile Project Management Tool
  • Tools
  • Software Project Management
Accesso libero

Particle Swarm Optimization and Tabu Search Hybrid Algorithm for Flexible Job Shop Scheduling Problem – Analysis of Test Results

Pubblicato online: 11 Dec 2019
Pagine: 26 - 44

Astratto

Abstract

The paper presents a hybrid metaheuristic algorithm, including a Particle Swarm Optimization (PSO) procedure and elements of Tabu Search (TS) metaheuristic. The novel algorithm is designed to solve Flexible Job Shop Scheduling Problems (FJSSP). Twelve benchmark test examples from different reference sources are experimentaly tested to demonstrate the performance of the algorithm. The obtained mean error for the deviation from optimality is 0.044%. The obtained test results are compared to the results in the reference sources and to the results by a genetic algorithm. The comparison illustrates the good performance of the proposed algorithm. Investigations on the base of test examples with a larger dimension will be carried out with the aim of further improvement of the algorithm and the quality of the test results.

Parole chiave

  • Flexible Job Shop Scheduling Problem (FJSSP)
  • Particle Swarm Optimization (PSO)
  • Tabu Search (TS)
Accesso libero

An Efficient Fault-Tolerant Scheduling Approach with Energy Minimization for Hard Real-Time Embedded Systems

Pubblicato online: 11 Dec 2019
Pagine: 45 - 60

Astratto

Abstract

In this paper, we focus on two major problems in hard real-time embedded systems fault tolerance and energy minimization. Fault tolerance is achieved via both checkpointing technique and active replication strategy to tolerate multiple transient faults, whereas energy minimization is achieved by adapting Dynamic Voltage Frequency Scaling (DVFS) technique. First, we introduce an original fault-tolerance approach for hard real-time systems on multiprocessor platforms. Based on this approach, we then propose DVFS_FTS algorithm for energy-efficient fault-tolerant scheduling of precedence-constrained applications. DVFS_FTS is based on a list scheduling heuristics, it satisfies real-time constraints and minimizes energy consumption even in the presence of faults by exploring the multiprocessor architecture. Simulation results reveal that the proposed algorithm can save a significant amount of energy while preserving the required fault-tolerance of the system and outperforms other related approaches in energy savings.

Parole chiave

  • Fault tolerance
  • Transient faults
  • Checkpointing
  • Active replication
  • Dynamic Voltage Frequency Scaling (DVFS)
  • Energy minimization
Accesso libero

QoS Routing Algorithm Based on Entropy Granularity in the Network Transmission

Pubblicato online: 11 Dec 2019
Pagine: 61 - 72

Astratto

Abstract

With the rapid development of computer networks, more hosts are connected to the Internet where they could communicate with each other. The need for network service has exceeded the service capacity of the network, and the Quality of Service (QoS) is gradually declining. Based on existing Shortest Path First (SPF) algorithm, this paper proposes a new QoS required transmission path approach by considering the overhead balance of network resources. This paper uses the entropy granularity as the main line in the application of routing protocols. Firstly, it researches the optimization of routing algorithms for network load balancing resources, routing algorithms based on link traffic distributing weights, link weight optimization based on adaptive genetic algorithm and computational intelligence based on entropy granularity theory. This research proposes a method to apply entropy granularity to Open Shortest Path First (OSPF) routing, including the implementation of the method. After that, a case study is presented by using some examples.

Parole chiave

  • Quality of Service (QoS)
  • routing
  • entropy
  • granularity
  • network communication
Accesso libero

Mission Critical Messaging Using Multi-Access Edge Computing

Pubblicato online: 11 Dec 2019
Pagine: 73 - 89

Astratto

Abstract

5th Generation (5G) mobile system is expected to support the requirements of mission critical communications for ultra reliability and availability, and very low latency. With the development of messaging and data transfer in mobile networks, mission critical communication users see more and more potential in data communications. In this paper, we explore the capabilities of Multi-access Edge Computing (MEC) that appears to be a key 5G component, to provide short messaging service at the network edge. The provided use cases illustrate the capabilities for transferring mobile originating and mobile terminating short messages to and from mission critical mobile edge applications. The data model describes the service resource structure and the Application Programming Interface definitions illustrate how the mobile edge applications can use the service. Some implementation aspects related to behavioral logic of the network and applications are provided. The performance analysis enables estimation of latency introduced by the service.

Parole chiave

  • Mission Critical Communications
  • Fifth Generation Mobile System
  • Edge Computing
  • Messaging Service
Accesso libero

Availability Modelling of Cluster-Based System with Software Aging and Optional Rejuvenation Policy

Pubblicato online: 11 Dec 2019
Pagine: 90 - 100

Astratto

Abstract

This investigation deals with modeling and availability analysis of cluster-based system inflicted with software aging. Software aging is a phenomenon in which a software system shows performance degradation with time and finally results in software failures. To cope up with this phenomenon, rejuvenation is an innovative concept to recover from software failures. As failures occur, server has the option either to take essential rejuvenation with probability p or may opt for optional rejuvenation with complementary probability q. To achieve high availability of the system, the concept of clustering is also taken into consideration. In this study, restart, reboot and standby concept is used for reducing the downtime cost. The sensitivity analysis of different parameters on system availability has been examined numerically. By integrating clustering, software aging and rejuvenation, the researchers intended to increase the availability and decrease the down time.

Parole chiave

  • Software aging
  • Cluster
  • Standby
  • Reboot
  • Optional rejuvenation
  • Availability
  • Downtime cost
Accesso libero

Development and Research of Information System Elements for Passengers Drive Comfort Improvement

Pubblicato online: 11 Dec 2019
Pagine: 101 - 115

Astratto

Abstract

Preliminary theoretical analyzes have been made, which show that heavy acceleration reduces comfort are available. This applies both to the acceleration when starting and stopping. High levels of acceleration are most common when braking. An analysis of passenger comfort based on accelerometer data and a survey was conducted. The speed of travel, the acceleration in the direction of accelerometer X axis, the rotation axis C have a significant influence on the degree of passenger discomfort. The results obtained complement and partly improve those from the available literature with a model using only one linear and one rotary axis, by which the discomfort is described with sufficient accuracy. A regression model has been obtained, which is a suitable basis for building a driver assistance system to provide passenger comfort in public road transport. A model of a “Driver Assistant” microprocessor system based on studies is proposed.

Parole chiave

  • Passenger drive comfort
  • Driver assistant system
  • Regression model
  • Graphical user interface
Accesso libero

Second Call for Papers AIMSA 2020

Pubblicato online: 11 Dec 2019
Pagine: 116 - 118

Astratto

9 Articoli
Accesso libero

An Algorithm for Mining High Utility Sequential Patterns with Time Interval

Pubblicato online: 11 Dec 2019
Pagine: 3 - 16

Astratto

Abstract

Mining High Utility Sequential Patterns (HUSP) is an emerging topic in data mining which attracts many researchers. The HUSP mining algorithms can extract sequential patterns having high utility (importance) in a quantitative sequence database. In real world applications, the time intervals between elements are also very important. However, recent HUSP mining algorithms cannot extract sequential patterns with time intervals between elements. Thus, in this paper, we propose an algorithm for mining high utility sequential patterns with the time interval problem. We consider not only sequential patterns’ utilities, but also their time intervals. The sequence weight utility value is used to ensure the important downward closure property. Besides that, we use four time constraints for dealing with time interval in the sequence to extract more meaningful patterns. Experimental results show that our proposed method is efficient and effective in mining high utility sequential pattern with time intervals.

Parole chiave

  • Datamining
  • sequential pattern
  • time interval
  • high utility
Accesso libero

Agile Project Management Tools: A Brief Comprative View

Pubblicato online: 11 Dec 2019
Pagine: 17 - 25

Astratto

Abstract

Agile methodologies are becoming popular in software development. Managers are required to understand project’s progress and product quality without development documents. During Agile practices of the teams and organizations, Agile project management tools are frequently used. The use of such tools leads to achieving speed and efficiency, affects the quality of the software. The quality of final product is mostly related with to project management. Accordingly, the paper provides brief comparative perspective about the popular project management tools for agile projects. 16 popular Agile project management tools have been presented helping agile developers to plan and manage their tasks in an efficient manner. Taiga, Axosoft, Agielan, Planbox are more appropriate for start-up projects. The most twitted and most appreciated tools are reported as Jira, Trello, and VersionOne. SpiraTeam by Inflectra and Pivotal Tracker are other pricing and popular agile tools, providing flexibility to Agile developers and increase collaboration among team members.

Parole chiave

  • Agile Methodologies
  • Agile Project Management Tool
  • Tools
  • Software Project Management
Accesso libero

Particle Swarm Optimization and Tabu Search Hybrid Algorithm for Flexible Job Shop Scheduling Problem – Analysis of Test Results

Pubblicato online: 11 Dec 2019
Pagine: 26 - 44

Astratto

Abstract

The paper presents a hybrid metaheuristic algorithm, including a Particle Swarm Optimization (PSO) procedure and elements of Tabu Search (TS) metaheuristic. The novel algorithm is designed to solve Flexible Job Shop Scheduling Problems (FJSSP). Twelve benchmark test examples from different reference sources are experimentaly tested to demonstrate the performance of the algorithm. The obtained mean error for the deviation from optimality is 0.044%. The obtained test results are compared to the results in the reference sources and to the results by a genetic algorithm. The comparison illustrates the good performance of the proposed algorithm. Investigations on the base of test examples with a larger dimension will be carried out with the aim of further improvement of the algorithm and the quality of the test results.

Parole chiave

  • Flexible Job Shop Scheduling Problem (FJSSP)
  • Particle Swarm Optimization (PSO)
  • Tabu Search (TS)
Accesso libero

An Efficient Fault-Tolerant Scheduling Approach with Energy Minimization for Hard Real-Time Embedded Systems

Pubblicato online: 11 Dec 2019
Pagine: 45 - 60

Astratto

Abstract

In this paper, we focus on two major problems in hard real-time embedded systems fault tolerance and energy minimization. Fault tolerance is achieved via both checkpointing technique and active replication strategy to tolerate multiple transient faults, whereas energy minimization is achieved by adapting Dynamic Voltage Frequency Scaling (DVFS) technique. First, we introduce an original fault-tolerance approach for hard real-time systems on multiprocessor platforms. Based on this approach, we then propose DVFS_FTS algorithm for energy-efficient fault-tolerant scheduling of precedence-constrained applications. DVFS_FTS is based on a list scheduling heuristics, it satisfies real-time constraints and minimizes energy consumption even in the presence of faults by exploring the multiprocessor architecture. Simulation results reveal that the proposed algorithm can save a significant amount of energy while preserving the required fault-tolerance of the system and outperforms other related approaches in energy savings.

Parole chiave

  • Fault tolerance
  • Transient faults
  • Checkpointing
  • Active replication
  • Dynamic Voltage Frequency Scaling (DVFS)
  • Energy minimization
Accesso libero

QoS Routing Algorithm Based on Entropy Granularity in the Network Transmission

Pubblicato online: 11 Dec 2019
Pagine: 61 - 72

Astratto

Abstract

With the rapid development of computer networks, more hosts are connected to the Internet where they could communicate with each other. The need for network service has exceeded the service capacity of the network, and the Quality of Service (QoS) is gradually declining. Based on existing Shortest Path First (SPF) algorithm, this paper proposes a new QoS required transmission path approach by considering the overhead balance of network resources. This paper uses the entropy granularity as the main line in the application of routing protocols. Firstly, it researches the optimization of routing algorithms for network load balancing resources, routing algorithms based on link traffic distributing weights, link weight optimization based on adaptive genetic algorithm and computational intelligence based on entropy granularity theory. This research proposes a method to apply entropy granularity to Open Shortest Path First (OSPF) routing, including the implementation of the method. After that, a case study is presented by using some examples.

Parole chiave

  • Quality of Service (QoS)
  • routing
  • entropy
  • granularity
  • network communication
Accesso libero

Mission Critical Messaging Using Multi-Access Edge Computing

Pubblicato online: 11 Dec 2019
Pagine: 73 - 89

Astratto

Abstract

5th Generation (5G) mobile system is expected to support the requirements of mission critical communications for ultra reliability and availability, and very low latency. With the development of messaging and data transfer in mobile networks, mission critical communication users see more and more potential in data communications. In this paper, we explore the capabilities of Multi-access Edge Computing (MEC) that appears to be a key 5G component, to provide short messaging service at the network edge. The provided use cases illustrate the capabilities for transferring mobile originating and mobile terminating short messages to and from mission critical mobile edge applications. The data model describes the service resource structure and the Application Programming Interface definitions illustrate how the mobile edge applications can use the service. Some implementation aspects related to behavioral logic of the network and applications are provided. The performance analysis enables estimation of latency introduced by the service.

Parole chiave

  • Mission Critical Communications
  • Fifth Generation Mobile System
  • Edge Computing
  • Messaging Service
Accesso libero

Availability Modelling of Cluster-Based System with Software Aging and Optional Rejuvenation Policy

Pubblicato online: 11 Dec 2019
Pagine: 90 - 100

Astratto

Abstract

This investigation deals with modeling and availability analysis of cluster-based system inflicted with software aging. Software aging is a phenomenon in which a software system shows performance degradation with time and finally results in software failures. To cope up with this phenomenon, rejuvenation is an innovative concept to recover from software failures. As failures occur, server has the option either to take essential rejuvenation with probability p or may opt for optional rejuvenation with complementary probability q. To achieve high availability of the system, the concept of clustering is also taken into consideration. In this study, restart, reboot and standby concept is used for reducing the downtime cost. The sensitivity analysis of different parameters on system availability has been examined numerically. By integrating clustering, software aging and rejuvenation, the researchers intended to increase the availability and decrease the down time.

Parole chiave

  • Software aging
  • Cluster
  • Standby
  • Reboot
  • Optional rejuvenation
  • Availability
  • Downtime cost
Accesso libero

Development and Research of Information System Elements for Passengers Drive Comfort Improvement

Pubblicato online: 11 Dec 2019
Pagine: 101 - 115

Astratto

Abstract

Preliminary theoretical analyzes have been made, which show that heavy acceleration reduces comfort are available. This applies both to the acceleration when starting and stopping. High levels of acceleration are most common when braking. An analysis of passenger comfort based on accelerometer data and a survey was conducted. The speed of travel, the acceleration in the direction of accelerometer X axis, the rotation axis C have a significant influence on the degree of passenger discomfort. The results obtained complement and partly improve those from the available literature with a model using only one linear and one rotary axis, by which the discomfort is described with sufficient accuracy. A regression model has been obtained, which is a suitable basis for building a driver assistance system to provide passenger comfort in public road transport. A model of a “Driver Assistant” microprocessor system based on studies is proposed.

Parole chiave

  • Passenger drive comfort
  • Driver assistant system
  • Regression model
  • Graphical user interface
Accesso libero

Second Call for Papers AIMSA 2020

Pubblicato online: 11 Dec 2019
Pagine: 116 - 118

Astratto

Pianifica la tua conferenza remota con Sciendo