The Experts below are selected from a list of 105 Experts worldwide ranked by ideXlab platform
Yonghui Wu - One of the best experts on this subject based on the ideXlab platform.
-
Web Intelligence - Normalization Design of XML Database Schema for Eliminating Redundant Schemas and Satisfying Lossless Join
2004Co-Authors: Yonghui WuAbstract:Normalization design of XML database schema is to produce a set of XML schemas or DTDs that can well represent data dependencies and eliminate redundancies. In the current researches on Normalization design of XML database schema, redundancies in XML database schema are not studied specially and classified, and Normalization design algorithms are only converting an initial schema into one in one of Normal Forms proposed in these researches. The paper defines hierarchical schema representing XML database schema and corresponding Normal Forms - first Normal Form (INF) and Second Normal Form (2NF) for XML database schema, and presents the algorithm eliminating redundant schemas and Normalization design algorithm for 2NF. In XML database schema in 1NF, the set of full and embedded MVDs are implied by the given set of MVDs. XML database schema in 2NF satifies properties for 1NF, eliminates reduant schemas, and satifies lossless join property.
-
Normalization Design of XML Database Schema for Eliminating Redundant Schemas and Satisfying Lossless Join
IEEE WIC ACM International Conference on Web Intelligence (WI'04), 2004Co-Authors: Yonghui WuAbstract:Normalization design of XML database schema is to produce a set of XML schemas or DTDs that can well represent data dependencies and eliminate redundancies. In the current researches on Normalization design of XML database schema, redundancies in XML database schema are not studied specially and classified, and Normalization design algorithms are only converting an initial schema into one in one of Normal Forms proposed in these researches. The paper defines hierarchical schema representing XML database schema and corresponding Normal Forms - first Normal Form (INF) and Second Normal Form (2NF) for XML database schema, and presents the algorithm eliminating redundant schemas and Normalization design algorithm for 2NF. In XML database schema in 1NF, the set of full and embedded MVDs are implied by the given set of MVDs. XML database schema in 2NF satifies properties for 1NF, eliminates reduant schemas, and satifies lossless join property.
Ying Xiao - One of the best experts on this subject based on the ideXlab platform.
-
CISP-BMEI - RLS CMA blind equalization with adaptive forgetting factor controlled by energy steady state
2016 9th International Congress on Image and Signal Processing BioMedical Engineering and Informatics (CISP-BMEI), 2016Co-Authors: Ying XiaoAbstract:To further improve the perFormance of recurrent least square (RLS) constant modulus algorithm (CMA) RLS-CMA blind equalization, an RLS-CMA blind equalization algorithm with adaptive forgetting factor controlled by energy steady state was proposed. The cost function of CMA is simplified to meet Second Normal Form, and the blind equalizer can be updated according to RLS algorithm. The energy rate of the blind equalizer is defined, based on which to judge the algorithm enter the steady state. The forgetting factor switches from the small value to big value when the steady state is reached. There are only two forgetting factors can be selected during the iterative process, which can take full advantages of small and big forgetting factors in the RLS algorithm. Computer simulation results show the effectiveness of the proposed algorithm.
-
RLS CMA blind equalization with adaptive forgetting factor controlled by energy steady state
2016 9th International Congress on Image and Signal Processing BioMedical Engineering and Informatics (CISP-BMEI), 2016Co-Authors: Ying XiaoAbstract:To further improve the perFormance of recurrent least square (RLS) constant modulus algorithm (CMA) RLS-CMA blind equalization, an RLS-CMA blind equalization algorithm with adaptive forgetting factor controlled by energy steady state was proposed. The cost function of CMA is simplified to meet Second Normal Form, and the blind equalizer can be updated according to RLS algorithm. The energy rate of the blind equalizer is defined, based on which to judge the algorithm enter the steady state. The forgetting factor switches from the small value to big value when the steady state is reached. There are only two forgetting factors can be selected during the iterative process, which can take full advantages of small and big forgetting factors in the RLS algorithm. Computer simulation results show the effectiveness of the proposed algorithm.
D Talalaev - One of the best experts on this subject based on the ideXlab platform.
-
KZ equation, G-opers, quantum Drinfeld–Sokolov reduction, and quantum Cayley–Hamilton identity
Journal of Mathematical Sciences, 2009Co-Authors: D Talalaev, A. ChervovAbstract:The Lax operator of Gaudin-type models is a 1-Form at the classical level. In virtue of the quantization scheme proposed by D. Talalaev, it is natural to treat the quantum Lax operator as a connection; this connection is a partcular case of the Knizhnik–Zamolodchikov connection. In this paper, we find a gauge trasFormation that produces the “Second Normal Form,” or the “Drinfeld–Sokolov” Form. Moreover, the differential operator nurally corresponding to this Form is given precisely by the quantum characteristic polynomial of the Lax operator (this operator is called the G-oper or Baxter operator). This observation allows us to relate solutions of the KZ and Baxter equations in an obvious way, and to prove that the immanent KZ equation has only meromorphic solutions. As a corollary, we obtain the quantum Cayley–Hamilton identity for Gaudin-type Lax operators (including the general $ \mathfrak{gl}_{n}[t] $ case). The presented construction sheds a new light on the geometric Langlands correspondence. We also discuss the relation with the Harish-Chandra homomorphism. Bibliography: 19 titles.
-
KZ equation, G-opers and quantum Drinfeld-Sokolov reduction
arXiv: High Energy Physics - Theory, 2006Co-Authors: A. Chervov, D TalalaevAbstract:The Lax operator of the classical Gaudin type models is a 1-Form on the classical level. In virtue of the quantization scheme proposed in [Talalaev04] (hep-th/0404153) it is natural to treat the quantum Lax operator as a {\em connection}; this connection is a particular case of the Knizhnik-Zamolodchikov connection [ChervovTalalaev06] (hep-th/0604128). In this paper we propose the general conjecture: by the gauge transFormation this connection can be reduced to the "Second Normal Form" or the "Drinfeld-Sokolov" Form. Moreover the differential operator naturally corresponding to this Form is given precisely by the quantum characteristic polynomial [Talalaev04] of the Lax operator (this operator is called the $G$-oper or Baxter equation). We prove the conjecture in the GL(2) case. This observation allows to relate solutions of the KZ and Baxter equations in an obvious way, and to prove that the immanent KZ-equations has only meromorphic solutions. We also discuss the relation with the Harish-Chandra homomorphism.
-
KZ equation, G-opers, quantum Drinfeld-Sokolov reduction and quantum Cayley-Hamilton identity
arXiv: High Energy Physics - Theory, 2006Co-Authors: A. Chervov, D TalalaevAbstract:The Lax operator of the Gaudin type models is a 1-Form on the classical level. In virtue of the quantization scheme proposed in [Talalaev04] (hep-th/0404153) it is natural to treat the quantum Lax operator as a connection; this connection is a particular case of the Knizhnik-Zamolodchikov connection [ChervovTalalaev06] (hep-th/0604128). In this paper we find a gauge transFormation which produces the "Second Normal Form" or the "Drinfeld-Sokolov" Form. Moreover the differential operator naturally corresponding to this Form is given precisely by the quantum characteristic polynomial [Talalaev04] of the Lax operator (this operator is called the G-oper or Baxter equation). This observation allows to relate solutions of the KZ and Baxter equations in an obvious way, and to prove that the immanent KZ-equations has only meromorphic solutions. As a corollary we obtain the quantum Cayley-Hamilton identity for the Gaudin-type Lax operators (including the general gl(n)[t] case). The presented construction sheds a new light on a geometric Langlands correspondence. We also discuss the relation with the Harish-Chandra homomorphism.
A. Chervov - One of the best experts on this subject based on the ideXlab platform.
-
KZ equation, G-opers, quantum Drinfeld–Sokolov reduction, and quantum Cayley–Hamilton identity
Journal of Mathematical Sciences, 2009Co-Authors: D Talalaev, A. ChervovAbstract:The Lax operator of Gaudin-type models is a 1-Form at the classical level. In virtue of the quantization scheme proposed by D. Talalaev, it is natural to treat the quantum Lax operator as a connection; this connection is a partcular case of the Knizhnik–Zamolodchikov connection. In this paper, we find a gauge trasFormation that produces the “Second Normal Form,” or the “Drinfeld–Sokolov” Form. Moreover, the differential operator nurally corresponding to this Form is given precisely by the quantum characteristic polynomial of the Lax operator (this operator is called the G-oper or Baxter operator). This observation allows us to relate solutions of the KZ and Baxter equations in an obvious way, and to prove that the immanent KZ equation has only meromorphic solutions. As a corollary, we obtain the quantum Cayley–Hamilton identity for Gaudin-type Lax operators (including the general $ \mathfrak{gl}_{n}[t] $ case). The presented construction sheds a new light on the geometric Langlands correspondence. We also discuss the relation with the Harish-Chandra homomorphism. Bibliography: 19 titles.
-
KZ equation, G-opers and quantum Drinfeld-Sokolov reduction
arXiv: High Energy Physics - Theory, 2006Co-Authors: A. Chervov, D TalalaevAbstract:The Lax operator of the classical Gaudin type models is a 1-Form on the classical level. In virtue of the quantization scheme proposed in [Talalaev04] (hep-th/0404153) it is natural to treat the quantum Lax operator as a {\em connection}; this connection is a particular case of the Knizhnik-Zamolodchikov connection [ChervovTalalaev06] (hep-th/0604128). In this paper we propose the general conjecture: by the gauge transFormation this connection can be reduced to the "Second Normal Form" or the "Drinfeld-Sokolov" Form. Moreover the differential operator naturally corresponding to this Form is given precisely by the quantum characteristic polynomial [Talalaev04] of the Lax operator (this operator is called the $G$-oper or Baxter equation). We prove the conjecture in the GL(2) case. This observation allows to relate solutions of the KZ and Baxter equations in an obvious way, and to prove that the immanent KZ-equations has only meromorphic solutions. We also discuss the relation with the Harish-Chandra homomorphism.
-
KZ equation, G-opers, quantum Drinfeld-Sokolov reduction and quantum Cayley-Hamilton identity
arXiv: High Energy Physics - Theory, 2006Co-Authors: A. Chervov, D TalalaevAbstract:The Lax operator of the Gaudin type models is a 1-Form on the classical level. In virtue of the quantization scheme proposed in [Talalaev04] (hep-th/0404153) it is natural to treat the quantum Lax operator as a connection; this connection is a particular case of the Knizhnik-Zamolodchikov connection [ChervovTalalaev06] (hep-th/0604128). In this paper we find a gauge transFormation which produces the "Second Normal Form" or the "Drinfeld-Sokolov" Form. Moreover the differential operator naturally corresponding to this Form is given precisely by the quantum characteristic polynomial [Talalaev04] of the Lax operator (this operator is called the G-oper or Baxter equation). This observation allows to relate solutions of the KZ and Baxter equations in an obvious way, and to prove that the immanent KZ-equations has only meromorphic solutions. As a corollary we obtain the quantum Cayley-Hamilton identity for the Gaudin-type Lax operators (including the general gl(n)[t] case). The presented construction sheds a new light on a geometric Langlands correspondence. We also discuss the relation with the Harish-Chandra homomorphism.
Kazuaki Maeda - One of the best experts on this subject based on the ideXlab platform.
-
An Extended Line-Based Approach to Detect Code Clones Using Syntactic and Lexical InFormation
2010 Seventh International Conference on Information Technology: New Generations, 2010Co-Authors: Kazuaki MaedaAbstract:This paper proposes a new line-based approach for the detection of code clones using syntactic and lexical inFormation. A customized compiler writes a source code representation that contains syntactic and lexical inFormation. A new clone detection tool called LePalex reads the source code representation, and converts it to three types of code: first Normal Form, Second Normal Form, and third Normal Form. The first Normal Form is used to detect the exact match of code clones. The Second Normal Form is used to detect the syntactic match of code clones. The third Normal Form is used to check for syntactically correct segments of code clones. This paper demonstrates the advantage of this approach in achieving programming language independence using syntactic and lexical inFormation.
-
ITNG - An Extended Line-Based Approach to Detect Code Clones Using Syntactic and Lexical InFormation
2010 Seventh International Conference on Information Technology: New Generations, 2010Co-Authors: Kazuaki MaedaAbstract:This paper proposes a new line-based approach for the detection of code clones using syntactic and lexical inFormation. A customized compiler writes a source code representation that contains syntactic and lexical inFormation. A new clone detection tool called LePalex reads the source code representation, and converts it to three types of code: first Normal Form, Second Normal Form, and third Normal Form. The first Normal Form is used to detect the exact match of code clones. The Second Normal Form is used to detect the syntactic match of code clones. The third Normal Form is used to check for syntactically correct segments of code clones. This paper demonstrates the advantage of this approach in achieving programming language independence using syntactic and lexical inFormation.