Search

Your search keyword '"Wu Chunjiang"' showing total 33 results
Start Over Author "Wu Chunjiang"
33 results on '"Wu Chunjiang"'

10. A New k-Graph Partition Algorithm for Distributed P2P Simulation Systems

Author

Wu, Chunjiang, Zhou, Shijie, Wei, Linna, Luo, Jiaqing, Wang, Yanli, Yang, Xiaoqian, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Jin, Hai, editor, Rana, Omer F., editor, Pan, Yi, editor, and Prasanna, Viktor K., editor

Published
2007
Full Text
View/download PDF

13. Improving Laplace Mechanism of Differential Privacy by Personalized Sampling

Author

Shilin Qiu, Yongjian Liao, Wen Huang, Wu Chunjiang, Tianqing Zhu, and Shijie Zhou

Subjects
021110 strategic, defence & security studies, Information privacy, Laplace transform, Computer science, 0211 other engineering and technologies, Sampling (statistics), 020206 networking & telecommunications, Sample (statistics), 02 engineering and technology, computer.software_genre, Synthetic data, Term (time), Set (abstract data type), 0202 electrical engineering, electronic engineering, information engineering, Differential privacy, Data mining, computer
Abstract

The differential privacy is the state-of-the-art conception for privacy preservation due to its strong privacy guarantees, however it suffers from low accuracy. In this paper, we propose a personalized sample Laplace mechanism by combining the Laplace mechanism with sampling technology. In order to improve the accuracy, the proposed mechanism assigns personalized sampling probability to each record. Based on the personalized sampling probability, we prove that the proposed mechanism satisfies ε differential privacy. Then we compare the proposed mechanism with other mechanisms in term of the accuracy. Through extensive experiments on synthetic data set and real world data set, we demonstrate that the performance of proposed mechanism is better.

Published
2020
Full Text
View/download PDF

16. 基于薄膜铌酸锂光波导的平坦光频率梳的设计

Author

Wei Hang, Feng Su-Chun, Wu Chunjiang, Liu Yu, and Deng Yi

Subjects
chemistry.chemical_compound, Materials science, chemistry, business.industry, Lithium niobate, Optoelectronics, Optical frequency comb, Electrical and Electronic Engineering, business, Atomic and Molecular Physics, and Optics, Electronic, Optical and Magnetic Materials
Published
2021
Full Text
View/download PDF

23. Generation of High Repetition Rate Broadband Flat Coherent Optical Frequency Comb Based on Tantalum Pentoxide Integrated Nonlinear Optical Waveguide

Author

Wu Chunjiang and Feng Su-Chun

Subjects
Nonlinear optical, chemistry.chemical_compound, Materials science, chemistry, Repetition (rhetorical device), business.industry, Broadband, Tantalum pentoxide, Optoelectronics, Optical frequency comb, business, Waveguide (optics), Atomic and Molecular Physics, and Optics
Published
2019
Full Text
View/download PDF

25. Design, synthesis and biological evaluation of phenylpicolinamide sorafenib derivatives as antitumor agents.

Author

Wu, Chunjiang, Xu, Shan, Guo, Yuping, Wu, Jielian, Luo, Rong, Wang, Wenhui, Tu, Yuanbiao, Le Chen, Zhu, Wufu, and Zheng, Pengwu

Abstract

Two series of phenylpicolinamide sorafenib derivatives (14a–k, 15a–k) were designed and synthesized. They were evaluated for IC50 values against three cancer cell lines (A549, Hela, and MCF-7) and VEGFR2/KDR, BRAF, and CRAF kinases. Fourteen target compounds showed moderate to excellent cytotoxicity activity against the different cancer cells with potency from the single-digit μM to nanomole range. What’s more, six of them were equal to more potent than sorafenib against one or more cell lines. Most of the compounds showed bad activity against VEGFR2/KDR, BRAF, or CRAF kinases. The most promising compound 15f showed strong antitumor activities against A549 and MCF-7 cell lines with IC50 values of 5.43 ± 0.74 and 0.62 ± 0.21 μM, which were 1.29–6.79-fold more active than sorafenib (6.53 ± 0.82, 4.21 ± 0.62 μM), respectively and it exhibited moderate IC50 (7.1 μM) than 14f (IC50 = 3.1 μM). Structure–activity relationships (SARs) and docking studies indicated that replacement of diarylurea of sorafenib with phenylpicolinamide moiety benefits to the activity. The position of aryl group and the substitutions of aryl group have a great influence on antitumor activity and selectivity. Small volume groups of aryl group such as (substituted) alkyl groups (–CH3, –CF3), halogen atoms (–F) were favorable to the cytotoxicity. Exact action mechanism of target compounds is not quite clear and further study will be carried out to identify the target in near future. [ABSTRACT FROM AUTHOR]

Published
2018
Full Text
View/download PDF

27. Adaptive Flooding Routing Algorithm in Unstructured P2P

Author

Zhou Shijie, Luo Jia-Qing, Wu Chunjiang, Yang Xiao-qian, and Deng Yi-yi

Subjects
Computer science, business.industry, Distributed computing, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Routing algorithm, Peer-to-peer, computer.software_genre, Flooding (computer networking), law.invention, Relay, law, Peer to peer computing, business, computer, Computer network
Abstract

Flooding is widely used in unstructured Peer to Peer (P2P) systems, such as Gnutella. Although it is effective in content search, flooding among peers or super-peers causes large volume of unnecessary traffic. To address this problem, we propose an efficient and adaptive search mechanism, Adaptive Flooding Routing Algorithm (AFRA). AFRA provides the flexibility to adaptively adjust the number of relay neighbors and TTL value to meet different performance requirements. The effectiveness of AFRA is demonstrated through simulation studies. Primary experimental results show that our new AFRA solution reduces about 65% of the flooding messages while maintaining the acceptable high searching quality.

Published
2006
Full Text
View/download PDF

31. A New k-Graph Partition Algorithm for Distributed P2P Simulation Systems.

Author

Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Jin, Hai, Rana, Omer F., Pan, Yi, Prasanna, Viktor K., and Wu, Chunjiang

Abstract

While simulating a P2P system with distributed simulator, it generally requires that one single large network topology should be pre-divided into some small sub-nets, each of which denotes a group of peers in the P2P system. Because of interconnectivity of the simulated network, the sub-nets running on different simulation node must exchange message with each other to complete the simulation task. Based on the knowledge of degree sequence and breadth-first search, this paper proposes a novel approximate algorithm of k-graph partition. By this optimized algorithm, a large P2P network topology can be divided into k sub-nets while not only the traffic among different sub-net is minimized, but also the tasks of simulation are balanced. Through the analysis of time complexity, load balance and edge-cut experimental results for different network topology, it shows our algorithm is a feasible method applied for distributed P2P simulation systems. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results