Scopus İndeksli Yayınlar Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/8651

Browse

Search Results

Now showing 1 - 10 of 14
  • Article
    Citation - WoS: 2
    Citation - Scopus: 2
    Order-Preserving Languages for the Supervisory Control of Automated Manufacturing Systems
    (Ieee-inst Electrical Electronics Engineers inc, 2020) Nooruldeen, Anas; Schmidt, Klaus Werner
    Automated manufacturing systems (AMSs) consist of computer-controlled interconnected manufacturing components (MCs) that are used to transport and process different product types. Each product type requires a certain sequence of processing steps in different MCs. Hereby, multiple product types can share processing steps on the same MC and the paths of different products types can overlap. In this paper we consider the modeling of AMSs in the scope of supervisory control for discrete event systems (DES). On the one hand, a suitable AMS model must allow the representation of sequential and concurrent processing steps in MCs. On the other hand, such model must be able to track different product types traveling through the AMS so as to process the products correctly. While previous work is commonly concerned with the first requirement, this paper identifies that the existing literature lacks a general treatment of the second requirement. Accordingly, we first introduce order-preserving (OP) languages that preserve the order of different product types in MCs and we propose a suitable finite state automaton model for OP languages. Then, we show that the composition of OP languages again leads to an OP language. That is, modeling MCs by OP languages, an OP model of a complete AMS that is suitable for supervisory control is obtained. In addition, it is possible to use both OP models and non-OP models for general AMSs, where MCs have different properties. We demonstrate the applicability of the proposed modeling technique by a flexible manufacturing system example.
  • Article
    Citation - WoS: 10
    Citation - Scopus: 14
    A Pairwise Deep Ranking Model for Relative Assessment of Parkinson's Disease Patients From Gait Signals
    (Ieee-inst Electrical Electronics Engineers inc, 2022) Ogul, Burcin Buket; Ozdemir, Suat
    Continuous monitoring of the symptoms is crucial to improve the quality of life for patients with Parkinson's Disease (PD). Thus, it is necessary to objectively assess the PD symptoms. Since manual assessment is subjective and prone to misinterpretation, computer-aided methods that use sensory measurements have recently been used to make objective PD assessment. Current methods follow an absolute assessment strategy, where the symptoms are classified into known categories or quantified with exact values. These methods are usually difficult to generalize and considered to be unreliable in practice. In this paper, we formulate the PD assessment problem as a relative assessment of one patient compared to another. For this assessment, we propose a new approach to the comparative analysis of gait signals obtained via foot-worn sensors. We introduce a novel pairwise deep-ranking model that is fed by data from a pair of patients, where the data is obtained from multiple ground reaction force sensors. The proposed model, called Ranking by Siamese Recurrent Network with Attention, takes two multivariate time-series as inputs and produces a probability of the first signal having a higher continuous attribute than the second one. In ten-fold cross-validation, the accuracy of pairwise ranking predictions can reach up to 82% with an AUROC of 0.89. The model outperforms the previous methods for PD monitoring when run in the same experimental setup. To the best of our knowledge, this is the first study that attempts to relatively assess PD patients using a pairwise ranking measure on sensory data. The model can serve as a complementary model to computer-aided prognosis tools by monitoring the progress of the patient during the applied treatment.
  • Article
    Citation - WoS: 17
    Citation - Scopus: 23
    Voronoi Boundary Visibility for Efficient Path Planning
    (Ieee-inst Electrical Electronics Engineers inc, 2020) Al-Dahhan, Mohammed Rabeea Hashim; Schmidt, Klaus Werner
    The subject of this paper is the computation of paths for mobile robots that navigate from a start position to a goal position in environments with static obstacles. Specifically, we focus on paths that are represented by straight lines. Such paths can for example directly be followed by omni-directional robots or can be used as an initial solution for path smoothing. In this context, the most common performance metrics are the path length, the obstacle clearance and the computation time. In this paper, we develop a new path planning algorithm that addresses all the stated performance metrics. Our method first determines all possible connections between the start position and goal position along the edges of the generalized Voronoi diagram (GVD) of a given obstacle map. The shortest connections are then refined using a balanced method for creating shortcuts along existing waypoints and introducing new waypoints in order to cut corners. As an important feature, our method reduces the number of required waypoints by iteratively adding new waypoints and then removing unnecessary waypoints along solution paths. Moreover, our method takes into account multiple start-goal connections, since the shortest start-goal connection along the edges of the GVD might not lead to the shortest solution path. A comprehensive computational evaluation for a large number of maps with different properties shows that the proposed method outperforms sampling-based algorithms such as Probabilistic Roadmaps (PRM) and exact methods such as Visibility Graphs (VG) by computing close-to-optimal solution paths with a specified minimum obstacle clearance in less time.
  • Article
    Citation - WoS: 5
    Citation - Scopus: 6
    Multi-Objective Trajectory Planning for Slung-Load Quadrotor System
    (Ieee-inst Electrical Electronics Engineers inc, 2021) Ergezer, Halit
    In this article, multi-objective trajectory planning has been carried out for a quadrotor carrying a slung load. The goal is to obtain non-dominated solutions for path length, mission duration, and dissipated energy cost functions. These costs are optimized by imposing constraints on the slung-load quadrotor system's endpoints, borders, obstacles, and dynamical equations. The dynamic model of a slung-load quadrotor system is used in the Euler-Lagrange formulation. Although the differential flatness feature is mostly used in this system's trajectory planning, a fully dynamic model has been used in our study. A new multi-objective Genetic Algorithm has been developed to solve path planning, aiming to optimize trajectory length, mission time, and energy consumed during the mission. The solution process has a three-phase algorithm: Phase-1 is about randomly generating waypoints, Phase-2 is about constructing the initial non-dominated pool, and the final phase, Phase-3, is obtaining the solution. In addition to conventional genetic operators, simple genetic operators are proposed to improve the trajectories locally. Pareto Fronts have been obtained corresponding to exciting scenarios. The method has been tested, and results have been presented at the end. A comparison of the solutions obtained with MOGA operators and MOPSO over hypervolume values is also presented.
  • Article
    Citation - WoS: 8
    Citation - Scopus: 8
    Analysis of Quantum Radar Cross-Section by Canonical Quantization Method (Full Quantum Theory)
    (Ieee-inst Electrical Electronics Engineers inc, 2020) Salmanogli, Ahmad; Gokcen, Dincer
    This article investigates the difference between two quantum-based theories to calculate the radar cross-section (RCS). Quantum radar cross-section (QRCS) has been commonly analyzed using the dipole approximation method, and the related results show that it can improve the sidelobe of the interference pattern in contrast to the classical methods. This study, on the other hand, utilizes the canonical quantization (or microscopic) method, which is a more comprehensive theory than the dipole approximation method to calculate the radar cross-section. It is shown that there are some similarities between two methods; nonetheless, there are some crucial quantities and factors that have been ignored in the dipole approximation methods. The main difference arises due to the interaction Hamiltonian that two methods relied on. The theoretical calculation shows some critical points suggesting that the dipole approximation method cannot cover all aspects of the radar cross-section calculation. To verify the mentioned point, we establish a new method in which the radar cross-section is calculated by merging the quantum approach with the method of moment (MoM), called quantum-method of moment (QMoM). The simulation results show that the newly established method is in harmony with the canonical quantization method.
  • Article
    Citation - WoS: 2
    Citation - Scopus: 2
    A New Computational Approach To Estimate the Subdivision Depth of N-Ary Subdivision Scheme
    (Ieee-inst Electrical Electronics Engineers inc, 2020) Shahzad, Aamir; Khan, Faheem; Baleanu, Dumitru; Chu, Yuming; Mustafa, Ghulam
    The n-ary subdivision scheme has traditionally been designed to generate smooth curve and surface from control polygon. In this paper, we propose a new subdivision depth computation technique for n-ary subdivision scheme. The existing techniques do not ensure the computation of subdivision depth unless some strong condition is assumed on the mask of the scheme. But our technique relaxes the effect of strong condition assumed on the mask of the scheme by increasing the number of convolution steps. Consequently, a more precise subdivision depth technique for a given error tolerance is presented in this paper.
  • Article
    Citation - WoS: 23
    Citation - Scopus: 32
    A Compact Multiband Printed Monopole Antenna With Hybrid Polarization Radiation for Gps, Lte, and Satellite Applications
    (Ieee-inst Electrical Electronics Engineers inc, 2020) Al-Mihrab, Mohammed A.; Salim, Ali J.; Ali, Jawad K.
    A new compact printed monopole antenna is presented in this paper. An open-loop hexagonal radiator excited by a microstrip feed line, which is printed on top of the substrate, which is FR4 type, while on another side, a partial ground plane is fixed and embedded with two pairs of slits as well as a pair of rectangular strips. Triple operating bands with two different polarization types are obtained. The lower band has right-hand circular polarization (RHCP) characteristic, whereas the upper band has left-hand circular polarization (LHCP) characteristic means that a dual-band dual-sense circular polarization (CP). Concerning the middle band, a linear polarization (LP) has been gotten in this antenna. Numerical analysis and experimental validation of the proposed antenna structure have been performed, and results are demonstrated. The measured impedance bandwidths (IBWs) are 14.7% (1.478-1.714 GHz), 6.8% (2.54-2.72 GHz), and 13.1% (4.29-4.89 GHz), respectively. The measured 3-dB axial ratio bandwidths (ARBWs) are 6.2% (1.510-1.606 GHz), and 22.7% (4.035-5.07 GHz) for the lower and the upper band, respectively. So, it's suitable for covering modern wireless applications such as GPS (Global Positioning System), LTE (Long Term Evaluation), and Satellite.
  • Article
    Citation - WoS: 4
    Citation - Scopus: 4
    A Class of Refinement Schemes With Two Shape Control Parameters
    (Ieee-inst Electrical Electronics Engineers inc, 2020) Hameed, Rabia; Mahmood, Ayesha; Baleanu, Dumitru; Mustafa, Ghulam
    A subdivision scheme defines a smooth curve or surface as the limit of a sequence of successive refinements of given polygon or mesh. These schemes take polygons or meshes as inputs and produce smooth curves or surfaces as outputs. In this paper, a class of combine refinement schemes with two shape control parameters is presented. These even and odd rules of these schemes have complexity three and four respectively. The even rule is designed to modify the vertices of the given polygon, whereas the odd rule is designed to insert a new point between every edge of the given polygon. These schemes can produce high order of continuous shapes than existing combine binary and ternary family of schemes. It has been observed that the schemes have interpolating and approximating behaviors depending on the values of parameters. These schemes have an interproximate behavior in the case of non-uniform setting of the parameters. These schemes can be considered as the generalized version of some of the interpolating and B-spline schemes. The theoretical as well as the numerical and graphical analysis of the shapes produced by these schemes are also presented.
  • Article
    Citation - WoS: 3
    Citation - Scopus: 7
    An Approximate-Analytical Solution To Analyze Fractional View of Telegraph Equations
    (Ieee-inst Electrical Electronics Engineers inc, 2020) Khan, Hassan; Farooq, Umar; Baleanu, Dumitru; Kumam, Poom; Arif, Muhammad; Ali, Izaz
    In the present research article, a modified analytical method is applied to solve time-fractional telegraph equations. The Caputo-operator is used to express the derivative of fractional-order. The present method is the combination of two well-known methods namely Mohan transformation method and Adomian decomposition method. The validity of the proposed technique is confirmed through illustrative examples. It is observed that the obtained solutions have strong contact with the exact solution of the examples. Moreover, it is investigated that the present method has the desired degree of accuracy and provided the graphs closed form solutions of all targeted examples. The graphs have verified the convergence analysis of fractional-order solutions to integer-order solution. In conclusion, the suggested method is simple, straightforward and an effective technique to solve fractional-order partial differential equations.
  • Article
    Citation - WoS: 36
    Citation - Scopus: 35
    Families of Travelling Waves Solutions for Fractional-Order Extended Shallow Water Wave Equations, Using an Innovative Analytical Method
    (Ieee-inst Electrical Electronics Engineers inc, 2019) Shoaib; Balean, Dumitru; Kumam, Poom; Al-Zaidy, Jameel F.; Khan, Hassan; Baleanu, Dumitru
    In the present research article, an efficient analytical technique is applied for travelling waves solutions of fractional partial differential equations. The investigated problems are reduced to ordinary differential equations, by a variable transformation. The solutions of the resultant ordinary differential equations are expressed in the term of some suitable polynomials, which provide trigonometric, hyperbolic and rational function solutions with some free parameters. To confirm the reliability and novelty of the current work, the proposed method is applied for the solutions of (2+1) and (3+1)-dimensional fractional-order extended shallow water wave equations.