No abstract

No abstract

No abstract

On purpose to develop network-based engineering education, we produce a new ISP (In System Programming) tool that is capable of remotely designing, debugging or upgrading digital systems and products made of PLD by PSTN. The students can do all digital design and research work at home or anywhere as long as they have a telephone at hand. This tool can be used by schools or universities, where the courses of Digital Logic Circuits or Digital System Design are learned.

The unicost set covering problem and the attribute reduction problem are NP-complete problems. In this paper, the relationship between these two problems are discussed. Based on the transformability between attribute reductions and minimal solutions in unicost set covering models, two methods are provided. One is to induce an information table from a given unicost set covering model. With no doubt, it shows that the unicost set covering problem can be investigated by rough set theory. The other is to induce a unicost set covering model from a given information table. Similarly, it shows that the attribute reduction problem can be studied by set covering theory. As an application of the proposed theoretical results, a rough set heuristic algorithm is presented for the unicost set covering problem.