• Title/Summary/Keyword: Lipschitz Condition

Search Result 82, Processing Time 0.028 seconds

Observer Design for A Class of UncertainState-Delayed Nonlinear Systems

  • Lu Junwei;Feng Chunmei;Xu Shengyuan;Chu Yuming
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.4
    • /
    • pp.448-455
    • /
    • 2006
  • This paper deals with the observer design problem for a class of state-delayed nonlinear systems with or without time-varying norm-bounded parameter uncertainty. The nonlinearities under consideration are assumed to satisfy the global Lipschitz conditions and appear in both the state and measured output equations. The problem we address is the design of a nonlinear observer such that the resulting error system is globally asymptotically stable. For the case when there is no parameter uncertainty, a sufficient condition for the solvability of this problem is derived in terms of linear matrix inequalities and the explicit formula of a desired observer is given. Based on this, the robust observer design problem for the case when parameter uncertainties appear is considered and the solvability condition is also given. Both of the solvability conditions obtained in this paper are delay-dependent. A numerical example is provided to demonstrate the applicability of the proposed approach.

DNA Watermarking Method based on Random Codon Circular Code (랜덤 코돈 원형 부호 기반의 DNA 워터마킹)

  • Lee, Suk-Hwan;Kwon, Seong-Geun;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.3
    • /
    • pp.318-329
    • /
    • 2013
  • This paper proposes a DNA watermarking method for the privacy protection and the prevention of illegal copy. The proposed method allocates codons to random circular angles by using random mapping table and selects triplet codons for embedding target with the help of the Lipschitz regularity value of local modulus maxima of codon circular angles. Then the watermark is embedded into circular angles of triplet codons without changing the codes of amino acids in a DNA. The length and location of target triplet codons depend on the random mapping table for 64 codons that includes start and stop codons. This table is used as the watermark key and can be applied on any codon sequence regardless of the length of sequence. If this table is unknown, it is very difficult to detect the length and location of them for extracting the watermark. We evaluated our method and DNA-crypt watermarking of Heider method on the condition of similar capacity. From evaluation results, we verified that our method has lower base changing rate than DNA-crypt and has lower bit error rate on point mutation and insertions/deletions than DNA-crypt. Furthermore, we verified that the entropy of random mapping table and the locaton of triplet codons is high, meaning that the watermark security has high level.