Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
home > search

Now showing items 49 - 64 of 569

  • Efficient Algorithms for Finding a Longest Common Increasing Subsequence

    Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye   Hong Zhu  

    We study the problem of finding a longest common increasing subsequence (LCIS) of multiple sequences of numbers. The LCIS problem is a fundamental issue in various application areas, including the whole genome alignment and pattern recognition. In this paper we give an efficient algorithm to find the LCIS of two sequences in O(min(r logℓ, nℓ + r)loglog n + n log n) time where n is the length of each sequence and r is the total number of ordered pairs of positions at which the two sequences match and ℓ is the length of the LCIS. For m sequences where m ≥ 3, we find the LCIS in O(min(mr 2,mr log ℓlog m r) + mnlog n) time where r is the total number of m-tuples of positions at which the m sequences match. The previous results find the LCIS of two sequences in O(n 2) and O(n ℓ log n) time. Our algorithm is faster when r is relatively small, e.g., for r < min(n 2/loglogn,nℓ).
    Download Collect
  • FEN1 promotes tumor progression and confers cisplatin resistance in non‐small‐cell lung cancer

    Lingfeng He   Libo Luo   Hong Zhu   Huan Yang   Yilan Zhang   Huan Wu   Hongfang Sun   Feng Jiang   Chandra S. Kathera   Lingjie Liu   Ziheng Zhuang   Haoyan Chen   Feiyan Pan   Zhigang Hu   Jing Zhang   Zhigang Guo  

    Download Collect
  • Methyl parathion increases neuronal activities in the rat locus coeruleus

    Hong Zhu   Wu Zhou   Xiao R. Li   Tangen Ma   Ing K. Ho   Robin W. Rockhold  

    Download Collect
  • Globalization and the production of city image in Guangzhou’s metro station advertisements

    Hong Zhu   Junxi Qian   Yun Gao  

    Download Collect
  • General Public Key m-Out-of-n Oblivious Transfer

    Zhide Chen   Hong Zhu  

    In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from the n messages, Alice cannot know which m messages Bob gets. In this paper, for the first time, we construct a m-out-of-n OT protocol based on the general secure public key system.
    Download Collect
  • Overexpression of programmed cell death 5 in a mouse model of ovalbumin-induced allergic asthma

    Xiaolin Diao   Juan Wang   Hong Zhu   Bei He  

    Download Collect
  • Fine-Grained Access Control for Database Management Systems

    Hong Zhu   Kevin Lü  

    A practical approach for developing fine-grained access control (FGAC) for database management systems is reported in this paper. We extend SQL language to support security policies. The concept of the policy type for databases is proposed. We implement the policy reuse through the use of policy types and policy instances to alleviate the administration workload of maintaining security policies. The policies for rows and columns can be expressed with policy types. Moreover, complicated database integrity constraints can also be expressed by policy types, and no further purpose-built programs are needed to create specific security control policies. We implement the fine-grained access control in a relational database management system DM5 [4]. The performance test results based on TPC-W are also presented.
    Download Collect
  • A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs

    Francis Y. L. Chin, Yong Zhang   Hong Zhu  

    In the frequency allocation problem, we are given a mobile telephone network, whose geographical coverage area is divided into cells, wherein phone calls are serviced by assigning frequencies to them so that no two calls emanating from the same or neighboring cells are assigned the same frequency. The problem is to use the frequencies efficiently, i.e., minimize the span of frequencies used. The frequency allocation problem can be regarded as a multicoloring problem on a weighted hexagonal graph. In this paper, we give a 1-local 4/3-competitive distributed algorithm for multicoloring a triangle-free hexagonal graph, which is a special case. Based on this result, we then propose a 1-local 13/9-competitive algorithm for multicoloring the (general-case) hexagonal graph, thereby improving the previous 1-local 3/2-competitive algorithm.
    Download Collect
  • Study of hydrolysis and acidification process to minimize excess biomass production

    Hong Zhu   Ji-hua Chen  

    Download Collect
  • Resettable Zero-Knowledge in the Weak Public-Key Model

    Yunlei Zhao, Xiaotie Deng, C. H. Lee   Hong Zhu  

    A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and Reyzin [EuroCrypt’01, pp. 373–393], is introduced and is named weak public-key (WPK) model. The motivations and applications of the WPK model are justified in the distributed smart-card/server setting and it seems more preferable in practice, especially in E-commerce over Internet. In this WPK model a 3-round (optimal) black-box resettable zero-knowledge argument with concurrent soundness for $ \mathcal{N}\mathcal{P} $ \mathcal{N}\mathcal{P} is presented assuming the security of RSA with large exponents against subexponential-time adversaries. Our result improves Micali and Reyzin’s result of resettable zero-knowledge argument with concurrent soundness for $ \mathcal{N}\mathcal{P} $ \mathcal{N}\mathcal{P} in the UPK model. Note that although Micali and Reyzin’ protocol satisfies concurrent soundness in the UPK model, but it does not satisfy even sequential soundness in our WPK model. Our protocol works in a somewhat “parallel repetition” manner to reduce the error probability and the black-box zero-knowledge simulator works in strict polynomial time rather than expected polynomial time. The critical tools used are: verifiable random functions introduced by Micali, Rabin and Vadhan [FOCS’99, pp. 120–130], zap presented by Dwork and Naor [FOCS’00, pp. 283–293] and complexity leveraging introduced by Canetti, Goldreich, Goldwasser and Micali [STOC’00, pp. 235–244].
    Download Collect
  • Array substrate, display panel and display device

    The invention discloses an array substrate, a display panel and a display device, and belongs to the field of array substrate test technology, which can solve the problem that the performance of the thin film transistor at the display region of the array substrate in an ADS mode cannot be accurately tested. The array substrate in the invention comprises a plurality of pixel units, each of which comprises a pixel electrode, an insulating layer above the pixel electrode, and a common electrode above the insulating layer, wherein at least one of the pixel units is a test pixel unit, wherein an opening is provided in the insulating layer of the test pixel unit to be above the pixel electrode and separated from the common electrode. The display panel and the display device in the invention comprise the above array substrate.
    Download Collect
  • Membrane microcantilever arrays fabrication with PZT thin films for nanorange movement

    Hong Zhu   Jianmin Miao   Bangtao Chen   Zhihong Wang   Weiguang Zhu  

    Lead zirconate titanate (PZT) piezoelectric thin films have been prepared by sol-gel method to fabricate microcantilever arrays for nano-actuation with potential applications in the hard disk drives. In order to solve the silicon over-etching problem, which leads to a low production yield in the microcantilever fabrication process, a new fabrication process using DRIE etching of silicon from the front side of the silicon wafer has been developed. Silicon free membrane microcantilevers with PZT thin films of 1 mum in thickness have been successfully fabricated with almost 100% yield by this new process. Annealing temperature and time are critical to the preparation of the sol-gel PZT thin film. The fabrication process of microcantilever arrays in planar structure will be presented. Key issues on the fabrication of the cantilever are the compatible etching process of PZT thin film and the compensation of thin film stress in all layers to obtain a flat multi-layer structure
    Download Collect
  • Membrane microcantilever arrays fabrication with PZT thin films for nanorange movement

    Hong Zhu   Jianmin Miao   Bangtao Chen   Zhihong Wang and Weiguang Zhu  

    Lead zirconate titanate (PZT) piezoelectric thin films have been prepared by sol-gel method to fabricate microcantilever arrays for nano-actuation with potential applications in the hard disk drives. In order to solve the silicon over-etching problem, which leads to a low production yield in the microcantilever fabrication process, a new fabrication process using DRIE etching of silicon from the front side of the silicon wafer has been developed. Silicon free membrane microcantilevers with PZT thin films of 1 m in thickness have been successfully fabricated with almost 100%yield by this new process. Annealing temperature and time are critical to the preparation of the sol-gel PZT thin film. The fabrication process of microcantilever arrays in planar structure will be presented. Key issues on the fabrication of the cantilever are the compatible etching process of PZT thin film and the compensation of thin film stress in all layers to obtain a flat multi-layer structure.
    Download Collect
  • Modeling and Closed-Loop Control of Stretch Bending of Aluminum Rectangular Tubes

    Hong Zhu   Kim A. Stelson  

    Download Collect
  • Study on mandatory access control in a secure database management system

    Hong Zhu   Yu-cai Feng  

    This paper proposes a security policy model for mandatory access control in a class B1 database management system whose level of labeling is tuple. The relational-hierarchical data model is extended to a multilevel relational-hierarchical data model. Based on the multilevel relational-hierarchical data model, the concept of upper-lower layer relational integrity is presented after analyzing and eliminating the covert channels caused by database integrity. Two SQL statements are extended to process polyinstantiation in the multilevel secure environment. The system is based on the multilevel relation-hierarchical data model and is capable of integratively storing and manipulating multilevel complicated objects (e.g., multilevel spatial data) and multilevel conventional data (e.g., integer, real number and character string)
    Download Collect
  • Microwave absorbing property of Fe-filled carbon nanotubes synthesized by a practical route

    Hong Zhu   Haiyan Lin   Hongfan Guo   Liufang Yu  

    Fe-filled carbon nanotubes were prepared reliably and economically via pyrolyzing of ferrocene and activated carbon. The sample was characterized by high-resolution transmission electron microscopy, electron diffraction and fast Fourier transforms. The complex relative permittivity and permeability parameters were measured in a frequency range of 2-18GHz and microwave absorbing behavior was investigated. The sample exhibits the maximum reflection loss and the widest bandwidth of below -5dB is -11.29dB and 4.13GHz (matching thickness=2.5mm), respectively. [All rights reserved Elsevier]
    Download Collect
1 2 3 4 5 6 7 8 9 10

Contact

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

Submit Feedback