Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States

We proposed novel schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed scheme. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.Comment: 10 pages, 1 figure;v2. discussions improve

Monitoring development control in Hong Kong a probit analysis of planning application for change in use and development in industrial zones /

Thesis (B.Sc)--University of Hong Kong, 2006.published_or_final_versio

An Economy-wide Analysis of Impacts of WTO Tiered Formula for Tariff Reduction on Taiwan

In this study we use Taiwan as a case study to provide an economy-wide analysis of impacts on Taiwan of WTO tariff reduction schemes with different combinations of thresholds and reduction rates. The model we utilized in this study is Taiwan General Equilibrium Model with a WTO module (TAIGEM-WTO, hereafter) that is a multi-sectoral computable general equilibrium (CGE) model of the Taiwan's economy derived from Australian ORANI model (Dixon, Parmenter, Sutton and Vincent, 1982). Simulation results show that results are more sensitive to the scheme of tariff-reduction (i.e., Category 1, 2, and 3) than the tiered levels (i.e., A, B, C, and D) and as a strategy we should pay more attention to the arguments related to the amounts of tariff-reduction. Moreover, changes in nominal average tariff rates are more sensitive and shocks to the economy are more severe when we change the tariff reduction categories rather than the tiered levels. This conclusion also applies to the tiered reduction case when only sensitive products are considered. Finally, simulations with sector's bound rate calculated using arithmetic means have bigger effects than those using import values as weights. Therefore, sector's bound rate using import values as weights would be preferred.International Relations/Trade,

Privacy Perils of Open Data and Data Sharing: A Case Study of Taiwan\u27s Open Data Policy and Practices

Governments and private sector players have hopped on the open data train in the past few years. Both the governments and civil society in Taiwan are exploring the opportunities provided by the data stored in public and private sectors. While they have been enjoying the benefits of the sharing and flowing of data among various databases, the government and some players in the private sectors have also posed tremendous privacy challenges by inappropriately gathering and processing personal data. The amended Personal Data Protection Act was originally enacted as a regulatory mechanism to protect personal data and create economic benefits via enhancing the uses of public and private sector data. In reality, the Act has instead resulted in harm to Taiwan’s data privacy situation in this big data era. This article begins with an overview of the Taiwan’s open data policy history and its current practices. Next, the article analyzes cases in which the data sharing practices between different sectors have given rise to privacy controversies, with a particular focus on 2020, when Taiwan used data surveillance in response to the COVID-19 pandemic. Finally, this article flags problems related to an open data system, including the protection of sensitive data, de-identification, the right to consent and opt-out, and the ambiguity of “public interest,” and concludes by proposing a feasible architecture for the implementation of a more sensible open data system with privacy-enhancing characteristics

Modeling and Algorithm for Multiple Spanning Tree Provisioning in Resilient and Load Balanced Ethernet Networks

We propose a multitree based fast failover scheme for Ethernet networks. In our system, only few spanning trees are used to carry working traffic in the normal state. As a failure happens, the nodes adjacent to the failure redirect traffic to the preplanned backup VLAN trees to realize fast failure recovery. In the proposed scheme, a new leaf constraint is enforced on the backup trees. It enables the network being able to provide 100% survivability against any single link and any single node failure. Besides fast failover, we also take load balancing into consideration. We model an Ethernet network as a twolayered graph and propose an Integer Linear Programming (ILP) formulation for the problem. We further propose a heuristic algorithm to provide solutions to large networks. The simulation results show that the proposed scheme can achieve high survivability while maintaining load balancing at the same time. In addition, we have implemented the proposed scheme in an FPGA system. The experimental results show that it takes only few μsec to recover a network failure. This is far beyond the 50 msec requirement used in telecommunication networks for network protection