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:("Chang-Biau Yang"). Showing records 1 – 30 of 96 total matches.

[1] [2] [3] [4]

Search Limiters

Last 2 Years | English Only

Degrees

▼ Search Limiters

1. Yuan, Hsin-Chuan. A Survey of Computational Methods for Protein Structure Prediction.

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

 The job of protein structure prediction is not easy. Various types of techniques and resources have been developed and deployed in the past decades to… (more)

Subjects/Keywords: structural genomics; protein structure prediction; computational structural biology; tertiary structure prediction; tertiary structure; bioinformatics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yuan, H. (2015). A Survey of Computational Methods for Protein Structure Prediction. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0713115-153535

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):

Yuan, Hsin-Chuan. “A Survey of Computational Methods for Protein Structure Prediction.” 2015. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0713115-153535.

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

MLA Handbook (7th Edition):

Yuan, Hsin-Chuan. “A Survey of Computational Methods for Protein Structure Prediction.” 2015. Web. 14 Aug 2020.

Vancouver:

Yuan H. A Survey of Computational Methods for Protein Structure Prediction. [Internet] [Thesis]. NSYSU; 2015. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0713115-153535.

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

Council of Science Editors:

Yuan H. A Survey of Computational Methods for Protein Structure Prediction. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0713115-153535

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


NSYSU

2. Fu, Wei-hao. Enhancement of Flower Classification with the Profile Feature.

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

 In this thesis, we propose an elegant method, based on machine learning, for the flower classification. There are three steps in our method. The process… (more)

Subjects/Keywords: inception-v3 model; Adaboost; flower classification; SVM; texture feature; color feature; segmentation; feature extraction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fu, W. (2018). Enhancement of Flower Classification with the Profile Feature. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0326118-050537

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):

Fu, Wei-hao. “Enhancement of Flower Classification with the Profile Feature.” 2018. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0326118-050537.

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

MLA Handbook (7th Edition):

Fu, Wei-hao. “Enhancement of Flower Classification with the Profile Feature.” 2018. Web. 14 Aug 2020.

Vancouver:

Fu W. Enhancement of Flower Classification with the Profile Feature. [Internet] [Thesis]. NSYSU; 2018. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0326118-050537.

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

Council of Science Editors:

Fu W. Enhancement of Flower Classification with the Profile Feature. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0326118-050537

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


NSYSU

3. Tseng, Chun-han. Chinese Input Method Based on First Mandarin Phonetic Alphabet for Mobile Devices and an Approach in Speaker Diarization with Divide-and-Conquer.

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

 There are two research topics in this thesis. First, we implement a highly efficient Chinese input method. Second, we apply a divide-and-conquer scheme to the… (more)

Subjects/Keywords: divide-and-conquer; Chinese input method; speaker diarization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tseng, C. (2008). Chinese Input Method Based on First Mandarin Phonetic Alphabet for Mobile Devices and an Approach in Speaker Diarization with Divide-and-Conquer. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909108-140401

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):

Tseng, Chun-han. “Chinese Input Method Based on First Mandarin Phonetic Alphabet for Mobile Devices and an Approach in Speaker Diarization with Divide-and-Conquer.” 2008. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909108-140401.

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

MLA Handbook (7th Edition):

Tseng, Chun-han. “Chinese Input Method Based on First Mandarin Phonetic Alphabet for Mobile Devices and an Approach in Speaker Diarization with Divide-and-Conquer.” 2008. Web. 14 Aug 2020.

Vancouver:

Tseng C. Chinese Input Method Based on First Mandarin Phonetic Alphabet for Mobile Devices and an Approach in Speaker Diarization with Divide-and-Conquer. [Internet] [Thesis]. NSYSU; 2008. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909108-140401.

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

Council of Science Editors:

Tseng C. Chinese Input Method Based on First Mandarin Phonetic Alphabet for Mobile Devices and an Approach in Speaker Diarization with Divide-and-Conquer. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909108-140401

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


NSYSU

4. Lin, Chih-Ying. Disulfide Bonding State Prediction with SVM Based on Protein Types.

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

 Disulfide bonds play crucial roles to predict the three-dimensional structure and the function of a protein. This thesis develops two algorithms to predict the disulfide… (more)

Subjects/Keywords: prediction; disulfide bond; protein

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, C. (2010). Disulfide Bonding State Prediction with SVM Based on Protein Types. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0818110-174218

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, Chih-Ying. “Disulfide Bonding State Prediction with SVM Based on Protein Types.” 2010. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0818110-174218.

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

MLA Handbook (7th Edition):

Lin, Chih-Ying. “Disulfide Bonding State Prediction with SVM Based on Protein Types.” 2010. Web. 14 Aug 2020.

Vancouver:

Lin C. Disulfide Bonding State Prediction with SVM Based on Protein Types. [Internet] [Thesis]. NSYSU; 2010. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0818110-174218.

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

Council of Science Editors:

Lin C. Disulfide Bonding State Prediction with SVM Based on Protein Types. [Thesis]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0818110-174218

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


NSYSU

5. Guo, Yi-pu. Efficient Algorithms for the Flexible Longest Common Subsequence Problem.

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

 Given two sequences, the traditional longest common subsequence (LCS) problem is to obtain the common subsequence with the maximum number of matches, without considering the… (more)

Subjects/Keywords: Dominant Strategy; Flexible Longest Common Subsequence; Longest Common Subsequence; Dynamic Programming; Sequence Alignment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guo, Y. (2014). Efficient Algorithms for the Flexible Longest Common Subsequence Problem. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0020114-165412

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):

Guo, Yi-pu. “Efficient Algorithms for the Flexible Longest Common Subsequence Problem.” 2014. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0020114-165412.

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

MLA Handbook (7th Edition):

Guo, Yi-pu. “Efficient Algorithms for the Flexible Longest Common Subsequence Problem.” 2014. Web. 14 Aug 2020.

Vancouver:

Guo Y. Efficient Algorithms for the Flexible Longest Common Subsequence Problem. [Internet] [Thesis]. NSYSU; 2014. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0020114-165412.

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

Council of Science Editors:

Guo Y. Efficient Algorithms for the Flexible Longest Common Subsequence Problem. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0020114-165412

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


NSYSU

6. Hsu, Chun-Chieh. The Department Score Prediction and Analysis of the College Entrance Examination.

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

 Prediction systems for college entrance examination (CEE) are used to give some recommendations for students to choose their ideal department. In Taiwan, more than 40%… (more)

Subjects/Keywords: prediction; fuzzy time series; precision; recall; college entrance examination; prediction system

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hsu, C. (2014). The Department Score Prediction and Analysis of the College Entrance Examination. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0719114-223232

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, Chun-Chieh. “The Department Score Prediction and Analysis of the College Entrance Examination.” 2014. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0719114-223232.

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

MLA Handbook (7th Edition):

Hsu, Chun-Chieh. “The Department Score Prediction and Analysis of the College Entrance Examination.” 2014. Web. 14 Aug 2020.

Vancouver:

Hsu C. The Department Score Prediction and Analysis of the College Entrance Examination. [Internet] [Thesis]. NSYSU; 2014. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0719114-223232.

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

Council of Science Editors:

Hsu C. The Department Score Prediction and Analysis of the College Entrance Examination. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0719114-223232

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


NSYSU

7. Hsu, Che-jui. Flexible Dynamic Time Warping for Time Series Classification.

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

 Measuring the similarity or distance between two time series sequences is critical for the classification of a set of time series sequences. Given two time… (more)

Subjects/Keywords: Time Series Classification; Dynamic Programming; Behavior Knowledge Space; Dominant Strategy; Dynamic Time Warping; Flexible Dynamic Time Warping

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hsu, C. (2014). Flexible Dynamic Time Warping for Time Series Classification. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725114-180851

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, Che-jui. “Flexible Dynamic Time Warping for Time Series Classification.” 2014. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725114-180851.

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

MLA Handbook (7th Edition):

Hsu, Che-jui. “Flexible Dynamic Time Warping for Time Series Classification.” 2014. Web. 14 Aug 2020.

Vancouver:

Hsu C. Flexible Dynamic Time Warping for Time Series Classification. [Internet] [Thesis]. NSYSU; 2014. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725114-180851.

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

Council of Science Editors:

Hsu C. Flexible Dynamic Time Warping for Time Series Classification. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725114-180851

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


NSYSU

8. Chiang, Chung-Han. A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences.

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

 Various approaches have been proposed for finding the longest common subsequence (LCS) of two sequences. The time complexities of these algorithms are usually O(n2) in… (more)

Subjects/Keywords: longest common subsequence; multiple sequences; genetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiang, C. (2009). A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018

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):

Chiang, Chung-Han. “A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018.

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

MLA Handbook (7th Edition):

Chiang, Chung-Han. “A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Web. 14 Aug 2020.

Vancouver:

Chiang C. A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences. [Internet] [Thesis]. NSYSU; 2009. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018.

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

Council of Science Editors:

Chiang C. A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018

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


NSYSU

9. Chen, Yun-Shiuan. he Prediction of the Department Score of the College Entrance Examination in Taiwan.

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

 Prediction systems for College Entrance Examination (CEE) are popular during the graduating season, July every year in Taiwan. These systems give students suggestion according to… (more)

Subjects/Keywords: SVM; SVR; College Entrance Examination; regression; prediction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, Y. (2012). he Prediction of the Department Score of the College Entrance Examination in Taiwan. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0911112-150630

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, Yun-Shiuan. “he Prediction of the Department Score of the College Entrance Examination in Taiwan.” 2012. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0911112-150630.

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

MLA Handbook (7th Edition):

Chen, Yun-Shiuan. “he Prediction of the Department Score of the College Entrance Examination in Taiwan.” 2012. Web. 14 Aug 2020.

Vancouver:

Chen Y. he Prediction of the Department Score of the College Entrance Examination in Taiwan. [Internet] [Thesis]. NSYSU; 2012. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0911112-150630.

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

Council of Science Editors:

Chen Y. he Prediction of the Department Score of the College Entrance Examination in Taiwan. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0911112-150630

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


NSYSU

10. 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 August 14, 2020. 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. 14 Aug 2020.

Vancouver:

Huang C. Trading Strategy Mining with Gene Expression Programming. [Internet] [Thesis]. NSYSU; 2012. [cited 2020 Aug 14]. 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

11. 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 August 14, 2020. 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. 14 Aug 2020.

Vancouver:

Chan H. The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems. [Internet] [Thesis]. NSYSU; 2016. [cited 2020 Aug 14]. 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

12. Sun, Tsai-ming. Flower Image Classification Based on the Support Vector Machine.

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

 This thesis proposes a method of flower image classification, based on the support vector machine (SVM). There are three main stages in our method: (1)… (more)

Subjects/Keywords: HSV color space; support vector machine; flower images; speed up robust feature; histogram of gradient; local binary pattern; local ternary pattern

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sun, T. (2016). Flower Image Classification Based on the Support Vector Machine. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0521116-192334

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):

Sun, Tsai-ming. “Flower Image Classification Based on the Support Vector Machine.” 2016. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0521116-192334.

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

MLA Handbook (7th Edition):

Sun, Tsai-ming. “Flower Image Classification Based on the Support Vector Machine.” 2016. Web. 14 Aug 2020.

Vancouver:

Sun T. Flower Image Classification Based on the Support Vector Machine. [Internet] [Thesis]. NSYSU; 2016. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0521116-192334.

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

Council of Science Editors:

Sun T. Flower Image Classification Based on the Support Vector Machine. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0521116-192334

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


NSYSU

13. Yang, Zih-Jie. Prediction for the Essential Protein with the Support Vector Machine.

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

 Essential proteins affect the cellular life deeply, but it is hard to identify them. Protein-protein interaction is one of the ways to disclose whether a… (more)

Subjects/Keywords: bioinformatics; essential protein; protein-protein interaction; support vector machine; feature set

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, Z. (2011). Prediction for the Essential Protein with the Support Vector Machine. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-094417

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):

Yang, Zih-Jie. “Prediction for the Essential Protein with the Support Vector Machine.” 2011. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-094417.

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

MLA Handbook (7th Edition):

Yang, Zih-Jie. “Prediction for the Essential Protein with the Support Vector Machine.” 2011. Web. 14 Aug 2020.

Vancouver:

Yang Z. Prediction for the Essential Protein with the Support Vector Machine. [Internet] [Thesis]. NSYSU; 2011. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-094417.

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

Council of Science Editors:

Yang Z. Prediction for the Essential Protein with the Support Vector Machine. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-094417

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


NSYSU

14. Lin, Dong-Jian. Protein Contact Prediction Based on Protein Sequences.

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

 The biological function of a protein is mainly maintained by its three-dimensional structure. Protein folds support the three-dimensional structure of a protein, and then the… (more)

Subjects/Keywords: prediction; Contact; SVM; KNN; PDA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, D. (2011). Protein Contact Prediction Based on Protein Sequences. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-150445

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, Dong-Jian. “Protein Contact Prediction Based on Protein Sequences.” 2011. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-150445.

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

MLA Handbook (7th Edition):

Lin, Dong-Jian. “Protein Contact Prediction Based on Protein Sequences.” 2011. Web. 14 Aug 2020.

Vancouver:

Lin D. Protein Contact Prediction Based on Protein Sequences. [Internet] [Thesis]. NSYSU; 2011. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-150445.

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

Council of Science Editors:

Lin D. Protein Contact Prediction Based on Protein Sequences. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-150445

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


NSYSU

15. Chen, Kai-Yu. All-atom Backbone Prediction with Improved Tool Preference Classification.

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

 The all-atom protein backbone reconstruction problem (PBRP) is to reconstruct the 3D coordinates of all atoms, including N, C, and O atoms on the backbone,… (more)

Subjects/Keywords: protein; 3D coordinate; prediction; backbone; SVM

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, K. (2011). All-atom Backbone Prediction with Improved Tool Preference Classification. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907111-133928

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, Kai-Yu. “All-atom Backbone Prediction with Improved Tool Preference Classification.” 2011. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907111-133928.

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

MLA Handbook (7th Edition):

Chen, Kai-Yu. “All-atom Backbone Prediction with Improved Tool Preference Classification.” 2011. Web. 14 Aug 2020.

Vancouver:

Chen K. All-atom Backbone Prediction with Improved Tool Preference Classification. [Internet] [Thesis]. NSYSU; 2011. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907111-133928.

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

Council of Science Editors:

Chen K. All-atom Backbone Prediction with Improved Tool Preference Classification. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907111-133928

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


NSYSU

16. Wang, Chong-Jie. Disulfide Bond Prediction with Hybrid Models.

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

 Disulfide bonds are special covalent cross links between two cysteines in a protein. This kind of bonding state plays an important role in protein folding… (more)

Subjects/Keywords: prediction; SVM; disulfide bond; cysteine; hybrid model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, C. (2011). Disulfide Bond Prediction with Hybrid Models. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-171625

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):

Wang, Chong-Jie. “Disulfide Bond Prediction with Hybrid Models.” 2011. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-171625.

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

MLA Handbook (7th Edition):

Wang, Chong-Jie. “Disulfide Bond Prediction with Hybrid Models.” 2011. Web. 14 Aug 2020.

Vancouver:

Wang C. Disulfide Bond Prediction with Hybrid Models. [Internet] [Thesis]. NSYSU; 2011. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-171625.

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

Council of Science Editors:

Wang C. Disulfide Bond Prediction with Hybrid Models. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-171625

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


NSYSU

17. 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 August 14, 2020. 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. 14 Aug 2020.

Vancouver:

Chen C. Efficient Algorithms for the Common Multiset Interval Problem. [Internet] [Thesis]. NSYSU; 2015. [cited 2020 Aug 14]. 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

18. Fang, Chun-yi. The Disulfide Bonding Pattern Prediction with the Cysteine Labels.

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

 There are four versions for the disulfide prediction problem, including chain classification, bonding state of each cysteine, connectivity of each cysteines pair and disulfide bonding… (more)

Subjects/Keywords: behavior knowledge space; disulfide bond; support vector machine; protein; cysteine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fang, C. (2015). The Disulfide Bonding Pattern Prediction with the Cysteine Labels. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0105115-014637

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):

Fang, Chun-yi. “The Disulfide Bonding Pattern Prediction with the Cysteine Labels.” 2015. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0105115-014637.

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

MLA Handbook (7th Edition):

Fang, Chun-yi. “The Disulfide Bonding Pattern Prediction with the Cysteine Labels.” 2015. Web. 14 Aug 2020.

Vancouver:

Fang C. The Disulfide Bonding Pattern Prediction with the Cysteine Labels. [Internet] [Thesis]. NSYSU; 2015. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0105115-014637.

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

Council of Science Editors:

Fang C. The Disulfide Bonding Pattern Prediction with the Cysteine Labels. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0105115-014637

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


NSYSU

19. Hung, Siang-Huai. A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem.

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

 The longest common subsequence (LCS) problem and its variations have been studied deeply in past decades. In the constrained longest common subsequence (CLCS) problem, given… (more)

Subjects/Keywords: diagonal; domination; similarity; constrained longest common subsequence; longest common subsequence; design of algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hung, S. (2018). A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-144718

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):

Hung, Siang-Huai. “A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem.” 2018. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-144718.

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

MLA Handbook (7th Edition):

Hung, Siang-Huai. “A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem.” 2018. Web. 14 Aug 2020.

Vancouver:

Hung S. A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem. [Internet] [Thesis]. NSYSU; 2018. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-144718.

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

Council of Science Editors:

Hung S. A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-144718

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


NSYSU

20. Liu, Jia-Hong. Portfolio Investment Based on Neural Networks.

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

 In this thesis, we combine the trading signals generated by the gen expression programming (GEP) method of Lee et al. and the portfolio generated by… (more)

Subjects/Keywords: neural network; stock investment; gene expression programming; convolutional neural network; portfolio

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, J. (2018). Portfolio Investment Based on Neural Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0621118-142449

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):

Liu, Jia-Hong. “Portfolio Investment Based on Neural Networks.” 2018. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0621118-142449.

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

MLA Handbook (7th Edition):

Liu, Jia-Hong. “Portfolio Investment Based on Neural Networks.” 2018. Web. 14 Aug 2020.

Vancouver:

Liu J. Portfolio Investment Based on Neural Networks. [Internet] [Thesis]. NSYSU; 2018. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0621118-142449.

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

Council of Science Editors:

Liu J. Portfolio Investment Based on Neural Networks. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0621118-142449

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


NSYSU

21. Lo, Shou-Fu. A Diagonal Algorithm for the Longest Common Increasing Subsequence Problem.

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

 The longest common increasing subsequencesã(LCIS) problem is to find out a common increasing subsequence with the maximal length of two given sequences. In this thesis,… (more)

Subjects/Keywords: Van Emde Boas Tree; Longest Common Increasing Subsequence; Diagonal; Dominate; Longest Increasing Subsequence; Longest Common Subsequence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lo, S. (2018). A Diagonal Algorithm for the Longest Common Increasing Subsequence Problem. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-163508

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):

Lo, Shou-Fu. “A Diagonal Algorithm for the Longest Common Increasing Subsequence Problem.” 2018. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-163508.

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

MLA Handbook (7th Edition):

Lo, Shou-Fu. “A Diagonal Algorithm for the Longest Common Increasing Subsequence Problem.” 2018. Web. 14 Aug 2020.

Vancouver:

Lo S. A Diagonal Algorithm for the Longest Common Increasing Subsequence Problem. [Internet] [Thesis]. NSYSU; 2018. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-163508.

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

Council of Science Editors:

Lo S. A Diagonal Algorithm for the Longest Common Increasing Subsequence Problem. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-163508

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


NSYSU

22. Chen, Bo-Xian. A Fast Algorithm for Dynamic Time Warping with Adaptive Window.

Degree: Master, Chinese Literature, 2018, NSYSU

 The classification problem is a critical issue in data processing field, especially emph{time series classification} (TSC) problem. In the TSC problem, the calculation of the… (more)

Subjects/Keywords: dynamic time warping (DTW); time series classication (TSC) problem; distance measurement; derivative dynamic time warping (DDTW); warping window

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, B. (2018). A Fast Algorithm for Dynamic Time Warping with Adaptive Window. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0631118-170443

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, Bo-Xian. “A Fast Algorithm for Dynamic Time Warping with Adaptive Window.” 2018. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0631118-170443.

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

MLA Handbook (7th Edition):

Chen, Bo-Xian. “A Fast Algorithm for Dynamic Time Warping with Adaptive Window.” 2018. Web. 14 Aug 2020.

Vancouver:

Chen B. A Fast Algorithm for Dynamic Time Warping with Adaptive Window. [Internet] [Thesis]. NSYSU; 2018. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0631118-170443.

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

Council of Science Editors:

Chen B. A Fast Algorithm for Dynamic Time Warping with Adaptive Window. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0631118-170443

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

23. Wu, Chen-Chang. Efficient Access Methods on the Hilbert Curve.

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

 The design of multi-dimensional access methods is difficult as compared to those of one-dimensional case because of no total ordering that preserves spatial locality. One… (more)

Subjects/Keywords: Image Processing; Hilbert Curve; Space Filling Curve; Window Query; Image Compression

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, C. (2012). Efficient Access Methods on the Hilbert Curve. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618112-141752

Chicago Manual of Style (16th Edition):

Wu, Chen-Chang. “Efficient Access Methods on the Hilbert Curve.” 2012. Doctoral Dissertation, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618112-141752.

MLA Handbook (7th Edition):

Wu, Chen-Chang. “Efficient Access Methods on the Hilbert Curve.” 2012. Web. 14 Aug 2020.

Vancouver:

Wu C. Efficient Access Methods on the Hilbert Curve. [Internet] [Doctoral dissertation]. NSYSU; 2012. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618112-141752.

Council of Science Editors:

Wu C. Efficient Access Methods on the Hilbert Curve. [Doctoral Dissertation]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618112-141752


NSYSU

24. Lai , Jyun-Hao. Ensemble Learning for Text Classiï¬cation.

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

 The text classification (text categorization, document classification, or document categorization) problem is to assign a given document to one of the predefined classes. The problem… (more)

Subjects/Keywords: support vector machine (SVM); ensemble learning; behavior knowledge space (BKS); Chinese text classification; feature generation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lai , J. (2017). Ensemble Learning for Text Classiï¬cation. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0802117-142741

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):

Lai , Jyun-Hao. “Ensemble Learning for Text Classiï¬cation.” 2017. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0802117-142741.

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

MLA Handbook (7th Edition):

Lai , Jyun-Hao. “Ensemble Learning for Text Classiï¬cation.” 2017. Web. 14 Aug 2020.

Vancouver:

Lai J. Ensemble Learning for Text Classiï¬cation. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0802117-142741.

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

Council of Science Editors:

Lai J. Ensemble Learning for Text Classiï¬cation. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0802117-142741

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


NSYSU

25. Chiu, Hsuan-Tsung. The NP-hardness and APX-hardness of the Two-dimensional Largest Common Substructure Problems.

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

 The similarity of one-dimensional data is usually measured by the longest common subsequence (LCS) algorithms. However, these algorithms cannot be directly extended to solve the… (more)

Subjects/Keywords: Satisfiabiliy; APX-hard; NP-hard; Similarity; Longest common subsequence; 3-dimensional matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiu, H. (2017). The NP-hardness and APX-hardness 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-0807117-143404

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):

Chiu, Hsuan-Tsung. “The NP-hardness and APX-hardness of the Two-dimensional Largest Common Substructure Problems.” 2017. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143404.

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

MLA Handbook (7th Edition):

Chiu, Hsuan-Tsung. “The NP-hardness and APX-hardness of the Two-dimensional Largest Common Substructure Problems.” 2017. Web. 14 Aug 2020.

Vancouver:

Chiu H. The NP-hardness and APX-hardness of the Two-dimensional Largest Common Substructure Problems. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143404.

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

Council of Science Editors:

Chiu H. The NP-hardness and APX-hardness of the Two-dimensional Largest Common Substructure Problems. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143404

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


NSYSU

26. Hung, Shu-Kai. An Algorithm for Time Series Classification Using Dissimilarity Space.

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

 ABSTRACT The time series classification problem is aimed to classify a new time series to a suitable class and then to give this time series… (more)

Subjects/Keywords: SVM; Time series; Dynamic time warping; Dissimilarity space; Ensemble

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hung, S. (2017). An Algorithm for Time Series Classification Using Dissimilarity Space. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143059

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):

Hung, Shu-Kai. “An Algorithm for Time Series Classification Using Dissimilarity Space.” 2017. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143059.

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

MLA Handbook (7th Edition):

Hung, Shu-Kai. “An Algorithm for Time Series Classification Using Dissimilarity Space.” 2017. Web. 14 Aug 2020.

Vancouver:

Hung S. An Algorithm for Time Series Classification Using Dissimilarity Space. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143059.

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

Council of Science Editors:

Hung S. An Algorithm for Time Series Classification Using Dissimilarity Space. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143059

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


NSYSU

27. 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 August 14, 2020. 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. 14 Aug 2020.

Vancouver:

Lin B. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Aug 14]. 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

28. Chang, Chia-Hung. Accuracy Improvement for RNA Secondary Structure Prediction with SVM.

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

 Ribonucleic acid (RNA) sometimes occurs in a complex structure called pseudoknots. Prediction of RNA secondary structures has drawn much attention from both biologists and computer… (more)

Subjects/Keywords: RNA; secondary structure; support vector machine; machine learning; classification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chang, C. (2008). Accuracy Improvement for RNA Secondary Structure Prediction with SVM. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0730108-234319

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):

Chang, Chia-Hung. “Accuracy Improvement for RNA Secondary Structure Prediction with SVM.” 2008. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0730108-234319.

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

MLA Handbook (7th Edition):

Chang, Chia-Hung. “Accuracy Improvement for RNA Secondary Structure Prediction with SVM.” 2008. Web. 14 Aug 2020.

Vancouver:

Chang C. Accuracy Improvement for RNA Secondary Structure Prediction with SVM. [Internet] [Thesis]. NSYSU; 2008. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0730108-234319.

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

Council of Science Editors:

Chang C. Accuracy Improvement for RNA Secondary Structure Prediction with SVM. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0730108-234319

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


NSYSU

29. Chang, Hsiao-Yen. Refinement of All-atom Backbone Prediction of Proteins.

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

 The all-atom protein backbone reconstruction problem (PBRP) is to rebuild the 3D coordinates of all atoms on the backbone which includes N, C, and O… (more)

Subjects/Keywords: backbone; prediction; protein

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chang, H. (2008). Refinement of All-atom Backbone Prediction of Proteins. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0820108-215243

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):

Chang, Hsiao-Yen. “Refinement of All-atom Backbone Prediction of Proteins.” 2008. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0820108-215243.

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

MLA Handbook (7th Edition):

Chang, Hsiao-Yen. “Refinement of All-atom Backbone Prediction of Proteins.” 2008. Web. 14 Aug 2020.

Vancouver:

Chang H. Refinement of All-atom Backbone Prediction of Proteins. [Internet] [Thesis]. NSYSU; 2008. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0820108-215243.

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

Council of Science Editors:

Chang H. Refinement of All-atom Backbone Prediction of Proteins. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0820108-215243

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


NSYSU

30. Chiu, Chiao-Wei. A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph.

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

 In this thesis, we focus on the design of the fault-tolerant routing algorithm for the (n, k)-star graph. We apply the idea of collecting the… (more)

Subjects/Keywords: Fault-Tolerant Routing Algorithm; (n k)-star Graph; Probabilistic Safety Vector

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiu, C. (2008). A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0903108-161000

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):

Chiu, Chiao-Wei. “A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph.” 2008. Thesis, NSYSU. Accessed August 14, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0903108-161000.

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

MLA Handbook (7th Edition):

Chiu, Chiao-Wei. “A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph.” 2008. Web. 14 Aug 2020.

Vancouver:

Chiu C. A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph. [Internet] [Thesis]. NSYSU; 2008. [cited 2020 Aug 14]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0903108-161000.

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

Council of Science Editors:

Chiu C. A Fault-Tolerant Routing Algorithm with Probabilistic Safety Vectors on the (n, k)-star Graph. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0903108-161000

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

[1] [2] [3] [4]

.