Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"NSYSU" +contributor:("Hsing-Yen Ann"). Showing records 1 – 8 of 8 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


NSYSU

1. Huang, Chang-Hao. Trading Strategy Mining with Gene Expression Programming.

Degree: Master, Computer Science and Engineering, 2012, NSYSU

 In the thesis, we apply the gene expression programming (GEP) to training profitable trading strategies. We propose a model which utilizes several historical periods that… (more)

Subjects/Keywords: Taiwan Stock Exchange Capitalization Weighted Stock Index; simple majority vote; feature set; strategy pool; gene expression programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Huang, C. (2012). Trading Strategy Mining with Gene Expression Programming. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-113643

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Huang, Chang-Hao. “Trading Strategy Mining with Gene Expression Programming.” 2012. Thesis, NSYSU. Accessed October 13, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-113643.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Huang, Chang-Hao. “Trading Strategy Mining with Gene Expression Programming.” 2012. Web. 13 Oct 2019.

Vancouver:

Huang C. Trading Strategy Mining with Gene Expression Programming. [Internet] [Thesis]. NSYSU; 2012. [cited 2019 Oct 13]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-113643.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang C. Trading Strategy Mining with Gene Expression Programming. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-113643

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

2. Chan, Huang-Ting. The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems.

Degree: Master, Computer Science and Engineering, 2016, NSYSU

 The traditional longest common subsequence (LCS) problem is to find the maximum number of ordered matches in two sequences. The similarity of two one-dimensional sequences… (more)

Subjects/Keywords: Longest Common Subsequence; Similarity; NP-hard; Matrices; Integer Linear Programming; Heuristic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chan, H. (2016). The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0031116-004017

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chan, Huang-Ting. “The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems.” 2016. Thesis, NSYSU. Accessed October 13, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0031116-004017.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chan, Huang-Ting. “The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems.” 2016. Web. 13 Oct 2019.

Vancouver:

Chan H. The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems. [Internet] [Thesis]. NSYSU; 2016. [cited 2019 Oct 13]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0031116-004017.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chan H. The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0031116-004017

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

3. Chen, Cing-Yao. Efficient Algorithms for the Common Multiset Interval Problem.

Degree: Master, Computer Science and Engineering, 2015, NSYSU

 For two sequences A = a1a2a3 ⦠am and B = b1b2b3 ⦠cn, a multiset interval â(A, i, j) = [ax | i ⤅ (more)

Subjects/Keywords: Assembly Code; CI; LCS; CPE; BKS; CMI

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chen, C. (2015). Efficient Algorithms for the Common Multiset Interval Problem. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0108115-142017

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chen, Cing-Yao. “Efficient Algorithms for the Common Multiset Interval Problem.” 2015. Thesis, NSYSU. Accessed October 13, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0108115-142017.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chen, Cing-Yao. “Efficient Algorithms for the Common Multiset Interval Problem.” 2015. Web. 13 Oct 2019.

Vancouver:

Chen C. Efficient Algorithms for the Common Multiset Interval Problem. [Internet] [Thesis]. NSYSU; 2015. [cited 2019 Oct 13]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0108115-142017.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen C. Efficient Algorithms for the Common Multiset Interval Problem. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0108115-142017

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

4. Lin, Bi-Shiang. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem.

Degree: Master, Computer Science and Engineering, 2017, NSYSU

 Given two sequences A and B of lengths m and n, respectively, the consecutive suffix alignment problem is to compute the longest common subsequence (LCS)… (more)

Subjects/Keywords: S-table; linear space; consecutive suffix alignment problem; longest common subsequence; range query; segment tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lin, B. (2017). The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lin, Bi-Shiang. “The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem.” 2017. Thesis, NSYSU. Accessed October 13, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lin, Bi-Shiang. “The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem.” 2017. Web. 13 Oct 2019.

Vancouver:

Lin B. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. [Internet] [Thesis]. NSYSU; 2017. [cited 2019 Oct 13]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lin B. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

5. Cheng, Kai-Yuan. The Longest Common Subsequence Problem with a Gapped Constraint.

Degree: Master, Computer Science and Engineering, 2012, NSYSU

 This thesis considers a variant of the classical problem for finding the longest common subsequence (LCS) called longest common subsequence problem with a gapped constraint… (more)

Subjects/Keywords: DP; Dynamic Programming; constraint; CLCS; LCS; Gap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Cheng, K. (2012). The Longest Common Subsequence Problem with a Gapped Constraint. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-090312

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Cheng, Kai-Yuan. “The Longest Common Subsequence Problem with a Gapped Constraint.” 2012. Thesis, NSYSU. Accessed October 13, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-090312.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Cheng, Kai-Yuan. “The Longest Common Subsequence Problem with a Gapped Constraint.” 2012. Web. 13 Oct 2019.

Vancouver:

Cheng K. The Longest Common Subsequence Problem with a Gapped Constraint. [Internet] [Thesis]. NSYSU; 2012. [cited 2019 Oct 13]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-090312.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cheng K. The Longest Common Subsequence Problem with a Gapped Constraint. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-090312

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

6. Lin, Shian-liang. A Survey on the Algorithms of the Edit Distance Problem and Related Variants.

Degree: Master, Computer Science and Engineering, 2016, NSYSU

 Abstract The edit distance problem has been studied for several decades. Given sequences (strings) A and B with length m and n, respectively, m ⤅ (more)

Subjects/Keywords: Genome Rearrangement; Similarity; Dynamic Programing; Longest Common Subsequence; Edit Distance; Block Edit

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lin, S. (2016). A Survey on the Algorithms of the Edit Distance Problem and Related Variants. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806116-215529

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lin, Shian-liang. “A Survey on the Algorithms of the Edit Distance Problem and Related Variants.” 2016. Thesis, NSYSU. Accessed October 13, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806116-215529.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lin, Shian-liang. “A Survey on the Algorithms of the Edit Distance Problem and Related Variants.” 2016. Web. 13 Oct 2019.

Vancouver:

Lin S. A Survey on the Algorithms of the Edit Distance Problem and Related Variants. [Internet] [Thesis]. NSYSU; 2016. [cited 2019 Oct 13]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806116-215529.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lin S. A Survey on the Algorithms of the Edit Distance Problem and Related Variants. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806116-215529

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

7. Hsu, Tzu-Chiang. An Algorithm for Computing the Distance of the Non-overlapping Inversion and Transposition.

Degree: Master, Computer Science and Engineering, 2017, NSYSU

 Reacting to the growing interest in large-scale mutation events, Ta et al. introduced the non-overlapping inversion and transposition distance problem in 2015, which is to… (more)

Subjects/Keywords: Non-Overlapping; Genome Rearrangement; Inversion; Transposition; Dynamic Programming; Run

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hsu, T. (2017). An Algorithm for Computing the Distance of the Non-overlapping Inversion and Transposition. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0022117-230149

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hsu, Tzu-Chiang. “An Algorithm for Computing the Distance of the Non-overlapping Inversion and Transposition.” 2017. Thesis, NSYSU. Accessed October 13, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0022117-230149.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hsu, Tzu-Chiang. “An Algorithm for Computing the Distance of the Non-overlapping Inversion and Transposition.” 2017. Web. 13 Oct 2019.

Vancouver:

Hsu T. An Algorithm for Computing the Distance of the Non-overlapping Inversion and Transposition. [Internet] [Thesis]. NSYSU; 2017. [cited 2019 Oct 13]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0022117-230149.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hsu T. An Algorithm for Computing the Distance of the Non-overlapping Inversion and Transposition. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0022117-230149

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

8. Ho, Wen-chuan. A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet.

Degree: Master, Computer Science and Engineering, 2017, NSYSU

 Given three sequences A, B and C with lengths of m, n and r, respectively, the constrained longest common subsequence (CLCS) problem is to find… (more)

Subjects/Keywords: Small alphabet; Dynamic Programming; Similar; CLCS; LCS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ho, W. (2017). A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0023117-160730

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ho, Wen-chuan. “A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet.” 2017. Thesis, NSYSU. Accessed October 13, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0023117-160730.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ho, Wen-chuan. “A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet.” 2017. Web. 13 Oct 2019.

Vancouver:

Ho W. A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet. [Internet] [Thesis]. NSYSU; 2017. [cited 2019 Oct 13]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0023117-160730.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ho W. A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0023117-160730

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.