LIVIVO - The Search Portal for Life Sciences

zur deutschen Oberfläche wechseln
Advanced search

Search results

Result 1 - 10 of total 59

Search options

  1. Book ; Online: Bayesian Calibrated Click-Through Auction

    Chen, Junjie / Li, Minming / Xu, Haifeng / Zuo, Song

    2023  

    Abstract: We study information design in click-through auctions, in which the bidders/advertisers bid for winning an opportunity to show their ads but only pay for realized clicks. The payment may or may not happen, and its probability is called the click-through ... ...

    Abstract We study information design in click-through auctions, in which the bidders/advertisers bid for winning an opportunity to show their ads but only pay for realized clicks. The payment may or may not happen, and its probability is called the click-through rate(CTR). This auction format is widely used in the industry of online advertising. Bidders have private values, whereas the seller has private information about each bidder's CTRs. We are interested in the seller's problem of partially revealing CTR information to maximize revenue. Information design in click-through auctions turns out to be intriguingly different from almost all previous studies in this space since any revealed information about CTRs will never affect bidders' bidding behaviors -- they will always bid their true value for a click -- but only affect the auction's allocation and payment rule. This makes information design effectively a (constrained) mechanism design problem. We primarily focus on the two-bidder situation, which is already notoriously challenging as demonstrated in recent works, and adopt the algorithmic lens of developing approximate algorithms. Our first result is an FPTAS to compute an approximately optimal mechanism. The design of this algorithm leverages Bayesian bidder values which help to ``smooth'' the seller's revenue function and lead to better tractability. Our second result seeks to design ``simple'' and more practical signaling schemes. When bidders' CTR distribution is symmetric, we develop a simple prior-free signaling scheme, whose construction relies on a single parameter called optimal signal ratio. The constructed scheme provably obtains a good approximation as long as the maximum and minimum of bidders' value density functions do not differ much.
    Keywords Computer Science - Computer Science and Game Theory
    Subject code 005
    Publishing date 2023-06-10
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    More links

    Kategorien

  2. Article ; Online: Effect of interventional embolization based on absolute ethanol for peripheral arteriovenous malformations.

    Wang, Yanlin / Liu, Dakan / Xiao, Li / Zuo, Song / Ren, Tengfei / Dong, Changxian / Li, Tianxiao

    Biotechnology & genetic engineering reviews

    2023  , Page(s) 1–12

    Abstract: Background: Interventional embolization schedules based on absolute ethanol are usually used for peripheral arteriovenous malformations (PAVMs), and clinicians often choose the scheme according to the classification.: Aim: To evaluate different ... ...

    Abstract Background: Interventional embolization schedules based on absolute ethanol are usually used for peripheral arteriovenous malformations (PAVMs), and clinicians often choose the scheme according to the classification.
    Aim: To evaluate different interventional embolization schedules based on absolute ethanol for PAVMs.
    Methods: A retrospective study was performed of 165 patients with PAVMs treated with interventional embolization based on absolute ethanol in Henan Provincial People's Hospital from January 2018 to May 2021. PAVMs were classified as type II (
    Results: PAVMs were classified as type II (
    Conclusions: PAVMs occur maxillofacial usually, and Type II can achieve better effect by spring coil and absolute ethanol, while Type III and Type IV have no ideal effect by Pingyangmycin + iodized oil + PVA + absolute ethanol and spring coil + absolute ethanol, respectively. Both the two happen to be complications, and wound accounts the highest.
    Language English
    Publishing date 2023-05-29
    Publishing country England
    Document type Journal Article
    ZDB-ID 49457-4
    ISSN 2046-5556 ; 0264-8725
    ISSN (online) 2046-5556
    ISSN 0264-8725
    DOI 10.1080/02648725.2023.2217617
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

  3. Article ; Online: GFANet: Gated Fusion Attention Network for skin lesion segmentation.

    Qiu, Shihan / Li, Chengfei / Feng, Yue / Zuo, Song / Liang, Huijie / Xu, Ao

    Computers in biology and medicine

    2023  Volume 155, Page(s) 106462

    Abstract: Automatic segmentation of skin lesions is crucial for diagnosing and treating skin diseases. Although current medical image segmentation methods have significantly improved the results of skin lesion segmentation, the following major challenges still ... ...

    Abstract Automatic segmentation of skin lesions is crucial for diagnosing and treating skin diseases. Although current medical image segmentation methods have significantly improved the results of skin lesion segmentation, the following major challenges still affect the segmentation performance: (i) segmentation targets have irregular shapes and diverse sizes and (ii) low contrast or blurred boundaries between lesions and background. To address these issues, this study proposes a Gated Fusion Attention Network (GFANet) which designs two progressive relation decoders to accurately segment skin lesions images. First, we use a Context Features Gated Fusion Decoder (CGFD) to fuse multiple levels of contextual features, and then a prediction result is generated as the initial guide map. Then, it is optimized by a prediction decoder consisting of a shape flow and a final Gated Convolution Fusion (GCF) module, where we iteratively use a set of Channel Reverse Attention (CRA) modules and GCF modules in the shape flow to combine the features of the current layer and the prediction results of the adjacent next layer to gradually extract boundary information. Finally, to speed up network convergence and improve segmentation accuracy, we use GCF to fuse low-level features from the encoder and the final output of the shape flow. To verify the effectiveness and advantages of the proposed GFANet, we conduct extensive experiments on four publicly available skin lesion datasets (International Skin Imaging Collaboration [ISIC] 2016, ISIC 2017, ISIC 2018, and PH
    MeSH term(s) Humans ; Skin Diseases ; Skin ; Benchmarking ; Software ; Image Processing, Computer-Assisted
    Language English
    Publishing date 2023-02-19
    Publishing country United States
    Document type Journal Article ; Research Support, Non-U.S. Gov't
    ZDB-ID 127557-4
    ISSN 1879-0534 ; 0010-4825
    ISSN (online) 1879-0534
    ISSN 0010-4825
    DOI 10.1016/j.compbiomed.2022.106462
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

  4. Book ; Online: Autobidding Auctions in the Presence of User Costs

    Deng, Yuan / Mao, Jieming / Mirrokni, Vahab / Zhang, Hanrui / Zuo, Song

    2023  

    Abstract: We study autobidding ad auctions with user costs, where each bidder is value-maximizing subject to a return-over-investment (ROI) constraint, and the seller aims to maximize the social welfare taking into consideration the user's cost of viewing an ad. ... ...

    Abstract We study autobidding ad auctions with user costs, where each bidder is value-maximizing subject to a return-over-investment (ROI) constraint, and the seller aims to maximize the social welfare taking into consideration the user's cost of viewing an ad. We show that in the worst case, the approximation ratio of social welfare by running the vanilla VCG auctions with user costs could as bad as 0. To improve the performance of VCG, We propose a new variant of VCG based on properly chosen cost multipliers, and prove that there exist auction-dependent and bidder-dependent cost multipliers that guarantee approximation ratios of 1/2 and 1/4 respectively in terms of the social welfare.
    Keywords Computer Science - Computer Science and Game Theory
    Publishing date 2023-02-01
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    More links

    Kategorien

  5. Article ; Online: Integrated exploration of experimentation and molecular simulation in ester-containing polyimide dielectrics.

    Luo, Jinpeng / Tong, Hui / Mo, Song / Zhou, Fei / Zuo, Song / Yin, Chuanqiang / Xu, Ju / Li, Xiaomin

    RSC advances

    2023  Volume 13, Issue 2, Page(s) 963–972

    Abstract: With the growing development of film capacitors in various applications, the requirements for polymer dielectrics have increased accordingly. In this work, a series of ester-cotaining polyimide (EPI) dielectrics were designed and fabricated. Futhermore, ... ...

    Abstract With the growing development of film capacitors in various applications, the requirements for polymer dielectrics have increased accordingly. In this work, a series of ester-cotaining polyimide (EPI) dielectrics were designed and fabricated. Futhermore, integrated exploration of experimentation and molecular simulation is proposed to achieve polymer dielectrics with advanced comprehensive performance, as well as to analyze the dielectric mechanism in-depth. The EPIs show superior thermal resistance and dielectric properties. A Weibull breakdown strength of 440-540 MV m
    Language English
    Publishing date 2023-01-04
    Publishing country England
    Document type Journal Article
    ISSN 2046-2069
    ISSN (online) 2046-2069
    DOI 10.1039/d2ra06376j
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

  6. Book ; Online: The Matthew Effect in Computation Contests

    Zeng, Yulong / Zuo, Song

    High Difficulty May Lead to 51% Dominance

    2019  

    Abstract: We study the computation contests where players compete for searching a solution to a given problem with a winner-take-all reward. The search processes are independent across the players and the search speeds of players are proportional to their ... ...

    Abstract We study the computation contests where players compete for searching a solution to a given problem with a winner-take-all reward. The search processes are independent across the players and the search speeds of players are proportional to their computational powers. One concrete application of this abstract model is the mining process of proof-of-work type blockchain systems, such as Bitcoin. Although one's winning probability is believed to be proportional to his computational power in previous studies on Bitcoin, we show that it is not the case in the strict sense. Because of the gaps between the winning probabilities and the proportions of computational powers, the Matthew effect will emerge in the system, where the rich get richer and the poor get poorer. In addition, we show that allowing the players to pool with each other or reducing the number of solutions to the problem may aggravate the Matthew effect and vice versa.

    Comment: WWW 2019
    Keywords Computer Science - Computer Science and Game Theory
    Publishing date 2019-02-24
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    More links

    Kategorien

  7. Book ; Online: Efficiency of the First-Price Auction in the Autobidding World

    Deng, Yuan / Mao, Jieming / Mirrokni, Vahab / Zhang, Hanrui / Zuo, Song

    2022  

    Abstract: We study the price of anarchy of the first-price auction in the autobidding world, where bidders can be either utility maximizers (i.e., traditional bidders) or value maximizers (i.e., autobidders). We show that with autobidders only, the price of ... ...

    Abstract We study the price of anarchy of the first-price auction in the autobidding world, where bidders can be either utility maximizers (i.e., traditional bidders) or value maximizers (i.e., autobidders). We show that with autobidders only, the price of anarchy of the first-price auction is $1/2$, and with both kinds of bidders, the price of anarchy degrades to about $0.457$ (the precise number is given by an optimization). These results complement the recent result by Jin and Lu [2022] showing that the price of anarchy of the first-price auction with traditional bidders only is $1 - 1/e^2$. We further investigate a setting where the seller can utilize machine-learned advice to improve the efficiency of the auctions. There, we show that as the accuracy of the advice increases, the price of anarchy improves smoothly from about $0.457$ to $1$.
    Keywords Computer Science - Computer Science and Game Theory ; Computer Science - Data Structures and Algorithms
    Subject code 303
    Publishing date 2022-08-22
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    More links

    Kategorien

  8. Book ; Online: Mechanism Design for Large Language Models

    Duetting, Paul / Mirrokni, Vahab / Leme, Renato Paes / Xu, Haifeng / Zuo, Song

    2023  

    Abstract: We investigate auction mechanisms to support the emerging format of AI-generated content. We in particular study how to aggregate several LLMs in an incentive compatible manner. In this problem, the preferences of each agent over stochastically generated ...

    Abstract We investigate auction mechanisms to support the emerging format of AI-generated content. We in particular study how to aggregate several LLMs in an incentive compatible manner. In this problem, the preferences of each agent over stochastically generated contents are described/encoded as an LLM. A key motivation is to design an auction format for AI-generated ad creatives to combine inputs from different advertisers. We argue that this problem, while generally falling under the umbrella of mechanism design, has several unique features. We propose a general formalism -- the token auction model -- for studying this problem. A key feature of this model is that it acts on a token-by-token basis and lets LLM agents influence generated contents through single dimensional bids. We first explore a robust auction design approach, in which all we assume is that agent preferences entail partial orders over outcome distributions. We formulate two natural incentive properties, and show that these are equivalent to a monotonicity condition on distribution aggregation. We also show that for such aggregation functions, it is possible to design a second-price auction, despite the absence of bidder valuation functions. We then move to designing concrete aggregation functions by focusing on specific valuation forms based on KL-divergence, a commonly used loss function in LLM. The welfare-maximizing aggregation rules turn out to be the weighted (log-space) convex combination of the target distributions from all participants. We conclude with experimental results in support of the token auction formulation.
    Keywords Computer Science - Computer Science and Game Theory ; Economics - Theoretical Economics
    Subject code 005
    Publishing date 2023-10-16
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    More links

    Kategorien

  9. Book ; Online: Efficiency of the Generalized Second-Price Auction for Value Maximizers

    Deng, Yuan / Mahdian, Mohammad / Mao, Jieming / Mirrokni, Vahab / Zhang, Hanrui / Zuo, Song

    2023  

    Abstract: We study the price of anarchy of the generalized second-price auction where bidders are value maximizers (i.e., autobidders). We show that in general the price of anarchy can be as bad as $0$. For comparison, the price of anarchy of running VCG is $1/2$ ... ...

    Abstract We study the price of anarchy of the generalized second-price auction where bidders are value maximizers (i.e., autobidders). We show that in general the price of anarchy can be as bad as $0$. For comparison, the price of anarchy of running VCG is $1/2$ in the autobidding world. We further show a fined-grained price of anarchy with respect to the discount factors (i.e., the ratios of click probabilities between lower slots and the highest slot in each auction) in the generalized second-price auction, which highlights the qualitative relation between the smoothness of the discount factors and the efficiency of the generalized second-price auction.
    Keywords Computer Science - Computer Science and Game Theory
    Publishing date 2023-10-04
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    More links

    Kategorien

  10. Article ; Online: Evaluation of an algorithm-guided photoplethysmography for atrial fibrillation burden using a smartwatch.

    Zhao, Zixu / Li, Qifan / Li, Sitong / Guo, Qi / Bo, Xiaowen / Kong, Xiangyi / Xia, Shijun / Li, Xin / Dai, Wenli / Guo, Lizhu / Liu, Xiaoxia / Jiang, Chao / Guo, Xueyuan / Liu, Nian / Li, Songnan / Zuo, Song / Sang, Caihua / Long, Deyong / Dong, Jianzeng /
    Ma, Changsheng

    Pacing and clinical electrophysiology : PACE

    2024  Volume 47, Issue 4, Page(s) 511–517

    Abstract: Background: Wearable devices based on the PPG algorithm can detect atrial fibrillation (AF) effectively. However, further investigation of its application on long-term, continuous monitoring of AF burden is warranted.: Method: The performance of a ... ...

    Abstract Background: Wearable devices based on the PPG algorithm can detect atrial fibrillation (AF) effectively. However, further investigation of its application on long-term, continuous monitoring of AF burden is warranted.
    Method: The performance of a smartwatch with continuous photoplethysmography (PPG) and PPG-based algorithms for AF burden estimation was evaluated in a prospective study enrolling AF patients admitted to Beijing Anzhen Hospital for catheter ablation from September to November 2022. A continuous Electrocardiograph patch (ECG) was used as the reference device to validate algorithm performance for AF detection in 30-s intervals.
    Results: A total of 578669 non-overlapping 30-s intervals for PPG and ECG each from 245 eligible patients were generated. An interval-level sensitivity of PPG was 96.3% (95% CI 96.2%-96.4%), and specificity was 99.5% (95% CI 99.5%-99.6%) for the estimation of AF burden. AF burden estimation by PPG was highly correlated with AF burden calculated by ECG via Pearson correlation coefficient (R2 = 0.996) with a mean difference of -0.59 (95% limits of agreement, -7.9% to 6.7%). The subgroup study showed the robust performance of the algorithm in different subgroups, including heart rate and different hours of the day.
    Conclusion: Our results showed the smartwatch with an algorithm-based PPG monitor has good accuracy and stability in continuously monitoring AF burden compared with ECG patch monitors, indicating its potential for diagnosing and managing AF.
    MeSH term(s) Humans ; Atrial Fibrillation/diagnosis ; Photoplethysmography/methods ; Prospective Studies ; Sensitivity and Specificity ; Algorithms ; Electrocardiography/methods
    Language English
    Publishing date 2024-02-26
    Publishing country United States
    Document type Journal Article
    ZDB-ID 424437-0
    ISSN 1540-8159 ; 0147-8389
    ISSN (online) 1540-8159
    ISSN 0147-8389
    DOI 10.1111/pace.14951
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

To top