Suzhou Institute for Advanced Study

Suzhou, China

Suzhou Institute for Advanced Study

Suzhou, China
SEARCH FILTERS
Time filter
Source Type

Shi R.-H.,NHPCC | Shi R.-H.,Anhui Science and Technology University | Huang L.-S.,NHPCC | Huang L.-S.,Suzhou Institute for Advanced Study | And 3 more authors.
Quantum Information Processing | Year: 2011

We present a scheme for asymmetric multi-party quantum state sharing of an arbitrary m-qubit state with n agents. The sender Alice first shares m - 1 Bell states and one n + 1-particle Greenberger-Horne-Zeilinger state with n agents, where the agent Bob, who is designated to recover the original m-qubit state, just keeps m particles and other agents (all controllers) n - 1 particles, that is, each controller only holds one particle in hand. Subsequently, Alice performs m Bell-basis measurements on her 2m particles and each controller only need take a single-particle measurement on his particle with the basis X. Finally, Bob can recover the original m-qubit state with the corresponding local unitary operations according to Alice and all controllers' measurement results. Its intrinsic efficiency for qubits approaches 100%, and the total efficiency really approaches the maximal value, which is higher than those of the known symmetric schemes. © 2010 Springer Science+Business Media, LLC.


Shi R.-H.,NHPCC | Shi R.-H.,Anhui Science and Technology University | Huang L.-S.,NHPCC | Huang L.-S.,Suzhou Institute for Advanced Study | And 3 more authors.
Quantum Information Processing | Year: 2011

We present a newscheme for sharing an arbitrary two-qubit quantum state with n agents our scheme, the sender Alice first shares n Einsein-Podolsky-Rosen (EPR) pairs in Bell states with n agents. After setting up the secure quantum channel, Alice first applies (n ?2) Controlled-Not (CNOT) gate operations, and then performs two Bell-state measurements and (n ? 2) single-particle measurements (n <2) addition, all controllers only hold one particle in their hands, respectively, and thus they only need to perform a single-particle measurement on the respective particle with the basis {|0}, |1}}. Compared with other schemes with Bell states, our scheme needs less qubits as the quantum resources and exchanges less classical information, and thus obtains higher total efficiency. © Springer Science+Business Media, LLC 2010.


Shi R.-H.,NHPCC | Shi R.-H.,Anhui Science and Technology University | Huang L.-S.,NHPCC | Huang L.-S.,Suzhou Institute for Advanced Study | And 3 more authors.
Optics Communications | Year: 2010

We present an efficient scheme for sharing an arbitrary two-qubit quantum state with n agents. In this scheme, the sender Alice first prepares an n+2-particle GHZ state and introduces a Controlled-Not (CNOT) gate operation. Then, she utilizes the n+2-particle entangled state as the quantum resource. After setting up the quantum channel, she performs one Bell-state measurement and another single-particle measurement, rather than two Bell-state measurements. In addition, except that the designated recover of the quantum secret just keeps two particles, almost all agents only hold one particle in their hands respectively, and thus they only need to perform a single-particle measurement on the respective particle with the basis X. Compared with other schemes based on entanglement swapping, our scheme needs less qubits as the quantum resources and exchanges less classical information, and thus obtains higher communication efficiency. © 2010 Elsevier B.V. All rights reserved.


Shi R.-h.,NHPCC | Shi R.-h.,Anhui Science and Technology University | Huang L.-s.,NHPCC | Huang L.-s.,Suzhou Institute for Advanced Study | And 3 more authors.
Optics Communications | Year: 2010

We present a multiparty quantum secret sharing scheme and analyze its security. In this scheme, the sender Alice takes EPR pairs in Bell states as quantum resources. In order to obtain the shared key, all participants only need to perform Bell measurements, not to perform any local unitary operation. The total efficiency in this scheme approaches 100% as the classical information exchanged is not necessary except for the eavesdropping checks. © 2010 Elsevier B.V. All rights reserved.


Tai Q.,Anhui University of Science and Technology | Tai Q.,Suzhou Institute for Advanced Study | Chen L.,Anhui University of Science and Technology | Song L.,Anhui University of Science and Technology | And 5 more authors.
Polymer Degradation and Stability | Year: 2010

A monomer, acryloxyethyl phenoxy phosphorodiethyl amidate (AEPPA), was synthesized and characterized using Fourier transform infrared (FTIR), 1H nuclear magnetic resonance spectroscopy (1H NMR) and 31P NMR. The copolymer with various amounts of styrene (St) was obtained by the free radical bulk polymerization between AEPPA and St, and characterized using 1H NMR. The thermal properties of the copolymers were investigated with thermogravimetric analysis (TGA) in air and nitrogen atmosphere, and differential scanning calorimetry (DSC). The TGA results in air indicated the copolymers with AEPPA show higher thermal stability than those without AEPPA. However, the TGA results in nitrogen showed that the decomposition temperature decreased and the char residue increased with the increase of AEPPA. The glass transition temperature (Tg) of the copolymers from DSC indicated that a inverse proportion was observed between Tg and the amount of AEPPA incorporated. The flammability of the copolymers was evaluated by microscale combustion calorimeter (MCC). The MCC results showed that AEPPA can decrease the peak heat release rate (PHRR) and the heat release capacity (HRC), and the sample CP10 shows the lowest PHRR and HRC. © 2010 Elsevier Ltd. All rights reserved.


Zhu C.,Suzhou Institute for Advanced Study | Wu G.,Suzhou Institute for Advanced Study
Proceedings - 3rd International Conference on Multimedia Information Networking and Security, MINES 2011 | Year: 2011

Search engine optimization (SEO) is a process of improving the prominence of a website. Following a reverse engineering approach, in this paper, we study and analyze the key influence factors in the process of web search. We firstly build a system to automatically crawl all factors of 200 thousand web pages. Then we make a content analysis including Page Rank, URL and HTML analysis based on top 20 positions of Google search result pages. Finally we derive top five factors for search engine optimization. It turns out that although SEO factors vary for different websites, the core SEO factors are similar. Therefore, in the common SEO, it is enough to focus on these core factors. © 2011 IEEE.


Liu H.,Suzhou Institute for Advanced Study | Liu H.,Anhui University of Science and Technology | Liu J.,CAS Suzhou Institute of Nano Technology and Nano Bionics
RSC Advances | Year: 2016

Hollow mesoporous Gd2O3:Eu3+ nanospheres were successfully synthesized by using carboxyl-capped polystyrene (CCPS) nanospheres as sacrificed templates, which turn out to be ideal templates to fabricate Gd2O3:Eu3+ nanospheres due to the carboxyl of polystyrene being affined to REE (rare earth element). The X-ray diffraction (XRD), Fourier transform infrared (FT-IR), transmission electron microscopy (TEM), thermogravimetric analysis (TGA), photoluminescence (PL), and UV-vis absorption spectral were used to characterize as-obtained products. The mesoporous structure is revealed by TEM images as well as N2 adsorption-desorption isotherm. The samples are composed of hollow mesoporous Gd2O3:Eu3+ nanospheres with a mean particle size of about 276 nm. It is also found that hollow mesoporous Gd2O3:Eu3+ nanospheres exhibit strong red light emission under ultraviolet excitation. Significantly, the strongly luminescent property of the hollow mesoporous spheres could be better tracked as drug delivery host carriers, the IBU-Gd2O3 systems displayed a fast release in the initial 10 h, and a sustained release property with durable release rate. © 2016 The Royal Society of Chemistry.


Liu S.,Anhui University of Science and Technology | Hua B.,Suzhou Institute for Advanced Study
Proceedings - Conference on Local Computer Networks, LCN | Year: 2014

Network coding is a transmission mechanism for improving the capacity of multicast applications. Practical problems arise when applying network coding in traditional wired networks: multipath multicast routing, backward compatibility with deployed base, and adding new functions in commercial routers. SDN network naturally solves these problems via logically centralized control plane and open APIs of Openflow switches. This paper proposes NCoS, a framework for realizing network coding over SDN networks. It gives a brief introduction on how to extend Openflow protocol to include new actions, and add network coding related functions in controller and switches. © 2014 IEEE.


Zu Y.,Hefei University of Technology | Hua B.,Suzhou Institute for Advanced Study
Journal of Computational Information Systems | Year: 2015

The need for data compression has grown in the big data era for better utilization of network bandwidth and efficient data storage. The Deflate compression algorithm, made up of two main stages-LZSS compression and Huffman coding, is the most widely used data compression program. However, due to high computational overhead, data compression is seldom used in high-speed applications. In this paper, we focus on parallelizing Deflate algorithm on GPU with the NVIDIA CUDA framework to improve compression speed. In parallelizing LZSS, we redesign the dictionary to accelerate the locating of duplicate substring, and eliminate path divergence to accelerate the match of duplicate substring. In parallelizing Huffman coding, we utilize high efficient data structures and algorithms to optimize Huffman tree construction and variable-length encoding. As the first work on parallelizing Deflate algorithm on GPU, we compare our GPU-based Deflate with CPU-based GZIP, the most popular Deflate-based implementation. Experiments on an NVIDIA GTX 590 machine with 13 benchmark files from real world demonstrate the effectiveness of our method. © 2015, by Binary Information Press


He L.-B.,NHPCC | Huang L.-S.,Suzhou Institute for Advanced Study | Yang W.,Suzhou Institute for Advanced Study | Xu R.,Suzhou Institute for Advanced Study | Han D.-Q.,Suzhou Institute for Advanced Study
Quantum Information Processing | Year: 2012

We investigate the quantum sealed-bid auction protocol proposed by Zhao et al. (Opt Commun 283:1394, 2010). It uses M groups n-particle GHZ states to represent bids and a post-confirmation mechanism to guarantee the honesty of the quantum sealed-bid auction. However, in our opinion the protocol still does not complete the task of a sealed-bid auction fairly. It is shown that a large group of dishonest bidders can collude to obtain all the other one's secret bids before the opening phase of the auction with a probability polynomially close to one. Moreover, a simple feasible improvement of the protocol is proposed. © Springer Science+Business Media, LLC 2011.

Loading Suzhou Institute for Advanced Study collaborators
Loading Suzhou Institute for Advanced Study collaborators