DSpace community: 李家同 (1993-1994) http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/79568 http://www.nthu.edu.tw/intro/aboutnthu2-p8.php The community's search engine Search the Channel s http://nthur.lib.nthu.edu.tw/dspace/simple-search Voronoi Diagrams of Moving Points in the Plane http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80755 title: Voronoi Diagrams of Moving Points in the Plane abstract: In this paper, we consider the dynamic Voronoi diagram problem. In this problem, a given set of planar points are moving and our objective is to find the Voronoi diagram of these moving points at any time t. A preprocessing algorithm and a query processing algorithm are presented in this paper. Assume that the points are in k-motion, and it takes O(k) time to find the roots of a polynomial with degree O(k). The preprocessing algorithm uses O(k2n3logn⋅2O(α(n)5k+1)) time to process moving functions of given points, and uses O(k2n3⋅2O(α(n)5k+1)) space to store the preprocessing result where α(n) is the functional inverse of Ackermann's function. The query processing algorithm is designed to report the Voronoi diagram of these points for a query time t. It takes O(n) time which is optimal. <br> The Specialization of Programs by Theorem Proving http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80756 title: The Specialization of Programs by Theorem Proving abstract: Suppose a program P is written to accept a set of inputs I. If we are only interested in a nonempty subset \$I^ * \$ of I, we usually can simplify P to another program \$P^ * \$ such that \$P^ * \$ runs faster on \$I^ * \$ than P does. The problem of specialization is to find such \$P^ * \$. In this paper, the program P and the input \$I^ * \$ will be specified by axioms. Using these axioms, we can obtain \$P^ * \$ from P through theorem-proving techniques. <br> An Algorithm to Generate Prime Implicants and Its Applications to the Selection Problem http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80757 title: An Algorithm to Generate Prime Implicants and Its Applications to the Selection Problem abstract: In this paper, the algorithm to generate prime implicants presented in Ref. 5 is extended to a new algorithm. The new algorithm does not require the Boolean function to be in conjunctive normal form and is complete in the sense that it generates all the prime implicants. The author also shows that this new algorithm can be used to efficiently solve the selection problem . By using this algorithm, the original selection problem can be solved by a branch-and-bound approach which avoids an exhaustive search of the solution space and reduces the amount of necessary calculations. <br> Fuzzy Logic and the Resolution Principle http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80758 title: Fuzzy Logic and the Resolution Principle abstract: The relationship between fuzzy logic and two-valued logic in the context of the first order predicate calctflus is discussed. It is proved that if every clause in a set of clauses is somethblg more than a &quot;half-truth&quot; and the most reliable clause has truth-value a and the most unreliable clause has truth-value b, then we are guaranteed that all the logical con- sequences obtained by repeatedly applying the resolution principle will have truth-value between a and b. The significance of this theorem is also discussed. <br>