Search results

Recently, star variables and the post-crisis nature of cyclical fluctuations have attracted a great deal of interest. In this chapter, the authors investigate different methods of assessing business cycles (BCs) for the European Union in general and the euro area in particular. First, the authors conduct a Monte Carlo (MC) experiment using a broad spectrum of univariate trend-cycle decomposition methods. The simulation aims to examine the ability of the analysed methods to find the observed simulated cycle with structural properties similar to actual macroeconomic data. For the simulation, the authors used the structural model’s parameters calibrated to the euro area’s real gross domestic product (GDP) and unemployment rate. The simulation outcomes indicate the sufficient composition of the suite of models (SoM) consisting of popular Hodrick–Prescott, Christiano–Fitzgerald and structural trend-cycle-seasonal filters, then used for the real application. The authors find that: (i) there is a high level of model uncertainty in comparing the estimates; (ii) growth rate (acceleration) cycles have often the worst performances, but they could be useful as early-warning predictors of turning points in growth and BCs; and (iii) the best-performing MC approaches provide a reasonable combination as the SoM. When swings last less time and/or are smaller, it is easier to pick a good alternative method to the suite to capture the BC for real GDP. Second, the authors estimate the BCs for real GDP and unemployment data varying from 1995Q1 to 2020Q4 (GDP) or 2020Q3 (unemployment), ending up with 28 cycles per country. This analysis also confirms that the BCs of euro area members are quite synchronized with the aggregate euro area. Some major differences can be found, however, especially in the case of periphery and new member states, with the latter improving in terms of coherency after the global financial crisis. The German cycles are among the cyclical movements least synchronized with the aggregate euro area.

In this article the authors will focus on the state of the art on information filtering and recommender systems based on trust. Then the authors will represent a variety of filtering and recommendation techniques studied in different literature, like basic content filtering, collaborative filtering and hybrid filtering. The authors will also examine different trust-based recommendation algorithms. It will ends with a summary of the different existing approaches and it develops the link between trust, sustainability and recommender systems.

Methodology of this study will begin with a general introduction to the different approaches of recommendation systems; then define trust and its relationship with recommender systems. At the end the authors will present their approach to “trust-based recommendation systems”.

The purpose of this study is to understand how groups of users could improve trust in a recommendation system. The authors will examine how to evaluate the performance of recommender systems to ensure their ability to meet the needs that led to its creation and to make the system sustainable with respect to the information. The authors know very well that selecting a measure must depend on the type of data to be processed and user interests. Since the recommendation domain is derived from information search paradigms, it is obvious to use the evaluation measures of information systems.

The authors presented a list of recommendations systems. They examined and compared several recommendation approaches. The authors then analyzed the dominance of collaborative filtering in the field and the emergence of Recommender Systems in social web. Then the authors presented and analyzed different trust algorithms. Finally, their proposal was to measure the impact of trust in recommendation systems.

This paper aims to identify, evaluate and integrate the findings of all relevant and high-quality individual studies addressing one or more research questions about recommender systems and performing a comprehensive study of empirical research on recommender systems that have been divided into five main categories. To achieve this aim, the authors use systematic literature review (SLR) as a powerful method to collect and critically analyze the research papers. Also, the authors discuss the selected recommender systems and its main techniques, as well as their benefits and drawbacks in general.

In this paper, the SLR method is utilized with the aim of identifying, evaluating and integrating the findings of all relevant and high-quality individual studies addressing one or more research questions about recommender systems and performing a comprehensive study of empirical research on recommender systems that have been divided into five main categories. Also, the authors discussed recommender system and its techniques in general without a specific domain.

The major developments in categories of recommender systems are reviewed, and new challenges are outlined. Furthermore, insights on the identification of open issues and guidelines for future research are provided. Also, this paper presents the systematical analysis of the recommender system literature from 2005. The authors identified 536 papers, which were reduced to 51 primary studies through the paper selection process.

This survey will directly support academics and practical professionals in their understanding of developments in recommender systems and its techniques.

This paper aims to focus on real-world mobile systems, and thus propose relevant contribution to the special issue on “Real-world mobile robot systems”. This work on 3D laser semantic mobile mapping and particle filter localization dedicated for robot patrolling urban sites is elaborated with a focus on parallel computing application for semantic mapping and particle filter localization. The real robotic application of patrolling urban sites is the goal; thus, it has been shown that crucial robotic components have reach high Technology Readiness Level (TRL).

Three different robotic platforms equipped with different 3D laser measurement system were compared. Each system provides different data according to the measured distance, density of points and noise; thus, the influence of data into final semantic maps has been compared. The realistic problem is to use these semantic maps for robot localization; thus, the influence of different maps into particle filter localization has been elaborated. A new approach has been proposed for particle filter localization based on 3D semantic information, and thus, the behavior of particle filter in different realistic conditions has been elaborated. The process of using proposed robotic components for patrolling urban site, such as the robot checking geometrical changes of the environment, has been detailed.

The focus on real-world mobile systems requires different points of view for scientific work. This study is focused on robust and reliable solutions that could be integrated with real applications. Thus, new parallel computing approach for semantic mapping and particle filter localization has been proposed. Based on the literature, semantic 3D particle filter localization has not yet been elaborated; thus, innovative solutions for solving this issue have been proposed. Recently, a semantic mapping framework that was already published was developed. For this reason, this study claimed that the authors’ applied studies during real-world trials with such mapping system are added value relevant for this special issue.

The main problem is the compromise between computer power and energy consumed by heavy calculations, thus our main focus is to use modern GPGPU, NVIDIA PASCAL parallel processor architecture. Recent advances in GPGPUs shows great potency for mobile robotic applications, thus this study is focused on increasing mapping and localization capabilities by improving the algorithms. Current limitation is related with the number of particles processed by a single processor, and thus achieved performance of 500 particles in real-time is the current limitation. The implication is that multi-GPU architectures for increasing the number of processed particle can be used. Thus, further studies are required.

The research focus is related to real-world mobile systems; thus, practical aspects of the work are crucial. The main practical application is semantic mapping that could be used for many robotic applications. The authors claim that their particle filter localization is ready to integrate with real robotic platforms using modern 3D laser measurement system. For this reason, the authors claim that their system can improve existing autonomous robotic platforms. The proposed components can be used for detection of geometrical changes in the scene; thus, many practical functionalities can be applied such as: detection of cars, detection of opened/closed gate, etc. […] These functionalities are crucial elements of the safe and security domain.

Improvement of safe and security domain is a crucial aspect of modern society. Protecting critical infrastructure plays an important role, thus introducing autonomous mobile platforms capable of supporting human operators of safe and security systems could have a positive impact if viewed from many points of view.

This study elaborates the novel approach of particle filter localization based on 3D data and semantic mapping. This original work could have a great impact on the mobile robotics domain, and thus, this study claims that many algorithmic and implementation issues were solved assuming real-task experiments. The originality of this work is influenced by the use of modern advanced robotic systems being a relevant set of technologies for proper evaluation of the proposed approach. Such a combination of experimental hardware and original algorithms and implementation is definitely an added value.

The purpose of this paper is to review and provide a detailed performance evaluation of a number of texture descriptors that analyse texture at micro‐level such as local binary patterns (LBP) and a number of standard filtering techniques that sample the texture information using either a bank of isotropic filters or Gabor filters.

The experimental tests were conducted on standard databases where the classification results are obtained for single and multiple texture orientations. The authors also analysed the performance of standard filtering texture analysis techniques (such as those based of LM and MR8 filter banks) when applied to the classification of texture images contained in standard Outex and Brodatz databases.

The most important finding resulting from this study is that although the LBP/C and the multi‐channel Gabor filtering techniques approach texture analysis from a different theoretical perspective, in this paper the authors have experimentally demonstrated that they share some common properties in regard to the way they sample the macro and micro properties of the texture.

Texture is a fundamental property of digital images and the development of robust image descriptors plays a crucial role in the process of image segmentation and scene understanding.

This paper contrast, from a practical and theoretical standpoint, the LBP and representative multi‐channel texture analysis approaches and a substantial number of experimental results were provided to evaluate their performance when applied to standard texture databases.

Very large-scale integration (VLSI) digital signal processing became very popular and is predominantly used in several emerging applications. The optimal design of multirate filter with improvement in performance parameters such as less area, high speed and less power is the challenging task in most of the signal processing applications. This study aims to propose several effective multirate filter structures to accomplish sampling rate conversion.

The multirate filter structures considered in this work are polyphase filter and coefficient symmetry-based finite impulse response filter. The symmetry scheme particularly brings down the complexity to significant extent. To bring improvement in speed, delay registers are inserted at appropriate path with the help of pipelining and retiming scheme.

In this paper, the three tasks have been considered. First, the polyphase coefficient symmetry and modified polyphase (MP) structure is designed. Second, the pipelining is applied to the polyphase structure and the obtained results are compared with the polyphase structure. In third, retiming is applied to the polyphase structure and the performance comparison is carried out. The structures are realized for various orders, and the comparative analysis is carried out with the filter order N = 12, 30, 42, 8, 11 and 24 and the results are stated. The performance of all the accomplished structures is analyzed using Altera Quartus with the family cyclone II, device EP2C70F672C6. The results show that the multirate filter using pipelining and retiming offers better performance when examining with the conventional structures. Retimed and pipelined MP structure achieves a speed enhancement of about 33.81% when examining with the conventional polyphase (CP) structure with retiming and pipelining for N = 24 and M = 5. Likewise, the 2/3 structure of pipelined coefficient symmetry approach offers area reduction of about 54.76% over 2/3 structure of pipelined polyphase approach for N = 30 with little reduction in power. The fine grain pipelined and retimed MP structure with N = 11 and M = 3 avails critical path delay reduction of about 28.15% when examining with the corresponding fine grain pipelined and retimed CP structure.

The proposed distinct structures offer better alternative to conventional structures because of the symmetric coefficients, performance enhancement using pipelining and retiming based rate conversion structures. The suggested structures can be used for achieving different rates in software radios.

The digital down converter (DDC) is a principal component in modern communication systems. The DDC process traditionally entails quadrature down conversion, bandwidth reducing filters and commensurate sample rate reduction. To avoid group delay, distortion linear phase FIR filters are used in the DDC. The filter performance specifications related to deep stopband attenuation, small in-band ripple and narrow transition bandwidth lead to filters with a large number of coefficients. To reduce the computational workload of the filtering process, filtering is often performed as a two-stage process, the first stage being a down sampling Hoegenauer (or cascade-integrated comb) filter and a reduced sample rate FIR filter. An alternative option is an M-Path polyphase partition of a band cantered FIR filter. Even though IIR filters offer reduced workload to implement a specific filtering task, the authors avoid using them because of their poor group delay characteristics. This paper aims to propose the design of M-path, approximately linear phase IIR filters as an alternative option to the M-path FIR filter.

Two filter designs are presented in the paper. The first approach uses linear phase IIR low pass structure to reduce the filter’s coefficient. Whereas the second approach uses multipath polyphase structure to design approximately linear phase IIR filter in DDC.

The authors have compared the performance and workload of the proposed polyphase structured IIR filters with state-of-the-art filter design used in DDC. The proposed design is seen to satisfy tight design specification with a significant reduction in arithmetic operations and required power consumption.

The proposed design is an alternate solution to the M-path polyphase FIR filter offering very less number of coefficients in the filter design. Proposed DDC using polyphase structured IIR filter satisfies the requirement of linear phase with the least number of computation cost in comparison with other DDC structure.

Although the existence of a close relationship between the areas of digital signal processing and time integration methodology is known, a systematic application of the concepts and methods of the first area to the second is missing. Such an approach is followed in this paper, arising from the fact that any time integration formula can be viewed as a digital filter of the applied excitation force, approximating as close as possible to the behaviour of a ‘prototype analogue filter’, which is in fact the semi discrete equations of motion of the system. This approach provides a universal framework for handling and analysing all various aspects of time integration formulae, such as analysis in the frequency domain, algebraic operations, accuracy and stability, aliasing, spurious oscillations generation, introduction of digital filters within the time integration formula, initial conditions handling and overshooting. Additionally it is shown that digital signal processing methods, such as pre‐ or post‐processing, time delays, etc. can be in certain cases a quite effective complement of the time integration scheme.

The purpose of this paper is to provide the results of investigation of multi‐moment statistical characteristics of chaos and apply them to improve the accuracy of nonlinear algorithms for chaos filtering for real‐time applications.

The approach to find multi‐moment statistical properties of chaos‐multi‐moment cumulant (covariance) functions of higher order is a generalization of the previously proposed (by the authors) “degenerated cumulant equations” method. Those multi‐moment cumulants functions are applied in the generalization of the Stratonovich‐Kushner equations (SKE) for the optimum algorithm of nonlinear filtering of chaos as well as for synthesis of the quasi‐optimum algorithms.

Results are presented to investigate the multi‐moment statistical properties of chaos and formulate the theoretical background for synthesis of multi‐moment optimum and quasi‐optimum algorithms for nonlinear filtering of chaos with the improved accuracy in the presence of additive white noise.

The paper presents new theoretical results of the statistical description of chaos, previously partially reported only from experimental studies. A novel approach for chaos filtering is also presented. The proposed approach is dedicated to further improvement of the filtering accuracy for the case of low (less than one) SNR scenarios and is important for implementation in real‐time processing. As an important practical example, the new modified EKF algorithm is proposed with the rather opportunistic characteristics of the filtering fidelity together with algorithm complexity – practically the same as the “classic” one‐moment EKF algorithm.

This paper deals with the problem of input/output-to-state stability (IOSS) of direct-form digital filters, which simultaneously contain external disturbances and two's complement nonlinearity. The nonlinearity under consideration is confined to the sector [–1, 1], which contains saturation, zeroing, two's complement and triangular.

The proposed condition is based on IOSS approach, which is capable of providing a framework for checking and analysing the stability of nonlinear system based on input as well as output information.

A linear matrix inequality (LMI)-based new sufficient criterion for the IOSS of the suggested system is obtained. The obtained criterion is capable of detecting the output-to-state stability (OSS) and asymptotic stability of direct-form digital filters with zero external disturbances. In addition, state-norm estimator for the filter under consideration is constructed by adopting an exponential-decay IOSS criterion. Several examples are provided to illustrate the usefulness of the proposed criteria.

The result of the paper is introduced for the first time, and it is suitable for stability analysis of interfered direct-form digital filter with two's complement overflow using IOSS approach.