Browsing by Author "Chuang, YC"

Now showing 1 - 6 of 6

Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs
(2001-09-28)
Chang, CH
;
Chuang, YC
;
Hsu, LH
;
資訊工程學系
;
Department of Computer Science
It is known that if f is a multiplicative increasing function on N, then either f(n) = 0 for all n is an element of N or f (n) = n(alpha) for some alpha greater than or equal to 0. It is very natural to ask if there are similar results in other algebraic systems. In this paper, we first study the multiplicative increasing functions. over nonnegative square matrices with respect to tensor product and then restrict our result to multidigraphs and loopless multidigraphs. (C) 2001 Elsevier Science B.V. All rights reserved.
Dewatering characteristics of algae-containing alum sludge
(1999-05-01)
Pan, JR
;
Huang, CP
;
Chuang, YC
;
Wu, CC
;
環境工程研究所
The presence of algae in source waters not only causes problems in the water treatment process, but also complicates the treatment and disposal of sludge. This has become a major concern in Taiwan because of the increasing eutrophication of water sources. The purpose of this study was to determine the effects of algae during aging process on the characteristics of potable water treatment residuals and investigate their conditioning in order to provide water treatment plants with guidelines for treating algae-containing sludge. In this study, we measured the bound water content and CST to evaluate the influence of algae and their exudates on sludge conditioning. The change in zeta potential was monitored during sludge aging. During the aging process up to 5 days, the surface charge of sludge became more negative and the dewaterability was enhanced by algal exudates. Microphotographs of the algae-containing sludge suggest that algae and their exudates cause the bio-flocculation phenomenon. (C) 1999 Elsevier Science B.V. All rights reserved.
Enhancing ICP with P2P technology: Cost, availability, and reconfiguration
(2004-07-01)
Yeh, PJ
;
Chuang, YC
;
Yuan, SM
;
資訊工程學系
;
Department of Computer Science
Traditional Web cache servers based on HTTP and ICP infrastructure tend to have higher hardware and management cost, have difficulty in availability, automatic and dynamic reconfiguration, and may have slow links to some users. We find that peer-to-peer technology can help solve these problems. The peer cache service (PCS) we proposed here leverages each peer's local cache, similar access patterns, fully distributed coordination, and fast communication channels to enhance response time, scale of cacheable objects, and availability. Moreover, incorporating goals and strategies such as making the protocol lightweight and mutually compatible with existing cache infrastructure, supporting mobile devices, undertaking dynamic three-level caching, and exchanging cache meta-information further improve the effectiveness and differentiate our work from other similar-at-first-glance P2P Web cache systems.
On the fault-tolerant Hamiltonicity of faulty crossed cubes
(2002-06-01)
Huang, WT
;
Chuang, YC
;
Tan, JJM
;
Hsu, LH
;
資訊工程學系
An n-dimensional crossed cube, CQ(n), is a variation of the hypercube. In this paper, we prove that CQ(n) is (n-2)-Hamiltonian and (n-3)-Hamiltonian connected. That is, a ring of length 2(n)-f(v) can be embedded in a faulty CQ(n) with f(v) faulty nodes and f(e) faulty edges, where f(v)+f(e) less than or equal to n-2 and n greater than or equal to 3. In other words, we show that the faulty CQ(n) is still Hamiltonian with n-2 faults. In addition, we also prove that there exists a Hamiltonian path between any pair of vertices in a faulty CQ(n) with n-3 faults. The above results are optimum in the sense that the fault-tolerant Hamiltonicity (fault-tolerant Hamiltonian connectivity respectively) Of CQ(n) is at most n-2 (n-3 respectively). A recent result has shown that a ring of length 2(n)-2f(v) can be embedded in a faulty hypercube, if f(v)+f(e) less than or equal to n-1 and n greater than or equal to 4, with a few additional constraints [17]. Our results, in comparison to the hypercube, show that longer rings can be embedded in CQ(n) without additional constraints.
Optimal 1-edge fault-tolerant designs for ladders
(2002-10-31)
Chuang, YC
;
Hsu, LH
;
Chang, CH
;
資訊工程學系
;
Department of Computer Science
A graph G* is 1-edge fault-tolerant with respect to a graph G, denoted by 1-EFT(G), if every graph obtained by removing any edge from G* contains G. A1-EFT(G) graph is optimal if it contains the minimum number of edges among all 1-EFT(G) graphs. The kth ladder graph, L-k, is defined to be the cartesian product of the P-k and P-2 where P-n is the n-vertex path graph. In this paper, we present several 1-edge fault-tolerant graphs with respect to ladders. Some of these graphs are proven to be optimal. (C) 2002 Elsevier Science B.V. All rights reserved.
Place, identity, and social movements: Shequ and neighborhood organizing in Taipei city
(2005-09-01)
Chuang, YC
;
客家文化學院
;
College of Hakka Studies