Chun-Chao Yeh

Learn More
In this paper, we extend previous works on task assignment problems for a set of linear-pipeline tasks over a set of processors. Different from previous works, we revisit the problems with two additional system factors: deadline and energy-consumption, which are key factors in real-time and power-aware computation. For a set of linear-pipelined real-time(More)
Due to Internet, people prefer using emails instead of traditional post mails, because of its simple and easy to use. Meanwhile unsolicited emails (spam) become a serious problem, as sending bulk emails are almost cost free in terms of time and money. Spam not only reduces system performance of mail servers but also annoys mail receivers. Nowadays attacks(More)
Due to fast changing of spam techniques, we argue that multiple spam detection strategies should be developed to effectively against spam. Among many others, (naive) Bayesian filter is one of those being proposed. While there are some early works being done on Bayesian approaches for spam detection, it is unknown if such a simple approach is still effective(More)
This paper presents the design of secure and verifiable P2P card games. An efficient scheme was proposed to achieve secret encoding, distribution, revealing, and verification in a fully distributed way. The proposed card shuffling scheme is based on lightweight operations such as permutation and modular addition. Compared with most of previous approaches(More)
OVSF (Orthogonal Variable Spreading Factor) codes are used as channelization codes in WCDMA system. OVSF codes are getting popular due to his efficiency and flexibility to allocate variable bite rates for different bandwidth requirement of applications. A core design issue of OVSF code allocation schemes is to utilize the codes efficiently such that more(More)
Previous studies have discussed various constrained minimal spanning tree (MST) problems. In this paper, we propose an efficient algorithm for solving a class of constrained MST problems. The proposed PSO (Particle Swarm Optimization)like strategy for solving constrained MST problems identifies optimal MSTs under degree and delay constraints. The solution(More)