Drug policy history, design and practice: introduction

The history, policies and practice of drug control in Asia have been historically multifaceted, particularly concerning substances like opium, cannabis, and various indigenous psychoactive plants. The opium trade, notably in the 19th and early 20th centuries, significantly impacted Asian societies, triggering conflicts, influencing international relations, and altering the socio-economic fabric. Yet, the history of drug control across different parts of Asia reflects a complex interplay of factors and a stark regional diversity. This special issue serves as a platform for interdisciplinary studies that link Asian drug trafficking with collaborative legal responses across the region. The primary objective is to compile an overview of the history, current practices, and policies addressing drug production, trafficking, and usage in a continent that houses 60% of the global population. This is done by sampling articles that encompass the large geographical scope of Asia, from Northeast Asia to the Middle East. The special issue focuses on three key dimensions of drug control that affect Asian countries: Historical landmarks, including milestones of drug control policy developments at the national level, which shaped the international regime over the last two centuries; public health and history of local responses with the analysis of the burden of infectious diseases, and the state of access to controlled essential medicines; and, criminal justice and historical landmarks of its development through legal responses and punishments

A privacy-preserving fuzzy interest matching protocol for friends finding in social networks

Nowadays, it is very popular to make friends, share photographs, and exchange news throughout social networks. Social networks widely expand the area of people’s social connections and make communication much smoother than ever before. In a social network, there are many social groups established based on common interests among persons, such as learning group, family group, and reading group. People often describe their profiles when registering as a user in a social network. Then social networks can organize these users into groups of friends according to their profiles. However, an important issue must be considered, namely many users’ sensitive profiles could have been leaked out during this process. Therefore, it is reasonable to design a privacy-preserving friends-finding protocol in social network. Toward this goal, we design a fuzzy interest matching protocol based on private set intersection. Concretely, two candidate users can first organize their profiles into sets, then use Bloom filters to generate new data structures, and finally find the intersection sets to decide whether being friends or not in the social network. The protocol is shown to be secure in the malicious model and can be useful for practical purposes.Peer ReviewedPostprint (author's final draft

RESEARCH ON EFFICIENCY OF PRIMARY HEALTHCARE SERVICE OF SHANGHAI IN CHINA

Object: The article researches on efficiency of Shanghai Community Health Service (SCHS) and establishes production function of SCHS.Method: Establishing the production function of SCHS by Weighted Least Squares Estimation .Result: 1. Formulating the reasonable production function of SCHs based on Cobb: Douglas (C-D) function. 2. The article reveals SCHS production function with constant returns to scale.Conclusion: 1. Increasing human resource investment is a key factor for raising SCHS.2.Strenghten management and explore an efficient service model will improve SCHS level

More on complexity of operators in quantum field theory

Recently it has been shown that the complexity of SU($n$) operator is determined by the geodesic length in a bi-invariant Finsler geometry, which is constrained by some symmetries of quantum field theory. It is based on three axioms and one assumption regarding the complexity in continuous systems. By relaxing one axiom and an assumption, we find that the complexity formula is naturally generalized to the Schatten $p$-norm type. We also clarify the relation between our complexity and other works. First, we show that our results in a bi-invariant geometry are consistent with the ones in a right-invariant geometry such as $k$-local geometry. Here, a careful analysis of the sectional curvature is crucial. Second, we show that our complexity can concretely realize the conjectured pattern of the time-evolution of the complexity: the linear growth up to saturation time. The saturation time can be estimated by the relation between the topology and curvature of SU($n$) groups.Comment: Modified the Sec. 4.1, where we offered a powerful proof: if (1) the ket vector and bra vector in quantum mechanics contain same physics, or (2) adding divergent terms to a Lagrangian will not change underlying physics, then complexity in quantum mechanics must be bi-invariant

Principles and symmetries of complexity in quantum field theory

Based on general and minimal properties of the {\it discrete} circuit complexity, we define the complexity in {\it continuous} systems in a geometrical way. We first show that the Finsler metric naturally emerges in the geometry of the complexity in continuous systems. Due to fundamental symmetries of quantum field theories, the Finsler metric is more constrained and consequently, the complexity of SU($n$) operators is uniquely determined as a length of a geodesic in the Finsler geometry. Our Finsler metric is bi-invariant contrary to the right-invariance of discrete qubit systems. We clarify why the bi-invariance is relevant in quantum field theoretic systems. After comparing our results with discrete qubit systems we show most results in $k$-local right-invariant metric can also appear in our framework. Based on the bi-invariance of our formalism, we propose a new interpretation for the Schr\"{o}dinger's equation in isolated systems - the quantum state evolves by the process of minimizing "computational cost."Comment: Published version; added a short introduction on Finsler geometr