http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
RADIO LABELING AND RADIO NUMBER FOR GENERALIZED CATERPILLAR GRAPHS
NAZEER, SAIMA,KHAN, M. SAQIB,KOUSAR, IMRANA,NAZEER, WAQAS The Korean Society for Computational and Applied M 2016 Journal of applied mathematics & informatics Vol.34 No.5
A Radio labeling of the graph G is a function g from the vertex set V (G) of G to ℤ<sup>+</sup> such that |g(u) - g(v)| ≥ diam(G) + 1 - d<sub>G</sub>(u, v), where diam(G) and d(u, v) are diameter and distance between u and v in graph G respectively. The radio number rn(G) of G is the smallest number k such that G has radio labeling with max{g(v) : v ∈ V(G)} = k. We investigate radio number for some families of generalized caterpillar graphs.
RADIO AND RADIO ANTIPODAL LABELINGS FOR CIRCULANT GRAPHS G(4k + 2; {1, 2})
Nazeer, Saima,Kousar, Imrana,Nazeer, Waqas The Korean Society for Computational and Applied M 2015 Journal of applied mathematics & informatics Vol.33 No.1
A radio k-labeling f of a graph G is a function f from V (G) to $Z^+{\cup}\{0\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}k+1$ for every two distinct vertices x and y of G, where d(x, y) is the distance between any two vertices $x,y{\in}G$. The span of a radio k-labeling f is denoted by sp(f) and defined as max$\{{\mid}f(x)-f(y){\mid}:x,y{\in}V(G)\}$. The radio k-labeling is a radio labeling when k = diam(G). In other words, a radio labeling is an injective function $f:V(G){\rightarrow}Z^+{\cup}\{0\}$ such that $${\mid}f(x)=f(y){\mid}{\geq}diam(G)+1-d(x,y)$$ for any pair of vertices $x,y{\in}G$. The radio number of G denoted by rn(G), is the lowest span taken over all radio labelings of the graph. When k = diam(G) - 1, a radio k-labeling is called a radio antipodal labeling. An antipodal labeling for a graph G is a function $f:V(G){\rightarrow}\{0,1,2,{\ldots}\}$ such that $d(x,y)+{\mid}f(x)-f(y){\mid}{\geq}diam(G)$ holds for all $x,y{\in}G$. The radio antipodal number for G denoted by an(G), is the minimum span of an antipodal labeling admitted by G. In this paper, we investigate the exact value of the radio number and radio antipodal number for the circulant graphs G(4k + 2; {1, 2}).
Radio and Radio Antipodal Labelings For Circulant Graphs
Saima Nazeer,Imrana Kousar,Waqas Nazeer 한국전산응용수학회 2015 Journal of applied mathematics & informatics Vol.33 No.1
A radio $k$-labeling $f$ of a graph $G$ is a function $f$ from $V(G)$ to $Z^{+}\cup\{0\}$ such that$d(x,y)+|f(x)-f(y)|\geq k+1$ for every two distinct vertices $x$ and $y$ of $G$, where $d(x,y)$ is the distance between any two vertices $x, y\in G$. The span of a radio $k$-labeling $f$ is denoted by $sp(f)$ and defined as max$\{|f(x)-f(y)|: x,y\in V(G)\}$. The radio $k$-labeling is a radio labeling when$k=\text{diam}(G)$. In other words, a radio labeling is an injective function $f:V(G)\rightarrow Z^{+}\cup\{0\}$ such that$$|f(x)-f(y)|\geq \text{diam}(G)+1-d(x,y)$$ for any pair of vertices $x, y \in G$. The radio number of $G$denoted by rn$(G)$, is the lowest span taken over all radio labelings of the graph. When $k=\text{diam}(G)-1$, a radio $k$- labeling is called a radioantipodal labeling. An antipodal labeling for a graph $G$ is a function $f:V(G)\rightarrow\{0, 1, 2, ...\}$such that $d(x,y)+|f(x)-f(y)|\geq \text{diam}(G)$ holds for all $x,y\in G$. The radio antipodal number for $G$ denoted by an$(G)$, is the minimum span of an antipodal labeling admitted by $G$. In this paper, we investigate the exact value of the radio number and radio antipodal number for thecirculant graphs $G(4k+2;\{1,2\})$.
Radio labeling and Radio Number For Generalized Caterpillar Graphs
Saima Nazeer,M. Saqib Khan,Imrana Kausar,Waqas Nazeer 한국전산응용수학회 2016 Journal of applied mathematics & informatics Vol.34 No.5
A Radio labeling of the graph $G$ is a function $g$ from the vertex set $V(G)$ of $G$ to $\mathbb{Z}^{+}$ such that $|g(u)-g(v)|\geq\text{diam}(G)+1-d_G(u,v)$, where diam$(G)$ and $d(u,v)$ are diameter and distance between $u$ and $v$ in graph $G$ respectively. The radio number rn$(G)$ of $G$ is the smallest number $k$ such that $G$ has radio labeling with max$\{g(v):v\in V(G)\}=k$. We investigate radio number for some families of generalized caterpillar graphs.
Nazeer, Malik M.,Khan, M. Afzal,Haq, A-Ul Techno-Press 2003 Structural Engineering and Mechanics, An Int'l Jou Vol.16 No.1
The nonlinear dependence aspect of various conical tool indentation parameters leading to an optimum tool semi angle value for easiest perforation is plotted and discussed explicitly in this work with the conclusion that tool angle has an optimum response towards most of the indentation parameters. Around this optimum angle, the aluminium sheets showed minimum fracture toughness as well as minimum work input to overcome the offered resistance. At the end, the mechanism leading to this phenomenon is presented with the conclusion that plastic flow dominates as the dimple semi cone angle reaches 35 and both pre and post plastic flow perforations lead the tool semi cone angle value towards this dimple cone semi angle of plastic flow initiation for its optimum performance. It is also concluded that specimen material failure is solely under tensile hoop stress and hence results into radial cracks initiation and propagation.
NAZEER, WAQAS,MUNIR, MOBEEN,NIZAMI, ABDUL RAUF,KAUSAR, SAMINA,KANG, SHIN MIN The Korean Society for Computational and Applied M 2017 Journal of applied mathematics & informatics Vol.35 No.3
In this note we establish a new non-convex hybrid iteration algorithm corresponding to Khan iterative process [4] and prove strong convergence theorems of common fixed points for a uniformly closed asymptotically family of countable quasi-Lipschitz mappings in Hilbert spaces. Moreover, the main results are applied to get the common fixed points of finite family of quasi-asymptotically nonexpansive mappings. The results presented in this article are interesting extensions of some current results.
Nazeer Abdul Azeez,Udhayakumar Sreelakshmi,Mani Saranpriya,Dhanapal Mothilal,Vijaykumar Sudarshana Deepa 나노기술연구협의회 2018 Nano Convergence Vol.5 No.23
Surface modification of nanoparticles for biological applications is receiving enormous interest among the research community due to the ability to alchemy the toxic nanoparticles into biocompatible compounds. In this study, the agrowastes of Moringa oleifera and Coriandrum sativum were used to surface modify the magnesium oxide nanoparticles and ferric oxide nanoparticles respectively. The agrowaste amended magnesium oxide nano particles (AMNP) and agrowaste amended ferric oxide nanoparticles (AFNP) were characterized using scanning electron microscope, X-ray diffractometer, Fourier transformed-infra red spectroscope to justify the formation and surface modification of nanoparticles with the organic functional groups from the agro wastes. The surface modified nano particles were tested for their biocompatibility and ability to treat the chlorosis in Glycine max. On comparison between the two metal based nanoparticles, AMNP exhibited better chlorosis treating ability than the AFNP. Both the nano particles showed increased potency at minimal amount, 30 μg and the higher concentrations till 125 μg exhibited down run of the potency which was again enhanced from 250 μg of nanoparticle treatment to plants. Further the surface modified nanoparticles were assessed for biocompatibility on human embryonic kidney (HEK-293) cell line which proved that the cell lines are non-toxic to normal human cells. The size of the particles and the concentration is suggested to be responsible for the effective chlorosis treatment and the organic functional groups responsible for the reduction of toxicity of the particles to the plants.
Real-Time Implementation of Human Detection in Thermal Imagery Based on CNN
Nazeer Shahid,유광현,Tan Dat Trinh,신도성,김진영 한국정보기술학회 2019 한국정보기술학회논문지 Vol.17 No.1
In this paper, an effective human detection method in thermal imaging is proposed using background modeling and convolution neural network(CNN). For real-time implementation, the background modeling is done by modified running Gaussian average and the CNN-based human classification is performed for only detected foreground objects. To enhance human detection accuracy, morphological operators and ellipse testing are adopted to extract Region of Interest. Also, three CNN models with different input sizes and voting method are trained using our own dataset. For real-time system, the whole system is implemented in C++ and it process more than 30 fps with high accuracy.
Waqas Nazeer,Mobeen Munir,Abdul Rauf Nizami,Samina Kausar,강신민 한국전산응용수학회 2017 Journal of applied mathematics & informatics Vol.35 No.3
In this note we establish a new non-convex hybrid iteration algorithm corresponding to Khan iterative process [4] and prove strong convergence theorems of common fixed points for a uniformly closed asymptotically family of countable quasi-Lipschitz mappings in Hilbert spaces. Moreover, the main results are applied to get the common fixed points of finite family of quasi-asymptotically nonexpansive mappings. The results presented in this article are interesting extensions of some current results.