Search Results

Documents authored by Chen, Hong

Found 3 Possible Name Variants:

Chen, Hong

Document
DOI: 10.4230/DagSemProc.08043.1
08043 Summary – Perspectives Workshop: Telecommunication Economics

Authors: Heikki Hammainen, Hong Chen, Aiko Pras, George Huitema, Martin Waldburger, David Hausheer, Panayotis Antoniadis, Peter Reichl, Jerzy Kubasik, and Burkhard Stiller

Published in: Dagstuhl Seminar Proceedings, Volume 8043, Perspectives Workshop: Telecommunication Economics (2008)

Abstract
The telecommunications sector and the Internet section of Internet Service Providers (ISP) have become a dynamic key area for the economic development of industrialized nations in the world. It is in constant evolution. Because of intense competition, telecommunications companies and ISPs are forced to diversify their offers and thus to propose an increasing number of services. However, economic analysis often ignores important technical aspects of telecommunications and is not aware of new developments. Engineering models often ignore economic factors. Thus, the design and deployment of future networks that incorporate new services are subject to uncertainties such as equipment and capacity prices (due to technological innovation), demand and supply for services (due to competition). Seeing leading researchers bringing together with various backgrounds, all working on innovative aspects of technical, techno-economic, social, and regulatory issues, lead to the following four main areas that have been – partially – tackled in an integrated manner: - Architectural side, - Social side, - Economic and business side, and - Regulatory side.
Cite as

Heikki Hammainen, Hong Chen, Aiko Pras, George Huitema, Martin Waldburger, David Hausheer, Panayotis Antoniadis, Peter Reichl, Jerzy Kubasik, and Burkhard Stiller. 08043 Summary – Perspectives Workshop: Telecommunication Economics. In Perspectives Workshop: Telecommunication Economics. Dagstuhl Seminar Proceedings, Volume 8043, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{hammainen_et_al:DagSemProc.08043.1,
  author =	{Hammainen, Heikki and Chen, Hong and Pras, Aiko and Huitema, George and Waldburger, Martin and Hausheer, David and Antoniadis, Panayotis and Reichl, Peter and Kubasik, Jerzy and Stiller, Burkhard},
  title =	{{08043 Summary – Perspectives Workshop: Telecommunication Economics}},
  booktitle =	{Perspectives Workshop: Telecommunication Economics},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8043},
  editor =	{Burkhard Stiller},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08043.1},
  URN =		{urn:nbn:de:0030-drops-14900},
  doi =		{10.4230/DagSemProc.08043.1},
  annote =	{Keywords: Telecommunication and Internet Services, Tariffing and Pricing, Personalization, Incentives, Value Chain, Accounting, Contracts and Legal Domains, Quality-of-Experience, Dynamic Business, and Competition}
}

Chen, Xiaohong

Document
Invited Paper
DOI: 10.4230/LIPIcs.CALCO.2019.1
Matching mu-Logic: Foundation of K Framework (Invited Paper)

Authors: Xiaohong Chen and Grigore Roşu

Published in: LIPIcs, Volume 139, 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)

Abstract
K framework is an effort in realizing the ideal language framework where programming languages must have formal semantics and all languages tools are automatically generated from the formal semantics in a correct-by-construction manner at no additional costs. In this extended abstract, we present matching mu-logic as the foundation of K and discuss some of its applications in defining constructors, transition systems, modal mu-logic and temporal logic variants, and reachability logic.
Cite as

Xiaohong Chen and Grigore Roşu. Matching mu-Logic: Foundation of K Framework (Invited Paper). In 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 139, pp. 1:1-1:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{chen_et_al:LIPIcs.CALCO.2019.1,
  author =	{Chen, Xiaohong and Ro\c{s}u, Grigore},
  title =	{{Matching mu-Logic: Foundation of K Framework}},
  booktitle =	{8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)},
  pages =	{1:1--1:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-120-7},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{139},
  editor =	{Roggenbach, Markus and Sokolova, Ana},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2019.1},
  URN =		{urn:nbn:de:0030-drops-114296},
  doi =		{10.4230/LIPIcs.CALCO.2019.1},
  annote =	{Keywords: Matching mu-logic, Program verification, Reachability logic}
}

Chen, Zhi-Zhong

Document
DOI: 10.4230/LIPIcs.WABI.2019.5
Better Practical Algorithms for rSPR Distance and Hybridization Number

Authors: Kohei Yamada, Zhi-Zhong Chen, and Lusheng Wang

Published in: LIPIcs, Volume 143, 19th International Workshop on Algorithms in Bioinformatics (WABI 2019)

Abstract
The problem of computing the rSPR distance of two phylogenetic trees (denoted by RDC) is NP-hard and so is the problem of computing the hybridization number of two phylogenetic trees (denoted by HNC). Since they are important problems in phylogenetics, they have been studied extensively in the literature. Indeed, quite a number of exact or approximation algorithms have been designed and implemented for them. In this paper, we design and implement one exact algorithm for HNC and several approximation algorithms for RDC and HNC. Our experimental results show that the resulting exact program is much faster (namely, more than 80 times faster for the easiest dataset used in the experiments) than the previous best and its superiority in speed becomes even more significant for more difficult instances. Moreover, the resulting approximation programs output much better results than the previous bests; indeed, the outputs are always nearly optimal and often optimal. Of particular interest is the usage of the Monte Carlo tree search (MCTS) method in the design of our approximation algorithms. Our experimental results show that with MCTS, we can often solve HNC exactly within short time.
Cite as

Kohei Yamada, Zhi-Zhong Chen, and Lusheng Wang. Better Practical Algorithms for rSPR Distance and Hybridization Number. In 19th International Workshop on Algorithms in Bioinformatics (WABI 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 143, pp. 5:1-5:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{yamada_et_al:LIPIcs.WABI.2019.5,
  author =	{Yamada, Kohei and Chen, Zhi-Zhong and Wang, Lusheng},
  title =	{{Better Practical Algorithms for rSPR Distance and Hybridization Number}},
  booktitle =	{19th International Workshop on Algorithms in Bioinformatics (WABI 2019)},
  pages =	{5:1--5:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-123-8},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{143},
  editor =	{Huber, Katharina T. and Gusfield, Dan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2019.5},
  URN =		{urn:nbn:de:0030-drops-110355},
  doi =		{10.4230/LIPIcs.WABI.2019.5},
  annote =	{Keywords: phylogenetic tree, fixed-parameter algorithms, approximation algorithms, Monte Carlo tree search}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact