LIVIVO - The Search Portal for Life Sciences

zur deutschen Oberfläche wechseln
Advanced search

Search results

Result 1 - 10 of total 475

Search options

  1. Article: Effects of Massa Medicata Fermentata on the intestinal pathogenic flagella bacteria and visceral hypersensitivity in rats with irritable bowel syndrome.

    Zhuang, Zhaomeng / Huang, Chen / Zhang, Yiguang / Lv, Bin

    Frontiers in physiology

    2022  Volume 13, Page(s) 1039804

    Abstract: Objective: ...

    Abstract Objective:
    Language English
    Publishing date 2022-11-24
    Publishing country Switzerland
    Document type Journal Article
    ZDB-ID 2564217-0
    ISSN 1664-042X
    ISSN 1664-042X
    DOI 10.3389/fphys.2022.1039804
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

  2. Article ; Online: Distributed Time-Varying Convex Optimization With Dynamic Quantization.

    Chen, Ziqin / Yi, Peng / Li, Li / Hong, Yiguang

    IEEE transactions on cybernetics

    2023  Volume 53, Issue 2, Page(s) 1078–1092

    Abstract: In this work, we design a distributed algorithm for time-varying convex optimization over networks with quantized communications. Each agent has its local time-varying objective function, while the agents need to cooperatively track the optimal solution ... ...

    Abstract In this work, we design a distributed algorithm for time-varying convex optimization over networks with quantized communications. Each agent has its local time-varying objective function, while the agents need to cooperatively track the optimal solution trajectories of global time-varying functions. The distributed algorithm is motivated by the alternating direction method of multipliers, but the agents can only share quantization information through an undirected graph. To reduce the tracking error due to information loss in quantization, we apply the dynamic quantization scheme with a decaying scaling function. The tracking error is explicitly characterized with respect to the limit of the decaying scaling function in quantization. Furthermore, we are able to show that the algorithm could asymptotically track the optimal solution when time-varying functions converge, even with quantization information loss. Finally, the theoretical results are validated via numerical simulation.
    Language English
    Publishing date 2023-01-13
    Publishing country United States
    Document type Journal Article
    ISSN 2168-2275
    ISSN (online) 2168-2275
    DOI 10.1109/TCYB.2021.3099905
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

  3. Article ; Online: Distributed Optimization With Projection-Free Dynamics: A Frank-Wolfe Perspective.

    Chen, Guanpu / Yi, Peng / Hong, Yiguang / Chen, Jie

    IEEE transactions on cybernetics

    2023  Volume 54, Issue 1, Page(s) 599–610

    Abstract: We consider solving distributed constrained optimization in this article. To avoid projection operations due to constraints in the scenario with large-scale variable dimensions, we propose distributed projection-free dynamics by employing the Frank-Wolfe ...

    Abstract We consider solving distributed constrained optimization in this article. To avoid projection operations due to constraints in the scenario with large-scale variable dimensions, we propose distributed projection-free dynamics by employing the Frank-Wolfe method, also known as the conditional gradient. Technically, we find a feasible descent direction by solving an alternative linear suboptimization. To make the approach available over multiagent networks with weight-balanced digraphs, we design dynamics to simultaneously achieve both the consensus of local decision variables and the global gradient tracking of auxiliary variables. Then, we present the rigorous convergence analysis of the continuous-time dynamical systems. Also, we derive its discrete-time scheme with an accordingly proved convergence rate of O(1/k) . Furthermore, to clarify the advantage of our proposed distributed projection-free dynamics, we make detailed discussions and comparisons with both existing distributed projection-based dynamics and other distributed Frank-Wolfe algorithms.
    Language English
    Publishing date 2023-12-20
    Publishing country United States
    Document type Journal Article
    ISSN 2168-2275
    ISSN (online) 2168-2275
    DOI 10.1109/TCYB.2023.3284822
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

  4. Article ; Online: Zero-determinant strategy in stochastic Stackelberg asymmetric security game

    Zhaoyang Cheng / Guanpu Chen / Yiguang Hong

    Scientific Reports, Vol 13, Iss 1, Pp 1-

    2023  Volume 11

    Abstract: Abstract In a stochastic Stackelberg asymmetric security game, the strong Stackelberg equilibrium (SSE) strategy is a popular option for the defender to get the highest utility against an attacker with the best response (BR) strategy. However, the ... ...

    Abstract Abstract In a stochastic Stackelberg asymmetric security game, the strong Stackelberg equilibrium (SSE) strategy is a popular option for the defender to get the highest utility against an attacker with the best response (BR) strategy. However, the attacker may be a boundedly rational player, who adopts a combination of the BR strategy and a fixed stubborn one. In such a condition, the SSE strategy may not maintain the defensive performance due to the stubbornness. In this paper, we focus on how the defender can adopt the unilateral-control zero-determinate (ZD) strategy to confront the boundedly rational attacker. At first, we verify the existence of ZD strategies for the defender. We then investigate the performance of the defender’s ZD strategy against a boundedly rational attacker, with a comparison of the SSE strategy. Specifically, when the attacker’s strategy is close to the BR strategy, the ZD strategy admits a bounded loss for the defender compared with the SSE strategy. Conversely, when the attacker’s strategy is close to the stubborn strategy, the ZD strategy can bring higher defensive performance for the defender than the SSE strategy does.
    Keywords Medicine ; R ; Science ; Q
    Subject code 070
    Language English
    Publishing date 2023-07-01T00:00:00Z
    Publisher Nature Portfolio
    Document type Article ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    More links

    Kategorien

  5. Article ; Online: Zero-determinant strategy in stochastic Stackelberg asymmetric security game.

    Cheng, Zhaoyang / Chen, Guanpu / Hong, Yiguang

    Scientific reports

    2023  Volume 13, Issue 1, Page(s) 11308

    Abstract: In a stochastic Stackelberg asymmetric security game, the strong Stackelberg equilibrium (SSE) strategy is a popular option for the defender to get the highest utility against an attacker with the best response (BR) strategy. However, the attacker may be ...

    Abstract In a stochastic Stackelberg asymmetric security game, the strong Stackelberg equilibrium (SSE) strategy is a popular option for the defender to get the highest utility against an attacker with the best response (BR) strategy. However, the attacker may be a boundedly rational player, who adopts a combination of the BR strategy and a fixed stubborn one. In such a condition, the SSE strategy may not maintain the defensive performance due to the stubbornness. In this paper, we focus on how the defender can adopt the unilateral-control zero-determinate (ZD) strategy to confront the boundedly rational attacker. At first, we verify the existence of ZD strategies for the defender. We then investigate the performance of the defender's ZD strategy against a boundedly rational attacker, with a comparison of the SSE strategy. Specifically, when the attacker's strategy is close to the BR strategy, the ZD strategy admits a bounded loss for the defender compared with the SSE strategy. Conversely, when the attacker's strategy is close to the stubborn strategy, the ZD strategy can bring higher defensive performance for the defender than the SSE strategy does.
    Language English
    Publishing date 2023-07-12
    Publishing country England
    Document type Journal Article
    ZDB-ID 2615211-3
    ISSN 2045-2322 ; 2045-2322
    ISSN (online) 2045-2322
    ISSN 2045-2322
    DOI 10.1038/s41598-023-38460-8
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

  6. Article ; Online: Efficient Algorithm for Approximating Nash Equilibrium of Distributed Aggregative Games.

    Xu, Gehui / Chen, Guanpu / Qi, Hongsheng / Hong, Yiguang

    IEEE transactions on cybernetics

    2023  Volume 53, Issue 7, Page(s) 4375–4387

    Abstract: In this article, we aim to design a distributed approximate algorithm for seeking Nash equilibria (NE) of an aggregative game. Due to the local set constraints of each player, projection-based algorithms have been widely employed for solving such ... ...

    Abstract In this article, we aim to design a distributed approximate algorithm for seeking Nash equilibria (NE) of an aggregative game. Due to the local set constraints of each player, projection-based algorithms have been widely employed for solving such problems actually. Since it may be quite hard to get the exact projection in practice, we utilize inscribed polyhedrons to approximate local set constraints, which yields a related approximate game model. We first prove that the NE of the approximate game is the ϵ -NE of the original game and then propose a distributed algorithm to seek the ϵ -NE, where the projection is then of a standard form in quadratic optimization with linear constraints. With the help of the existing developed methods for solving quadratic optimization, we show the convergence of the proposed algorithm and also discuss the computational cost issue related to the approximation. Furthermore, based on the exponential convergence of the algorithm, we estimate the approximation accuracy related to ϵ . In addition, we investigate the computational cost saved by approximation in numerical simulation.
    MeSH term(s) Algorithms ; Computer Simulation
    Language English
    Publishing date 2023-06-15
    Publishing country United States
    Document type Journal Article
    ISSN 2168-2275
    ISSN (online) 2168-2275
    DOI 10.1109/TCYB.2022.3175831
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

  7. Article ; Online: Discovery of Aburatubolactams Reveals Biosynthetic Logic for Distinct 5/5-Type Polycyclic Tetramate Macrolactams.

    Chen, Youzhe / Jin, Hongbo / Xiong, Weiliang / Fang, Zhuangjie / Sun, Weiguang / Zhu, Yiguang / Zhang, Liping / Zhang, Yonghui / Zhang, Wenjun / Zhang, Changsheng

    Organic letters

    2024  Volume 26, Issue 8, Page(s) 1677–1682

    Abstract: A known polycyclic tetramate macrolactam (aburatubolactam C, ...

    Abstract A known polycyclic tetramate macrolactam (aburatubolactam C,
    MeSH term(s) Cyclization ; Streptomyces
    Language English
    Publishing date 2024-02-16
    Publishing country United States
    Document type Journal Article
    ISSN 1523-7052
    ISSN (online) 1523-7052
    DOI 10.1021/acs.orglett.4c00168
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

  8. Article ; Online: Distributed Optimization Design for Computation of Algebraic Riccati Inequalities.

    Zeng, Xianlin / Chen, Jie / Hong, Yiguang

    IEEE transactions on cybernetics

    2022  Volume 52, Issue 3, Page(s) 1924–1935

    Abstract: This article proposes a distributed optimization design to compute continuous-time algebraic Riccati inequalities (ARIs), where the information of matrices is distributed among agents. We propose a design procedure to tackle the nonlinearity, the ... ...

    Abstract This article proposes a distributed optimization design to compute continuous-time algebraic Riccati inequalities (ARIs), where the information of matrices is distributed among agents. We propose a design procedure to tackle the nonlinearity, the inequality, and the coupled information structure of ARI; then, we design a distributed algorithm based on an optimization approach and analyze its convergence properties. The proposed algorithm is able to verify whether ARI is feasible in a distributed way and converges to a solution if ARI is feasible for any initial condition.
    Keywords covid19
    Language English
    Publishing date 2022-03-11
    Publishing country United States
    Document type Journal Article
    ISSN 2168-2275
    ISSN (online) 2168-2275
    DOI 10.1109/TCYB.2020.3000791
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

  9. Article ; Online: Intraorbital Arteriovenous Fistulas: Case Series and Systematic Review.

    Su, Xin / Song, Zihao / Chen, Yiguang / Ye, Ming / Zhang, Hongqi / Ma, Yongjie / Zhang, Peng

    Operative neurosurgery (Hagerstown, Md.)

    2024  

    Abstract: Background and objectives: Intraorbital arteriovenous fistulas (AVFs) are an extremely rare subtype of intracranial fistula with ophthalmic symptoms similar to cavernous sinus dural AVFs or carotid cavernous fistulas but worse visual outcomes. Here, we ... ...

    Abstract Background and objectives: Intraorbital arteriovenous fistulas (AVFs) are an extremely rare subtype of intracranial fistula with ophthalmic symptoms similar to cavernous sinus dural AVFs or carotid cavernous fistulas but worse visual outcomes. Here, we present a case series and thorough systematic review on intraorbital AVFs to demonstrate treatment modalities and address this rare type of AVF.
    Methods: We conducted a retrospective study at a single center, in which we identified all cases of intraorbital AVFs that occurred between 2002 and 2022. We collected and analyzed data on demographics, fistula characteristics, treatment methods, clinical outcomes, and fistula closure. In addition, we conducted a systematic review of intraorbital AVFs.
    Results: Seven cases in our center and 41 cases of intraorbital AVFs reported in the 35 articles were identified. At our center, transarterial embolization (TAE) (42.9%) alone resulted in immediate complete occlusion in 3 cases. Transvenous embolization (14.3%) resulted in one case of immediate complete occlusion. In 2 cases, surgery (28.6%) resulted in immediate complete occlusion. In one case, conservative treatment (14.3%) was used, and the fistula was eventually spontaneously occluded. Immediate complete occlusion rate was 85.7%. One blindness occurred (14.3%). In the literature reported, 3 cases (60%) of retinal artery occlusion were reported when performing TAE via the ophthalmic artery. Two fistulas recurred as reported. In 33 (80.5%) patients, the fistula was finally completely occluded.
    Conclusion: TAE via the ophthalmic artery carries a high risk of blindness and a low cure rate. Transvenous techniques such as conventional transvenous routes, surgical exposure, or direct puncture of the drainage vein have been used as the first line of treatment for intraorbital AVFs.
    Language English
    Publishing date 2024-02-02
    Publishing country United States
    Document type Journal Article
    ZDB-ID 2767575-0
    ISSN 2332-4260 ; 2332-4252
    ISSN (online) 2332-4260
    ISSN 2332-4252
    DOI 10.1227/ons.0000000000001055
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

  10. Article ; Online: Spatial temporal Fourier single-pixel imaging.

    Tang, Zixin / Tang, Tianhang / Chen, Jie / Lv, Shun / Liu, Yiguang

    Optics letters

    2023  Volume 48, Issue 8, Page(s) 2066–2069

    Abstract: Generally, the imaging quality of Fourier single-pixel imaging (FSI) will severely degrade while achieving high-speed imaging at a low sampling rate (SR). To tackle this problem, a new, to the best of our knowledge, imaging technique is proposed: firstly, ...

    Abstract Generally, the imaging quality of Fourier single-pixel imaging (FSI) will severely degrade while achieving high-speed imaging at a low sampling rate (SR). To tackle this problem, a new, to the best of our knowledge, imaging technique is proposed: firstly, the Hessian-based norm constraint is introduced to deal with the staircase effect caused by the low SR and total variation regularization; secondly, based on the local similarity prior of consecutive frames in the time dimension, we designed the temporal local image low-rank constraint for the FSI, and combined the spatiotemporal random sampling method, the redundancy image information of consecutive frames can be utilized sufficiently; finally, by introducing additional variables to decompose the optimization problem into multiple sub-problems and analytically solving each one, a closed-form algorithm is derived for efficient image reconstruction. Experimental results show that the proposed method improves imaging quality significantly compared with state-of-the-art methods.
    Language English
    Publishing date 2023-03-13
    Publishing country United States
    Document type Journal Article
    ISSN 1539-4794
    ISSN (online) 1539-4794
    DOI 10.1364/OL.480190
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

To top