Ming-Ju Lee's research while affiliated with Jen-Teh Junior College Of Medicine, Nursing And Management and other places

Publications (19)

Article
The objective of this study was to evaluate ultra high performance concrete (UHPC) as a precast product material containing portland type II cement, quartz powder, silica fume, silica sand, steel fiber, superplasticizer, water, and a specific amount of incinerator fly ash (IFA). The UHPC mixes containing different volumes of IFA were evaluated to f...
Conference Paper
Portland cement concrete pervious pavement is a unique and effective means to address important environmental issues and support green sustainable growth. The main purpose of this study is to evaluate the performance of Portland cement concrete pervious pavement in Puli office building project. The three experiments included in this study are: (1)...
Article
This study investigates the effects of steam and microwave curing on concretes containing fly ash, blast-furnace slag, or silica fume. Two steam curing treatments, four microwave curing times, and four types of concrete mix were used in this study. The test results indicated that microwave heating could further increase the compressive strength of...
Conference Paper
In this study, cement mortar and concrete were used to investigate some accelerated curing on the strength and chloride electrical penetration of concrete. To evaluate some rapid testing procedures that could run a series of tests within one day to attain an estimate of the 28-day strength of the concrete, specimens with microwave heating in differ...
Article
The star arboricity of a graph G is the minimum number of star forests which are needed to decompose the edges of G. For integers 1 ≤ d ≤ n, let Cn,d be the graph with vertex set {a0, ..., an-1, b0, ..., bn-1} and edge set {aibj : i = 0, ···, n - 1; j ≡ i + 1, ···, i + d (mod n)}. We call Cn,d a crown. In this paper, we investigate the lower bound...
Article
A graph G(V, E) with order p and size q is called (a,d)-edge-antimagic total if there exists a bijective function f: V(G) {n-ary union} E(G)→{1, 2,..., p + q} such that the edge-weights λf(uv) = f(u) + f(v) + f(uv), uv{small element of} E(G), form an arithmetic sequence with first term a and common difference d. Such a labeling is called super if t...
Article
In this paper, we introduce the concept of ω -almost convergent sequences. Such a definition is a weak form of almost convergent sequences given by G. G. Lorentz in [Acta Math., Vol. 80 (1948), pp. 167–190]. We give Cauchy criterions for w -almost convergence and characterize ω -almost convergent double sequences in Lp(T2) in terms of Fourier coeff...
Article
Full-text available
In this study, ultra high performance concrete (UHPC) was used to investigate the effect of UHPC and its precast product by the severe freeze-thaw testing. The UHPC to be used as a precast product material contains a large amount of cement and cementitious materials, a large amount of superplasticizer, and a very small amount of water. The UHPC mix...
Conference Paper
Pervious concrete pavement is an effective means to address important environmental issues and support green and sustainable growth. By capturing storm water and allowing it to seep into the ground, pervious concrete is instrumental in recharging groundwater, reducing storm water runoff, and meeting U.S. Environmental Protection Agency storm water...
Article
A total labeling of a graph G is an assignment of integers 1,2,⋯,|V(G)|+|E(G)| to vertices and edges of G. In this paper, we present two results on the total labeling of the grid P m □P n (m,n≥2). The first result is about magic total labeling (a notion involving constant sum). We prove that P m □P n (m,n≥2) is C 4 -supermagic. This settles an open...
Article
A graph G(V, E) with order p and size q is called (a, d)-edge-antimagic total labeling graph if there exists a bijective function f : V(G) boolean OR E(G) -> {1, 2, ... , p+q} such that the edge-weights lambda(f) (uv) = f (u)+ f (v)+ f (uv), uv is an element of E(G), form an arithmetic sequence with first term a and common difference d. Such a labe...
Article
A graph G(V,E) with order p and size q is called (a,d)-edge-antimagic total labeling graph if there exists a bijective function fV(G)∪E(G)→{1,2,⋯,p+q} such that the edge-weights λ f (uv)=f(u)+f(v)+f(uv), uv∈E(G), form an arithmetic sequence with the first term a and the common difference d. Such a labeling is called super if the p smallest possible...
Article
We prove that the power of cycles C n 2 for odd n are antimagic. We provide explicit constructions to demonstrate all power of cycles C n 2 for odd n are antimagic and its vertex sums form a set of successive integers.
Article
In this paper, we introduce the concept of w -almost convergent sequences. Such a definition is a weak form of almost convergent sequences given by G. G. Lorentz in [Acta Math., Vol. 80 (1948), pp. 167-190]. We give Cauchy criterions for w -almost convergence and characterize w -almost convergent double sequences in Lp(T2) in terms of Fourier coeff...
Article
An antimagic labeling of a finite simple graph with m edges and n vertices is a bijection from the set of edges to the set of integers 1, 2,…, m such that all n vertices sums are pairwise distinct, where the vertex sum of a vertex v is the sum of labels of all edges incident with the vertex v. An graph is called antimagic if it has an antimagic lab...
Article
For positive integers k≤n, the crown C n,k is the graph with vertex set {a 0 ,a 1 ,⋯,a n-1 ,b 0 ,b 1 ,⋯,b n-1 } and edge set {a i b j 0≤i≤n-1,j=i+1,i+2,⋯,i+k(modn)}. A caterpillar is a tree of order at least three which contains a path such that each vertex not on the path is adjacent to a vertex on the path. Being a connected bipartite graph, a ca...
Article
The isomorphic path decompositions of λ-fold balanced complete tripartite graphs λK n,n,n and λ-fold balanced complete tripartite digraphs λK n,n,n * are investigated for odd n. We prove that the obvious necessary conditions for such decompositions in the undirected case are also sufficient; we also provide sufficient conditions for the directed ca...
Article
In this paper, the isomorphic path decompositions of A-fold balanced complete tripartite graphs lambda K(n,n,n) and lambda-fold balanced complete tripartite digraphs lambda K(n,n,n)(star) are investigated for odd n. We prove that the obvious necessary conditions for such decompositions in the undirected case are also sufficient; we also provide suf...
Article
The star arboricity sa(G) of a graph G is the minimum number of star forests which are needed to decompose all edges of G. For integers k and n, 1≤k≤n, the crown C n,k is the graph with vertex set {a 0 ,a 1 ,⋯,a n-1 ,b 0 ,b 1 ,⋯,b n-1 } and edge set {a i b j i=0,1,⋯,n-1;j≡i+1,i+2,⋯,i+k(modn)}. In [Ars Comb. 66, 33–48 (2003; Zbl 1073.05563)], C. Lin...

Citations

... 4 Several research projects have explored the possible use of MSW-BA in road pavements, in full or partial replacement of natural aggregates and mineral filler in asphalt mixtures and cement concrete, focusing on either performance properties or environmental features. [5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23] It has been shown that the optimum percentage of MSW-BA employed for aggregate substitution can vary widely (ranging from 10 to 75 % by the total weight of dried aggregates) and seems to depend upon several factors such as the physicochemical treatment that MSW-BA has been subjected to, its chemical composition, and the pavement layer in which it is included. [24][25][26][27][28][29][30][31][32][33][34][35][36][37][38][39][40] The mechanical behavior of asphalt mixtures was found to be significantly affected by the type and amount of employed MSW-BA. ...
... The existence of EAT labeling for d = 4 was proved in [85], see Theorem 6.3.56, i.e., the graph kP 2 Other results on super (a, d)-EAT labelings of certain families of connected graphs can be found in [169,170,171,173,213,214,254,266,285]. ...
Reference: Conclusion
... In recent years, the utilization of advanced chemical admixtures and fibers; specialized aggregates with excellent packing density; very high binder content; low water-to-cementitious materials ratio; and customized mixing and curing has led to the development of ultra-high performance concrete (UHPC) [1][2][3][4][5][6][7][8]. According to ACI 239R [9], ''Ultra-high performance concrete (UHPC) is a class of advanced cementitious materials with greater strength, tensile ductility, and durability properties when compared to conven-tional or even high-performance concrete. ...
... Without sacrificing long-term strength, the early strength is significantly improved. When microwave curing for 30 min, the internal temperature distribution is relatively uniform, and The concrete did not develop a strength gradient [95]; Lee [96] thinks that the curing time with uniform internal temperature is 40 min Fig. 7 shows the temperature change over time under microwave curing conditions of cement paste with different water cement ratios. ...
... Permeable concrete pavements such as pervious concrete have also been reported to remove heavy metals from infiltrating water without the danger of mobilization [7].The alkalinity in concrete raises the pH of infiltrating water, which may cause most heavy metals to precipitate as metal hydroxides and remain in or around the concrete layer or in the base material [7]. Pervious concrete systems were reported to have reduced the amount of total nitrogen by 37-95 percent as well as reduce the total phosphorous by 66-95 percent [11]. ...
... The existence of EAT labeling for d = 4 was proved in [85], see Theorem 6.3.56, i.e., the graph kP 2 Other results on super (a, d)-EAT labelings of certain families of connected graphs can be found in [169,170,171,173,213,214,254,266,285]. ...
Reference: Conclusion
... -decompositions of graphs have been a popular topic of research in graph theory. Articles of interest include [1][2][3][4][5][6][7][8][9][10][11]. The reader can refer to [12] for an excellent survey of this topic. ...
... The existence of EAT labeling for d = 4 was proved in [85], see Theorem 6.3.56, i.e., the graph kP 2 Other results on super (a, d)-EAT labelings of certain families of connected graphs can be found in [169,170,171,173,213,214,254,266,285]. ...
Reference: Conclusion
... Conjecture A: All connected graphs, except for K 2 , are antimagic. Although many types of connected graphs have been verified to be antimagic in recent decades [1][2][3][4][5][6][7][8][9][10][11][12][13][14], Conjecture A remains open. As an extension, we study the antimagicness of disconnected graphs. ...