Lin-Yu Tseng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Lin-Yu Tseng has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
Chun Chen
5 shared publicationsShiueng Bien Yang
4 shared publicationsYa-Tai Lin
4 shared publicationsChih-Sheng Wu
National Chung Hsing University, Department of Computer Science and Engineering, 250 Kuo Kuang Road, Taichung, Taiwan
3 shared publicationsLi-Chin Huang
3 shared publicationsRung-Ching Chen
Department of Health Services Management, China Medical University, Taichung, Taiwan, ROC, 2Department of Information Management, Chaoyang University of Technology, Taichung, Taiwan, ROC, 3Department of Computer Science, National Chung Hsing University, Taichung, Taiwan, ROC, 4Department of Food Science, Central Taiwan University of Science and Technology, Taichung, Taiwan, ROC and 5Department of Management Information System, National Chung Hsing University, Taichung, Taiwan, ROC
3 shared publications
Latest Publications
- Open Access
- 5 February 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-7
Epidemiology of Orthopedic Fractures and Other Injuries among Inpatients Admitted due to Traffic Accidents: A 10-Year Nationwide Survey in Taiwan
To investigate the major injury patterns associated with traffic accidents and evaluate the risk factors of the main injury, a survey of Taiwan’s national insurance admission data between 2002 and 2011 was performed. The incidence of traffic-accidents-related hospitalization was between 9.17% and 11.54% and the average mortality rate of the inpatients admitted due to traffic accidents was 0.68%. Of all inpatients due to road traffic accidents in Taiwan, orthopedic fractures were the most common injuries that accounted for 29.36% of them. There were a total of 391,197 cases of three orthopedic fracture groups that were divided into (1) fracture of upper limb, (2) fracture of lower limb, and (3) fracture of spine and trunk. An increase in national medical cost used for inpatients with orthopedic fractures was noted and ranged from US$ 45.6 million to US$ 86 million annually. These orthopedic fracture patterns were frequently associated with other injuries especially head injuries (ranged from 14% to 26%). A significant relation to male gender, older age, low income, and admission to high-level hospital to the observed fracture patterns was observed.
- 5 February 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-7
Open AccessEpidemiology of Orthopedic Fractures and Other Injuries among Inpatients Admitted due to Traffic Accidents: A 10-Year Nationwide Survey in Taiwan
To investigate the major injury patterns associated with traffic accidents and evaluate the risk factors of the main injury, a survey of Taiwan’s national insurance admission data between 2002 and 2011 was performed. The incidence of traffic-accidents-related hospitalization was between 9.17% and 11.54% and the average mortality rate of the inpatients admitted due to traffic accidents was 0.68%. Of all inpatients due to road traffic accidents in Taiwan, orthopedic fractures were the most common injuries that accounted for 29.36% of them. There were a total of 391,197 cases of three orthopedic fracture groups that were divided into (1) fracture of upper limb, (2) fracture of lower limb, and (3) fracture of spine and trunk. An increase in national medical cost used for inpatients with orthopedic fractures was noted and ranged from US$ 45.6 million to US$ 86 million annually. These orthopedic fracture patterns were frequently associated with other injuries especially head injuries (ranged from 14% to 26%). A significant relation to male gender, older age, low income, and admission to high-level hospital to the observed fracture patterns was observed.
- 3 October 2013
- Published by Taylor & Francis in Engineering Optimization
- Vol. 46 (10) , 1430-1445
An improved version of the multiple trajectory search for real value multi-objective optimization problems
- 3 October 2013
- Published by Taylor & Francis in Engineering Optimization
- Vol. 46 (10) , 1430-1445
An improved version of the multiple trajectory search for real value multi-objective optimization problems
- 1 March 2013
- Published by Elsevier in Journal of Systems and Software
- Vol. 86 (3) , 716-727
A reversible data hiding method by histogram shifting in high quality medical images
- 1 March 2013
- Published by Elsevier in Journal of Systems and Software
- Vol. 86 (3) , 716-727
A reversible data hiding method by histogram shifting in high quality medical images
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 112-120
A Hybrid Genetic Algorithm for the Maximum Satisfiability Problem
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 112-120
A Hybrid Genetic Algorithm for the Maximum Satisfiability Problem
- 1 September 2012
- Published by Elsevier in Information Sciences
- Vol. 199, 167-178
Prediction of disulfide bonding pattern based on a support vector machine and multiple trajectory search
- 1 September 2012
- Published by Elsevier in Information Sciences
- Vol. 199, 167-178
Prediction of disulfide bonding pattern based on a support vector machine and multiple trajectory search
- 1 November 2010
- Published by Elsevier in International Journal of Production Economics
- Vol. 128 (1) , 144-152
A hybrid genetic algorithm for no-wait flowshop scheduling problem
- 1 November 2010
- Published by Elsevier in International Journal of Production Economics
- Vol. 128 (1) , 144-152
A hybrid genetic algorithm for no-wait flowshop scheduling problem
- 1 October 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2381-2386
An evolutionary algorithm for variable-sized ANN ensemble construction
For some difficult problems, artificial neural network (ANN) ensemble classifiers, instead of a single ANN classifier, are considered. The ensemble usually has better generalization performance than any individual network for classification problems. But, it is not easy to construct the ANN ensemble. In the previous study, the authors presented the systematic trajectory search algorithm (STSA) to train the ANN and the experimental results revealed the performance of the STSA is good. Based on the STSA, an evolutionary algorithm for variable-sized ANN ensemble construction, called the VSEC, is proposed in this paper. A penalty term is added to the error function in order to guarantee the diversity of the ensemble. Besides, a variable-sized ANN ensemble construction method, based on three operations, is proposed to update the ensemble members. The performance of the proposed algorithm is evaluated by applying it to train a class of feedforward neural networks to solve the large n-bit parity problems. By comparing with the previous studies, the experimental results revealed that the neural network ensemble classifiers trained by the VSEC have very good classification ability.
- 1 October 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2381-2386
An evolutionary algorithm for variable-sized ANN ensemble construction
For some difficult problems, artificial neural network (ANN) ensemble classifiers, instead of a single ANN classifier, are considered. The ensemble usually has better generalization performance than any individual network for classification problems. But, it is not easy to construct the ANN ensemble. In the previous study, the authors presented the systematic trajectory search algorithm (STSA) to train the ANN and the experimental results revealed the performance of the STSA is good. Based on the STSA, an evolutionary algorithm for variable-sized ANN ensemble construction, called the VSEC, is proposed in this paper. A penalty term is added to the error function in order to guarantee the diversity of the ensemble. Besides, a variable-sized ANN ensemble construction method, based on three operations, is proposed to update the ensemble members. The performance of the proposed algorithm is evaluated by applying it to train a class of feedforward neural networks to solve the large n-bit parity problems. By comparing with the previous studies, the experimental results revealed that the neural network ensemble classifiers trained by the VSEC have very good classification ability.
- 1 September 2010
- Published by Elsevier in International Journal of Production Economics
- Vol. 127 (1) , 121-128
A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem
- 1 September 2010
- Published by Elsevier in International Journal of Production Economics
- Vol. 127 (1) , 121-128
A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem
- 1 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 1-7
Multiple Trajectory Search for single objective constrained real-parameter optimization problems
In this paper, the Multiple Trajectory Search (MTS) is presented for single objective constrained real-parameter optimization problems. The MTS uses multiple agents to search the solution space concurrently. Each agent does an iterated region search using one of three candidate region search methods. By choosing a region search method that best fits the landscape of a solution's neighborhood, an agent may find its way to a local optimum or the global optimum. We applied the MTS to the eighteen benchmark problems designed for the CEC 2010 Competition on Single Objective Constrained Real-Parameter Optimization. The results are quite promising.
- 1 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 1-7
Multiple Trajectory Search for single objective constrained real-parameter optimization problems
In this paper, the Multiple Trajectory Search (MTS) is presented for single objective constrained real-parameter optimization problems. The MTS uses multiple agents to search the solution space concurrently. Each agent does an iterated region search using one of three candidate region search methods. By choosing a region search method that best fits the landscape of a solution's neighborhood, an agent may find its way to a local optimum or the global optimum. We applied the MTS to the eighteen benchmark problems designed for the CEC 2010 Competition on Single Objective Constrained Real-Parameter Optimization. The results are quite promising.
- 1 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 2583-2588
Automatic fissure detection in CT images based on the genetic algorithm
Lung cancer is one of the most frequently occurring cancer and has a very low five-year survival rate. Computer-aided diagnosis (CAD) helps reducing the burden of radiologists and improving the accuracy of abnormality detection during CT image interpretations. Owing to rapid development of the scanner technology, the volume of medical imaging data is becoming huger and huger. Automated segmentations of the target organ region are always required by the CAD systems. Although the analysis of lung fissures provides important information for treatment, it is still a challenge to extract fissures automatically based on the CT values because the appearance of lung fissures is very fuzzy and indefinite. Since the oblique fissures can be visualized more easily among other fissures on the chest CT images, they are used to check the exact localization of the lesions. In this paper, we propose a fully automatic fissure detection method based on the genetic algorithm to identify the oblique fissures. The accurate rates of identifying the oblique fissures in the right lung and the left lung are 97% and 86%, respectively when the method was tested on 87 slices.
- 1 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 2583-2588
Automatic fissure detection in CT images based on the genetic algorithm
Lung cancer is one of the most frequently occurring cancer and has a very low five-year survival rate. Computer-aided diagnosis (CAD) helps reducing the burden of radiologists and improving the accuracy of abnormality detection during CT image interpretations. Owing to rapid development of the scanner technology, the volume of medical imaging data is becoming huger and huger. Automated segmentations of the target organ region are always required by the CAD systems. Although the analysis of lung fissures provides important information for treatment, it is still a challenge to extract fissures automatically based on the CT values because the appearance of lung fissures is very fuzzy and indefinite. Since the oblique fissures can be visualized more easily among other fissures on the chest CT images, they are used to check the exact localization of the lesions. In this paper, we propose a fully automatic fissure detection method based on the genetic algorithm to identify the oblique fissures. The accurate rates of identifying the oblique fissures in the right lung and the left lung are 97% and 86%, respectively when the method was tested on 87 slices.