Nothing Special   »   [go: up one dir, main page]

You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (36,879)

Search Parameters:
Keywords = digitization

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
32 pages, 821 KiB  
Article
How Government Subsidies Facilitate the Digital Transformation of Suppliers
by Xiong-Lei Hao, Xing-Yu Chen and Fu-Tao Wang
Sustainability 2024, 16(19), 8652; https://doi.org/10.3390/su16198652 (registering DOI) - 6 Oct 2024
Abstract
Digital transformation is increasingly recognized as a key driver of sustainable development, enabling suppliers to improve efficiency, reduce resource consumption, and adapt to changing market demands. However, it remains a challenging process for suppliers, often hindered by resource and capacity constraints. This study [...] Read more.
Digital transformation is increasingly recognized as a key driver of sustainable development, enabling suppliers to improve efficiency, reduce resource consumption, and adapt to changing market demands. However, it remains a challenging process for suppliers, often hindered by resource and capacity constraints. This study investigates how government subsidies can facilitate supplier digital transformation, considering supply chain diffusion and local government competition dynamics. Using data from A-share listed companies in China between 2010 and 2021, our analysis reveals that government subsidies significantly promote supplier digital transformation by encouraging a more diversified downstream customer base. Moreover, customer digital transformation can facilitate supplier digital transformation, but spillover effects are higher within the same jurisdiction than across different jurisdictions. This study further identifies that the impact of government subsidies is more pronounced under higher opportunistic risk but is constrained by systemic risk. Additionally, suppliers with higher human capital and a smaller digital divide with customers exhibit greater effectiveness in adopting innovation diffusion. These findings provide valuable insights into optimizing local government subsidies policies to enhance supplier digital transformation and contribute to the broader goal of sustainable development. Full article
16 pages, 4663 KiB  
Article
Algorithm Analysis and Optimization of a Digital Image Correlation Method Using a Non-Probability Interval Multidimensional Parallelepiped Model
by Xuedong Zhu, Jianhua Liu, Xiaohui Ao, Huanxiong Xia, Sihan Huang, Lijian Zhu, Xiaoqiang Li and Changlin Du
Sensors 2024, 24(19), 6460; https://doi.org/10.3390/s24196460 (registering DOI) - 6 Oct 2024
Abstract
Digital image correlation (DIC), a widely used non-contact measurement technique, often requires empirical tuning of several algorithmic parameters to strike a balance between computational accuracy and efficiency. This paper introduces a novel uncertainty analysis approach aimed at optimizing the parameter intervals of a [...] Read more.
Digital image correlation (DIC), a widely used non-contact measurement technique, often requires empirical tuning of several algorithmic parameters to strike a balance between computational accuracy and efficiency. This paper introduces a novel uncertainty analysis approach aimed at optimizing the parameter intervals of a DIC algorithm. Specifically, the method leverages the inverse compositional Gauss–Newton algorithm combined with a prediction-correction scheme (IC-GN-PC), considering three critical parameters as interval variables. Uncertainty analysis is conducted using a non-probabilistic interval-based multidimensional parallelepiped model, where accuracy and efficiency serve as the reliability indexes. To achieve both high computational accuracy and efficiency, these two reliability indexes are simultaneously improved by optimizing the chosen parameter intervals. The optimized algorithm parameters are subsequently tested and validated through two case studies. The proposed method can be generalized to enhance multiple aspects of an algorithm’s performance by optimizing the relevant parameter intervals. Full article
19 pages, 6533 KiB  
Article
Personalised High Tibial Osteotomy Surgery Is Accurate: An Assessment Using 3D Distance Mapping
by Andrea Varaschin, Harinderjit Singh Gill, Stefano Zaffagnini, Alberto Leardini, Maurizio Ortolani, Fabio Norvillo, Alisdair MacLeod, Giacomo Dal Fabbro, Giorgio Cassiolas, Alberto Grassi and Claudio Belvedere
Appl. Sci. 2024, 14(19), 9033; https://doi.org/10.3390/app14199033 (registering DOI) - 6 Oct 2024
Abstract
Early-stage knee osteoarthritis is often suitable for treatment with high tibial osteotomy (HTO). This is an effective joint-preserving treatment, resulting in good postoperative outcomes. To overcome the limitations of traditional HTO, the surgical technique and correction accuracy can be enhanced by personalised procedures [...] Read more.
Early-stage knee osteoarthritis is often suitable for treatment with high tibial osteotomy (HTO). This is an effective joint-preserving treatment, resulting in good postoperative outcomes. To overcome the limitations of traditional HTO, the surgical technique and correction accuracy can be enhanced by personalised procedures using three-dimensional digital planning and metal additive manufacturing, The purpose of this clinical trial study was to evaluate the three-dimensional accuracy of a new personalised HTO procedure, using modern imaging techniques, 3D modelling, and distance map analysis (DMA). Twenty-five patients were treated with the personalised HTO procedure. Before surgery and after 6 months, they underwent clinical evaluation scoring, radiographic imaging, and computed-tomography scanning to generate morphological models. Specifically, preoperative tibia models were used to plan the tibia correction and the design and position of the fixation plate. Preoperative, planned, and postoperative models were imported in computer-aided and designing software (Geomagic ControlTM 2014, 3D Systems, Rock Hill, SC, USA) for DMA implementation to assess geometrical differences between model surfaces. A very good reproduction of the planned tibia morphology was achieved postoperatively (average differences between −0.9 mm and 1.4 mm). DMA values associated with fixation-plate deformation were less than 1 mm, similar to those for plate-to-tibia surface-contour matching. Overall, personalised digitally planned HTO utilising three-dimensional printed surgical guides and plates enables accurate planned correction and plate placement. Full article
Show Figures

Figure 1

Figure 1
<p>Planning on CT scan-derived geometry allows placement of tibial cuts and design of personalised jig and plate. (<b>a</b>) Tibial cuts with surgical jig in closed position. (<b>b</b>) Surgical jig opened to required correction. (<b>c</b>) Osteotomy stabilised with personalised plate (NB planning also gives the appropriate screw length to use, screw lengths are indicated by color).</p>
Full article ">Figure 2
<p>Diagram of the DMA workflow.</p>
Full article ">Figure 3
<p>Boxplots for positive mean distance (<math display="inline"><semantics> <mrow> <mover accent="true"> <mrow> <mi mathvariant="normal">P</mi> <mi mathvariant="normal">D</mi> </mrow> <mo>¯</mo> </mover> </mrow> </semantics></math>), negative mean distance (<math display="inline"><semantics> <mrow> <mover accent="true"> <mrow> <mi mathvariant="normal">N</mi> <mi mathvariant="normal">D</mi> </mrow> <mo>¯</mo> </mover> </mrow> </semantics></math>), and DMA standard deviation (DSD) for all sets of surface comparisons.</p>
Full article ">Figure 4
<p>Screenshot of DMA software depicting (i) POST tibia versus PLA tibia. Data from a representative case, the colour scale gives surface deviation in millimetres.</p>
Full article ">Figure 5
<p>Screenshot (left image front view, right image back view) from DMA software depicting (ii) POST fixation plate versus PLA fixation plate. Data from the representative case above and the colour scale gives surface deviation in millimetres.</p>
Full article ">Figure 6
<p>Screenshot of DMA software depicting (iii-a) PLA fixation plate versus PLA tibia (<b>left</b>) and (iii-b) POST fixation plate versus POST tibia (<b>right</b>). Data from the representative case above and the colour scale gives surface deviation in millimetres.</p>
Full article ">Figure 7
<p>Screenshot of DMA software depicting (iv) POST tibial plateau versus PRE tibial plateau. Data from the representative case above and the colour scale gives surface deviation in millimetres.</p>
Full article ">Figure A1
<p>Screenshot of DMA software depicting (i) POST tibia versus PLA tibia. Data from an alternative case to the one shown in <a href="#applsci-14-09033-f004" class="html-fig">Figure 4</a>. The colour scale gives surface deviation in millimetres.</p>
Full article ">Figure A2
<p>Screenshot (left image front view, right image back view) from DMA software depicting (ii) POST fixation plate versus PLA fixation plate. Data from an alternative case to the one shown in <a href="#applsci-14-09033-f005" class="html-fig">Figure 5</a>. The colour scale gives surface deviation in millimetres.</p>
Full article ">Figure A3
<p>Screenshot of DMA software depicting (iii-a) PLA fixation plate versus PLA tibia (<b>left</b>) and (iii-b) POST fixation plate versus POST tibia (<b>right</b>). Data from an alternative case to the one shown in <a href="#applsci-14-09033-f006" class="html-fig">Figure 6</a>. The colour scale gives surface deviation in millimetres.</p>
Full article ">Figure A4
<p>Screenshot of DMA software depicting (iv) POST tibial plateau versus PRE tibial plateau. Data from an alternative case to the one shown in <a href="#applsci-14-09033-f007" class="html-fig">Figure 7</a>. The colour scale gives surface deviation in millimetres.</p>
Full article ">
25 pages, 855 KiB  
Review
Tools, Technologies and Frameworks for Digital Twins in the Oil and Gas Industry: An In-Depth Analysis
by Edwin Benito Mitacc Meza, Dalton Garcia Borges de Souza, Alessandro Copetti, Ana Paula Barbosa Sobral, Guido Vaz Silva, Iara Tammela and Rodolfo Cardoso
Sensors 2024, 24(19), 6457; https://doi.org/10.3390/s24196457 (registering DOI) - 6 Oct 2024
Abstract
The digital twin (DT), which involves creating a virtual replica of a physical asset or system, has emerged as a transformative set of tools across various industries. In the oil and gas (O&G) industry, the development of DTs represents a significant evolution in [...] Read more.
The digital twin (DT), which involves creating a virtual replica of a physical asset or system, has emerged as a transformative set of tools across various industries. In the oil and gas (O&G) industry, the development of DTs represents a significant evolution in how companies manage complex operations, enhance safety, and optimize decision-making processes. Despite these significant advancements, the underlying tools, technologies, and frameworks for developing DTs in O&G applications remain non-standardized and unfamiliar to many O&G practitioners, highlighting the need for a systematic literature review (SLR) on the topic. Thus, this paper offers an SLR of the existing literature on DT development for O&G from 2018 onwards, utilizing Scopus and Web of Science Core Collection. We provide a comprehensive overview of this field, demonstrate how it is evolving, and highlight standard practices and research opportunities in the area. We perform broad classifications of the 98 studies, categorizing the DTs by their development methodologies, implementation objectives, data acquisition, asset digital development, data integration and preprocessing, data analysis and modeling, evaluation and validation, and deployment tools. We also include a bibliometric analysis of the selected papers, highlighting trends and key contributors. Given the increasing number of new DT developments in O&G and the many new technologies available, we hope to provide guidance on the topic and promote knowledge production and growth concerning the development of DTs for O&G. Full article
(This article belongs to the Special Issue Sensors as Drivers of Industry 4.0)
Show Figures

Figure 1

Figure 1
<p>Article selection framework (Note: the asterisk represents a wildcard for zero or more characters in the search terms).</p>
Full article ">Figure 2
<p>Countries with the most publications.</p>
Full article ">Figure 3
<p>Profile of authorship in publications.</p>
Full article ">Figure 4
<p>Companies with the most appearances in articles.</p>
Full article ">Figure 5
<p>Different stages of digital twin development.</p>
Full article ">Figure 6
<p>Stages of implementation in publications.</p>
Full article ">Figure 7
<p>Word cloud of primary keywords from the selected articles.</p>
Full article ">Figure 8
<p>Conceptual framework for digital twin development in O&amp;G industry.</p>
Full article ">
16 pages, 7440 KiB  
Article
Development of an Automatic Rock Mass Classification System Using Digital Tunnel Face Mapping
by Hyun-Koo Lee, Myung-Kyu Song, Young-Oh Jeong and Sean Seung-Won Lee
Appl. Sci. 2024, 14(19), 9024; https://doi.org/10.3390/app14199024 (registering DOI) - 6 Oct 2024
Abstract
To mitigate unforeseen incidents, such as key block failure or tunnel collapse during excavation, an appropriate support pattern that correlates with the geological conditions of the rock mass at the tunnel face should be designed. Rock mass evaluations should be conducted through geological [...] Read more.
To mitigate unforeseen incidents, such as key block failure or tunnel collapse during excavation, an appropriate support pattern that correlates with the geological conditions of the rock mass at the tunnel face should be designed. Rock mass evaluations should be conducted through geological face mapping during the construction phase, alongside predictions based on field investigations during the design phase. When marked discrepancies are identified, it is customary to convene an on-site evaluation involving a committee of experts. This study develops a digital tunnel face mapping system that utilises mobile devices to facilitate online evaluations during the construction phase. This system effectively replaces the traditional on-site field evaluation method. Tunnel face mapping can be promptly accomplished using images captured at the excavation face, enabling rapid analysis. In conjunction with the mapping capabilities, the developed system was designed to digitally store geological information, which includes parameters such as rock strength distribution, the spacing and length of discontinuities observed during the mapping process, as well as data pertaining to weathering and the groundwater conditions of those discontinuities. This information was then correlated with the rock mass rating sheet to automate the determination of ratings for each parameter, ultimately leading to a conclusive classification of the rock mass quality. By employing this system for tunnel face mapping and rock quality evaluation, we significantly reduced the discrepancies in the evaluation results that often arise due to the subjective judgement of geologists, as well as human errors that can occur throughout the rating process. Full article
20 pages, 9133 KiB  
Article
Utilizing an Ex Vivo Skin Penetration Analysis Model for Predicting Ocular Drug Penetration: A Feasibility Study with Curcumin Formulations
by Christian Raab, Stefan Brugger, Jara-Sophie Lechner, Geisa Nascimento Barbalho, Taís Gratieri, Priyanka Agarwal, Ilva D. Rupenthal and Cornelia M. Keck
Pharmaceutics 2024, 16(10), 1302; https://doi.org/10.3390/pharmaceutics16101302 (registering DOI) - 6 Oct 2024
Abstract
Objective: This study aimed to investigate the feasibility of using the digital image processing technique, developed to semi-quantitatively study dermal penetration, to study corneal penetration in an ex vivo porcine eye model. Here, we investigated various formulation strategies intended to enhance dermal and [...] Read more.
Objective: This study aimed to investigate the feasibility of using the digital image processing technique, developed to semi-quantitatively study dermal penetration, to study corneal penetration in an ex vivo porcine eye model. Here, we investigated various formulation strategies intended to enhance dermal and corneal bioavailability of the model hydrophobic drug, curcumin. Methods: Several formulation principles were explored, including oily solutions, oily suspensions, aqueous nanosuspension, micelles, liposomes and cyclodextrins. The dermal penetration efficacy was tested using an ex vivo porcine ear model previously developed at Philipps-Universität Marburg with subsequent digital image processing. This image analysis method was further applied to study corneal penetration using an ex vivo porcine whole-eye model. Results: For dermal penetration, oily solutions, oily suspensions and nanosuspensions exhibited the least penetration, whereas liposomes and cyclodextrins showed enhanced penetration. Corneal curcumin penetration correlated with dermal penetration, with curcumin loaded into cyclodextrins penetrating the deepest. Conclusions: Overall, our study suggests that the image analysis method previously developed for ex vivo skin penetration can easily be repurposed to study corneal penetration of hydrophobic drugs. Full article
(This article belongs to the Special Issue Curcumin in Biomedical Applications, 2nd Edition)
Show Figures

Figure 1

Figure 1
<p>Scheme of dermal penetration testing with the ‘Marburg skin penetration’ model. (<b>A</b>) Fresh pig ear with areas for treatment. (<b>B</b>,<b>C</b>) Cross-sectional images of skin biopsies taken by inverted epifluorescence microscopy. (<b>D</b>,<b>E</b>) Images after digital image processing, where an automated threshold was applied to subtract the autofluorescence of the skin. The remaining pixels represent the penetrated API. SCT—stratum corneum thickness; MPD = mean penetration depth. Scale bar = 50 µm.</p>
Full article ">Figure 2
<p>Microscopic images of curcumin formulations.</p>
Full article ">Figure 3
<p>Particle size analysis (LD data) of curcumin formulations.</p>
Full article ">Figure 4
<p>Fluorescence images of tissue cross-sections showing untreated skin and skin treated with the different curcumin formulations. Scale bar = 50 µm.</p>
Full article ">Figure 5
<p>Dermal penetration efficacy [MGV/px] and relative (rel.) penetration efficacy [%] of curcumin from different formulations. *: <span class="html-italic">p</span>-value &lt; 0.05; ***: <span class="html-italic">p</span>-value &lt; 0.001.</p>
Full article ">Figure 6
<p>Mean dermal penetration depth [µm] and relative (rel.) penetration depth [%] of curcumin from different formulations. *: <span class="html-italic">p</span>-value &lt; 0.05; ***: <span class="html-italic">p</span>-value &lt; 0.001.</p>
Full article ">Figure 7
<p>Influence of unloaded vehicles and curcumin-loaded formulations on SCT. *: <span class="html-italic">p</span>-value &lt; 0.05; **: <span class="html-italic">p</span>-value &lt; 0.01, ***: <span class="html-italic">p</span>-value &lt; 0.001, n.s.: non-significant.</p>
Full article ">Figure 8
<p>Fluorescence images of untreated cornea and cornea treated with different curcumin-containing formulations. Scale bar = 50 µm.</p>
Full article ">Figure 9
<p>Fluorescence images after RGB threshold of untreated cornea and cornea treated with different curcumin-containing formulations. Scale bar = 50 µm.</p>
Full article ">Figure 10
<p>Influence of formulation principle on corneal penetration efficacy of curcumin—data analysis from images obtained after automated RGB threshold. (<b>A</b>) Corneal penetration efficacy [MGV/px] and rel. penetration efficacy [%] of curcumin from different formulations. (<b>B</b>) Mean penetration depth [µm] and rel. penetration depth [%] of curcumin from different formulations. *: <span class="html-italic">p</span>-value &lt; 0.05, ***: <span class="html-italic">p</span>-value &lt; 0.001, n.s.: non-significant.</p>
Full article ">Figure 11
<p>Influence of formulation principle on corneal penetration efficacy of curcumin—data analysis from original images obtained from inverted epifluorescence microscopy. (<b>A</b>) Corneal penetration efficacy [MGV/px] and rel. penetration efficacy [%] of curcumin from different formulations. (<b>B</b>) Mean penetration depth [µm] and rel. penetration depth [%] of curcumin from different formulations. *: <span class="html-italic">p</span>-value &lt; 0.05; **: <span class="html-italic">p</span>-value &lt; 0.01, ***: <span class="html-italic">p</span>-value &lt; 0.001, n.s.: non-significant.</p>
Full article ">
16 pages, 3291 KiB  
Article
A Scaled Monocular 3D Reconstruction Based on Structure from Motion and Multi-View Stereo
by Zhiwen Zhan, Fan Yang, Jixin Jiang, Jialin Du, Fanxing Li, Si Sun and Yan Wei
Electronics 2024, 13(19), 3943; https://doi.org/10.3390/electronics13193943 (registering DOI) - 6 Oct 2024
Abstract
Three-dimensional digital modeling at actual scales is essential for digitally preserving cultural relics. While 3D reconstruction using a monocular camera offers a cost-effective solution, the lack of scale information in the resulting models limits their suitability for geometric measurements. Objects with monotonous textures, [...] Read more.
Three-dimensional digital modeling at actual scales is essential for digitally preserving cultural relics. While 3D reconstruction using a monocular camera offers a cost-effective solution, the lack of scale information in the resulting models limits their suitability for geometric measurements. Objects with monotonous textures, such as batteries, pose additional challenges due to insufficient feature points, increasing positional uncertainty. This article proposes a method incorporating point and line features to address the scale ambiguity in multi-view 3D reconstruction using monocular cameras. By pre-measuring the lengths of multiple sets of real line segments, building a lookup table, and associating the line features in different images, the table was input into the improved reconstruction algorithm to further optimize the scale information. Experimental results on real datasets showed that the proposed method outperformed the COLMAP method by 70.82% in reconstruction accuracy, with a scale recovery reaching millimeter-level accuracy. This method is highly generalizable, cost-effective, and supports lightweight computation, making it suitable for real-time operation on a CPU. Full article
17 pages, 1289 KiB  
Article
Development of a Digital Twin Driven by a Deep Learning Model for Fault Diagnosis of Electro-Hydrostatic Actuators
by Roman Rodriguez-Aguilar, Jose-Antonio Marmolejo-Saucedo and Utku Köse
Mathematics 2024, 12(19), 3124; https://doi.org/10.3390/math12193124 (registering DOI) - 6 Oct 2024
Abstract
The first quarter of the 21st century has witnessed many technological innovations in various sectors. Likewise, the COVID-19 pandemic triggered the acceleration of digital transformation in organizations driven by artificial intelligence and communication technologies in Industry 4.0 and Industry 5.0. Aiming at the [...] Read more.
The first quarter of the 21st century has witnessed many technological innovations in various sectors. Likewise, the COVID-19 pandemic triggered the acceleration of digital transformation in organizations driven by artificial intelligence and communication technologies in Industry 4.0 and Industry 5.0. Aiming at the construction of digital twins, virtual representations of a physical system allow real-time bidirectional communication. This will allow the monitoring of operations, identification of possible failures, and decision making based on technical evidence. In this study, a fault diagnosis solution is proposed, based on the construction of a digital twin, for a cloud-based Industrial Internet of Things (IIoT) system contemplating the control of electro-hydrostatic actuators (EHAs). The system was supported by a deep learning model using Long Short-Term Memory (LSTM) networks for an effective diagnostic approach. The implemented study considers data preparation and integration and system development and application to evaluate the performance against the fault diagnosis problem. According to the results obtained, positive results are shown in the construction of the digital twin using a deep learning model for the fault diagnosis problem of an active EHA-IIoT configuration. Full article
21 pages, 1525 KiB  
Article
An Adaptive Task Planning Method for UAVC Task Layer: DSTCA
by Ting Duan, Qun Li, Xin Zhou and Xiaobo Li
Drones 2024, 8(10), 553; https://doi.org/10.3390/drones8100553 (registering DOI) - 6 Oct 2024
Abstract
With the rapid development of digital intelligence, drones can provide many conveniences for people’s lives, especially in executing rescue missions in special areas. When executing rescue missions in remote areas, communication cannot be fully covered. Therefore, to improve the online adaptability of the [...] Read more.
With the rapid development of digital intelligence, drones can provide many conveniences for people’s lives, especially in executing rescue missions in special areas. When executing rescue missions in remote areas, communication cannot be fully covered. Therefore, to improve the online adaptability of the task chain link in task planning with a complex system structure as the background, a distributed source-task-capability allocation (DSTCA) problem was constructed. The first task chain coordination mechanism scheme was proposed, and a DSTCA architecture based on the task chain coordination mechanism was constructed to achieve the online adaptability of the swarm. At the same time, the existing algorithms cannot achieve this idea, and the DSTCA-CBBA algorithm based on CNP is proposed. The efficiency change, agent score, and time three indicators are evaluated through specific cases. In response to sudden changes in nodes in the task chain link, the maximum spanning tree algorithm is used to reconstruct the task chain link in a short time, thereby completing the mission task assigned to the drone entity. Meanwhile, the experimental results also prove the effectiveness of the proposed algorithm. Full article
(This article belongs to the Special Issue Distributed Control, Optimization, and Game of UAV Swarm Systems)
16 pages, 3583 KiB  
Article
BHT-QAOA: The Generalization of Quantum Approximate Optimization Algorithm to Solve Arbitrary Boolean Problems as Hamiltonians
by Ali Al-Bayaty and Marek Perkowski
Entropy 2024, 26(10), 843; https://doi.org/10.3390/e26100843 (registering DOI) - 6 Oct 2024
Abstract
A new methodology is introduced to solve classical Boolean problems as Hamiltonians, using the quantum approximate optimization algorithm (QAOA). This methodology is termed the “Boolean-Hamiltonians Transform for QAOA” (BHT-QAOA). Because a great deal of research and studies are mainly focused on solving combinatorial [...] Read more.
A new methodology is introduced to solve classical Boolean problems as Hamiltonians, using the quantum approximate optimization algorithm (QAOA). This methodology is termed the “Boolean-Hamiltonians Transform for QAOA” (BHT-QAOA). Because a great deal of research and studies are mainly focused on solving combinatorial optimization problems using QAOA, the BHT-QAOA adds an additional capability to QAOA to find all optimized approximated solutions for Boolean problems, by transforming such problems from Boolean oracles (in different structures) into Phase oracles, and then into the Hamiltonians of QAOA. From such a transformation, we noticed that the total utilized numbers of qubits and quantum gates are dramatically minimized for the generated Hamiltonians of QAOA. In this article, arbitrary Boolean problems are examined by successfully solving them with our BHT-QAOA, using different structures based on various logic synthesis methods, an IBM quantum computer, and a classical optimization minimizer. Accordingly, the BHT-QAOA will provide broad opportunities to solve many classical Boolean-based problems as Hamiltonians, for the practical engineering applications of several algorithms, digital synthesizers, robotics, and machine learning, just to name a few, in the hybrid classical-quantum domain. Full article
(This article belongs to the Special Issue The Future of Quantum Machine Learning and Quantum AI)
Show Figures

Figure 1

Figure 1
<p>The quantum circuit of a Boolean oracle in POS structure for the classical Boolean problem (a ∨ b ∨ ¬ c) ∧ (¬ a ∨ c) ∧ (¬ b ∨ c), where the <span class="html-italic">OR1</span> ancilla qubit represents the term (a ∨ b ∨ ¬ c), the <span class="html-italic">OR2</span> ancilla qubit represents the term (¬ a ∨ c), the <span class="html-italic">OR3</span> ancilla qubit represents the term (¬ b ∨ c), the <span class="html-italic">fqubit</span> ancilla qubit performs all AND operations (∧), and the quantum gates in red denote the mirror (as the uncomputing part) of this Boolean oracle to reset all ancilla qubits to their initial quantum states. Note that all ancilla qubits are initially set to the |0⟩ states.</p>
Full article ">Figure 2
<p>The synthesis method for the classical Boolean problem of Equation (1) above: (<b>a</b>) the Karnaugh map synthesis from the Boolean oracle (in <a href="#entropy-26-00843-f001" class="html-fig">Figure 1</a>) to the Boolean oracle in (<b>c</b>), based on grouping all true minterms ‘1’ (as solutions) only, (<b>b</b>) the Karnaugh map synthesis from the Boolean oracle (in <a href="#entropy-26-00843-f001" class="html-fig">Figure 1</a>) to its equivalent Boolean oracle in ESOP structure ((¬ <span class="html-italic">a</span> ∧ ¬ <span class="html-italic">b</span>) ⊕ <span class="html-italic">c</span>), based on grouping all ‘1’ minterms (as solutions) with one ‘0’ minterm (as an XORed solution), and (<b>c</b>) the Boolean oracle in DSOP structure of Equation (2) above, where the <span class="html-italic">fqubit</span> performs all XORing operations (⊕).</p>
Full article ">Figure 3
<p>Schematics of our generalized transformation rules from the quantum Boolean-based gates (Feynman, Toffoli, and <span class="html-italic">n</span>-bit Toffoli gates) to the quantum Phase-based gates (Z, CZ, and (<span class="html-italic">n</span>−1)-bit MCZ gates) with their truth tables, where <span class="html-italic">n</span> ≥ 3 qubits (q inputs + <span class="html-italic">fqubit</span>), and texts in red indicate the solutions: (<b>a</b>) Rule 1 transforms a Feynman (CX) gate into a Z gate, (<b>b</b>) Rule 2 transforms a Toffoli gate into a CZ gate, and (<b>c</b>) Rule 3 transforms an <span class="html-italic">n</span>-bit Toffoli gate to an (<span class="html-italic">n</span>−1)-bit MCZ gate. Note that the total number of qubits is reduced by one after applying these rules, i.e., the <span class="html-italic">fqubit</span> is removed.</p>
Full article ">Figure 4
<p>The Phase oracle for the classical Boolean problem (<span class="html-italic">a</span> ∨ <span class="html-italic">b</span> ∨ ¬ <span class="html-italic">c</span>) ∧ (¬ <span class="html-italic">a</span> ∨ <span class="html-italic">c</span>) ∧ (¬ <span class="html-italic">b</span> ∨ <span class="html-italic">c</span>), after applying our generalized transformation rules on its Boolean oracle in ESOP structure, such that (i) two 4-bit Toffoli gates are transformed into two 3-bit MCZ gates and one Toffoli gate into one CZ gate, (ii) all ancilla qubits (including <span class="html-italic">fqubit</span>) are removed, and (iii) there is no mirror for this oracle.</p>
Full article ">Figure 5
<p>Steps of generating the Hamiltonian (<span class="html-italic">H<sub>C</sub></span>) using our generalized composition rules (<span class="html-italic">H<sub>g</sub></span>) from the Phase oracle shown in <a href="#entropy-26-00843-f004" class="html-fig">Figure 4</a>, such that <span class="html-italic">H<sub>C</sub></span> = (<span class="html-italic">H<sub>g</sub></span><sub>1</sub> → <span class="html-italic">H<sub>g</sub></span><sub>2</sub>) + (<span class="html-italic">H<sub>g</sub></span><sub>3</sub> → <span class="html-italic">H<sub>g</sub></span><sub>4</sub>) + <span class="html-italic">H<sub>g</sub></span><sub>5</sub>.</p>
Full article ">Figure 6
<p>The quantum circuit for the classical Boolean problem of (<span class="html-italic">a</span> ∨ <span class="html-italic">b</span> ∨ ¬ <span class="html-italic">c</span>) ∧ (¬ <span class="html-italic">a</span> ∨ <span class="html-italic">c</span>) ∧ (¬ <span class="html-italic">b</span> ∨ <span class="html-italic">c</span>) after applying our generalized transformation rules (<span class="html-italic">H<sub>g</sub></span>) to generate two Hamiltonians (<span class="html-italic">H<sub>C</sub></span> and <span class="html-italic">H<sub>M</sub></span>) in one repetition (<span class="html-italic">p</span>), where H is the Hadamard gate, <span class="html-italic">H<sub>C</sub></span> is (‘III’, ‘ZII’, ‘ZIZ’, ‘ZZI’, ‘ZZZ’) with its coefficient <span class="html-italic">v</span> = [<math display="inline"><semantics> <mrow> <mo>−</mo> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mrow> <mn>1</mn> </mrow> <mrow> <mo> </mo> <mn>2</mn> <mo> </mo> </mrow> </mfrac> </mstyle> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mrow> <mn>1</mn> </mrow> <mrow> <mo> </mo> <mn>4</mn> <mo> </mo> </mrow> </mfrac> </mstyle> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mo>−</mo> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mrow> <mn>1</mn> </mrow> <mrow> <mo> </mo> <mn>4</mn> <mo> </mo> </mrow> </mfrac> </mstyle> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mo>−</mo> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mrow> <mn>1</mn> </mrow> <mrow> <mo> </mo> <mn>4</mn> <mo> </mo> </mrow> </mfrac> </mstyle> </mrow> </semantics></math>], <span class="html-italic">H<sub>M</sub></span> is (‘XII’, ‘IXI’, ‘IIX’) with its coefficient <span class="html-italic">ω</span> = 2.0, and <span class="html-italic">ɣ</span> and <span class="html-italic">β</span> are the optimization angular parameters for <span class="html-italic">H<sub>C</sub></span> and <span class="html-italic">H<sub>M</sub></span>, respectively.</p>
Full article ">Figure 7
<p>The architecture of our Boolean–Hamiltonian Transform for QAOA (BHT-QAOA) to solve arbitrary classical Boolean problems as Hamiltonians (<span class="html-italic">H<sub>C</sub></span> and <span class="html-italic">H<sub>M</sub></span>). The BHT-QAOA is mainly grouped into two processing domains: (i) the classical processing domain as denoted by blue, and (ii) the quantum processing domain as denoted by red.</p>
Full article ">Figure 8
<p>Schematics of the classical representations and the quantum circuits for arbitrary Boolean problems: ((<b>a</b>), <span class="html-italic">upper-left</span>) the Boolean oracle in SOP structure representing Equation (10) above, ((<b>b</b>), <span class="html-italic">upper-right</span>) the Boolean oracle in ESOP structure representing Equation (11) above, ((<b>c</b>), <span class="html-italic">middle-left</span>) the board layout of 2 × 2 Sudoku, ((<b>d</b>), <span class="html-italic">middle-right</span>) the Boolean oracle in CNF-XOR SAT structure of 2 × 2 Sudoku, ((<b>e</b>), <span class="html-italic">bottom-left</span>) the classical 4-bit conditioned half-adder for two 2-bit numbers (A = <span class="html-italic">a</span><sub>1</sub><span class="html-italic">a</span><sub>0</sub> and B = <span class="html-italic">b</span><sub>1</sub><span class="html-italic">b</span><sub>0</sub>), and ((<b>f</b>), <span class="html-italic">bottom-right</span>) the Boolean oracle in a mixed structure representing Equation (13) above.</p>
Full article ">Figure 9
<p>The final measured solutions for arbitrary applications executed with ibm_brisbane QPU (for 1024 shots): ((<b>a</b>), <span class="html-italic">upper-left</span>) the four solutions {<math display="inline"><semantics> <mrow> <mover accent="true"> <mrow> <mi>a</mi> </mrow> <mo mathvariant="normal">-</mo> </mover> <mover accent="true"> <mrow> <mi>b</mi> </mrow> <mo mathvariant="normal">-</mo> </mover> <mover accent="true"> <mrow> <mi>c</mi> </mrow> <mo mathvariant="normal">-</mo> </mover> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>a</mi> <mover accent="true"> <mrow> <mi>b</mi> </mrow> <mo mathvariant="normal">-</mo> </mover> <mi>c</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mover accent="true"> <mrow> <mi>a</mi> </mrow> <mo mathvariant="normal">-</mo> </mover> <mi mathvariant="italic">bc</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi mathvariant="italic">abc</mi> </mrow> </semantics></math>} for the Boolean oracle in POS structure of Equation (1) above, ((<b>b</b>), <span class="html-italic">upper-middle</span>) the four solutions {<math display="inline"><semantics> <mrow> <mi mathvariant="italic">ab</mi> <mover accent="true"> <mrow> <mi>c</mi> </mrow> <mo mathvariant="normal">-</mo> </mover> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mover accent="true"> <mrow> <mi>a</mi> </mrow> <mo mathvariant="normal">-</mo> </mover> <mover accent="true"> <mrow> <mi>b</mi> </mrow> <mo mathvariant="normal">-</mo> </mover> <mi>c</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>a</mi> <mover accent="true"> <mrow> <mi>b</mi> </mrow> <mo mathvariant="normal">-</mo> </mover> <mi>c</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mover accent="true"> <mrow> <mi>a</mi> </mrow> <mo mathvariant="normal">-</mo> </mover> <mi mathvariant="italic">bc</mi> </mrow> </semantics></math>} for the Boolean oracle in SOP structure of Equation (10) above, ((<b>c</b>), <span class="html-italic">upper-right</span>) the three solutions {<math display="inline"><semantics> <mrow> <mi mathvariant="italic">ab</mi> <mover accent="true"> <mrow> <mi>c</mi> </mrow> <mo mathvariant="normal">-</mo> </mover> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>a</mi> <mover accent="true"> <mrow> <mi>b</mi> </mrow> <mo mathvariant="normal">-</mo> </mover> <mi>c</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mover accent="true"> <mrow> <mi>a</mi> </mrow> <mo mathvariant="normal">-</mo> </mover> <mi mathvariant="italic">bc</mi> </mrow> </semantics></math>} for the Boolean oracle in ESOP structure of Equation (11) above, ((<b>d</b>), <span class="html-italic">bottom-left</span>) the two permutative solutions {solution 1: <span class="html-italic">cell</span><sub>1</sub> = <span class="html-italic">cell</span><sub>4</sub> = 0 and <span class="html-italic">cell</span><sub>2</sub> = <span class="html-italic">cell</span><sub>3</sub> = 1; solution 2: <span class="html-italic">cell</span><sub>1</sub> = <span class="html-italic">cell</span><sub>4</sub> = 1 and <span class="html-italic">cell</span><sub>2</sub> = <span class="html-italic">cell</span><sub>3</sub> = 0} for the 2 × 2 Sudoku game of Equation (12) above, ((<b>e</b>), <span class="html-italic">bottom-middle</span>) the three solutions as two 2-bit numbers {<math display="inline"><semantics> <mrow> <msub> <mrow> <mi>a</mi> </mrow> <mrow> <mn>0</mn> </mrow> </msub> <msub> <mrow> <mi>a</mi> </mrow> <mrow> <mn>1</mn> </mrow> </msub> <mover accent="true"> <mrow> <msub> <mrow> <mi>b</mi> </mrow> <mrow> <mn>0</mn> </mrow> </msub> </mrow> <mo>¯</mo> </mover> <msub> <mrow> <mi>b</mi> </mrow> <mrow> <mn>1</mn> </mrow> </msub> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mover accent="true"> <mrow> <msub> <mrow> <mi>a</mi> </mrow> <mrow> <mn>0</mn> </mrow> </msub> </mrow> <mo>¯</mo> </mover> <msub> <mrow> <mi>a</mi> </mrow> <mrow> <mn>1</mn> </mrow> </msub> <msub> <mrow> <mi>b</mi> </mrow> <mrow> <mn>0</mn> </mrow> </msub> <msub> <mrow> <mi>b</mi> </mrow> <mrow> <mn>1</mn> </mrow> </msub> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>a</mi> </mrow> <mrow> <mn>0</mn> </mrow> </msub> <msub> <mrow> <mi>a</mi> </mrow> <mrow> <mn>1</mn> </mrow> </msub> <msub> <mrow> <mi>b</mi> </mrow> <mrow> <mn>0</mn> </mrow> </msub> <msub> <mrow> <mi>b</mi> </mrow> <mrow> <mn>1</mn> </mrow> </msub> </mrow> </semantics></math>} for the 4-bit conditioned half-adder of Equation (13) above, and ((<b>f</b>), <span class="html-italic">bottom-right</span>) the required <span class="html-italic">nfev</span> for the SciPy optimization minimizer to successfully optimize the numerical values of <span class="html-italic">ɣ</span> and <span class="html-italic">β</span> for the above-mentioned applications, in the subfigures (<b>a</b>–<b>e</b>).</p>
Full article ">
24 pages, 1269 KiB  
Article
Leveraging Digital Twins and Intrusion Detection Systems for Enhanced Security in IoT-Based Smart City Infrastructures
by Mohammed El-Hajj
Electronics 2024, 13(19), 3941; https://doi.org/10.3390/electronics13193941 (registering DOI) - 6 Oct 2024
Abstract
In this research, we investigate the integration of an Intrusion Detection System (IDS) with a Digital Twin (DT) to enhance the cybersecurity of physical devices in cyber–physical systems. Using Eclipse Ditto as the DT platform and Snort as the IDS, we developed a [...] Read more.
In this research, we investigate the integration of an Intrusion Detection System (IDS) with a Digital Twin (DT) to enhance the cybersecurity of physical devices in cyber–physical systems. Using Eclipse Ditto as the DT platform and Snort as the IDS, we developed a near-realistic test environment that included a Raspberry Pi as the physical device and a Kali Linux virtual machine to perform common cyberattacks such as Hping3 flood attacks and NMAP reconnaissance scans. The results demonstrated that the IDS effectively detected Hping3-based flood attacks but showed limitations in identifying NMAP scans, suggesting areas for IDS configuration improvements. Furthermore, the study uncovered significant system resource impacts, including high Central Processing Unit (CPU) usage during SYN and ACK flood attacks and persistent memory usage after Network Mapper (NMAP) scans, highlighting the need for enhanced recovery mechanisms. This research presents a novel approach by coupling a Digital Twin with an IDS, enabling real-time monitoring and providing a dual perspective on both system performance and security. The integration offers a holistic method for identifying vulnerabilities and understanding resource impacts during cyberattacks. The work contributes new insights into the use of Digital Twins for cybersecurity and paves the way for further research into automated defense mechanisms, real-world validation of the proposed model, and the incorporation of additional attack scenarios. The results suggest that this combined approach holds significant promise for enhancing the security and resilience of IoT devices and other cyber–physical systems. Full article
25 pages, 731 KiB  
Article
Artificial Intelligence for Social Innovation: Beyond the Noise of Algorithms and Datafication
by Igor Calzada
Sustainability 2024, 16(19), 8638; https://doi.org/10.3390/su16198638 (registering DOI) - 6 Oct 2024
Abstract
In an era of rapid technological advancement, decisions about the ownership and governance of emerging technologies like Artificial Intelligence will shape the future of both urban and rural environments in the Global North and South. This article explores how AI can move beyond [...] Read more.
In an era of rapid technological advancement, decisions about the ownership and governance of emerging technologies like Artificial Intelligence will shape the future of both urban and rural environments in the Global North and South. This article explores how AI can move beyond the noise of algorithms by adopting a technological humanistic approach to enable Social Innovation, focusing on global inequalities and digital justice. Using a fieldwork Action Research methodology, based on the Smart Rural Communities project in Colombia and Mozambique, the study develops a framework for integrating AI with SI. Drawing on insights from the AI4SI International Summer School held in Donostia-San Sebastián in 2024, the article examines the role of decentralized Web3 technologies—such as Blockchain, Decentralized Autonomous Organizations, and Data Cooperatives—in enhancing data sovereignty and fostering inclusive and participatory governance. The results demonstrate how decentralization can empower marginalized communities in the Global South by promoting digital justice and addressing the imbalance of power in digital ecosystems. The conclusion emphasizes the potential for AI and decentralized technologies to bridge the digital divide, offering practical recommendations for scaling these innovations to support equitable, community-driven governance and address systemic inequalities across the Global North and South. Full article
Show Figures

Figure 1

Figure 1
<p>AI4SI Framework: Blockchain, DAOs, and Data Cooperatives.</p>
Full article ">
19 pages, 596 KiB  
Article
The Impact of Digital Capabilities on Peasants’ Wage Growth: Evidence from Chinese Farmer Entrepreneurs
by Shanhu Zhang, Jinxiu Yang, Yun Shen and Zhuoli Li
Agriculture 2024, 14(10), 1765; https://doi.org/10.3390/agriculture14101765 (registering DOI) - 6 Oct 2024
Viewed by 109
Abstract
The gradual integration of digital technology into traditional Chinese villages has triggered a shift in income distribution from labor to capital, posing challenges to the wage growth of employed peasants. Based on the theory of empowerment, this paper explores the mechanisms of credit [...] Read more.
The gradual integration of digital technology into traditional Chinese villages has triggered a shift in income distribution from labor to capital, posing challenges to the wage growth of employed peasants. Based on the theory of empowerment, this paper explores the mechanisms of credit availability and talent loss in the interplay between digital capabilities and wage augmentation among employed peasants. This study empirically examines or validates the mechanism of digital capabilities on wage growth for employed peasants through the entropy weight method, the OLS linear model, the mediation effect model, and propensity score matching while using survey data from 490 farmer entrepreneurs as samples. The findings are as follows. (1) The digital capabilities of farmer entrepreneurs have a significant positive impact on the wage growth of employed peasants, and this result remains robust after a series of robustness checks. In terms of hierarchical effects, digital foundational capabilities > digital application capabilities > digital innovation capabilities. (2) Credit availability and talent loss mediate the relationship between digital capabilities and wage growth for employed peasants. (3) The digital capabilities of farmer entrepreneurs who are young, highly educated, and have a low family-dependency ratio exert a more pronounced influence on the wage growth of employed peasants. Additionally, lower policy uncertainty enhances the effect of digital capabilities on wage growth for employed peasants. The study uncovers the empowerment mechanism of digital advancements embedded during the entrepreneurial journey, enriches research on digital capabilities and common prosperity, and provides a feasible path for governments to formulate reasonable entrepreneurship and digital promotion policies. Full article
(This article belongs to the Special Issue Agricultural Policies toward Sustainable Farm Development)
Show Figures

Figure 1

Figure 1
<p>The relationship mechanism between DC and the growth of employed peasants’ wages.</p>
Full article ">
17 pages, 2968 KiB  
Article
Empirical Modeling of Soil Loss and Yield Utilizing RUSLE and SYI: A Geospatial Study in South Sikkim, Teesta Basin
by Md Nawazuzzoha, Md. Mamoon Rashid, Prabuddh Kumar Mishra, Kamal Abdelrahman, Mohammed S. Fnais and Hasan Raja Naqvi
Land 2024, 13(10), 1621; https://doi.org/10.3390/land13101621 (registering DOI) - 5 Oct 2024
Viewed by 348
Abstract
Soil erosion and subsequent sedimentation pose significant challenges in the Sikkim Himalayas. In this study, we conducted an assessment of the impact of rainfall-induced soil erosion and sediment loss in South Sikkim, which falls within the Teesta Basin, employing Revised Universal Soil Loss [...] Read more.
Soil erosion and subsequent sedimentation pose significant challenges in the Sikkim Himalayas. In this study, we conducted an assessment of the impact of rainfall-induced soil erosion and sediment loss in South Sikkim, which falls within the Teesta Basin, employing Revised Universal Soil Loss Equation (RUSLE) and Sediment Yield Index (SYI) models. Leveraging mean annual precipitation data, a detailed soil map, geomorphological landforms, Digital Elevation Models (DEMs), and LANDSAT 8 OLI data were used to prepare the factorial maps of South Sikkim. The results of the RUSLE and SYI models revealed annual soil loss >200 t ha−1 yr−1, whereas mean values were estimated to be 93.42 t ha−1 yr−1 and 70.3 t ha−1 yr−1, respectively. Interestingly, both models displayed similar degrees of soil loss in corresponding regions under the various severity classes. Notably, low-severity erosion <50 t ha−1 yr−1 was predominantly observed in the valley sides in low-elevation zones, while areas with severe erosion rates >200 t ha−1 yr−1were concentrated in the upper reaches, characterized by steep slopes. These findings underscore the strong correlation between erosion rates and topography, which makes the region highly vulnerable to erosion. The prioritization of such regions and potential conservation methods need to be adopted to protect such precious natural resources in mountainous regions. Full article
(This article belongs to the Special Issue Advances in Hydro-Sedimentological Modeling for Simulating LULC)
Show Figures

Figure 1

Figure 1
<p>South Sikkim: a part of the Teesta Basin.</p>
Full article ">Figure 2
<p>Schematic flow chart of the methodology adopted for sediment loss quantification employing RUSLE and SYI empirical models.</p>
Full article ">Figure 3
<p>Factors mapping: Rainfall Erosivity (<b>a</b>), Soil Erodibility (<b>b</b>), Slope Length and Steepness (<b>c</b>), Cover Management, (<b>d</b>) and Support Practice (<b>e</b>) factors of RUSLE model.</p>
Full article ">Figure 4
<p>Factors employed for SYI model: slope in degree (<b>a</b>), rainfall erosivity (<b>b</b>), elevation (<b>c</b>), LULC (<b>d</b>), soil (<b>e</b>), and geomorphological landforms in which there are MDHs, Moderately Dissected Hills, and HDHs, Highly Dissected Hills (<b>f</b>).</p>
Full article ">Figure 5
<p>RUSLE (<b>a</b>) and SYI (<b>b</b>) empirical model-based soil loss rate.</p>
Full article ">
16 pages, 2426 KiB  
Article
From Protectionist to Regulator: Policy-Driven Transformation of Digital Urban Networks in China’s Online Gaming Industry
by Xu Zhang, Yingmin Huang and Xiaohua Zou
Sustainability 2024, 16(19), 8634; https://doi.org/10.3390/su16198634 (registering DOI) - 5 Oct 2024
Viewed by 343
Abstract
In the digital era, data-driven production organizes digital urban networks. This study explores the critical role of government policies in shaping these networks, focusing on China’s evolving policy contexts. While existing research has mainly emphasized qualitative analyses, this paper quantitatively assesses the impact [...] Read more.
In the digital era, data-driven production organizes digital urban networks. This study explores the critical role of government policies in shaping these networks, focusing on China’s evolving policy contexts. While existing research has mainly emphasized qualitative analyses, this paper quantitatively assesses the impact of policy changes on digital urban networks, specifically through the lens of China’s online gaming industry. The study aimed to elucidate the relationship between the policy environment and digital urban networks. By examining China’s transition from protectionist to regulatory policies, this research employed a social network analysis and valued exponential random graph models (ERGMs) across two key phases: the competitive protection phase (2014–2017) and the systematic regulatory phase (2018–2022). The findings revealed a significant transformation in urban network structure, shifting from a centralized model dominated by a few core cities to a decentralized, multi-centered network. The key factors influencing this evolution include the institutional proximity and cross-regional collaborations. This study offers valuable insights into how policy shifts affect urban networks in the digital economy, contributing both theoretically and practically to future policy design. Full article
Show Figures

Figure 1

Figure 1
<p>Heatmap of the regional connections of the digital urban network. (<b>a</b>) Competitive protection phase; (<b>b</b>) systematic regulatory phase.</p>
Full article ">Figure 2
<p>Spatial configuration of China’s digital urban network under the (<b>a</b>) competitive protection phase and the (<b>b</b>) systematic regulatory phase. These dots or polylines are part of the South China Sea and indicate coral reefs and coastlines in Chinese territory. They are part of the standard map of China and are not related to the research data in this paper.</p>
Full article ">
Back to TopTop