Search

Your search keyword '"Zhao, Chang"' showing total 4,649 results
Start Over Author "Zhao, Chang"
4,649 results on '"Zhao, Chang"'

1. Quantifying Heterogeneous Ecosystem Services With Multi-Label Soft Classification

Author

Tian, Zhihui, Upchurch, John, Simon, G. Austin, Dubeux, José, Zare, Alina, Zhao, Chang, and Harley, Joel B.

Subjects
Computer Science - Machine Learning, Computer Science - Artificial Intelligence, Quantitative Biology - Quantitative Methods
Abstract

Understanding and quantifying ecosystem services are crucial for sustainable environmental management, conservation efforts, and policy-making. The advancement of remote sensing technology and machine learning techniques has greatly facilitated this process. Yet, ground truth labels, such as biodiversity, are very difficult and expensive to measure. In addition, more easily obtainable proxy labels, such as land use, often fail to capture the complex heterogeneity of the ecosystem. In this paper, we demonstrate how land use proxy labels can be implemented with a soft, multi-label classifier to predict ecosystem services with complex heterogeneity., Comment: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible

Published
2024

2. PerLLM: Personalized Inference Scheduling with Edge-Cloud Collaboration for Diverse LLM Services

Author

Yang, Zheming, Yang, Yuanhao, Zhao, Chang, Guo, Qi, He, Wenkai, and Ji, Wen

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Networking and Internet Architecture
Abstract

With the rapid growth in the number of large language model (LLM) users, it is difficult for bandwidth-constrained cloud servers to simultaneously process massive LLM services in real-time. Recently, edge-cloud infrastructures have been used to improve the processing efficiency of large-scale LLM services. However, the diversity of task requirements and the dynamics of resources pose great challenges to inference scheduling, leading to the wastage of many resources. In this paper, we present PerLLM, a personalized inference scheduling framework with edge-cloud collaboration designed for diverse LLM services. For the complexity of multiple constraints and the decision-making process of edge-cloud collaboration, we integrate the upper confidence bound algorithm based on the constraint satisfaction mechanism in PerLLM. For diverse LLM services, PerLLM can optimize service scheduling and resource allocation solutions within the edge-cloud infrastructure to meet processing time requirements while minimizing energy costs. Experimental results from different model deployments show that PerLLM can effectively meet the processing time requirements of personalized services. Compared to other methods, PerLLM achieves 2.2x, 2.1x, and 1.6x throughput and reduces the energy cost by more than 50%.

Published
2024

8. Phylogenomics, divergence times and notes of orders in Basidiomycota

Author

He, Mao-Qiang, Cao, Bin, Liu, Fei, Boekhout, Teun, Denchev, Teodor T., Schoutteten, Nathan, Denchev, Cvetomir M., Kemler, Martin, Gorjón, Sergio P., Begerow, Dominik, Valenzuela, Ricardo, Davoodian, Naveed, Niskanen, Tuula, Vizzini, Alfredo, Redhead, Scott A., Ramírez-Cruz, Virginia, Papp, Viktor, Dudka, Vasiliy A., Dutta, Arun Kumar, García-Sandoval, Ricardo, Liu, Xin-Zhan, Kijpornyongpan, Teeratas, Savchenko, Anton, Tedersoo, Leho, Theelen, Bart, Trierveiler-Pereira, Larissa, Wu, Fang, Zamora, Juan Carlos, Zeng, Xiang-Yu, Zhou, Li-Wei, Liu, Shi-Liang, Ghobad-Nejhad, Masoomeh, Giachini, Admir J., Li, Guo-Jie, Kakishima, Makoto, Olariaga, Ibai, Haelewaters, Danny, Sulistyo, Bobby, Sugiyama, Junta, Svantesson, Sten, Yurkov, Andrey, Alvarado, Pablo, Antonín, Vladimír, da Silva, André Felipe, Druzhinina, Irina, Gibertoni, Tatiana B., Guzmán-Dávalos, Laura, Justo, Alfredo, Karunarathna, Samantha C., Galappaththi, Mahesh C. A., Toome-Heller, Merje, Hosoya, Tsuyoshi, Liimatainen, Kare, Márquez, Rodrigo, Mešić, Armin, Moncalvo, Jean-Marc, Nagy, László G., Varga, Torda, Orihara, Takamichi, Raymundo, Tania, Salcedo, Isabel, Silva-Filho, Alexandre G. S., Tkalčec, Zdenko, Wartchow, Felipe, Zhao, Chang-Lin, Bau, Tolgor, Cabarroi-Hernández, Milay, Cortés-Pérez, Alonso, Decock, Cony, De Lange, Ruben, Weiss, Michael, Menolli, Jr., Nelson, Nilsson, R. Henrik, Fan, Yu-Guang, Verbeken, Annemieke, Gafforov, Yusufjon, Meiras-Ottoni, Angelina, Mendes-Alvarenga, Renato L., Zeng, Nian-Kai, Wu, Qi, Hyde, Kevin D., Kirk, Paul M., and Zhao, Rui-Lin

Published
2024
Full Text
View/download PDF

10. Mechanically-primed voltage-gated proton channels from angiosperm plants.

Author

Zhao, Chang, Webster, Parker, De Angeli, Alexis, and Tombola, Francesco

Subjects
Protons, Magnoliopsida, Ion Channels, Tracheophyta
Abstract

Voltage-gated and mechanically-gated ion channels are distinct classes of membrane proteins that conduct ions across gated pores and are turned on by electrical or mechanical stimuli, respectively. Here, we describe an Hv channel (a.k.a voltage-dependent H+ channel) from the angiosperm plant A. thaliana that gates with a unique modality as it is turned on by an electrical stimulus only after exposure to a mechanical stimulus, a process that we call priming. The channel localizes in the vascular tissue and has homologs in vascular plants. We find that mechanical priming is not required for activation of non-angiosperm Hvs. Guided by AI-generated structural models of plant Hv homologs, we identify a set of residues playing a crucial role in mechanical priming. We propose that Hvs from angiosperm plants require priming because of a network of hydrophilic/charged residues that locks the channels in a silent resting conformation. Mechanical stimuli destabilize the network allowing the conduction pathway to turn on. In contrast to many other channels and receptors, Hv proteins are not thought to possess mechanisms such as inactivation or desensitization. Our findings demonstrate that angiosperm Hv channels are electrically silent until a mechanical stimulation turns on their voltage-dependent activity.

Published
2023

19. Arterial chemotherapy for hepatocellular carcinoma in China: consensus recommendations

Author

Zhao, Ming, Guo, Zhi, Zou, Ying-Hua, Li, Xiao, Yan, Zhi-Ping, Chen, Min-Shan, Fan, Wei-Jun, Li, Hai-Liang, Yang, Ji-Jin, Chen, Xiao-Ming, Xu, Lin-Feng, Zhang, Yue-Wei, Zhu, Kang-Shun, Sun, Jun-Hui, Li, Jia-Ping, Jin, Yong, Yu, Hai-Peng, Duan, Feng, Xiong, Bin, Yin, Guo-Wen, Lin, Hai-Lan, Ma, Yi-Long, Wang, Hua-Ming, Gu, Shan-Zhi, Si, Tong-Guo, Wang, Xiao-Dong, Zhao, Chang, Yu, Wen-Chang, Guo, Jian-Hai, Zhai, Jian, Huang, Yong-Hui, Wang, Wei-Yu, Lin, Hai-Feng, Gu, Yang-Kui, Chen, Jin-Zhang, Wang, Jian-Peng, Zhang, Yi-Min, Yi, Jun-Zhe, and Lyu, Ning

Published
2024
Full Text
View/download PDF

20. Orlicz log-Aleksandrov-Fenchel inequality

Author

Zhao, Chang-Jian

Subjects
Mathematics - General Mathematics
Abstract

In this paper, we establish an Orlicz log-Aleksandrov-Fenchel inequality by introducing new concepts of mixed volume measure and Orlicz multiple mixed volume measure, and using the Orlicz-Aleksandrov-Fenchel inequality. The Orlicz log-Aleksandrov-Fenchel inequality in special cases yield the classical Aleksandrov-Fenchel inequality and Orlicz log-Minkowski type inequality, respectively.

Published
2022

22. Competitor Matching Method for Penetration Control Based on Deep Learning

Author

Peng, Yi-yang, Cheng, Li, Zhao, Chang-chun, Meng, Hai-yang, Hu, Yang-xiu, Hua, Ren-kuan, Ceccarelli, Marco, Series Editor, Agrawal, Sunil K., Advisory Editor, Corves, Burkhard, Advisory Editor, Glazunov, Victor, Advisory Editor, Hernández, Alfonso, Advisory Editor, Huang, Tian, Advisory Editor, Jauregui Correa, Juan Carlos, Advisory Editor, Takeda, Yukio, Advisory Editor, and Li, Shaofan, editor

Published
2024
Full Text
View/download PDF

25. Familism Values and Psychological Adjustment of Latinx Adolescents in an Emerging Immigrant Community: A Five Wave Longitudinal Study

Author

Kho, Carmen, White, Rebecca M. B., Zhao, Chang, Knight, George P., and Roche, Kathleen M.

Abstract

This study examined the relations between normative developmental changes of familism values and later internalizing and externalizing behaviors in Latinx adolescents from an emerging immigrant community. The sample included 547 Latinx adolescents (55.4% female; baseline M[subscript age] = 12.80; SD = 1.03) residing in the Southeastern United States. Results from latent growth models indicated that higher initial levels of familism values (intercept) and slower declines (slope) in familism values across adolescence predicted lower internalizing and externalizing behaviors at a later time. These associations generalized across adolescent gender (boys and girls) and ethnic background (Mexican-origin vs. other Latinx-origin). This work highlights the impact of variation in normative developmental changes in familism values on adjustment among Latinx adolescents in an emerging immigrant community context.

Published
2023
Full Text
View/download PDF

26. Ligand recognition and G-protein coupling of trace amine receptor TAAR1

Author

Xu, Zheng, Guo, Lulu, Yu, Jingjing, Shen, Siyuan, Wu, Chao, Zhang, Weifeng, Zhao, Chang, Deng, Yue, Tian, Xiaowen, Feng, Yuying, Hou, Hanlin, Su, Lantian, Wang, Hongshuang, Guo, Shuo, Wang, Heli, Wang, Kexin, Chen, Peipei, Zhao, Jie, Zhang, Xiaoyu, Yong, Xihao, Cheng, Lin, Liu, Lunxu, Yang, Shengyong, Yang, Fan, Wang, Xiaohui, Yu, Xiao, Xu, Yunfei, Sun, Jin-Peng, Yan, Wei, and Shao, Zhenhua

Published
2023
Full Text
View/download PDF

39. An Alternative Approach for Computing Discrete Logarithms in Compressed SIDH

Author

Lin, Kaizhan, Wang, Weize, Wang, Lin, and Zhao, Chang-An

Subjects
Computer Science - Cryptography and Security
Abstract

Currently, public-key compression of supersingular isogeny Diffie-Hellman (SIDH) and its variant, supersingular isogeny key encapsulation (SIKE) involve pairing computation and discrete logarithm computation. In this paper, we propose novel methods to compute only 3 discrete logarithms instead of 4, in exchange for computing a lookup table efficiently. The algorithms also allow us to make a trade-off between memory and efficiency. Our implementation shows that the efficiency of our algorithms is close to that of the previous work, and our algorithms perform better in some special cases., Comment: 20 pages

Published
2021

42. The Elliptic Net Algorithm Revisited

Author

Cai, Shiping, Hu, Zhi, Yao, Zheng-An, and Zhao, Chang-An

Subjects
Computer Science - Cryptography and Security, Mathematics - Algebraic Geometry, Mathematics - Number Theory
Abstract

Pairings have been widely used since their introduction to cryptography. They can be applied to identity-based encryption, tripartite Diffie-Hellman key agreement, blockchain and other cryptographic schemes. The Acceleration of pairing computations is crucial for these cryptographic schemes or protocols. In this paper, we will focus on the Elliptic Net algorithm which can compute pairings in polynomial time, but it requires more storage than Miller's algorithm. We use several methods to speed up the Elliptic Net algorithm. Firstly, we eliminate the inverse operation in the improved Elliptic Net algorithm. In some circumstance, this finding can achieve further improvements. Secondly, we apply lazy reduction technique to the Elliptic Net algorithm, which helps us achieve a faster implementation. Finally, we propose a new derivation of the formulas for the computation of the Optimal Ate pairing on the twisted curve. Results show that the Elliptic Net algorithm can be significantly accelerated especially on the twisted curve. The algorithm can be $80\%$ faster than the previous ones on the twisted 381-bit BLS12 curve and $71.5\%$ faster on the twisted 676-bit KSS18 curve respectively.

Published
2021

43. Orlicz hormonic Blaschke addition

Author

Zhao, Chang-Jian

Subjects
Mathematics - General Mathematics
Abstract

Recently, Gardner, Hug and Weil have introduced the Orlicz-Brunn-Minkowski theory: a general framework, additions, and inequalities. Following this, in the paper we consider Orlicz dual Brunn-Minkowski theory. We introduce Orlicz hormonic Blaschke addition which is an extension of the Lp hormonic Blaschke addition and L p radial Minkowski addition, respectively. Inequalities of dual Minkowski and Brunn-Minkowski type are obtained for the Orlicz hormonic Blaschke addition. The new Orlicz dual Brunn-Minkowski inequality implies the dual and L p -dual Brunn-Minkowski inequalities, respectively. New Orlicz dual Minkowski inequality implies the L p -dual Minkowski inequality. One of these has connections with the conjectured log-Brunn-Minkowski inequality of Lutwak, Yang, and Zhang, and in fact we show a log dual Minkowski inequality. Finally, we introduce the concept of Orlicz dual projection body and an inequality similar to Orlicz projection body is established.

Published
2021

Catalog

Books, media, physical & digital resources
See catalog results