Entity

Time filter

Source Type


Wu R.-Y.,Lunghwa University of Science and Technology | Chang J.-M.,Institute of Information and Decision science | Chang C.-H.,Lunghwa University of Science and Technology
Mathematical and Computer Modelling | Year: 2011

Ordered trees are called non-regular trees with a prescribed branching sequence (or non-regular trees for short) if their internal nodes have a pre-specified degree sequence in preorder list. This article presents two main results. First, we develop a simple algorithm to generate all non-regular trees in lexicographic order using RD-sequences defined by [R.-Y. Wu, J.-M. Chang, Y.-L. Wang, Loopless generation of non-regular trees with a prescribed branching sequence, The Computer Journal 53 (2010) 661-666]. Then, by analyzing the structure of a coding tree, this algorithm is proved to run in constant amortized time. Next, we propose efficient ranking algorithm (i.e., determining the rank of a given non-regular tree in such an order) and unranking algorithm (i.e., converting a positive integer to its corresponding RD-sequence). © 2010 Elsevier Ltd. Source


Wang K.-H.,Asia University, Taiwan | Yang D.-Y.,Institute of Information and Decision science | Pearn W.L.,National Chiao Tung University
International Journal of Innovative Computing, Information and Control | Year: 2012

We consider a randomized policy to control the M/G/1 queueing system with an unreliable server, second optional service and general startup times. The server is subject to breaking down according to a Poisson process, and the repair time obeys a general distribution. All arrived customers demand the first required service, and only some of the arrived customers demand the second optional service. After all the customers are served in the system, the server immediately takes a vacation and operates the (T, p)-policy. For this queueing system, we employ maximum entropy approach with several constraints to develop the probability distributions of the system size and the expected waiting time in the queue. Based on the accuracy comparison between the exact and approximate methods, we show that the maximum entropy approach is quite accurate for practical purpose, which is a useful method for solving complex queueing systems. © 2012 ISSN 1349-4198. Source


Wu Y.-W.,National Taiwan University | Lin W.-Y.,National Taiwan University | Wang H.-L.,Institute of Information and Decision science | Chao K.-M.,National Taiwan University
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013

We consider an extension of the popular matching problem: the popular condensation problem. An instance of the popular matching problem consists of a set of applicants A and a set of posts P. Each applicant has a strictly ordered preference list, which is a sequence of posts in order of his/her preference. A matching M mapping from A to P is popular if there is no other matching M′ such that more applicants prefer M′ to M than prefer M to M′. Although some efficient algorithms have been proposed for finding a popular matching, a popular matching may not exist for those instances where the competition of some applicants cannot be resolved. The popular condensation problem is to find a popular matching with the minimum number of applicants whose preferences are neglected, that is, to optimally condense the instance to admit a local popular matching. We show that the problem can be solved in O(n + m) time, where n is the number of applicants and posts, and m is the total length of the preference lists. © 2013 Springer-Verlag. Source


Yang D.-Y.,Institute of Information and Decision science | Wang K.-H.,Providence University
Journal of Industrial and Production Engineering | Year: 2013

This paper considers two randomized control policies. One is (p, F)-policy queue which deals with the issue of randomized controlling arrivals to a queueing system and the server requires a start-up time before allowing customers to enter the system. Another is (q, N)-policy queue which considers the common issue of controlling service in a queueing system randomly, and the server requires a start-up time before providing service. The steady-state probability distribution of the system size and system performances measures are developed for both queues. In addition, we uncover an interrelationship between the (p, F)- and (q, N)-policy M/M/1/K queues by a series of propositions. The advantage created through interrelationship is that the solution of one queue has been derived, which assists us in obtaining that of the other queue easily. Finally, numerical results are presented for illustration purposes. © 2013 Chinese Institute of Industrial Engineers. Source


Wang Y.-F.,Institute of Information and Decision science | Chang M.-Y.,Chang Gung Memorial Hospital | Chiang R.-D.,Tamkang University | Hwang L.-J.,Tamkang University | And 2 more authors.
Journal of Medical Systems | Year: 2013

Ultrasound guided aspiration of ovarian endometrioma had been tried as an alternative therapeutic modality in patients whose desire to avoid surgery or surgical approach is contraindicated since 1991. Cyst puncture can reduce tumor volume and destruct the cyst wall, alleviate sticking circumstances and enhance the chance of recovery. But simple aspiration without other treatments results in high recurrence rate (28.5 % to 100 %). In order to reduce recurrence after aspiration, ultrasound-guided aspiration with instillation of tetracycline, methotrexate, and recombinant interleukin-2 has been combined and proven to be effective with the recurrence rates of 46.9 %, 18.1 %, and 40 % respectively. Noma et al. (2001) reported that conduct of ethanol instillation for more than 10 min particularly for a case with a single endometrial cyst is considered most effective from the standpoint of recurrence (14.9 %). Our goal is to analyze patients with recurrent pelvic cyst who underwent surgical intervention. The research data are based on clinical diagnosis, symptoms and medical intervention classification, and the cyst numbers are defined as forecast project target. The decision tree, methodology of data mining technology, is used to find the meaningful characteristic as well as each other mutually connection. The experimental result can help the clinical faculty doctors to better diagnose and provide treatment reference for future patients. © 2013 Springer Science+Business Media New York. Source

Discover hidden collaborations