Chen, Yang

[["dc.bibliographiccitation.firstpage","481"],["dc.bibliographiccitation.issue","5"],["dc.bibliographiccitation.journal","Scandinavian Journal of Immunology"],["dc.bibliographiccitation.lastpage","486"],["dc.bibliographiccitation.volume","49"],["dc.contributor.author","Schmidt, H."],["dc.contributor.author","Stuertz, K."],["dc.contributor.author","Brück, W."],["dc.contributor.author","Chen, V."],["dc.contributor.author","Stringaris, A. K."],["dc.contributor.author","Fischer, F. R."],["dc.contributor.author","Nau, R."],["dc.date.accessioned","2021-12-08T12:27:34Z"],["dc.date.available","2021-12-08T12:27:34Z"],["dc.date.issued","1999"],["dc.identifier.doi","10.1046/j.1365-3083.1999.00518.x"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/95387"],["dc.language.iso","en"],["dc.notes.intern","DOI-Import GROB-476"],["dc.relation.eissn","1365-3083"],["dc.relation.issn","0300-9475"],["dc.rights.uri","http://doi.wiley.com/10.1002/tdm_license_1.1"],["dc.title","Intravenous Granulocyte Colony-Stimulating Factor Increases the Release of Tumour Necrosis Factor and Interleukin-1beta into the Cerebrospinal Fluid, But Does Not Inhibit the Growth of Streptococcus pneumoniae in Experimental Meningitis"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","818"],["dc.bibliographiccitation.issue","8"],["dc.bibliographiccitation.journal","Cancer Cell"],["dc.bibliographiccitation.lastpage","834.e9"],["dc.bibliographiccitation.volume","40"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Yang, Sujuan"],["dc.contributor.author","Tavormina, Jena"],["dc.contributor.author","Tampe, Desiree"],["dc.contributor.author","Zeisberg, Michael"],["dc.contributor.author","Wang, Huamin"],["dc.contributor.author","Mahadevan, Krishnan K."],["dc.contributor.author","Wu, Chang-Jiun"],["dc.contributor.author","Sugimoto, Hikaru"],["dc.contributor.author","Chang, Chia-Chi"],["dc.contributor.author","Kalluri, Raghu"],["dc.date.accessioned","2022-09-01T09:49:30Z"],["dc.date.available","2022-09-01T09:49:30Z"],["dc.date.issued","2022"],["dc.identifier.doi","10.1016/j.ccell.2022.06.011"],["dc.identifier.pii","S1535610822002756"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/113442"],["dc.language.iso","en"],["dc.notes.intern","DOI-Import GROB-597"],["dc.relation.issn","1535-6108"],["dc.rights.uri","https://www.elsevier.com/tdm/userlicense/1.0/"],["dc.title","Oncogenic collagen I homotrimers from cancer cells bind to α3β1 integrin and impact tumor microbiome and immunity to promote pancreatic cancer"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","1"],["dc.bibliographiccitation.lastpage","6"],["dc.contributor.author","Fu, Xiaoming"],["dc.contributor.author","Zhu, Yibo"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Zhang, Zengbin"],["dc.contributor.author","Li, Dan"],["dc.contributor.author","Deng, Beixing"],["dc.contributor.author","Li, Xing"],["dc.date.accessioned","2018-05-09T13:56:04Z"],["dc.date.available","2018-05-09T13:56:04Z"],["dc.date.issued","2010"],["dc.description.abstract","Network Coordinate (NC) systems are efficient in scalable Internet latency estimation. While most of the focus has been put on how to distort Triangle Inequality Violation (TIV) in metric spaces to relieve the inaccuracy caused by it, TIV is a persistently and widely existing phenomenon on the Internet and thus should be embraced by future NC systems rather than being eliminated. Besides high accuracy, such an NC system can also provide the benefit of reducing the data transmission time by use of proper relay routes. With that in mind, we design an NC system with a hierarchical architecture, which is motivated by the natural idea of partitioning the three TIV links into different autonomous NC systems, in order to make as many as TIVs inherently embeddable in metric space. We implement and deploy our work, named Toread, on real Internet. Evaluation results show that Toread's metric space can well characterize more than 60% TIVs, thus Toread is highly accurate (0.54 in Toread versus 1.06 in Pyxida at 90th percentile Relative Error) and effective in searching detour paths (succeeds in 58.2% cases)."],["dc.identifier.doi","10.1145/1921233.1921242"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/14651"],["dc.language.iso","en"],["dc.notes.status","final"],["dc.relation.eventend","2010-11-30"],["dc.relation.eventlocation","Philadelphia, Pennsylvania"],["dc.relation.eventstart","2010-11-30"],["dc.relation.isbn","978-1-4503-0469-6"],["dc.relation.ispartof","ReARCH '10 Proceedings of the Re-Architecting the Internet Workshop"],["dc.title","Taming the Triangle Inequality Violations with Network Coordinate System on Real Internet"],["dc.type","conference_paper"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","37"],["dc.bibliographiccitation.journal","Journal of Rural Studies"],["dc.bibliographiccitation.lastpage","53"],["dc.bibliographiccitation.volume","94"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Herrera, Rafael Alcalá"],["dc.contributor.author","Benitez, Emilio"],["dc.contributor.author","Hoffmann, Christoph"],["dc.contributor.author","Möth, Stefan"],["dc.contributor.author","Paredes, Daniel"],["dc.contributor.author","Plaas, Elke"],["dc.contributor.author","Popescu, Daniela"],["dc.contributor.author","Rascher, Silke"],["dc.contributor.author","Rusch, Adrien"],["dc.contributor.author","Schwarz, Nina"],["dc.date.accessioned","2022-07-01T07:35:51Z"],["dc.date.available","2022-07-01T07:35:51Z"],["dc.date.issued","2022"],["dc.identifier.doi","10.1016/j.jrurstud.2022.05.021"],["dc.identifier.pii","S0743016722001255"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/112279"],["dc.language.iso","en"],["dc.notes.intern","DOI-Import GROB-581"],["dc.relation.issn","0743-0167"],["dc.rights.uri","https://www.elsevier.com/tdm/userlicense/1.0/"],["dc.title","Winegrowers’ decision-making: A pan-European perspective on pesticide use and inter-row management"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]

[["dc.contributor.author","Xu, Tianyin"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Jiao, Lei"],["dc.contributor.author","Zhao, Ben Y."],["dc.contributor.author","Hui, Pan"],["dc.contributor.author","Fu, Xiaoming"],["dc.date.accessioned","2018-05-07T11:05:48Z"],["dc.date.available","2018-05-07T11:05:48Z"],["dc.date.issued","2011"],["dc.description.abstract","Today’s microblogging services such as Twitter have long outgrown their initial designs as SMS-based social networks. Instead, a massive and steadily-growing user population of more than 100 million is using Twitter for everything from capturing the mood of the country to detecting earthquakes and Internet service failures. It is unsurprising that the traditional centralized client-server architecture has not scaled with user demands, leading to server overload and significant impairment of availability. In this paper, we argue that the divergence in usage models of microblogging services can be best addressed using complementary mechanisms, one that provides reliable messages between friends, and another that delivers events from popular celebrities and media outlets to their thousands or even millions of followers. We present Cuckoo, a new microblogging system that offloads processing and bandwidth costs away from a small centralized server base while ensuring reliable message delivery. We use a 20-day Twitter availability measurement to guide our design, and trace-driven emulation of 30,000 Twitter users to evaluate our Cuckoo prototype. Compared to the centralized approach, Cuckoo achieves 30-50% server bandwidth savings and 50-60% CPU load reduction, while guaranteeing reliable message delivery."],["dc.identifier.doi","10.1007/978-3-642-25821-3_2"],["dc.identifier.isbn","978-3-642-25820-6"],["dc.identifier.isbn","978-3-642-25821-3"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/14614"],["dc.language.iso","en"],["dc.notes.status","final"],["dc.relation.conference","International Middleware Conference"],["dc.relation.date","2011-12"],["dc.relation.eventlocation","Lisbon, Portugal"],["dc.title","Scaling Microblogging Services with Divergent Traffic Demands"],["dc.type","lecture"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","1"],["dc.bibliographiccitation.lastpage","8"],["dc.contributor.author","Fu, Xiaoming"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Sun, Peng"],["dc.contributor.author","Xu, Tianyin"],["dc.date.accessioned","2018-05-09T16:23:45Z"],["dc.date.available","2018-05-09T16:23:45Z"],["dc.date.issued","2010"],["dc.description.abstract","Network Coordinate (NC) systems provide a lightweight and useful way for scalable Internet distance prediction while serving as an important component in many Peer-to-Peer applications. Most of the existing NC systems utilize the Euclidean distance model, which is largely impaired by the persistent occurrence of Triangle Inequality Violation (TIV) in the Internet. Recently, matrix factorization (MF) based NC systems, which can completely remove the TIV constraint, provide an alternative approach towards better prediction accuracy. Phoenix, an NC system based on the MF model, well explores the advantage of the MF model and becomes the most accurate NC system so far. However, through experimental study, we find that the prediction accuracy of Phoenix for short links is significantly worse compared with the overall prediction accuracy. Based on the observation, we propose a new NC system, named Pancake, aiming at reducing the high prediction error for short links. By introducing a two-level architecture, Pancake achieves much higher prediction accuracy than other selected existing NC systems. Through extensive experiments, we demonstrate that Pancake reduces the 90th percentile relative error by up to 25.37% from Phoenix. Moreover, Pancake converges very fast and is robust to different dimension values. For further insights, we study the performance of Pancake using a dynamic data set in addition to the widely used aggregate data sets. With varying RTTs over time, Pancake outperforms other NC systems consistently."],["dc.identifier.doi","10.1109/ICCCN.2010.5560092"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/14656"],["dc.language.iso","en"],["dc.notes.status","final"],["dc.relation.conference","the 19th International Conference on Computer Communications"],["dc.relation.eventend","2010-08-05"],["dc.relation.eventlocation","Zürich, Switzerland"],["dc.relation.eventstart","2010-08-02"],["dc.relation.ispartof","2010 Proceedings of 19th International Conference on Computer Communications and Networks"],["dc.title","Improving Prediction Accuracy of Matrix Factorization Based Network Coordinate Systems"],["dc.type","conference_paper"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","334"],["dc.bibliographiccitation.issue","4"],["dc.bibliographiccitation.journal","IEEE Transactions on Network and Service Management"],["dc.bibliographiccitation.lastpage","347"],["dc.bibliographiccitation.volume","8"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Wang, Xiao"],["dc.contributor.author","Shi, Cong"],["dc.contributor.author","Lua, Eng Keong"],["dc.contributor.author","Fu, Xiaoming"],["dc.contributor.author","Deng, Beixing"],["dc.contributor.author","Li, Xing"],["dc.date.accessioned","2017-09-07T11:44:53Z"],["dc.date.available","2017-09-07T11:44:53Z"],["dc.date.issued","2011"],["dc.identifier.doi","10.1109/tnsm.2011.110911.100079"],["dc.identifier.gro","3149011"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/5652"],["dc.notes.intern","Fu Crossref Import"],["dc.notes.status","final"],["dc.notes.submitter","chake"],["dc.publisher","Institute of Electrical and Electronics Engineers (IEEE)"],["dc.relation.issn","1932-4537"],["dc.title","Phoenix: A Weight-Based Network Coordinate System Using Matrix Factorization"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dc.type.peerReviewed","no"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","346"],["dc.bibliographiccitation.journal","Neurocomputing"],["dc.bibliographiccitation.lastpage","355"],["dc.bibliographiccitation.volume","384"],["dc.contributor.author","Zhang, Jiulou"],["dc.contributor.author","Gu, Yunbo"],["dc.contributor.author","Tang, Hui"],["dc.contributor.author","Wang, Xiaoqing"],["dc.contributor.author","Kong, Youyong"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Shu, Huazhong"],["dc.contributor.author","Coatrieux, Jean-Louis"],["dc.date.accessioned","2021-04-14T08:26:49Z"],["dc.date.available","2021-04-14T08:26:49Z"],["dc.date.issued","2020"],["dc.identifier.doi","10.1016/j.neucom.2019.12.011"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/82089"],["dc.language.iso","en"],["dc.notes.intern","DOI Import GROB-399"],["dc.relation.issn","0925-2312"],["dc.title","Compressed sensing MR image reconstruction via a deep frequency-division network"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","406"],["dc.bibliographiccitation.issue","4"],["dc.bibliographiccitation.journal","ACM SIGCOMM Computer Communication Review"],["dc.bibliographiccitation.lastpage","407"],["dc.bibliographiccitation.volume","41"],["dc.contributor.author","Chen, Zhuo"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Ding, Cong"],["dc.contributor.author","Deng, Beixing"],["dc.contributor.author","Li, Xing"],["dc.date.accessioned","2018-11-07T08:53:51Z"],["dc.date.available","2018-11-07T08:53:51Z"],["dc.date.issued","2011"],["dc.description.abstract","Computing the shortest-path distances between nodes is a key problem in analyzing social graphs. Traditional methods like breadth-first search (BFS) do not scale well with graph size. Recently, a Graph Coordinate System, called Orion, has been proposed to estimate shortest-path distances in a scalable way. Orion uses a landmark-based approach, which does not take account of the shortest-path distances between non-landmark nodes in coordinate calculation. Such biased input for the coordinate system cannot characterize the graph structure well. In this paper, we propose Pomelo, which calculates the graph coordinates in a decentralized manner. Every node in Pomelo computes its shortest-path distances to both nearby neighbors and some random distant neighbors. By introducing the novel partial BFS, the computational overhead of Pomelo is tunable. Our experimental results from different representative social graphs show that Pomelo greatly outperforms Orion in estimation accuracy while maintaining the same computational overhead."],["dc.identifier.doi","10.1145/2043164.2018491"],["dc.identifier.isi","000302124800043"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/22528"],["dc.notes.status","zu prüfen"],["dc.notes.submitter","Najko"],["dc.publisher","Assoc Computing Machinery"],["dc.relation.issn","1943-5819"],["dc.relation.issn","0146-4833"],["dc.title","Pomelo: Accurate and Decentralized Shortest-path Distance Estimation in Social Graphs"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dc.type.peerReviewed","yes"],["dc.type.status","published"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.artnumber","1970046"],["dc.bibliographiccitation.issue","19"],["dc.bibliographiccitation.journal","Macromolecular Rapid Communications"],["dc.bibliographiccitation.volume","40"],["dc.contributor.author","Huang, Heqin"],["dc.contributor.author","Chen, Yang"],["dc.contributor.author","Wang, Xiaojie"],["dc.contributor.author","Rehfeldt, Florian"],["dc.contributor.author","Zhang, Kai"],["dc.date.accessioned","2020-04-27T08:52:14Z"],["dc.date.available","2020-04-27T08:52:14Z"],["dc.date.issued","2019"],["dc.description.abstract","Front Cover: Manipulation of water transportation within hydrogels is challenging. In article number 1900317, Kai Zhang and co‐workers construct a novel nanocomposite hydrogel with a dually electrostatically crosslinked network that shows thermoresponsive water transportation. The dense microstructure within the hydrogels delays water transportation and is favorable in preserving water. Interestingly, the water absorption, distribution, and dehydration processes can be continuously controlled by tuning the surrounding temperature."],["dc.identifier.doi","10.1002/marc.201970046"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/64357"],["dc.language.iso","en"],["dc.relation.eissn","1521-3927"],["dc.relation.issn","1022-1336"],["dc.title","Thermoresponsive Water Transportation in Dually Electrostatically Crosslinked Nanocomposite Hydrogels"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]