Challenges and opportunities for blockchain technology adoption : a systematic review
- Chhina, Shipra, Chadhar, Mehmood, Vatanasakdakul, Savanid, Chetty, Madhu
- Authors: Chhina, Shipra , Chadhar, Mehmood , Vatanasakdakul, Savanid , Chetty, Madhu
- Date: 2019
- Type: Text , Conference paper
- Relation: 30th Australasian Conference on Information Systems (ACIS), 9-11 December, Perth (Australia)
- Full Text:
- Reviewed:
- Description: Blockchain technology promises to significantly impact current business processes in industries from various sectors and reduce transactional cost. Firms, suppliers, government, financial institutions etc. are anticipating a business model transformation through blockchain by accomplishing a decentralized architecture of interorganizational dealings without intermediaries. In spite of its immense potential, however, there are key challenges of blockchain implementation which need to be studied for identifying the opportunities arising and for its successful implementations in future. In this paper, we aim to identify these challenges for blockchain adoption and classify them for clearer understanding. To pursue this effectively, this paper follows a hybrid model of systematic literature review. This paper also explicitly enumerates future research opportunities to lead industry and researchers in correct directions
- Authors: Chhina, Shipra , Chadhar, Mehmood , Vatanasakdakul, Savanid , Chetty, Madhu
- Date: 2019
- Type: Text , Conference paper
- Relation: 30th Australasian Conference on Information Systems (ACIS), 9-11 December, Perth (Australia)
- Full Text:
- Reviewed:
- Description: Blockchain technology promises to significantly impact current business processes in industries from various sectors and reduce transactional cost. Firms, suppliers, government, financial institutions etc. are anticipating a business model transformation through blockchain by accomplishing a decentralized architecture of interorganizational dealings without intermediaries. In spite of its immense potential, however, there are key challenges of blockchain implementation which need to be studied for identifying the opportunities arising and for its successful implementations in future. In this paper, we aim to identify these challenges for blockchain adoption and classify them for clearer understanding. To pursue this effectively, this paper follows a hybrid model of systematic literature review. This paper also explicitly enumerates future research opportunities to lead industry and researchers in correct directions
Factors affecting the organizational adoption of blockchain technology : extending the technology–organization– environment (TOE) framework in the Australian context
- Malik, Saleem, Chadhar, Mehmood, Vatanasakdakul, Savanid, Chetty, Madhu
- Authors: Malik, Saleem , Chadhar, Mehmood , Vatanasakdakul, Savanid , Chetty, Madhu
- Date: 2021
- Type: Text , Journal article
- Relation: Sustainability (Switzerland) Vol. 13, no. 16 (2021), p.
- Full Text:
- Reviewed:
- Description: Blockchain technology (BCT) has been gaining popularity due to its benefits for almost every industry. However, despite its benefits, the organizational adoption of BCT is rather limited. This lack of uptake motivated us to identify the factors that influence the adoption of BCT from an organizational perspective. In doing this, we reviewed the BCT literature, interviewed BCT experts, and proposed a research model based on the TOE framework. Specifically, we theorized the role of technological (perceived benefits, compatibility, information transparency, and disintermediation), organizational (organization innovativeness, organizational learning capability, and top management support), and environmental (competition intensity, government support, trading partners readiness, and standards uncertainty) factors in the organizational adoption of BCT in Australia. We confirmed the model with a sample of adopters and potential adopter organizations in Aus-tralia. The results show a significant role of the proposed factors in the organizational adoption of BCT in Australia. Additionally, we found that the relationship between the influential factors and BCT adoption is moderated by “perceived risks”. The study extends the TOE framework by adding factors that were ignored in previous studies on BCT adoption, such as perceived information trans-parency, perceived disintermediation, organizational innovativeness, organizational learning capa-bility, and standards uncertainty. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.
- Authors: Malik, Saleem , Chadhar, Mehmood , Vatanasakdakul, Savanid , Chetty, Madhu
- Date: 2021
- Type: Text , Journal article
- Relation: Sustainability (Switzerland) Vol. 13, no. 16 (2021), p.
- Full Text:
- Reviewed:
- Description: Blockchain technology (BCT) has been gaining popularity due to its benefits for almost every industry. However, despite its benefits, the organizational adoption of BCT is rather limited. This lack of uptake motivated us to identify the factors that influence the adoption of BCT from an organizational perspective. In doing this, we reviewed the BCT literature, interviewed BCT experts, and proposed a research model based on the TOE framework. Specifically, we theorized the role of technological (perceived benefits, compatibility, information transparency, and disintermediation), organizational (organization innovativeness, organizational learning capability, and top management support), and environmental (competition intensity, government support, trading partners readiness, and standards uncertainty) factors in the organizational adoption of BCT in Australia. We confirmed the model with a sample of adopters and potential adopter organizations in Aus-tralia. The results show a significant role of the proposed factors in the organizational adoption of BCT in Australia. Additionally, we found that the relationship between the influential factors and BCT adoption is moderated by “perceived risks”. The study extends the TOE framework by adding factors that were ignored in previous studies on BCT adoption, such as perceived information trans-parency, perceived disintermediation, organizational innovativeness, organizational learning capa-bility, and standards uncertainty. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.
An exploratory study of the adoption of blockchain technology among Australian organizations : a theoretical model
- Malik, Saleem, Chadhar, Mehmood, Chetty, Madhu, Vatanasakdakul, Savanid
- Authors: Malik, Saleem , Chadhar, Mehmood , Chetty, Madhu , Vatanasakdakul, Savanid
- Date: 2020
- Type: Text , Conference paper
- Relation: 17th European, Mediterranean, and Middle Eastern Conference on Information Systems, EMCIS 2020; Dubai; 25-26 November 2020 Vol. 402, p. 205-220
- Full Text:
- Reviewed:
- Description: Scholarly and commercial literature indicates several applications of Blockchain Technology (BCT) in different industries e.g. health, finance, supply chain, government, and energy. Despite abundant benefits reported and growing prominence, BCT has been facing various challenges across the globe, including low adoption by organizations. There is a dearth of studies that examined the organizational adoption of blockchain technology, particularly in Australia. This lack of uptake provides the rationale to initiate this research to identify the factors influencing the Australian organizations to adopt BCT. To achieve this, we conducted a qualitative study based on the Technology, Organization, Environment (TOE) framework. The study proposes a theoretical model grounded on the findings of semi-structured interviews of blockchain experts in Australia. The proposed model shows that the organizational adoption of blockchain is influenced by perceived benefits, compatibility, and complexity, organization innovativeness, organizational learning capability, competitive intensity, government support, trading partner readiness, and standards uncertainty. © 2020, Springer Nature Switzerland AG.
- Authors: Malik, Saleem , Chadhar, Mehmood , Chetty, Madhu , Vatanasakdakul, Savanid
- Date: 2020
- Type: Text , Conference paper
- Relation: 17th European, Mediterranean, and Middle Eastern Conference on Information Systems, EMCIS 2020; Dubai; 25-26 November 2020 Vol. 402, p. 205-220
- Full Text:
- Reviewed:
- Description: Scholarly and commercial literature indicates several applications of Blockchain Technology (BCT) in different industries e.g. health, finance, supply chain, government, and energy. Despite abundant benefits reported and growing prominence, BCT has been facing various challenges across the globe, including low adoption by organizations. There is a dearth of studies that examined the organizational adoption of blockchain technology, particularly in Australia. This lack of uptake provides the rationale to initiate this research to identify the factors influencing the Australian organizations to adopt BCT. To achieve this, we conducted a qualitative study based on the Technology, Organization, Environment (TOE) framework. The study proposes a theoretical model grounded on the findings of semi-structured interviews of blockchain experts in Australia. The proposed model shows that the organizational adoption of blockchain is influenced by perceived benefits, compatibility, and complexity, organization innovativeness, organizational learning capability, competitive intensity, government support, trading partner readiness, and standards uncertainty. © 2020, Springer Nature Switzerland AG.
Factors affecting the organisational adoption of blockchain technology in australia : a mixed-methods approach
- Authors: Malik, Muhammad Saleem
- Date: 2022
- Type: Text , Thesis , PhD
- Full Text:
- Description: Blockchain (BCT) is an emerging technology that promises many benefits for organisations, such as disintermediation, data security, data transparency, a single version of the truth, and trust among trading partners. Despite its multiple benefits, the adoption rate of BCT among organisations has not reached a significantly high level worldwide. The present thesis addresses this issue in the Australian context. There is a knowledge gap in what specific factors, among the plethora of factors reported in the extant scholarly and commercial literature, affect Australian organisations while deciding to adopt BCT. To fill this gap, this thesis uses a mixed-methods approach known as sequential exploratory mixed methods. In this approach, the research starts with a qualitative phase as an initial phase followed by a quantitative phase. During the qualitative phase, data were collected through semi-structured interviews of the BCT experts and decision-makers working with the ifferent Australian organisations that adopted or were in the process of adopting BCT. The Technology, Organisation, Environment (TOE) framework, based on the qualitative interpretative approach, was used as a theoretical lens during the qualitative phase. The qualitative data were analyzed using the thematic analysis technique with the SQR NVivo software. The analysis shows that the different factors, belonging to the technological, organisational, and environmental contexts, affect the organisational decision to adopt BCT in Australia. The technological factors include perceived benefits, perceived computability, perceived complexity, perceived disintermediation, and perceived information transparency; organisational factors are organisational innovativeness, organisational learning capability, top management support; environmental factors consist of government support, standards uncertainty, competition intensity, and trading partners readiness. The qualitative analysis also shows the direct and moderating effect of the perceived risks between the relationship of the identified factors and organisational adoption of BCT. Based on the findings of the qualitative phase, the thesis develops a theoretical conceptual model, which shows the relationship between the factors and the organisational adoption of BCT. To increase the external validity of the developed conceptual model, the thesis started a quantitative phase with the administration of an online survey for data collection. Certain criteria were set to screen out the irrelevant participants in the survey. During this phase, hypotheses were proposed for the relationship of the factors identified in the qualitative phase and the organisational adoption of BCT. The survey data was analyzed using the PLS Structural Equation Modelling (SEM) technique with the SmartPLS 3 software. The quantitative analysis confirms the findings of the qualitative phase that the perceived benefits, perceived compatibility, perceived information transparency, perceived disintermediation, organisational innovativeness, organisational learning capability, top management support, competitive intensity, government support, and trading partner readiness have a positive effect on the organisational adoption of BCT. Whereas the perceived complexity, standards uncertainty, and perceived risks have a negative effect. The analysis also shows that the moderating effects of perceived risks are significant in the relationship of perceived compatibility, perceived information transparency, perceived disintermediation, organisational innovativeness, organisation innovativeness, competition intensity, and organisational adoption of BCT. Contrary to the qualitative findings, ‘perceived risks’ has no moderating effects on the relationship of perceived benefits, organisational learning capability, top management support, government support, trading partner readiness, and the adoption of BCT. The thesis has both theoretical and practical contributions, which are useful both for theory development and decision-making for the adoption of BCT in Australia. Theoretically, this thesis contributes to the existing IT adoption literature in several ways. Firstly, the thesis provides empirical evidence about the factors affecting organisational adoption of BCT in Australia. This is the first in-depth sequential exploratory mixed methods research that bridges this knowledge gap in the extant literature. The identification of such factors is important, particularly for the Australian government and organisations interested in the value creation of BCT. Second, the thesis reports the effect of new factors, namely, perceived information transparency, perceived disintermediation, organisational innovativeness, organisational learning capability, standards uncertainty, trading partner readiness, and competition intensity on BCT adoption that are exclusively identified in this research. Third, this thesis confirms the findings of the past studies that the factors of perceived benefits and perceived compatibility, perceived complexity, and top management support have an effect on the organisational adoption of BCT. Fourth, according to the best of the authors' knowledge, this is the first research that has used the qualitative interpretive research approach to investigate the organisational adoption of BCT. Therefore, the thesis confirms the suitability of the qualitative interpretive research approach for BCT adoption. Lastly, most of the researchers have used the TOE framework in either in qualitative or quantitative research. This thesis proves its validity in mixed methods research as well. The thesis's practical contributions are discussed in chapter 7.
- Description: Doctor of Philosophy
- Authors: Malik, Muhammad Saleem
- Date: 2022
- Type: Text , Thesis , PhD
- Full Text:
- Description: Blockchain (BCT) is an emerging technology that promises many benefits for organisations, such as disintermediation, data security, data transparency, a single version of the truth, and trust among trading partners. Despite its multiple benefits, the adoption rate of BCT among organisations has not reached a significantly high level worldwide. The present thesis addresses this issue in the Australian context. There is a knowledge gap in what specific factors, among the plethora of factors reported in the extant scholarly and commercial literature, affect Australian organisations while deciding to adopt BCT. To fill this gap, this thesis uses a mixed-methods approach known as sequential exploratory mixed methods. In this approach, the research starts with a qualitative phase as an initial phase followed by a quantitative phase. During the qualitative phase, data were collected through semi-structured interviews of the BCT experts and decision-makers working with the ifferent Australian organisations that adopted or were in the process of adopting BCT. The Technology, Organisation, Environment (TOE) framework, based on the qualitative interpretative approach, was used as a theoretical lens during the qualitative phase. The qualitative data were analyzed using the thematic analysis technique with the SQR NVivo software. The analysis shows that the different factors, belonging to the technological, organisational, and environmental contexts, affect the organisational decision to adopt BCT in Australia. The technological factors include perceived benefits, perceived computability, perceived complexity, perceived disintermediation, and perceived information transparency; organisational factors are organisational innovativeness, organisational learning capability, top management support; environmental factors consist of government support, standards uncertainty, competition intensity, and trading partners readiness. The qualitative analysis also shows the direct and moderating effect of the perceived risks between the relationship of the identified factors and organisational adoption of BCT. Based on the findings of the qualitative phase, the thesis develops a theoretical conceptual model, which shows the relationship between the factors and the organisational adoption of BCT. To increase the external validity of the developed conceptual model, the thesis started a quantitative phase with the administration of an online survey for data collection. Certain criteria were set to screen out the irrelevant participants in the survey. During this phase, hypotheses were proposed for the relationship of the factors identified in the qualitative phase and the organisational adoption of BCT. The survey data was analyzed using the PLS Structural Equation Modelling (SEM) technique with the SmartPLS 3 software. The quantitative analysis confirms the findings of the qualitative phase that the perceived benefits, perceived compatibility, perceived information transparency, perceived disintermediation, organisational innovativeness, organisational learning capability, top management support, competitive intensity, government support, and trading partner readiness have a positive effect on the organisational adoption of BCT. Whereas the perceived complexity, standards uncertainty, and perceived risks have a negative effect. The analysis also shows that the moderating effects of perceived risks are significant in the relationship of perceived compatibility, perceived information transparency, perceived disintermediation, organisational innovativeness, organisation innovativeness, competition intensity, and organisational adoption of BCT. Contrary to the qualitative findings, ‘perceived risks’ has no moderating effects on the relationship of perceived benefits, organisational learning capability, top management support, government support, trading partner readiness, and the adoption of BCT. The thesis has both theoretical and practical contributions, which are useful both for theory development and decision-making for the adoption of BCT in Australia. Theoretically, this thesis contributes to the existing IT adoption literature in several ways. Firstly, the thesis provides empirical evidence about the factors affecting organisational adoption of BCT in Australia. This is the first in-depth sequential exploratory mixed methods research that bridges this knowledge gap in the extant literature. The identification of such factors is important, particularly for the Australian government and organisations interested in the value creation of BCT. Second, the thesis reports the effect of new factors, namely, perceived information transparency, perceived disintermediation, organisational innovativeness, organisational learning capability, standards uncertainty, trading partner readiness, and competition intensity on BCT adoption that are exclusively identified in this research. Third, this thesis confirms the findings of the past studies that the factors of perceived benefits and perceived compatibility, perceived complexity, and top management support have an effect on the organisational adoption of BCT. Fourth, according to the best of the authors' knowledge, this is the first research that has used the qualitative interpretive research approach to investigate the organisational adoption of BCT. Therefore, the thesis confirms the suitability of the qualitative interpretive research approach for BCT adoption. Lastly, most of the researchers have used the TOE framework in either in qualitative or quantitative research. This thesis proves its validity in mixed methods research as well. The thesis's practical contributions are discussed in chapter 7.
- Description: Doctor of Philosophy
Adoption of blockchain technology : exploring the factors affecting organizational decision
- Malik, Saleem, Chadhar, Mehmood, Chetty, Madhu, Vatanasakdakul, Savanid
- Authors: Malik, Saleem , Chadhar, Mehmood , Chetty, Madhu , Vatanasakdakul, Savanid
- Date: 2022
- Type: Text , Journal article , Review
- Relation: Human Behavior and Emerging Technologies Vol. 2022, no. (2022), p.
- Full Text:
- Reviewed:
- Description: Blockchain (BCT) is an emerging technology that promises many benefits for organizations, for instance, disintermediation, data security, data transparency, a single version of the truth, and trust among trading partners. Despite its multiple benefits, the adoption rate of BCT among organizations has not reached a significantly high level worldwide, thus requiring further research in this space. The present study addresses this issue in the Australian context. There is a knowledge gap in what specific factors, among the plethora of factors reported in the extant literature, affect the organizational adoption of BCT in Australia. To fill this gap, the study uses the qualitative interpretative research approach along with the technology-organization-environment (TOE) framework as a theoretical lens. The data was mainly drawn from the literature review and semi-structured interviews of the decision-makers and senior IT people from the BCT adopter and potential adopter organizations in Australia. According to the findings, perceived information transparency, perceived risks, organization innovativeness, organization learning capability, standards uncertainty, and competition intensity influence organizational adoption of BCT in Australia. These factors are exclusively identified in this study. The study also validates the influence of perceived benefits and perceived compatibility on BCT adoption that are reported in the past studies. Practically, these findings are helpful for the Australian government and public and private organizations to develop better policies and make informed decisions for the organizational adoption of BCT. The findings would guide decision-makers to think about the adoption of BCT strategically. The study also has theoretical implications explained in the discussion section. © 2022 Saleem Malik et al.
- Authors: Malik, Saleem , Chadhar, Mehmood , Chetty, Madhu , Vatanasakdakul, Savanid
- Date: 2022
- Type: Text , Journal article , Review
- Relation: Human Behavior and Emerging Technologies Vol. 2022, no. (2022), p.
- Full Text:
- Reviewed:
- Description: Blockchain (BCT) is an emerging technology that promises many benefits for organizations, for instance, disintermediation, data security, data transparency, a single version of the truth, and trust among trading partners. Despite its multiple benefits, the adoption rate of BCT among organizations has not reached a significantly high level worldwide, thus requiring further research in this space. The present study addresses this issue in the Australian context. There is a knowledge gap in what specific factors, among the plethora of factors reported in the extant literature, affect the organizational adoption of BCT in Australia. To fill this gap, the study uses the qualitative interpretative research approach along with the technology-organization-environment (TOE) framework as a theoretical lens. The data was mainly drawn from the literature review and semi-structured interviews of the decision-makers and senior IT people from the BCT adopter and potential adopter organizations in Australia. According to the findings, perceived information transparency, perceived risks, organization innovativeness, organization learning capability, standards uncertainty, and competition intensity influence organizational adoption of BCT in Australia. These factors are exclusively identified in this study. The study also validates the influence of perceived benefits and perceived compatibility on BCT adoption that are reported in the past studies. Practically, these findings are helpful for the Australian government and public and private organizations to develop better policies and make informed decisions for the organizational adoption of BCT. The findings would guide decision-makers to think about the adoption of BCT strategically. The study also has theoretical implications explained in the discussion section. © 2022 Saleem Malik et al.
- Authors: Mestrom, Sanne
- Date: 2012
- Type: Text , Visual art work
- Full Text:
Soil moisture, organic carbon, and nitrogen content prediction with hyperspectral data using regression models
- Datta, Dristi, Paul, Manoranjan, Murshed, Manzur, Teng, Shyh Wei, Schmidtke, Leigh
- Authors: Datta, Dristi , Paul, Manoranjan , Murshed, Manzur , Teng, Shyh Wei , Schmidtke, Leigh
- Date: 2022
- Type: Text , Journal article
- Relation: Sensors (Basel, Switzerland) Vol. 22, no. 20 (2022), p.
- Full Text:
- Reviewed:
- Description: Soil moisture, soil organic carbon, and nitrogen content prediction are considered significant fields of study as they are directly related to plant health and food production. Direct estimation of these soil properties with traditional methods, for example, the oven-drying technique and chemical analysis, is a time and resource-consuming approach and can predict only smaller areas. With the significant development of remote sensing and hyperspectral (HS) imaging technologies, soil moisture, carbon, and nitrogen can be estimated over vast areas. This paper presents a generalized approach to predicting three different essential soil contents using a comprehensive study of various machine learning (ML) models by considering the dimensional reduction in feature spaces. In this study, we have used three popular benchmark HS datasets captured in Germany and Sweden. The efficacy of different ML algorithms is evaluated to predict soil content, and significant improvement is obtained when a specific range of bands is selected. The performance of ML models is further improved by applying principal component analysis (PCA), a dimensional reduction method that works with an unsupervised learning method. The effect of soil temperature on soil moisture prediction is evaluated in this study, and the results show that when the soil temperature is considered with the HS band, the soil moisture prediction accuracy does not improve. However, the combined effect of band selection and feature transformation using PCA significantly enhances the prediction accuracy for soil moisture, carbon, and nitrogen content. This study represents a comprehensive analysis of a wide range of established ML regression models using data preprocessing, effective band selection, and data dimension reduction and attempt to understand which feature combinations provide the best accuracy. The outcomes of several ML models are verified with validation techniques and the best- and worst-case scenarios in terms of soil content are noted. The proposed approach outperforms existing estimation techniques.
- Authors: Datta, Dristi , Paul, Manoranjan , Murshed, Manzur , Teng, Shyh Wei , Schmidtke, Leigh
- Date: 2022
- Type: Text , Journal article
- Relation: Sensors (Basel, Switzerland) Vol. 22, no. 20 (2022), p.
- Full Text:
- Reviewed:
- Description: Soil moisture, soil organic carbon, and nitrogen content prediction are considered significant fields of study as they are directly related to plant health and food production. Direct estimation of these soil properties with traditional methods, for example, the oven-drying technique and chemical analysis, is a time and resource-consuming approach and can predict only smaller areas. With the significant development of remote sensing and hyperspectral (HS) imaging technologies, soil moisture, carbon, and nitrogen can be estimated over vast areas. This paper presents a generalized approach to predicting three different essential soil contents using a comprehensive study of various machine learning (ML) models by considering the dimensional reduction in feature spaces. In this study, we have used three popular benchmark HS datasets captured in Germany and Sweden. The efficacy of different ML algorithms is evaluated to predict soil content, and significant improvement is obtained when a specific range of bands is selected. The performance of ML models is further improved by applying principal component analysis (PCA), a dimensional reduction method that works with an unsupervised learning method. The effect of soil temperature on soil moisture prediction is evaluated in this study, and the results show that when the soil temperature is considered with the HS band, the soil moisture prediction accuracy does not improve. However, the combined effect of band selection and feature transformation using PCA significantly enhances the prediction accuracy for soil moisture, carbon, and nitrogen content. This study represents a comprehensive analysis of a wide range of established ML regression models using data preprocessing, effective band selection, and data dimension reduction and attempt to understand which feature combinations provide the best accuracy. The outcomes of several ML models are verified with validation techniques and the best- and worst-case scenarios in terms of soil content are noted. The proposed approach outperforms existing estimation techniques.
Efficient data gathering in 3D linear underwater wireless sensor networks using sink mobility
- Akbar, Mariam, Javaid, Nadeem, Khan, Ayesha, Imran, Muhammad, Shoaib, Muhammad, Vasilakos, Athanasios
- Authors: Akbar, Mariam , Javaid, Nadeem , Khan, Ayesha , Imran, Muhammad , Shoaib, Muhammad , Vasilakos, Athanasios
- Date: 2016
- Type: Text , Journal article
- Relation: Sensors (Switzerland) Vol. 16, no. 3 (2016), p.
- Full Text:
- Reviewed:
- Description: Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability. © 2016 by the authors; licensee MDPI, Basel, Switzerland.
- Authors: Akbar, Mariam , Javaid, Nadeem , Khan, Ayesha , Imran, Muhammad , Shoaib, Muhammad , Vasilakos, Athanasios
- Date: 2016
- Type: Text , Journal article
- Relation: Sensors (Switzerland) Vol. 16, no. 3 (2016), p.
- Full Text:
- Reviewed:
- Description: Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability. © 2016 by the authors; licensee MDPI, Basel, Switzerland.
Conical averagedness and convergence analysis of fixed point algorithms
- Bartz, Sedi, Dao, Minh, Phan, Hung
- Authors: Bartz, Sedi , Dao, Minh , Phan, Hung
- Date: 2022
- Type: Text , Journal article
- Relation: Journal of Global Optimization Vol. 82, no. 2 (2022), p. 351-373
- Full Text:
- Reviewed:
- Description: We study a conical extension of averaged nonexpansive operators and the role it plays in convergence analysis of fixed point algorithms. Various properties of conically averaged operators are systematically investigated, in particular, the stability under relaxations, convex combinations and compositions. We derive conical averagedness properties of resolvents of generalized monotone operators. These properties are then utilized in order to analyze the convergence of the proximal point algorithm, the forward–backward algorithm, and the adaptive Douglas–Rachford algorithm. Our study unifies, improves and casts new light on recent studies of these topics. © 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
- Authors: Bartz, Sedi , Dao, Minh , Phan, Hung
- Date: 2022
- Type: Text , Journal article
- Relation: Journal of Global Optimization Vol. 82, no. 2 (2022), p. 351-373
- Full Text:
- Reviewed:
- Description: We study a conical extension of averaged nonexpansive operators and the role it plays in convergence analysis of fixed point algorithms. Various properties of conically averaged operators are systematically investigated, in particular, the stability under relaxations, convex combinations and compositions. We derive conical averagedness properties of resolvents of generalized monotone operators. These properties are then utilized in order to analyze the convergence of the proximal point algorithm, the forward–backward algorithm, and the adaptive Douglas–Rachford algorithm. Our study unifies, improves and casts new light on recent studies of these topics. © 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
Magic and antimagic labeling of graphs
- Authors: Sugeng, Kiki Ariyanti
- Date: 2005
- Type: Text , Thesis , PhD
- Full Text:
- Description: "A bijection mapping that assigns natural numbers to vertices and/or edges of a graph is called a labeling. In this thesis, we consider graph labelings that have weights associated with each edge and/or vertex. If all the vertex weights (respectively, edge weights) have the same value then the labeling is called magic. If the weight is different for every vertex (respectively, every edge) then we called the labeling antimagic. In this thesis we introduce some variations of magic and antimagic labelings and discuss their properties and provide corresponding labeling schemes. There are two main parts in this thesis. One main part is on vertex labeling and the other main part is on edge labeling."
- Description: Doctor of Philosophy
- Authors: Sugeng, Kiki Ariyanti
- Date: 2005
- Type: Text , Thesis , PhD
- Full Text:
- Description: "A bijection mapping that assigns natural numbers to vertices and/or edges of a graph is called a labeling. In this thesis, we consider graph labelings that have weights associated with each edge and/or vertex. If all the vertex weights (respectively, edge weights) have the same value then the labeling is called magic. If the weight is different for every vertex (respectively, every edge) then we called the labeling antimagic. In this thesis we introduce some variations of magic and antimagic labelings and discuss their properties and provide corresponding labeling schemes. There are two main parts in this thesis. One main part is on vertex labeling and the other main part is on edge labeling."
- Description: Doctor of Philosophy
Strongly regular points of mappings
- Abbasi, Malek, Théra, Michel
- Authors: Abbasi, Malek , Théra, Michel
- Date: 2021
- Type: Text , Journal article
- Relation: Fixed Point Theory and Algorithms for Sciences and Engineering Vol. 2021, no. 1 (Journal article 2021), p.
- Full Text:
- Reviewed:
- Description: In this paper, we use a robust lower directional derivative and provide some sufficient conditions to ensure the strong regularity of a given mapping at a certain point. Then, we discuss the Hoffman estimation and achieve some results for the estimate of the distance to the set of solutions to a system of linear equalities. The advantage of our estimate is that it allows one to calculate the coefficient of the error bound. © 2021, The Author(s).
- Authors: Abbasi, Malek , Théra, Michel
- Date: 2021
- Type: Text , Journal article
- Relation: Fixed Point Theory and Algorithms for Sciences and Engineering Vol. 2021, no. 1 (Journal article 2021), p.
- Full Text:
- Reviewed:
- Description: In this paper, we use a robust lower directional derivative and provide some sufficient conditions to ensure the strong regularity of a given mapping at a certain point. Then, we discuss the Hoffman estimation and achieve some results for the estimate of the distance to the set of solutions to a system of linear equalities. The advantage of our estimate is that it allows one to calculate the coefficient of the error bound. © 2021, The Author(s).
On graphs with cyclic defect or excess
- Delorme, Charles, Pineda-Villavicencio, Guillermo
- Authors: Delorme, Charles , Pineda-Villavicencio, Guillermo
- Date: 2010
- Type: Text , Journal article
- Relation: Electronic Journal of Combinatorics Vol. 17, no. 1 (2010), p.
- Full Text:
- Reviewed:
- Description: The Moore bound constitutes both an upper bound on the order of a graph of maximum degree d and diameter D = k and a lower bound on the order of a graph of minimum degree d and odd girth g = 2k + 1. Graphs missing or exceeding the Moore bound by ε are called graphs with defect or excess ε, respectively. While Moore graphs (graphs with ε = 0) and graphs with defect or excess 1 have been characterized almost completely, graphs with defect or excess 2 represent a wide unexplored area. Graphs with defect (excess) 2 satisfy the equation Gd,k(A) = Jn +B (Gd,k(A) = Jn - B), where A denotes the adjacency matrix of the graph in question, n its order, Jn the n × n matrix whose entries are all 1's, B the adjacency matrix of a union of vertex-disjoint cycles, and Gd,k(x) a polynomial with integer coefficients such that the matrix Gd,k(A) gives the number of paths of length at most k joining each pair of vertices in the graph. In particular, if B is the adjacency matrix of a cycle of order n we call the corresponding graphs graphs with cyclic defect or excess; these graphs are the subject of our attention in this paper. We prove the non-existence of infinitely many such graphs. As the highlight of the paper we provide the asymptotic upper bound of O(64/3 d3/2) for the number of graphs of odd degree d ≥ 3 and cyclic defect or excess. This bound is in fact quite generous, and as a way of illustration, we show the non-existence of some families of graphs of odd degree d ≥ 3 and cyclic defect or excess. Actually, we conjecture that, apart from the Möbius ladder on 8 vertices, no non-trivial graph of any degree ≥ 3 and cyclic defect or excess exists.
- Authors: Delorme, Charles , Pineda-Villavicencio, Guillermo
- Date: 2010
- Type: Text , Journal article
- Relation: Electronic Journal of Combinatorics Vol. 17, no. 1 (2010), p.
- Full Text:
- Reviewed:
- Description: The Moore bound constitutes both an upper bound on the order of a graph of maximum degree d and diameter D = k and a lower bound on the order of a graph of minimum degree d and odd girth g = 2k + 1. Graphs missing or exceeding the Moore bound by ε are called graphs with defect or excess ε, respectively. While Moore graphs (graphs with ε = 0) and graphs with defect or excess 1 have been characterized almost completely, graphs with defect or excess 2 represent a wide unexplored area. Graphs with defect (excess) 2 satisfy the equation Gd,k(A) = Jn +B (Gd,k(A) = Jn - B), where A denotes the adjacency matrix of the graph in question, n its order, Jn the n × n matrix whose entries are all 1's, B the adjacency matrix of a union of vertex-disjoint cycles, and Gd,k(x) a polynomial with integer coefficients such that the matrix Gd,k(A) gives the number of paths of length at most k joining each pair of vertices in the graph. In particular, if B is the adjacency matrix of a cycle of order n we call the corresponding graphs graphs with cyclic defect or excess; these graphs are the subject of our attention in this paper. We prove the non-existence of infinitely many such graphs. As the highlight of the paper we provide the asymptotic upper bound of O(64/3 d3/2) for the number of graphs of odd degree d ≥ 3 and cyclic defect or excess. This bound is in fact quite generous, and as a way of illustration, we show the non-existence of some families of graphs of odd degree d ≥ 3 and cyclic defect or excess. Actually, we conjecture that, apart from the Möbius ladder on 8 vertices, no non-trivial graph of any degree ≥ 3 and cyclic defect or excess exists.
Comparative analysis of machine and deep learning models for soil properties prediction from hyperspectral visual band
- Datta, Dristi, Paul, Manoranjan, Murshed, Manzur, Teng, Shyh Wei, Schmidtke, Leigh
- Authors: Datta, Dristi , Paul, Manoranjan , Murshed, Manzur , Teng, Shyh Wei , Schmidtke, Leigh
- Date: 2023
- Type: Text , Journal article
- Relation: Environments Vol. 10, no. 5 (2023), p. 77
- Full Text:
- Reviewed:
- Description: Estimating various properties of soil, including moisture, carbon, and nitrogen, is crucial for studying their correlation with plant health and food production. However, conventional methods such as oven-drying and chemical analysis are laborious, expensive, and only feasible for a limited land area. With the advent of remote sensing technologies like multi/hyperspectral imaging, it is now possible to predict soil properties non-invasive and cost-effectively for a large expanse of bare land. Recent research shows the possibility of predicting those soil contents from a wide range of hyperspectral data using good prediction algorithms. However, these kinds of hyperspectral sensors are expensive and not widely available. Therefore, this paper investigates different machine and deep learning techniques to predict soil nutrient properties using only the red (R), green (G), and blue (B) bands data to propose a suitable machine/deep learning model that can be used as a rapid soil test. Another objective of this research is to observe and compare the prediction accuracy in three cases i. hyperspectral band ii. full spectrum of the visual band, and iii. three-channel of RGB band and provide a guideline to the user on which spectrum information they should use to predict those soil properties. The outcome of this research helps to develop a mobile application that is easy to use for a quick soil test. This research also explores learning-based algorithms with significant feature combinations and their performance comparisons in predicting soil properties from visual band data. For this, we also explore the impact of dimensional reduction (i.e., principal component analysis) and transformations (i.e., empirical mode decomposition) of features. The results show that the proposed model can comparably predict the soil contents from the three-channel RGB data.
- Authors: Datta, Dristi , Paul, Manoranjan , Murshed, Manzur , Teng, Shyh Wei , Schmidtke, Leigh
- Date: 2023
- Type: Text , Journal article
- Relation: Environments Vol. 10, no. 5 (2023), p. 77
- Full Text:
- Reviewed:
- Description: Estimating various properties of soil, including moisture, carbon, and nitrogen, is crucial for studying their correlation with plant health and food production. However, conventional methods such as oven-drying and chemical analysis are laborious, expensive, and only feasible for a limited land area. With the advent of remote sensing technologies like multi/hyperspectral imaging, it is now possible to predict soil properties non-invasive and cost-effectively for a large expanse of bare land. Recent research shows the possibility of predicting those soil contents from a wide range of hyperspectral data using good prediction algorithms. However, these kinds of hyperspectral sensors are expensive and not widely available. Therefore, this paper investigates different machine and deep learning techniques to predict soil nutrient properties using only the red (R), green (G), and blue (B) bands data to propose a suitable machine/deep learning model that can be used as a rapid soil test. Another objective of this research is to observe and compare the prediction accuracy in three cases i. hyperspectral band ii. full spectrum of the visual band, and iii. three-channel of RGB band and provide a guideline to the user on which spectrum information they should use to predict those soil properties. The outcome of this research helps to develop a mobile application that is easy to use for a quick soil test. This research also explores learning-based algorithms with significant feature combinations and their performance comparisons in predicting soil properties from visual band data. For this, we also explore the impact of dimensional reduction (i.e., principal component analysis) and transformations (i.e., empirical mode decomposition) of features. The results show that the proposed model can comparably predict the soil contents from the three-channel RGB data.
Structural properties and labeling of graphs
- Dafik
- Authors: Dafik
- Date: 2007
- Type: Text , Thesis , PhD
- Full Text:
- Description: The complexity in building massive scale parallel processing systems has re- sulted in a growing interest in the study of interconnection networks design. Network design affects the performance, cost, scalability, and availability of parallel computers. Therefore, discovering a good structure of the network is one of the basic issues. From modeling point of view, the structure of networks can be naturally stud- ied in terms of graph theory. Several common desirable features of networks, such as large number of processing elements, good throughput, short data com- munication delay, modularity, good fault tolerance and diameter vulnerability correspond to properties of the underlying graphs of networks, including large number of vertices, small diameter, high connectivity and overall balance (or regularity) of the graph or digraph. The first part of this thesis deals with the issue of interconnection networks ad- dressing system. From graph theory point of view, this issue is mainly related to a graph labeling. We investigate a special family of graph labeling, namely antimagic labeling of a class of disconnected graphs. We present new results in super (a; d)-edge antimagic total labeling for disjoint union of multiple copies of special families of graphs. The second part of this thesis deals with the issue of regularity of digraphs with the number of vertices close to the upper bound, called the Moore bound, which is unobtainable for most values of out-degree and diameter. Regularity of the underlying graph of a network is often considered to be essential since the flow of messages and exchange of data between processing elements will be on average faster if there is a similar number of interconnections coming in and going out of each processing element. This means that the in-degree and out-degree of each processing element must be the same or almost the same. Our new results show that digraphs of order two less than Moore bound are either diregular or almost diregular.
- Description: Doctor of Philosophy
- Authors: Dafik
- Date: 2007
- Type: Text , Thesis , PhD
- Full Text:
- Description: The complexity in building massive scale parallel processing systems has re- sulted in a growing interest in the study of interconnection networks design. Network design affects the performance, cost, scalability, and availability of parallel computers. Therefore, discovering a good structure of the network is one of the basic issues. From modeling point of view, the structure of networks can be naturally stud- ied in terms of graph theory. Several common desirable features of networks, such as large number of processing elements, good throughput, short data com- munication delay, modularity, good fault tolerance and diameter vulnerability correspond to properties of the underlying graphs of networks, including large number of vertices, small diameter, high connectivity and overall balance (or regularity) of the graph or digraph. The first part of this thesis deals with the issue of interconnection networks ad- dressing system. From graph theory point of view, this issue is mainly related to a graph labeling. We investigate a special family of graph labeling, namely antimagic labeling of a class of disconnected graphs. We present new results in super (a; d)-edge antimagic total labeling for disjoint union of multiple copies of special families of graphs. The second part of this thesis deals with the issue of regularity of digraphs with the number of vertices close to the upper bound, called the Moore bound, which is unobtainable for most values of out-degree and diameter. Regularity of the underlying graph of a network is often considered to be essential since the flow of messages and exchange of data between processing elements will be on average faster if there is a similar number of interconnections coming in and going out of each processing element. This means that the in-degree and out-degree of each processing element must be the same or almost the same. Our new results show that digraphs of order two less than Moore bound are either diregular or almost diregular.
- Description: Doctor of Philosophy
Linkedness of cartesian products of complete graphs
- Jorgensen, Leif, Pineda-Villavicencio, Guillermo, Ugon, Julien
- Authors: Jorgensen, Leif , Pineda-Villavicencio, Guillermo , Ugon, Julien
- Date: 2022
- Type: Text , Journal article
- Relation: Ars Mathematica Contemporanea Vol. 22, no. 2 (2022), p.
- Relation: http://purl.org/au-research/grants/arc/DP180100602
- Full Text:
- Reviewed:
- Description: This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with at least 2k vertices is k-linked if, for every set of 2k distinct vertices organised in arbitrary k pairs of vertices, there are k vertex-disjoint paths joining the vertices in the pairs. We show that the Cartesian product Kd1+1 × Kd2+1 of complete graphs Kd1+1 and Kd2+1 is
- Authors: Jorgensen, Leif , Pineda-Villavicencio, Guillermo , Ugon, Julien
- Date: 2022
- Type: Text , Journal article
- Relation: Ars Mathematica Contemporanea Vol. 22, no. 2 (2022), p.
- Relation: http://purl.org/au-research/grants/arc/DP180100602
- Full Text:
- Reviewed:
- Description: This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with at least 2k vertices is k-linked if, for every set of 2k distinct vertices organised in arbitrary k pairs of vertices, there are k vertex-disjoint paths joining the vertices in the pairs. We show that the Cartesian product Kd1+1 × Kd2+1 of complete graphs Kd1+1 and Kd2+1 is
You Can’t Beat Relating with God for Spiritual Well-Being: Comparing a Generic Version with the Original Spiritual Well-Being Questionnaire Called SHALOM
- Authors: Fisher, John
- Date: 2013
- Type: Text , Journal article
- Relation: Religions Vol. 2013, no. 4 (2013), p. 325-335
- Full Text:
- Reviewed:
- Description: The Spiritual Health And Life-Orientation Measure (SHALOM) is a 20-item instrument that assesses the quality of relationships of the respondent with self, others, the environment and/or a Transcendent Other. In the Transcendental domain, four of the five items had the words ‘God, ‘Divine’ and ‘Creator’ replaced by the word ‘Transcendent’ to make the survey more generic by removing any implied reference to any god or religion. Invitations to complete a web survey were sent to people who had published papers in spirituality, or belonged to associations for spirituality or religious studies, as well as the Australian Atheist Forum. 409 respondents from 14 geographic regions, completed the survey. Confirmatory factor analysis revealed that the modified, generic form of SHALOM showed acceptable model fit, comprising four clearly delineated domains of spiritual well-being. The paper analyses the results derived from using the modified, generic version and, in comparison with results of applications of the original survey instrument, concludes with discussion of the comparative utility of each of the versions of SHALOM. Further studies with more people are warranted, but, from evidence presented here, it looks like you can’t beat relating with God for spiritual well-being.
- Authors: Fisher, John
- Date: 2013
- Type: Text , Journal article
- Relation: Religions Vol. 2013, no. 4 (2013), p. 325-335
- Full Text:
- Reviewed:
- Description: The Spiritual Health And Life-Orientation Measure (SHALOM) is a 20-item instrument that assesses the quality of relationships of the respondent with self, others, the environment and/or a Transcendent Other. In the Transcendental domain, four of the five items had the words ‘God, ‘Divine’ and ‘Creator’ replaced by the word ‘Transcendent’ to make the survey more generic by removing any implied reference to any god or religion. Invitations to complete a web survey were sent to people who had published papers in spirituality, or belonged to associations for spirituality or religious studies, as well as the Australian Atheist Forum. 409 respondents from 14 geographic regions, completed the survey. Confirmatory factor analysis revealed that the modified, generic form of SHALOM showed acceptable model fit, comprising four clearly delineated domains of spiritual well-being. The paper analyses the results derived from using the modified, generic version and, in comparison with results of applications of the original survey instrument, concludes with discussion of the comparative utility of each of the versions of SHALOM. Further studies with more people are warranted, but, from evidence presented here, it looks like you can’t beat relating with God for spiritual well-being.
New Farkas-type results for vector-valued functions : A non-abstract approach
- Dinh, Nguyen, Goberna, Miguel, Long, Dang, Lopez-Cerda, Marco
- Authors: Dinh, Nguyen , Goberna, Miguel , Long, Dang , Lopez-Cerda, Marco
- Date: 2019
- Type: Text , Journal article
- Relation: Journal of Optimization Theory and Applications Vol. 182, no. 1 (2019), p. 4-29
- Full Text:
- Reviewed:
- Description: This paper provides new Farkas-type results characterizing the inclusion of a given set, called contained set, into a second given set, called container set, both of them are subsets of some locally convex space, called decision space. The contained and the container sets are described here by means of vector functions from the decision space to other two locally convex spaces which are equipped with the partial ordering associated with given convex cones. These new Farkas lemmas are obtained via the complete characterization of the conic epigraphs of certain conjugate mappings which constitute the core of our approach. In contrast with a previous paper of three of the authors (Dinh et al. in J Optim Theory Appl 173:357-390, 2017), the aimed characterizations of the containment are expressed here in terms of the data.
- Authors: Dinh, Nguyen , Goberna, Miguel , Long, Dang , Lopez-Cerda, Marco
- Date: 2019
- Type: Text , Journal article
- Relation: Journal of Optimization Theory and Applications Vol. 182, no. 1 (2019), p. 4-29
- Full Text:
- Reviewed:
- Description: This paper provides new Farkas-type results characterizing the inclusion of a given set, called contained set, into a second given set, called container set, both of them are subsets of some locally convex space, called decision space. The contained and the container sets are described here by means of vector functions from the decision space to other two locally convex spaces which are equipped with the partial ordering associated with given convex cones. These new Farkas lemmas are obtained via the complete characterization of the conic epigraphs of certain conjugate mappings which constitute the core of our approach. In contrast with a previous paper of three of the authors (Dinh et al. in J Optim Theory Appl 173:357-390, 2017), the aimed characterizations of the containment are expressed here in terms of the data.
Complete catalogue of graphs of maximum degree 3 and defect at most 4
- Miller, Mirka, Pineda-Villavicencio, Guillermo
- Authors: Miller, Mirka , Pineda-Villavicencio, Guillermo
- Date: 2009
- Type: Text , Journal article
- Relation: Discrete Applied Mathematics Vol. 157, no. 13 (2009), p. 2983-2996
- Full Text:
- Reviewed:
- Description: We consider graphs of maximum degree 3, diameter D≥2 and at most 4 vertices less than the Moore bound M3,D, that is, (3,D,−)-graphs for ≤4. We prove the non-existence of (3,D,−4)-graphs for D≥5, completing in this way the catalogue of (3,D,−)-graphs with D≥2 and ≤4. Our results also give an improvement to the upper bound on the largest possible number N3,D of vertices in a graph of maximum degree 3 and diameter D, so that N3,D≤M3,D−6 for D≥5. Copyright Elsevier.
- Authors: Miller, Mirka , Pineda-Villavicencio, Guillermo
- Date: 2009
- Type: Text , Journal article
- Relation: Discrete Applied Mathematics Vol. 157, no. 13 (2009), p. 2983-2996
- Full Text:
- Reviewed:
- Description: We consider graphs of maximum degree 3, diameter D≥2 and at most 4 vertices less than the Moore bound M3,D, that is, (3,D,−)-graphs for ≤4. We prove the non-existence of (3,D,−4)-graphs for D≥5, completing in this way the catalogue of (3,D,−)-graphs with D≥2 and ≤4. Our results also give an improvement to the upper bound on the largest possible number N3,D of vertices in a graph of maximum degree 3 and diameter D, so that N3,D≤M3,D−6 for D≥5. Copyright Elsevier.
An adaptive splitting algorithm for the sum of two generalized monotone operators and one cocoercive operator
- Authors: Dao, Minh , Phan, Hung
- Date: 2021
- Type: Text , Journal article
- Relation: Fixed Point Theory and Algorithms for Sciences and Engineering Vol. 2021, no. 1 (2021), p.
- Full Text:
- Reviewed:
- Description: Splitting algorithms for finding a zero of sum of operators often involve multiple steps which are referred to as forward or backward steps. Forward steps are the explicit use of the operators and backward steps involve the operators implicitly via their resolvents. In this paper, we study an adaptive splitting algorithm for finding a zero of the sum of three operators. We assume that two of the operators are generalized monotone and their resolvents are computable, while the other operator is cocoercive but its resolvent is missing or costly to compute. Our splitting algorithm adapts new parameters to the generalized monotonicity of the operators and, at the same time, combines appropriate forward and backward steps to guarantee convergence to a solution of the problem. © 2021, The Author(s).
- Authors: Dao, Minh , Phan, Hung
- Date: 2021
- Type: Text , Journal article
- Relation: Fixed Point Theory and Algorithms for Sciences and Engineering Vol. 2021, no. 1 (2021), p.
- Full Text:
- Reviewed:
- Description: Splitting algorithms for finding a zero of sum of operators often involve multiple steps which are referred to as forward or backward steps. Forward steps are the explicit use of the operators and backward steps involve the operators implicitly via their resolvents. In this paper, we study an adaptive splitting algorithm for finding a zero of the sum of three operators. We assume that two of the operators are generalized monotone and their resolvents are computable, while the other operator is cocoercive but its resolvent is missing or costly to compute. Our splitting algorithm adapts new parameters to the generalized monotonicity of the operators and, at the same time, combines appropriate forward and backward steps to guarantee convergence to a solution of the problem. © 2021, The Author(s).
Some new characterizations of intrinsic transversality in hilbert spaces
- Thao, Nguyen, Bui, Hoa, Cuong, Nguyen, Verhaegen, Michel
- Authors: Thao, Nguyen , Bui, Hoa , Cuong, Nguyen , Verhaegen, Michel
- Date: 2020
- Type: Text , Journal article
- Relation: Set-Valued and Variational Analysis Vol. 28, no. 1 (2020), p. 5-39
- Full Text:
- Reviewed:
- Description: Motivated by a number of questions concerning transversality-type properties of pairs of sets recently raised by Ioffe and Kruger, this paper reports several new characterizations of the intrinsic transversality property in Hilbert spaces. New results in terms of normal vectors clarify the picture of intrinsic transversality, its variants and sufficient conditions for subtransversality, and unify several of them. For the first time, intrinsic transversality is characterized by an equivalent condition which does not involve normal vectors. This characterization offers another perspective on intrinsic transversality. As a consequence, the obtained results allow us to answer a number of important questions about transversality-type properties. © 2020, The Author(s).
- Authors: Thao, Nguyen , Bui, Hoa , Cuong, Nguyen , Verhaegen, Michel
- Date: 2020
- Type: Text , Journal article
- Relation: Set-Valued and Variational Analysis Vol. 28, no. 1 (2020), p. 5-39
- Full Text:
- Reviewed:
- Description: Motivated by a number of questions concerning transversality-type properties of pairs of sets recently raised by Ioffe and Kruger, this paper reports several new characterizations of the intrinsic transversality property in Hilbert spaces. New results in terms of normal vectors clarify the picture of intrinsic transversality, its variants and sufficient conditions for subtransversality, and unify several of them. For the first time, intrinsic transversality is characterized by an equivalent condition which does not involve normal vectors. This characterization offers another perspective on intrinsic transversality. As a consequence, the obtained results allow us to answer a number of important questions about transversality-type properties. © 2020, The Author(s).