Rivista e Edizione

Volume 32 (2022): Edizione 3 (September 2022)
Recent Advances in Modelling, Analysis and Implementation of Cyber-Physical Systems (Special section, pp. 345-413), Remigiusz Wiśniewski, Luis Gomes and Shaohua Wan (Eds.)

Volume 32 (2022): Edizione 2 (June 2022)
Towards Self-Healing Systems through Diagnostics, Fault-Tolerance and Design (Special section, pp. 171-269), Marcin Witczak and Ralf Stetter (Eds.)

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

Volume 31 (2021): Edizione 4 (December 2021)
Advanced Machine Learning Techniques in Data Analysis (special section, pp. 549-611), Maciej Kusy, Rafał Scherer, and Adam Krzyżak (Eds.)

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

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

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

Volume 30 (2020): Edizione 4 (December 2020)

Volume 30 (2020): Edizione 3 (September 2020)
Big Data and Signal Processing (Special section, pp. 399-473), Joanna Kołodziej, Sabri Pllana, Salvatore Vitabile (Eds.)

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

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

Volume 29 (2019): Edizione 4 (December 2019)
New Perspectives in Nonlinear and Intelligent Control (In Honor of Alexander P. Kurdyukov) (special section, pp. 629-712), Julio B. Clempner, Enso Ikonen, Alexander P. Kurdyukov (Eds.)

Volume 29 (2019): Edizione 3 (September 2019)
Information Technology for Systems Research (special section, pp. 427-515), Piotr Kulczycki, Janusz Kacprzyk, László T. Kóczy, Radko Mesiar (Eds.)

Volume 29 (2019): Edizione 2 (June 2019)
Advances in Complex Cloud and Service Oriented Computing (special section, pp. 213-274), Anna Kobusińska, Ching-Hsien Hsu, Kwei-Jay Lin (Eds.)

Volume 29 (2019): Edizione 1 (March 2019)
Exploring Complex and Big Data (special section, pp. 7-91), Johann Gamper, Robert Wrembel (Eds.)

Volume 28 (2018): Edizione 4 (December 2018)

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

Volume 28 (2018): Edizione 2 (June 2018)
Advanced Diagnosis and Fault-Tolerant Control Methods (special section, pp. 233-333), Vicenç Puig, Dominique Sauter, Christophe Aubrun, Horst Schulte (Eds.)

Volume 28 (2018): Edizione 1 (March 2018)
Ediziones in Parameter Identification and Control (special section, pp. 9-122), Abdel Aitouche (Ed.)

Volume 27 (2017): Edizione 4 (December 2017)

Volume 27 (2017): Edizione 3 (September 2017)
Systems Analysis: Modeling and Control (special section, pp. 457-499), Vyacheslav Maksimov and Boris Mordukhovich (Eds.)

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

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

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

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

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

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

Volume 25 (2015): Edizione 4 (December 2015)
Special issue: Complex Problems in High-Performance Computing Systems, Editors: Mauro Iacono, Joanna Kołodziej

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

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

Volume 25 (2015): Edizione 1 (March 2015)
Safety, Fault Diagnosis and Fault Tolerant Control in Aerospace Systems, Silvio Simani, Paolo Castaldi (Eds.)

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

Volume 24 (2014): Edizione 3 (September 2014)
Modelling and Simulation of High Performance Information Systems (special section, pp. 453-566), Pavel Abaev, Rostislav Razumchik, Joanna Kołodziej (Eds.)

Volume 24 (2014): Edizione 2 (June 2014)
Signals and Systems (special section, pp. 233-312), Ryszard Makowski and Jan Zarzycki (Eds.)

Volume 24 (2014): Edizione 1 (March 2014)
Selected Problems of Biomedical Engineering (special section, pp. 7 - 63), Marek Kowal and Józef Korbicz (Eds.)

Volume 23 (2013): Edizione 4 (December 2013)

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

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

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

Volume 22 (2012): Edizione 4 (December 2012)
Hybrid and Ensemble Methods in Machine Learning (special section, pp. 787 - 881), Oscar Cordón and Przemysław Kazienko (Eds.)

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

Volume 22 (2012): Edizione 2 (June 2012)
Analysis and Control of Spatiotemporal Dynamic Systems (special section, pp. 245 - 326), Dariusz Uciński and Józef Korbicz (Eds.)

Volume 22 (2012): Edizione 1 (March 2012)
Advances in Control and Fault-Tolerant Systems (special issue), Józef Korbicz, Didier Maquin and Didier Theilliol (Eds.)

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

Volume 21 (2011): Edizione 3 (September 2011)
Ediziones in Advanced Control and Diagnosis (special section, pp. 423 - 486), Vicenç Puig and Marcin Witczak (Eds.)

Volume 21 (2011): Edizione 2 (June 2011)
Efficient Resource Management for Grid-Enabled Applications (special section, pp. 219 - 306), Joanna Kołodziej and Fatos Xhafa (Eds.)

Volume 21 (2011): Edizione 1 (March 2011)
Semantic Knowledge Engineering (special section, pp. 9 - 95), Grzegorz J. Nalepa and Antoni Ligęza (Eds.)

Volume 20 (2010): Edizione 4 (December 2010)

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

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

Volume 20 (2010): Edizione 1 (March 2010)
Computational Intelligence in Modern Control Systems (special section, pp. 7 - 84), Józef Korbicz and Dariusz Uciński (Eds.)

Volume 19 (2009): Edizione 4 (December 2009)
Robot Control Theory (special section, pp. 519 - 588), Cezary Zieliński (Ed.)

Volume 19 (2009): Edizione 3 (September 2009)
Verified Methods: Applications in Medicine and Engineering (special issue), Andreas Rauh, Ekaterina Auer, Eberhard P. Hofer and Wolfram Luther (Eds.)

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

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

Volume 18 (2008): Edizione 4 (December 2008)
Ediziones in Fault Diagnosis and Fault Tolerant Control (special issue), Józef Korbicz and Dominique Sauter (Eds.)

Volume 18 (2008): Edizione 3 (September 2008)
Selected Problems of Computer Science and Control (special issue), Krzysztof Gałkowski, Eric Rogers and Jan Willems (Eds.)

Volume 18 (2008): Edizione 2 (June 2008)
Selected Topics in Biological Cybernetics (special section, pp. 117 - 170), Andrzej Kasiński and Filip Ponulak (Eds.)

Volume 18 (2008): Edizione 1 (March 2008)
Applied Image Processing (special issue), Anton Kummert and Ewaryst Rafajłowicz (Eds.)

Volume 17 (2007): Edizione 4 (December 2007)

Volume 17 (2007): Edizione 3 (September 2007)
Scientific Computation for Fluid Mechanics and Hyperbolic Systems (special issue), Jan Sokołowski and Eric Sonnendrücker (Eds.)

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

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

Dettagli della rivista
Formato
Rivista
eISSN
2083-8492
Pubblicato per la prima volta
05 Apr 2007
Periodo di pubblicazione
4 volte all'anno
Lingue
Inglese

Cerca

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

Dettagli della rivista
Formato
Rivista
eISSN
2083-8492
Pubblicato per la prima volta
05 Apr 2007
Periodo di pubblicazione
4 volte all'anno
Lingue
Inglese

Cerca

15 Articoli

Individual Article Information

Accesso libero

A dynamically adaptive lattice Boltzmann method for thermal convection problems

Pubblicato online: 30 Dec 2016
Pagine: 735 - 747

Astratto

Abstract

Utilizing the Boussinesq approximation, a double-population incompressible thermal lattice Boltzmann method (LBM) for forced and natural convection in two and three space dimensions is developed and validated. A block-structured dynamic adaptive mesh refinement (AMR) procedure tailored for the LBM is applied to enable computationally efficient simulations of moderate to high Rayleigh number flows which are characterized by a large scale disparity in boundary layers and free stream flow. As test cases, the analytically accessible problem of a two-dimensional (2D) forced convection flow through two porous plates and the non-Cartesian configuration of a heated rotating cylinder are considered. The objective of the latter is to advance the boundary conditions for an accurate treatment of curved boundaries and to demonstrate the effect on the solution. The effectiveness of the overall approach is demonstrated for the natural convection benchmark of a 2D cavity with differentially heated walls at Rayleigh numbers from 103 up to 108. To demonstrate the benefit of the employed AMR procedure for three-dimensional (3D) problems, results from the natural convection in a cubic cavity at Rayleigh numbers from 103 up to 105 are compared with benchmark results.

Keywords

  • lattice Boltzmann method
  • adaptive mesh refinement
  • thermal convection
  • incompressible
Accesso libero

Modeling heat distribution with the use of a non-integer order, state space model

Pubblicato online: 30 Dec 2016
Pagine: 749 - 756

Astratto

Abstract

A new, state space, non-integer order model for the heat transfer process is presented. The proposed model is based on a Feller semigroup one, the derivative with respect to time is expressed by the non-integer order Caputo operator, and the derivative with respect to length is described by the non-integer order Riesz operator. Elementary properties of the state operator are proven and a formula for the step response of the system is also given. The proposed model is applied to the modeling of temperature distribution in a one dimensional plant. Results of experiments show that the proposed model is more accurate than the analogical integer order model in the sense of the MSE cost function.

Keywords

  • non-integer order systems
  • heat transfer equation
  • infinite dimensional systems
  • Feller semigroups
Accesso libero

A metaheuristic for a numerical approximation to the mass transfer problem

Pubblicato online: 30 Dec 2016
Pagine: 757 - 766

Astratto

Abstract

This work presents an improvement of the approximation scheme for the Monge-Kantorovich (MK) mass transfer problem on compact spaces, which is studied by Gabriel et al. (2010), whose scheme discretizes the MK problem, reduced to solve a sequence of finite transport problems. The improvement presented in this work uses a metaheuristic algorithm inspired by scatter search in order to reduce the dimensionality of each transport problem. The new scheme solves a sequence of linear programming problems similar to the transport ones but with a lower dimension. The proposed metaheuristic is supported by a convergence theorem. Finally, examples with an exact solution are used to illustrate the performance of our proposal.

Keywords

  • Monge-Kantorovich mass transfer problem
  • finite dimensional linear programming
  • transport problem
  • metaheuristic algorithm
  • scatter search
Accesso libero

Identification of parametric models with a priori knowledge of process properties

Pubblicato online: 30 Dec 2016
Pagine: 767 - 776

Astratto

Abstract

An approach to estimation of a parametric discrete-time model of a process in the case of some a priori knowledge of the investigated process properties is presented. The knowledge of plant properties is introduced in the form of linear bounds, which can be determined for the coefficient vector of the parametric model studied. The approach yields special biased estimation of model coefficients that preserves demanded properties. A formula for estimation of the model coefficients is derived and combined with a recursive scheme determined for minimization of the sum of absolute model errors. The estimation problem of a model with known static gains of inputs is discussed and proper formulas are derived. This approach can overcome the non-identifiability problem which has been observed during estimation based on measurements recorded in industrial closed-loop control systems. The application of the proposed approach to estimation of a model for an industrial plant (a water injector into the steam flow in a power plant) is presented and discussed.

Keywords

  • absolute error measure
  • constrained parameters estimation
  • identification
  • parametric MISO models
Accesso libero

The use of a non-integer order PI controller with an active queue management mechanism

Pubblicato online: 30 Dec 2016
Pagine: 777 - 789

Astratto

Abstract

In this paper the performance of a fractional order PI controller is compared with that of RED, a well-known active queue management (AQM) mechanism. The article uses fluid flow approximation and discrete-event simulation to investigate the influence of the AQM policy on the packet loss probability, the queue length and its variability. The impact of self-similar traffic is also considered.

Keywords

  • active queue management
  • PI controller
  • dropping packets
  • fractional calculus
Accesso libero

Reducing the mast vibration of single-mast stacker cranes by gain-scheduled control

Pubblicato online: 30 Dec 2016
Pagine: 791 - 802

Astratto

Abstract

In the frame structure of stacker cranes harmful mast vibrations may appear due to the inertial forces of acceleration or the braking movement phase. This effect may reduce the stability and positioning accuracy of these machines. Unfortunately, their dynamic properties also vary with the lifted load magnitude and position. The purpose of the paper is to present a controller design method which can handle the effect of a varying lifted load magnitude and position in a dynamic model and at the same time reveals good reference signal tracking and mast vibration reducing properties. A controller design case study is presented step by step from dynamic modeling through to the validation of the resulting controller. In the paper the dynamic modeling possibilities of single-mast stacker cranes are summarized. The handling of varying dynamical behavior is realized via the polytopic LPV modeling approach. Based on this modeling technique, a gain-scheduled controller design method is proposed, which is suitable for achieving the goals set. Finally, controller validation is presented by means of time domain simulations.

Keywords

  • robust control
  • LPV systems
  • gain-scheduling
  • stacker cranes
Accesso libero

Set-membership identifiability of nonlinear models and related parameter estimation properties

Pubblicato online: 30 Dec 2016
Pagine: 803 - 813

Astratto

Abstract

Identifiability guarantees that the mathematical model of a dynamic system is well defined in the sense that it maps unambiguously its parameters to the output trajectories. This paper casts identifiability in a set-membership (SM) framework and relates recently introduced properties, namely, SM-identifiability, μ-SM-identifiability, and ε-SM-identifiability, to the properties of parameter estimation problems. Soundness and ε-consistency are proposed to characterize these problems and the solution returned by the algorithm used to solve them. This paper also contributes by carefully motivating and comparing SM-identifiability, μ-SM-identifiability and ε-SM-identifiability with related properties found in the literature, and by providing a method based on differential algebra to check these properties.

Keywords

  • identifiability
  • bounded uncertainty
  • set-membership estimation
  • nonlinear dynamic models
Accesso libero

Fault isolability with different forms of the faults–symptoms relation

Pubblicato online: 30 Dec 2016
Pagine: 815 - 826

Astratto

Abstract

The definitions and conditions for fault isolability of single faults for various forms of the diagnostic relation are reviewed. Fault isolability and unisolability on the basis of a binary diagnostic matrix are analyzed. Definitions for conditional and unconditional isolability and unisolability on the basis of a fault information system (FIS), symptom sequences and directional residuals are formulated. General definitions for conditional and unconditional isolability and unisolability in the cases of simultaneous evaluation of diagnostic signal values and a sequence of symptoms are provided. A comprehensive example is discussed.

Keywords

  • diagnosis
  • fault diagnosis
  • fault isolation
  • sequences
  • information systems
Accesso libero

Switching time estimation and active mode recognition using a data projection method

Pubblicato online: 30 Dec 2016
Pagine: 827 - 840

Astratto

Abstract

This paper proposes a data projection method (DPM) to detect a mode switching and recognize the current mode in a switching system. The main feature of this method is that the precise knowledge of the system model, i.e., the parameter values, is not needed. One direct application of this technique is fault detection and identification (FDI) when a fault produces a change in the system dynamics. Mode detection and recognition correspond to fault detection and identification, and switching time estimation to fault occurrence time estimation. The general principle of the DPM is to generate mode indicators, namely, residuals, using matrix projection techniques, where matrices are composed of input and output measured data. The DPM is presented in detail, and properties of switching detectability (fault detectability) and discernability between modes (fault identifiability) are characterized and discussed. The great advantage of this method, compared with other techniques in the literature, is that it does not need the model parameter values and thus can be applied to systems of the same type without identifying their parameters. This is particularly interesting in the design of generic embedded fault diagnosis algorithms.

Keywords

  • switching systems
  • mode recognition
  • fault detection and isolation
  • data-driven method
  • mode discernability
  • switching detectability
  • fault identifiability
Accesso libero

Performance evaluation of an M/G/n-type queue with bounded capacity and packet dropping

Pubblicato online: 30 Dec 2016
Pagine: 841 - 854

Astratto

Abstract

A queueing system of the M/G/n-type, n ≥ 1, with a bounded total volume is considered. It is assumed that the volumes of the arriving packets are generally distributed random variables. Moreover, the AQM-type mechanism is used to control the actual buffer state: each of the arriving packets is dropped with a probability depending on its volume and the occupied volume of the system at the pre-arrival epoch. The explicit formulae for the stationary queue-size distribution and the loss probability are found. Numerical examples illustrating theoretical formulae are given as well.

Keywords

  • AQM algorithms
  • finite buffer
  • loss probability
  • total packet volume
  • queue-size distribution
Accesso libero

An advance in infinite graph models for the analysis of transportation networks

Pubblicato online: 30 Dec 2016
Pagine: 855 - 869

Astratto

Abstract

This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph. It also relates the new results with the corresponding situations for the finite case. In particular, concepts from ‘finite’ graph theory, like the average degree and the extremal number, are generalized and computed for some specific cases. Finally, some applications of infinite graphs to the transportation of dangerous goods are presented; they involve the analysis of networks and percolation thresholds.

Keywords

  • infinite graph
  • average degree
  • extremal problems
  • road transport network
  • percolation
Accesso libero

Lookahead selective sampling for incomplete data

Pubblicato online: 30 Dec 2016
Pagine: 871 - 884

Astratto

Abstract

Missing values in data are common in real world applications. There are several methods that deal with this problem. In this paper we present lookahead selective sampling (LSS) algorithms for datasets with missing values. We developed two versions of selective sampling. The first one integrates a distance function that can measure the similarity between pairs of incomplete points within the framework of the LSS algorithm. The second algorithm uses ensemble clustering in order to represent the data in a cluster matrix without missing values and then run the LSS algorithm based on the ensemble clustering instance space (LSS-EC). To construct the cluster matrix, we use the k-means and mean shift clustering algorithms especially modified to deal with incomplete datasets. We tested our algorithms on six standard numerical datasets from different fields. On these datasets we simulated missing values and compared the performance of the LSS and LSS-EC algorithms for incomplete data to two other basic methods. Our experiments show that the suggested selective sampling algorithms outperform the other methods.

Keywords

  • selective sampling
  • missing values
  • ensemble clustering
Accesso libero

A comparison of hole-filling methods in 3D

Pubblicato online: 30 Dec 2016
Pagine: 885 - 903

Astratto

Abstract

This paper presents a review of the most relevant current techniques that deal with hole-filling in 3D models. Contrary to earlier reports, which approach mesh repairing in a sparse and global manner, the objective of this review is twofold. First, a specific and comprehensive review of hole-filling techniques (as a relevant part in the field of mesh repairing) is carried out. We present a brief summary of each technique with attention paid to its algorithmic essence, main contributions and limitations. Second, a solid comparison between 34 methods is established. To do this, we define 19 possible meaningful features and properties that can be found in a generic hole-filling process. Then, we use these features to assess the virtues and deficiencies of the method and to build comparative tables. The purpose of this review is to make a comparative hole-filling state-of-the-art available to researchers, showing pros and cons in a common framework.

Keywords

  • survey
  • 3D polygonal models
  • repairing meshes
  • hole-filling
  • restoration algorithms
Accesso libero

The impatience mechanism as a diversity maintaining and saddle crossing strategy

Pubblicato online: 30 Dec 2016
Pagine: 905 - 918

Astratto

Abstract

The impatience mechanism diversifies the population and facilitates escaping from a local optima trap by modifying fitness values of poorly adapted individuals. In this paper, two versions of the impatience mechanism coupled with a phenotypic model of evolution are studied. A population subordinated to a basic version of the impatience mechanism polarizes itself and evolves as a dipole centered around an averaged individual. In the modified version, the impatience mechanism is supplied with extra knowledge about a currently found optimum. In this case, the behavior of a population is quite different than previously-considerable diversification is also observed, but the population is not polarized and evolves as a single cluster. The impatience mechanism allows crossing saddles relatively fast in different configurations of bimodal and multimodal fitness functions. Actions of impatience mechanisms are shown and compared with evolution without the impatience and with a fitness sharing. The efficiency of crossing saddles is experimentally examined for different fitness functions. Results presented in the paper confirm good properties of the impatience mechanism in diversity maintaining and saddle crossing.

Keywords

  • phenotypic evolution
  • impatience operator without and with extra knowledge
  • polarization of population
  • maintaining population diversity
  • saddle crossing
Accesso libero

Tiling arbitrarily nested loops by means of the transitive

Pubblicato online: 30 Dec 2016
Pagine: 919 - 939

Astratto

Abstract

A novel approach to generation of tiled code for arbitrarily nested loops is presented. It is derived via a combination of the polyhedral and iteration space slicing frameworks. Instead of program transformations represented by a set of affine functions, one for each statement, it uses the transitive closure of a loop nest dependence graph to carry out corrections of original rectangular tiles so that all dependences of the original loop nest are preserved under the lexicographic order of target tiles. Parallel tiled code can be generated on the basis of valid serial tiled code by means of applying affine transformations or transitive closure using on input an inter-tile dependence graph whose vertices are represented by target tiles while edges connect dependent target tiles. We demonstrate how a relation describing such a graph can be formed. The main merit of the presented approach in comparison with the well-known ones is that it does not require full permutability of loops to generate both serial and parallel tiled codes; this increases the scope of loop nests to be tiled.

Keywords

  • tiling
  • transitive closure
  • source-to-source compiler
  • polyhedral model
  • iteration space slicing
15 Articoli

Individual Article Information

Accesso libero

A dynamically adaptive lattice Boltzmann method for thermal convection problems

Pubblicato online: 30 Dec 2016
Pagine: 735 - 747

Astratto

Abstract

Utilizing the Boussinesq approximation, a double-population incompressible thermal lattice Boltzmann method (LBM) for forced and natural convection in two and three space dimensions is developed and validated. A block-structured dynamic adaptive mesh refinement (AMR) procedure tailored for the LBM is applied to enable computationally efficient simulations of moderate to high Rayleigh number flows which are characterized by a large scale disparity in boundary layers and free stream flow. As test cases, the analytically accessible problem of a two-dimensional (2D) forced convection flow through two porous plates and the non-Cartesian configuration of a heated rotating cylinder are considered. The objective of the latter is to advance the boundary conditions for an accurate treatment of curved boundaries and to demonstrate the effect on the solution. The effectiveness of the overall approach is demonstrated for the natural convection benchmark of a 2D cavity with differentially heated walls at Rayleigh numbers from 103 up to 108. To demonstrate the benefit of the employed AMR procedure for three-dimensional (3D) problems, results from the natural convection in a cubic cavity at Rayleigh numbers from 103 up to 105 are compared with benchmark results.

Keywords

  • lattice Boltzmann method
  • adaptive mesh refinement
  • thermal convection
  • incompressible
Accesso libero

Modeling heat distribution with the use of a non-integer order, state space model

Pubblicato online: 30 Dec 2016
Pagine: 749 - 756

Astratto

Abstract

A new, state space, non-integer order model for the heat transfer process is presented. The proposed model is based on a Feller semigroup one, the derivative with respect to time is expressed by the non-integer order Caputo operator, and the derivative with respect to length is described by the non-integer order Riesz operator. Elementary properties of the state operator are proven and a formula for the step response of the system is also given. The proposed model is applied to the modeling of temperature distribution in a one dimensional plant. Results of experiments show that the proposed model is more accurate than the analogical integer order model in the sense of the MSE cost function.

Keywords

  • non-integer order systems
  • heat transfer equation
  • infinite dimensional systems
  • Feller semigroups
Accesso libero

A metaheuristic for a numerical approximation to the mass transfer problem

Pubblicato online: 30 Dec 2016
Pagine: 757 - 766

Astratto

Abstract

This work presents an improvement of the approximation scheme for the Monge-Kantorovich (MK) mass transfer problem on compact spaces, which is studied by Gabriel et al. (2010), whose scheme discretizes the MK problem, reduced to solve a sequence of finite transport problems. The improvement presented in this work uses a metaheuristic algorithm inspired by scatter search in order to reduce the dimensionality of each transport problem. The new scheme solves a sequence of linear programming problems similar to the transport ones but with a lower dimension. The proposed metaheuristic is supported by a convergence theorem. Finally, examples with an exact solution are used to illustrate the performance of our proposal.

Keywords

  • Monge-Kantorovich mass transfer problem
  • finite dimensional linear programming
  • transport problem
  • metaheuristic algorithm
  • scatter search
Accesso libero

Identification of parametric models with a priori knowledge of process properties

Pubblicato online: 30 Dec 2016
Pagine: 767 - 776

Astratto

Abstract

An approach to estimation of a parametric discrete-time model of a process in the case of some a priori knowledge of the investigated process properties is presented. The knowledge of plant properties is introduced in the form of linear bounds, which can be determined for the coefficient vector of the parametric model studied. The approach yields special biased estimation of model coefficients that preserves demanded properties. A formula for estimation of the model coefficients is derived and combined with a recursive scheme determined for minimization of the sum of absolute model errors. The estimation problem of a model with known static gains of inputs is discussed and proper formulas are derived. This approach can overcome the non-identifiability problem which has been observed during estimation based on measurements recorded in industrial closed-loop control systems. The application of the proposed approach to estimation of a model for an industrial plant (a water injector into the steam flow in a power plant) is presented and discussed.

Keywords

  • absolute error measure
  • constrained parameters estimation
  • identification
  • parametric MISO models
Accesso libero

The use of a non-integer order PI controller with an active queue management mechanism

Pubblicato online: 30 Dec 2016
Pagine: 777 - 789

Astratto

Abstract

In this paper the performance of a fractional order PI controller is compared with that of RED, a well-known active queue management (AQM) mechanism. The article uses fluid flow approximation and discrete-event simulation to investigate the influence of the AQM policy on the packet loss probability, the queue length and its variability. The impact of self-similar traffic is also considered.

Keywords

  • active queue management
  • PI controller
  • dropping packets
  • fractional calculus
Accesso libero

Reducing the mast vibration of single-mast stacker cranes by gain-scheduled control

Pubblicato online: 30 Dec 2016
Pagine: 791 - 802

Astratto

Abstract

In the frame structure of stacker cranes harmful mast vibrations may appear due to the inertial forces of acceleration or the braking movement phase. This effect may reduce the stability and positioning accuracy of these machines. Unfortunately, their dynamic properties also vary with the lifted load magnitude and position. The purpose of the paper is to present a controller design method which can handle the effect of a varying lifted load magnitude and position in a dynamic model and at the same time reveals good reference signal tracking and mast vibration reducing properties. A controller design case study is presented step by step from dynamic modeling through to the validation of the resulting controller. In the paper the dynamic modeling possibilities of single-mast stacker cranes are summarized. The handling of varying dynamical behavior is realized via the polytopic LPV modeling approach. Based on this modeling technique, a gain-scheduled controller design method is proposed, which is suitable for achieving the goals set. Finally, controller validation is presented by means of time domain simulations.

Keywords

  • robust control
  • LPV systems
  • gain-scheduling
  • stacker cranes
Accesso libero

Set-membership identifiability of nonlinear models and related parameter estimation properties

Pubblicato online: 30 Dec 2016
Pagine: 803 - 813

Astratto

Abstract

Identifiability guarantees that the mathematical model of a dynamic system is well defined in the sense that it maps unambiguously its parameters to the output trajectories. This paper casts identifiability in a set-membership (SM) framework and relates recently introduced properties, namely, SM-identifiability, μ-SM-identifiability, and ε-SM-identifiability, to the properties of parameter estimation problems. Soundness and ε-consistency are proposed to characterize these problems and the solution returned by the algorithm used to solve them. This paper also contributes by carefully motivating and comparing SM-identifiability, μ-SM-identifiability and ε-SM-identifiability with related properties found in the literature, and by providing a method based on differential algebra to check these properties.

Keywords

  • identifiability
  • bounded uncertainty
  • set-membership estimation
  • nonlinear dynamic models
Accesso libero

Fault isolability with different forms of the faults–symptoms relation

Pubblicato online: 30 Dec 2016
Pagine: 815 - 826

Astratto

Abstract

The definitions and conditions for fault isolability of single faults for various forms of the diagnostic relation are reviewed. Fault isolability and unisolability on the basis of a binary diagnostic matrix are analyzed. Definitions for conditional and unconditional isolability and unisolability on the basis of a fault information system (FIS), symptom sequences and directional residuals are formulated. General definitions for conditional and unconditional isolability and unisolability in the cases of simultaneous evaluation of diagnostic signal values and a sequence of symptoms are provided. A comprehensive example is discussed.

Keywords

  • diagnosis
  • fault diagnosis
  • fault isolation
  • sequences
  • information systems
Accesso libero

Switching time estimation and active mode recognition using a data projection method

Pubblicato online: 30 Dec 2016
Pagine: 827 - 840

Astratto

Abstract

This paper proposes a data projection method (DPM) to detect a mode switching and recognize the current mode in a switching system. The main feature of this method is that the precise knowledge of the system model, i.e., the parameter values, is not needed. One direct application of this technique is fault detection and identification (FDI) when a fault produces a change in the system dynamics. Mode detection and recognition correspond to fault detection and identification, and switching time estimation to fault occurrence time estimation. The general principle of the DPM is to generate mode indicators, namely, residuals, using matrix projection techniques, where matrices are composed of input and output measured data. The DPM is presented in detail, and properties of switching detectability (fault detectability) and discernability between modes (fault identifiability) are characterized and discussed. The great advantage of this method, compared with other techniques in the literature, is that it does not need the model parameter values and thus can be applied to systems of the same type without identifying their parameters. This is particularly interesting in the design of generic embedded fault diagnosis algorithms.

Keywords

  • switching systems
  • mode recognition
  • fault detection and isolation
  • data-driven method
  • mode discernability
  • switching detectability
  • fault identifiability
Accesso libero

Performance evaluation of an M/G/n-type queue with bounded capacity and packet dropping

Pubblicato online: 30 Dec 2016
Pagine: 841 - 854

Astratto

Abstract

A queueing system of the M/G/n-type, n ≥ 1, with a bounded total volume is considered. It is assumed that the volumes of the arriving packets are generally distributed random variables. Moreover, the AQM-type mechanism is used to control the actual buffer state: each of the arriving packets is dropped with a probability depending on its volume and the occupied volume of the system at the pre-arrival epoch. The explicit formulae for the stationary queue-size distribution and the loss probability are found. Numerical examples illustrating theoretical formulae are given as well.

Keywords

  • AQM algorithms
  • finite buffer
  • loss probability
  • total packet volume
  • queue-size distribution
Accesso libero

An advance in infinite graph models for the analysis of transportation networks

Pubblicato online: 30 Dec 2016
Pagine: 855 - 869

Astratto

Abstract

This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph. It also relates the new results with the corresponding situations for the finite case. In particular, concepts from ‘finite’ graph theory, like the average degree and the extremal number, are generalized and computed for some specific cases. Finally, some applications of infinite graphs to the transportation of dangerous goods are presented; they involve the analysis of networks and percolation thresholds.

Keywords

  • infinite graph
  • average degree
  • extremal problems
  • road transport network
  • percolation
Accesso libero

Lookahead selective sampling for incomplete data

Pubblicato online: 30 Dec 2016
Pagine: 871 - 884

Astratto

Abstract

Missing values in data are common in real world applications. There are several methods that deal with this problem. In this paper we present lookahead selective sampling (LSS) algorithms for datasets with missing values. We developed two versions of selective sampling. The first one integrates a distance function that can measure the similarity between pairs of incomplete points within the framework of the LSS algorithm. The second algorithm uses ensemble clustering in order to represent the data in a cluster matrix without missing values and then run the LSS algorithm based on the ensemble clustering instance space (LSS-EC). To construct the cluster matrix, we use the k-means and mean shift clustering algorithms especially modified to deal with incomplete datasets. We tested our algorithms on six standard numerical datasets from different fields. On these datasets we simulated missing values and compared the performance of the LSS and LSS-EC algorithms for incomplete data to two other basic methods. Our experiments show that the suggested selective sampling algorithms outperform the other methods.

Keywords

  • selective sampling
  • missing values
  • ensemble clustering
Accesso libero

A comparison of hole-filling methods in 3D

Pubblicato online: 30 Dec 2016
Pagine: 885 - 903

Astratto

Abstract

This paper presents a review of the most relevant current techniques that deal with hole-filling in 3D models. Contrary to earlier reports, which approach mesh repairing in a sparse and global manner, the objective of this review is twofold. First, a specific and comprehensive review of hole-filling techniques (as a relevant part in the field of mesh repairing) is carried out. We present a brief summary of each technique with attention paid to its algorithmic essence, main contributions and limitations. Second, a solid comparison between 34 methods is established. To do this, we define 19 possible meaningful features and properties that can be found in a generic hole-filling process. Then, we use these features to assess the virtues and deficiencies of the method and to build comparative tables. The purpose of this review is to make a comparative hole-filling state-of-the-art available to researchers, showing pros and cons in a common framework.

Keywords

  • survey
  • 3D polygonal models
  • repairing meshes
  • hole-filling
  • restoration algorithms
Accesso libero

The impatience mechanism as a diversity maintaining and saddle crossing strategy

Pubblicato online: 30 Dec 2016
Pagine: 905 - 918

Astratto

Abstract

The impatience mechanism diversifies the population and facilitates escaping from a local optima trap by modifying fitness values of poorly adapted individuals. In this paper, two versions of the impatience mechanism coupled with a phenotypic model of evolution are studied. A population subordinated to a basic version of the impatience mechanism polarizes itself and evolves as a dipole centered around an averaged individual. In the modified version, the impatience mechanism is supplied with extra knowledge about a currently found optimum. In this case, the behavior of a population is quite different than previously-considerable diversification is also observed, but the population is not polarized and evolves as a single cluster. The impatience mechanism allows crossing saddles relatively fast in different configurations of bimodal and multimodal fitness functions. Actions of impatience mechanisms are shown and compared with evolution without the impatience and with a fitness sharing. The efficiency of crossing saddles is experimentally examined for different fitness functions. Results presented in the paper confirm good properties of the impatience mechanism in diversity maintaining and saddle crossing.

Keywords

  • phenotypic evolution
  • impatience operator without and with extra knowledge
  • polarization of population
  • maintaining population diversity
  • saddle crossing
Accesso libero

Tiling arbitrarily nested loops by means of the transitive

Pubblicato online: 30 Dec 2016
Pagine: 919 - 939

Astratto

Abstract

A novel approach to generation of tiled code for arbitrarily nested loops is presented. It is derived via a combination of the polyhedral and iteration space slicing frameworks. Instead of program transformations represented by a set of affine functions, one for each statement, it uses the transitive closure of a loop nest dependence graph to carry out corrections of original rectangular tiles so that all dependences of the original loop nest are preserved under the lexicographic order of target tiles. Parallel tiled code can be generated on the basis of valid serial tiled code by means of applying affine transformations or transitive closure using on input an inter-tile dependence graph whose vertices are represented by target tiles while edges connect dependent target tiles. We demonstrate how a relation describing such a graph can be formed. The main merit of the presented approach in comparison with the well-known ones is that it does not require full permutability of loops to generate both serial and parallel tiled codes; this increases the scope of loop nests to be tiled.

Keywords

  • tiling
  • transitive closure
  • source-to-source compiler
  • polyhedral model
  • iteration space slicing

Pianifica la tua conferenza remota con Sciendo