Browsing by Author "Mahsud, Minhas"
Now showing 1 - 4 of 4
- Results Per Page
- Sort Options
Article Exploring Drivers of Luxury Brand Buying Behavior : an Empirical Study(Taylor & Francis Ltd, 2021) Akbar, Kashifa; Mahsud, Minhas; Afzal, Farkhanda; Cancan, Murat; Riaz, IqraThe motivations that drive customers towards purchasing luxury brands have complex psychological underpinnings that warrant careful examination. This research paper examines the effect of brand image (BdI), brand trust (BdT) and brand affect (BdA) on luxury brand buying behavior with an aim to understand consumer motivations towards luxury brands. A structured questionnaire consisting of validated scales for the said constructs was administered to a sample of 390 consumers outside luxury brand stores within the Punjab province of Pakistan. For the data analysis, Partial Least Squares structural equation modeling (PLS-SEM) was used. We assessed the three correlations revealing significant relationships between the constructs. The empirical study makes an important contribution to the luxury brand management literature along with providing productive implications to academicians and experts.Article An Improved Fast Error Convergence Topology for Pdα-Type Fractional-Order Ilc(Taylor & Francis Ltd, 2021) Riaz, Saleem; Lin, Hui; Mahsud, Minhas; Afzal, Deeba; Alsinai, Ammar; Cancan, MuratThe monotonic convergence of the PD alpha-type fractional-order iterative learning control algorithm is considered for a class of fractional-order linear systems. First, a theoretical analysis of the monotonic convergence of 1st and 2nd order PD alpha-type control algorithms is carried out in the typical terms of Lebesgue-p (L-p), and the sufficient conditions for their monotonic convergence are comprehended and extended to the case of N-order control algorithms; then the speed of convergence of the two is explained in detail. It is concluded that the conditions for convergence of the control algorithm are determined by the learning gain and the system's properties are together determined. Simulation experiment verifies the accuracy of proposed scheme and the validity of the control algorithm.Article National Space Legislation: a Dire Need for Pakistan(Taru Publications, 2021) Cancan, Murat; Mahsud, Minhas; Ullah, Shakir; Mahsud, ZafarThe world is advancing at a great pace in space related activities. Space use has expanded, pushing more and more countries and private commercial operations towards launching different projects. Space agencies across the world are playing a progressively vital role in different activities such as environmental management, meteorology, communications, navigation, resource surveying, global positioning and disaster monitoring etc. Space science and research has tremendous potential and can be developed for solutions of problems. Remote sensing, a satellite and aircraft-based sensor technology used to spot and categorize objects on Earth, can be used in Earth Science disciplines such as geography, ecology, and land surveying etc. Based on these useful applications of remote sensing, we propose that this technology may be used for dispute resolution of the land demarcations and fragmentation issues. Many countries have already entered into all the five space treaties and are taking further steps to consolidate their respective space law and policy. It is required that the government of Pakistan together with the national space agency work on formulating an effective space legislation for e country.Article Study of Some Connectivity Index of Subdivided Mk Graphs of Ladder and Triangular Ladder Graph(Taru Publications, 2020) Cancan, Murat; Afzal, Farkhanda; Mahsud, Minhas; Naeem, Mustafa; Afzal, DeebaAn m(k)-graph of a graph G is defined by taking m >= 2 copies G(v), ..., G(m) of a graph G in which every vertex u(h) of copy G(h) is adjacent to a corresponding vertex v(m) of copy G(m). An m(k)-graph is represented by m(k)(G). In this paper we work on some degree based connectivity indices of subdivided m(k)-graph generated by ladder and triangular ladder graph. Also closed formulas for computing various degree based topological indices of said families of graphs have been presented.