构建人性化的步行空间——重庆城市建设的可持续发展设计

20世纪60年代关注步行道设计的开端是源自于对于城市规划的反思,城市污染严重、环境不断遭受挑战,设计可持续发展的城市环境已经迫在眉睫,步行道是人类最为本能的行为之一,城市步行道的建立要从生理与心理两方面入手,山地城市步行道建设要注重人文关怀,重庆的山地城市风貌有利于建立立体化的步行道,使步行道成为山地城市景观的重要部分,关注重庆的步行道设计使城市充满活力,重庆的未来将是活力之都、宜居之城。     

Ring signature scheme based on multivariate public key cryptosystems

The ring signature scheme is an important cryptographic primitive that enables a user to sign a message on behalf of a group in authentic and anonymous way, i.e. the recipient of the message is convinced that the message is valid and it comes from one of the group members, but does not know who the actual signer is. Currently, all the existing ring signatures are based on traditional cryptosystems. However, the rapid advances in the field of quantum computing indicate a growing threat to traditional cryptosystems. Multivariate public key cryptosystems (MPKCs) is one of the promising alternatives which may resist future quantum computing attacks. In this work, we propose a novel ring signature scheme based on multivariate polynomials with the security model for the first time. Our ring signature scheme has a great advantage in efficiency compared to many existing ring signature schemes, and currently it seems to be immune to quantum computing attacks.     

A photoluminescence-based quantum semiconductor biosensor for rapid in situ detection of Escherichia coli

This work describes a novel method of detecting Escherichia coli using photoluminescence (PL) emission from III–V quantum semiconductor (QS) devices functionalized with two different antibody-based architectures. The first approach employed self-assembled monolayers of biotinylated polyethylene glycol thiols to immobilize biotinylated antibody via neutravidin. In the second approach, we used QS microstructures coated with a thin layer of Si₃N₄ allowing direct functionalization with E. coli antibodies through hydrofluoric acid etching and glutaraldehyde-based reticulation. Atomic force, optical and fluorescence microscopy measurements were used to assess the immobilization process. Depending on the biosensing architecture, density of the immobilized bacteria was observed in the range of 0.5–0.7 bacteria/100 μm². The detection of E. coli at 10⁴ CFU/ml was achieved within less than 120 min of the bacteria exposure. It is expected that an even better sensitivity threshold could be achieved following further optimization of the method.     

Synthesis of quantum size ZnO crystals and their gas sensing properties for NO2

Quantum size ZnO crystals have been synthesized successfully by a room temperature sol-gel process. Oleic acid (OA) has been used as capping agent to control the particle size of ZnO. The crystal structure and size of the ZnO are characterized by the X-ray diffraction (XRD) and transmission electron microscope (TEM). The XRD results show the as-synthesized ZnO has hexagonal wurtzite structure and the average crystallite size is 5.7 nm which is little less than TEM result. It is testified by photoluminescence (PL) and Raman spectra that the quantum size ZnO keeps the crystal structure of the bulk ZnO and possesses more surface defects. The quantum size ZnO has the highest response of 280 to NO₂ and the highest selectivity of 31 and 49 corresponding to CO and CH₄ at operating temperature of 290 °C. The effect of calcination temperatures on sensing property and transient response of the ZnO sensor are also investigated.     

On a class of languages recognizable by probabilistic reversible decide-and-halt automata

We analyze the properties of probabilistic reversible decide-and-halt automata (DH-PRA) and show that there is a strong relationship between DH-PRA and 1-way quantum automata. We show that a general class of regular languages is not recognizable by DH-PRA by proving that two “forbidden” constructions in minimal deterministic automata correspond to languages not recognizable by DH-PRA. The shown class is identical to a class known to be not recognizable by 1-way quantum automata. We also prove that the class of languages recognizable by DH-PRA is not closed under union and other non-trivial Boolean operations.     

A comparative runtime analysis of heuristic algorithms for satisfiability problems

The satisfiability problem is a basic core NP-complete problem. In recent years, a lot of heuristic algorithms have been developed to solve this problem, and many experiments have evaluated and compared the performance of different heuristic algorithms. However, rigorous theoretical analysis and comparison are rare. This paper analyzes and compares the expected runtime of three basic heuristic algorithms: RandomWalk, (1+1) EA, and hybrid algorithm. The runtime analysis of these heuristic algorithms on two 2-SAT instances shows that the expected runtime of these heuristic algorithms can be exponential time or polynomial time. Furthermore, these heuristic algorithms have their own advantages and disadvantages in solving different SAT instances. It also demonstrates that the expected runtime upper bound of RandomWalk on arbitrary k-SAT (k?3) is O(n(k−1)), and presents a k-SAT instance that has Θ(n(k−1)) expected runtime bound.     

Analysis and synthesis of attractive quantum Markovian dynamics

We propose a general framework for investigating a large class of stabilization problems in Markovian quantum systems. Building on the notions of invariant and attractive quantum subsystem, we characterize attractive subspaces by exploring the structure of the invariant sets for the dynamics. Our general analysis results are exploited to assess the ability of open-loop Hamiltonian and output-feedback control strategies to synthesize Markovian generators which stabilize a target subsystem, subspace, or pure state. In particular, we provide an algebraic characterization of the manifold of stabilizable pure states in arbitrary finite-dimensional Markovian systems, that leads to a constructive strategy for designing the relevant controllers. Implications for stabilization of entangled pure states are addressed by example.     

The quantum query complexity of the determinant

In this paper we give tight quantum query complexity bounds of some important linear algebra problems. We prove Θ(n²) quantum query bounds for verify the determinant, rank, matrix inverse and the matrix power problem.