Entity

Time filter

Source Type

Taichung, Taiwan

Chaoyang University of Technology is a university in Wufeng District, Taichung, Taiwan. Founded in 1994. Originally named Chaoyang Institute of Technology. In 1997, CYUT was designated by the Ministry of Education as a University of Technology, the highest level in the technological and vocational education system within the R.O.C.Currently, the University comprises 5 colleges and 22 departments, which offer 19 master's programs and 5 doctoral programs. The number of students currently enrollment is around 17,000, and the faculty and staff is about 1,000 in total. CYUT’s excellent teachers and facilities have been readily receiving recognition. With its goal of becoming a large type of institution of higher learning. Wikipedia.


Chiu S.W.,Chaoyang University of Technology
Computers and Operations Research | Year: 2010

This study is concerned with robust planning in optimization, specifically in determining the optimal run time for production system that is subject to random breakdowns under abort/resume (AR) control policy and failure in rework. In most real-life production processes, generation of defective items and breakdowns of manufacturing equipment are inevitable. In this study, random defective rate is assumed and all manufactured items are screened. The perfect quality, reworkable and scrap items are identified and separated; failure-in-rework is assumed. The system is also subject to random machine breakdown; and when it occurs, the AR policy is adopted. Under such policy, the production of the interrupted lot will be immediately resumed when the machine is restored. Mathematical modeling and derivation of the production-inventory cost functions for both systems with/without breakdowns are presented. The renewal reward theorem is used to cope with the variable cycle length when integrating cost functions. The long-run average cost per unit time is obtained. Theorems on convexity and on bounds of production run time are proposed and proved. A recursive searching algorithm is developed for locating the optimal run time that minimizes the expected production-inventory costs. A numerical example with sensitivity analysis is provided to give insight into the optimal operational control of such an unreliable system. © 2009 Elsevier Ltd. All rights reserved.


Hsieh F.-S.,Chaoyang University of Technology
Decision Support Systems | Year: 2010

Recently, researchers have proposed decision support tool for generating suggestions for bids in combinatorial reverse auction based on disclosure of bids. An interesting issue is to design an effective mechanism to guide the bidders to collectively minimize the overall cost without explicitly disclosing the bids. We consider a winner determination problem for combinatorial reverse auction and study how to support the bidders' decisions without explicitly disclosing the bids of others. We propose an information revelation scheme for a buyer to guide the sellers to generate potential winning bids to minimize the overall cost. The main results include: (1) a problem formulation for the combinatorial reverse auction problem; (2) a solution methodology based on Lagrangian relaxation; (3) a scheme to guide the sellers to generate potential winning bids for the bidders in multi-round combinatorial reverse auctions based on revelation of Lagrangian multipliers; (4) a heuristic algorithm for finding a near-optimal feasible solution and (5) results and analysis of our solution algorithms. © 2009 Elsevier B.V. All rights reserved.


Chen L.-H.,Chaoyang University of Technology
Computers and Education | Year: 2010

To consider how Web-based learning program is utilized by learners with different cognitive styles, this study presents a Web-based learning system (WBLS) and analyzes learners' browsing data recorded in the log file to identify how learners' cognitive styles and learning behavior are related. In order to develop an adapted WBLS, this study also proposes a design model for system designers to tailor the preferences linked with each cognitive style. The samples comprise 105 third-grade Accounting Information System course students from a technology university in central Taiwan. Analytical results demonstrate that learners with different cognitive styles have similar but linear learning approaches, and learners with different cognitive styles adopt different navigation tools to process learning. © 2009 Elsevier Ltd. All rights reserved.


Ko H.-C.,Chaoyang University of Technology
Electronic Commerce Research and Applications | Year: 2013

The popularity and growth of social networking sites (SNSs) have resulted in fierce competition among SNS providers. A critical concern of SNSs is to identify how to have users continuously use a specific SNS. This study examines the determinants of journal-type bloggers' continuous self-disclosure. An analysis of 283 samples with continuous self-disclosure experiences in journal-type blogs shows that personal factors, specifically the habit of self-disclosure, are the major factors affecting bloggers' continuous self-disclosure, followed by self-benefits. In contrast, social factors, such as positive audience feedback and social benefits, are not related to continuous self-disclosure. These results suggest that SNS providers must encourage users to develop the habit of using their web sites regularly. By providing differential benefits to users, SNS providers may attract users to continuously use their services. © 2012 Elsevier B.V. All rights reserved.


Hung R.-W.,Chaoyang University of Technology
Theoretical Computer Science | Year: 2011

The n-dimensional hypercube network Qn is one of the most popular interconnection networks since it has simple structure and is easy to implement. The n-dimensional locally twisted cube LTQn, an important variation of the hypercube, has the same number of nodes and the same number of connections per node as Qn. One advantage of LTQn is that the diameter is only about half of the diameter of Qn. Recently, some interesting properties of LTQn have been investigated in the literature. The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the interconnection network. The existence of two edge-disjoint Hamiltonian cycles in locally twisted cubes has remained unknown. In this paper, we prove that the locally twisted cube LTQ n with n≥4 contains two edge-disjoint Hamiltonian cycles. Based on the proof of existence, we further provide an O(n2n)-linear time algorithm to construct two edge-disjoint Hamiltonian cycles in an n-dimensional locally twisted cube LTQn with n≥4, where LTQn contains 2n nodes and n2n-1 edges. © 2011 Elsevier B.V. All rights reserved.

Discover hidden collaborations