Editions

Magazine et Edition

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Volume 16 (2016): Edition 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): Edition 5 (October 2016)
Edition Title: Special Edition on Application of Advanced Computing and Simulation in Information Systems

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Volume 13 (2013): Edition 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): Edition 3 (September 2013)

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

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

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

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

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

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

Détails du magazine
Format
Magazine
eISSN
1314-4081
ISSN
1311-9702
Première publication
13 Mar 2012
Période de publication
4 fois par an
Langues
Anglais

Chercher

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

Détails du magazine
Format
Magazine
eISSN
1314-4081
ISSN
1311-9702
Première publication
13 Mar 2012
Période de publication
4 fois par an
Langues
Anglais

Chercher

7 Articles
Accès libre

First Order Perturbation Bounds of the Discrete-Time LMI-Based H∞ Quadratic Stability Problem for Descriptor Systems

Publié en ligne: 13 Mar 2013
Pages: 3 - 12

Résumé

Abstract

In this paper we propose an approach to obtain first order perturbation bounds for the discrete-time Linear Matrix Inequalities (LMI) based H∞ quadratic stability problem for descriptor systems. Applying the considered approach we are able to compute tight first order perturbation bounds for the LMIs’ solutions to the H∞ quadratic stability problem for discrete-time descriptor systems. In the paper we present an approach to compute the estimates of the individual condition numbers of the considered LMIs. To illustrate the performance and applicability of the results obtained we present a numerical example

Mots clés

  • Discrete-time descriptor systems
  • first order perturbation bounds
  • H∞ Quadratic Stability Problem
  • LMI based design
Accès libre

Algorithm for Multiple Model Adaptive Control Based on Input-Output Plant Model

Publié en ligne: 13 Mar 2013
Pages: 13 - 33

Résumé

Abstract

An algorithm for multiple model adaptive control of a time-variant plant in the presence of measurement noise is proposed. This algorithm controls the plant using a bank of PID controllers designed on the base of time invariant input/output models. The control signal is formed as weighting sum of the control signals of local PID controllers. The main contribution of the paper is the objective function minimized to determine the weighting coefficients. The proposed algorithm minimizes the sum of the square general error between the model bank output and the plant output. An equation for on-line determination of the weighting coefficients is obtained. They are determined by the current value of the general error covariance matrix. The main advantage of the algorithm is that the derived general error covariance matrix equation is the same as this in the recursive least square algorithm. Thus, most of the well known RLS modifications for the tracking timevariant parameters can be directly implemented. The algorithm performance is tested by simulation. Results with both SISO and MIMO time variant plants are obtained.

Mots clés

  • Multiple model adaptive control
  • input-output model
  • PID controllers
  • time variant plants
Accès libre

Analysis of a Vector Space Model, Latent Semantic Indexing and Formal Concept Analysis for Information Retrieval

Publié en ligne: 13 Mar 2013
Pages: 34 - 48

Résumé

Abstract

Latent Semantic Indexing (LSI), a variant of classical Vector Space Model (VSM), is an Information Retrieval (IR) model that attempts to capture the latent semantic relationship between the data items. Mathematical lattices, under the framework of Formal Concept Analysis (FCA), represent conceptual hierarchies in data and retrieve the information. However, both LSI and FCA use the data represented in the form of matrices. The objective of this paper is to systematically analyze VSM, LSI and FCA for the task of IR using standard and real life datasets.

Mots clés

  • Formal concept analysis
  • Information Retrieval
  • latent semantic indexing
  • vector space model
Accès libre

Insurance Dynamics – A Data Mining Approach for Customer Retention in Health Care Insurance Industry

Publié en ligne: 13 Mar 2013
Pages: 49 - 60

Résumé

Abstract

Extraction of customer behavioral patterns is a complex task and widely studied for various industrial applications under different heading viz., customer retention management, business intelligence and data mining. In this paper, authors experimented to extract the behavioral patterns for customer retention in Health care insurance. Initially, the customers are classified into three general categories - stable, unstable and oscillatory. To extract the patterns the concept of Novel index tree (a variant of K-d tree) clubbed with K-Nearest Neighbor algorithm is proposed for efficient classification of data, as well as outliers and the concept of insurance dynamics is proposed for analyzing customer behavioral patterns

Mots clés

  • Insurance dynamics
  • K-d tree
  • KNN
  • Novel Index tree
  • Customer retention
Accès libre

A Fuzzy Approach for Bidding Strategy Selection

Publié en ligne: 13 Mar 2013
Pages: 61 - 69

Résumé

Abstract

The goal of this work is to explore the applicability of fuzzy logic in multiagent systems for choosing the best bidding strategy in electronic auction. To find the multi-criterion ordering, agents use a fuzzy algorithm ARAKRI2 with direct aggregation operators MaxMin and MinAvg. The key difference between this new approach and known from the literature solution FTNA is in the lack of weighted coefficients. Despite the difference both algorithms give results that are similar. Therefore, the proposed approach can successfully solve the task for multi criteria selection of bidding strategy.

Mots clés

  • Software agents
  • bidding strategy selection
Accès libre

Some Applications of Intuitionistic Fuzzy Sets for the Determination of a Sociometric Index of Acceptance

Publié en ligne: 13 Mar 2013
Pages: 70 - 77

Résumé

Abstract

A simple use of intuitionistic fuzzy sets to determine and process the information describing the level of acceptance of people in a social group (e.g., pupils in a school class) is presented in the paper. An algorithm of processing linguistic assessments is given that leads to aggregated opinions and conclusions in the form of linguistic evaluation.

Mots clés

  • Sociometry
  • index of acceptance
  • intuitionistic fuzzy sets
  • linguistic evaluations
Accès libre

Open Access to Resource Management through Web Services

Publié en ligne: 13 Mar 2013
Pages: 78 - 96

Résumé

Abstract

The paper investigates the capabilities for open access to resource management in multimedia networks through Parlay X Web Services. Resource management allows the network operator to provide Quality of Service (QoS) to user sessions and to apply advanced charging. The study is based on the analysis of Policy and Charging Control (PCC) functions defined for evolved packet systems The PCC comprises flow-based charging including charging control and online credit control, gating control, and Quality of Service Control (QoS) control. The required functionality for open access to QoS management and advanced charging is identified. Parlay X Web Services are evaluated for the support of PCC and some enhancements are suggested. Implementation aspects are discussed and Parlay X interfaces are mapped on IMS control protocols. Use Cases of Parlay X Web services for PCC are presented.

Mots clés

  • Open service access
  • IP multimedia subsystem
  • Quality of service
  • Policy control
  • Charging
7 Articles
Accès libre

First Order Perturbation Bounds of the Discrete-Time LMI-Based H∞ Quadratic Stability Problem for Descriptor Systems

Publié en ligne: 13 Mar 2013
Pages: 3 - 12

Résumé

Abstract

In this paper we propose an approach to obtain first order perturbation bounds for the discrete-time Linear Matrix Inequalities (LMI) based H∞ quadratic stability problem for descriptor systems. Applying the considered approach we are able to compute tight first order perturbation bounds for the LMIs’ solutions to the H∞ quadratic stability problem for discrete-time descriptor systems. In the paper we present an approach to compute the estimates of the individual condition numbers of the considered LMIs. To illustrate the performance and applicability of the results obtained we present a numerical example

Mots clés

  • Discrete-time descriptor systems
  • first order perturbation bounds
  • H∞ Quadratic Stability Problem
  • LMI based design
Accès libre

Algorithm for Multiple Model Adaptive Control Based on Input-Output Plant Model

Publié en ligne: 13 Mar 2013
Pages: 13 - 33

Résumé

Abstract

An algorithm for multiple model adaptive control of a time-variant plant in the presence of measurement noise is proposed. This algorithm controls the plant using a bank of PID controllers designed on the base of time invariant input/output models. The control signal is formed as weighting sum of the control signals of local PID controllers. The main contribution of the paper is the objective function minimized to determine the weighting coefficients. The proposed algorithm minimizes the sum of the square general error between the model bank output and the plant output. An equation for on-line determination of the weighting coefficients is obtained. They are determined by the current value of the general error covariance matrix. The main advantage of the algorithm is that the derived general error covariance matrix equation is the same as this in the recursive least square algorithm. Thus, most of the well known RLS modifications for the tracking timevariant parameters can be directly implemented. The algorithm performance is tested by simulation. Results with both SISO and MIMO time variant plants are obtained.

Mots clés

  • Multiple model adaptive control
  • input-output model
  • PID controllers
  • time variant plants
Accès libre

Analysis of a Vector Space Model, Latent Semantic Indexing and Formal Concept Analysis for Information Retrieval

Publié en ligne: 13 Mar 2013
Pages: 34 - 48

Résumé

Abstract

Latent Semantic Indexing (LSI), a variant of classical Vector Space Model (VSM), is an Information Retrieval (IR) model that attempts to capture the latent semantic relationship between the data items. Mathematical lattices, under the framework of Formal Concept Analysis (FCA), represent conceptual hierarchies in data and retrieve the information. However, both LSI and FCA use the data represented in the form of matrices. The objective of this paper is to systematically analyze VSM, LSI and FCA for the task of IR using standard and real life datasets.

Mots clés

  • Formal concept analysis
  • Information Retrieval
  • latent semantic indexing
  • vector space model
Accès libre

Insurance Dynamics – A Data Mining Approach for Customer Retention in Health Care Insurance Industry

Publié en ligne: 13 Mar 2013
Pages: 49 - 60

Résumé

Abstract

Extraction of customer behavioral patterns is a complex task and widely studied for various industrial applications under different heading viz., customer retention management, business intelligence and data mining. In this paper, authors experimented to extract the behavioral patterns for customer retention in Health care insurance. Initially, the customers are classified into three general categories - stable, unstable and oscillatory. To extract the patterns the concept of Novel index tree (a variant of K-d tree) clubbed with K-Nearest Neighbor algorithm is proposed for efficient classification of data, as well as outliers and the concept of insurance dynamics is proposed for analyzing customer behavioral patterns

Mots clés

  • Insurance dynamics
  • K-d tree
  • KNN
  • Novel Index tree
  • Customer retention
Accès libre

A Fuzzy Approach for Bidding Strategy Selection

Publié en ligne: 13 Mar 2013
Pages: 61 - 69

Résumé

Abstract

The goal of this work is to explore the applicability of fuzzy logic in multiagent systems for choosing the best bidding strategy in electronic auction. To find the multi-criterion ordering, agents use a fuzzy algorithm ARAKRI2 with direct aggregation operators MaxMin and MinAvg. The key difference between this new approach and known from the literature solution FTNA is in the lack of weighted coefficients. Despite the difference both algorithms give results that are similar. Therefore, the proposed approach can successfully solve the task for multi criteria selection of bidding strategy.

Mots clés

  • Software agents
  • bidding strategy selection
Accès libre

Some Applications of Intuitionistic Fuzzy Sets for the Determination of a Sociometric Index of Acceptance

Publié en ligne: 13 Mar 2013
Pages: 70 - 77

Résumé

Abstract

A simple use of intuitionistic fuzzy sets to determine and process the information describing the level of acceptance of people in a social group (e.g., pupils in a school class) is presented in the paper. An algorithm of processing linguistic assessments is given that leads to aggregated opinions and conclusions in the form of linguistic evaluation.

Mots clés

  • Sociometry
  • index of acceptance
  • intuitionistic fuzzy sets
  • linguistic evaluations
Accès libre

Open Access to Resource Management through Web Services

Publié en ligne: 13 Mar 2013
Pages: 78 - 96

Résumé

Abstract

The paper investigates the capabilities for open access to resource management in multimedia networks through Parlay X Web Services. Resource management allows the network operator to provide Quality of Service (QoS) to user sessions and to apply advanced charging. The study is based on the analysis of Policy and Charging Control (PCC) functions defined for evolved packet systems The PCC comprises flow-based charging including charging control and online credit control, gating control, and Quality of Service Control (QoS) control. The required functionality for open access to QoS management and advanced charging is identified. Parlay X Web Services are evaluated for the support of PCC and some enhancements are suggested. Implementation aspects are discussed and Parlay X interfaces are mapped on IMS control protocols. Use Cases of Parlay X Web services for PCC are presented.

Mots clés

  • Open service access
  • IP multimedia subsystem
  • Quality of service
  • Policy control
  • Charging

Planifiez votre conférence à distance avec Sciendo