• Communications of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.435-445
• /
• 2017

Let D be a directed graph with p vertices and q arcs. A vertex out-magic total labeling is a bijection f from $V(D){\cup}A(D){\rightarrow}\{1,2,{\ldots},p+q\}$ with the property that for every $v{\in}V(D)$, $f(v)+\sum_{u{\in}O(v)}f((v,u))=k$, for some constant k. Such a labeling is called a V-super vertex out-magic total labeling (V-SVOMT labeling) if $f(V(D))=\{1,2,3,{\ldots},p\}$. A digraph D is called a V-super vertex out-magic total digraph (V-SVOMT digraph) if D admits a V-SVOMT labeling. In this paper, we provide a method to find the most vital nodes in a network by introducing the above labeling and we study the basic properties of such labelings for digraphs. In particular, we completely solve the problem of finding V-SVOMT labeling of generalized de Bruijn digraphs which are used in the interconnection network topologies.

• Journal of applied mathematics & informatics
• /
• v.40 no.1_2
• /
• pp.117-132
• /
• 2022

Reverse edge magic(REM) labeling of the graph G = (V, E) is a bijection of vertices and edges to a set of numbers from the set, defined by λ : V ∪ E → {1, 2, 3, …, |V| + |E|} with the property that for every xy ∈ E, constant k is the weight of equals to a xy, that is λ(xy) - [λ(x) + λ(x)] = k for some integer k. We given the construction of REM labeling for the Cartesian Product, Unions of Braids and Unions of Triangular Belts. The Kotzig array used in this paper is the 3 × (2r + 1) kotzig array. we test the konow results about REM labelling that are related to the new results we found.

• Journal of applied mathematics & informatics
• /
• v.35 no.1_2
• /
• pp.59-74
• /
• 2017

A radio labeling of a graph G is a function $f:V(G){\rightarrow}\{1,2,{\ldots},k\}$ with the property that ${\mid}f(u)-f(v){\mid}{\geq}1+diam(G)-d(u,v)$ for every pair of vertices $u,v{\in}V(G)$, where diam(G) and d(u, v) are diameter and distance between u and v in the graph G respectively. The radio number of a graph G, denoted by rn(G), is the smallest integer k such that G admits a radio labeling. In this paper, we completely determine radio number of all transformation graphs of a path.

• Nuclear Engineering and Technology
• /
• v.34 no.2
• /
• pp.146-153
• /
• 2002

To radiolabel bioactive molecules, we synthesized $^{99m}$Tc-tricarbonyl precursor, [$^{99m}$Tc(CO)$_3$($H_2O$)$_3$]$^{+}$ with a low oxidation state ( I ). The [$^{99m}$Tc(CO)$_3$($H_2O$)$_3$]$^{+}$ was prepared by low pressure carbonylation (1 atm of CO) of [$^{99m}$Tc $O_4$)]$^{[-10]}$ in the presence of NaB $H_4$ resulting in higher than 98% of labeling yield and stability up to 8 hrs. We evaluated the characteristics of $^{99m}$Tc- tricarbonyl labeled bioactive molecules by carrying out in vitro and in vitro study. Prepared [$^{99m}$Tc(CO)$_3$($H_2O$)$_3$]$^{+}$ was then reacted with some ligands of significance in modem diagnostic nuclear medicine and some amino acids. Labeling yields were checked by HPLC and found to be usually high, excluding $^{99m}$Tc-tricarbonyl-MDP, -EDTMP and -mIBG. And the biodistribution properties of $^{99m}$Tc-tricarbonyl complexes applied in rabbit showed different appearance comparing with that of the $^{99m}$Tc-labeling by conventional means. From these results, we conclude that [$^{99m}$Tc(CO)$_3$($H_2O$)$_3$]$^{+}$ is a potential precursor for development of radiopharmaceuticals, especially for labeling of biomolecules.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.801-804
• /
• 2008

During face recognition process, face detection process is most preceding process. However, face has very high floating property, so the result could be very different according to which method we used. This paper studies about eye detection and eye blinking verification using edge and color information from YCbCr distribution map, segmentation, and labeling methods.

• The Journal of the Korea Contents Association
• /
• v.11 no.12
• /
• pp.511-521
• /
• 2011

As the use of image input and output devices increases, the importance of extracting text area in color images is also increasing. In this paper, in order to extract text area of the images efficiently, we present a text area extraction method for color images based on labeling and gradient difference method. The proposed method first eliminates non-text area using the processes of labeling and filtering. After generating the candidates of text area by using the property that is high gradient difference in text area, text area is extracted using the post-processing of noise removal and text area merging. The benefits of the proposed method are its simplicity and high accuracy that is better than the conventional methods. Experimental results show that precision, recall and inverse ratio of non-text extraction (IRNTE) of the proposed method are 99.59%, 98.65% and 82.30%, respectively.

• Journal of Korea Multimedia Society
• /
• v.3 no.5
• /
• pp.454-460
• /
• 2000

To retrieve complex data such as images, the content-based retrieval method rather than keyword based method is required. In this paper, we implemented a content-based image retrieval system which retrieves object of user query effectively using invariant moments which have invariant properties about linear transformation like position transition, rotation and scaling. To extract the shape feature of objects in an image, we propose a labeling algorithm that extracts objects from an image and apply invariant moments to each object. Hashing method is also applied to reduce a retrieval time and index images effectively. The experimental results demonstrate the high retrieval efficiency i.e precision 85%, recall 23%. Consequently, our retrieval system shows better performance than the conventional system that cannot express the shale of objects exactly.

• YAKHAK HOEJI
• /
• v.30 no.6
• /
• pp.311-316
• /
• 1986

A new UV labeling reagent was developed and used in HPLC for the determination of prostaglandin $E_2$ which have weak UV light-absorbing property. This reagent, 2-bromoacetyltriphenylene, was synthesized by the bromination of 2-acetyltriphenylene which was obtained from triphenylene by Friedel-Crafts reaction. The wave length maximum (${\lambda}_{max}^{CH_3CN}$ of this reagent was 268nm. Prostaglandin E$_2$ was extracted from prostaglandin E$_2$-$\beta$-cyclodextrin using a Sep-pak $C_{18}$ cartridge. The prostaglandin E$_2$ was labeled with 2-bromoacetyl-triphenylene in aectonitrite using 18-crown-6-ether as catalyst. Derivatized prostaglandins were separated on a reversed-phase column (Radial-pak) $\mu$-Bondapak $C_{18}$ using acetonitrile: water=60:40 as mobile phase. The effluent was monitored by UV detector at 254nm filter kit. Linearity of calibration curve was obtained between 30ng and 140ng, and the lower limit of detection was 5ng.

• Journal of Nutrition and Health
• /
• v.30 no.1
• /
• pp.100-108
• /
• 1997

Our current food hygiene law mandates nutrition label (NL) for the special nutrition foods, health support foods, instant foods, and foods with certain nutrient emphasized note, only. Currently more processed foods are bearing nutrition labels though the format is quite inconsistant. This study examined the status on current nutrition labeling practices for the processed foods that are retailed in the supermarket. The obtained information was assessed in the aspects of numerical data presentation on nutrients content, descriptive terms, health claim, and the format. The results are summarized as follows. 1) Foods with NL are limited to the food category specified by current hygiene law while voluntary nutition labeling is few. 2) Descriptive terms such as free, low, and sufficient are not substantiated with quantitative data. The efficacy of microelements which has not been clalified yet are overemphasized but major nutrients are ignored. 3) The regulations for the descriptive terms are set on the base of the nutrient content per 100g or 100ml under current nutrition labeling act. It would mislead consumers thus the definition for these descriptor be better set on the unit of the amount of food customary eaten at one time. For this the standard serving size should be set officially. 4) Quantitative nutrition information given on food products is difficult to compare because of the lack in formality. The title of NL, load and kinds of nutritents, order of nutrients listed, the unit of expression, RDA comparision, and reference RDA are inconsistant among the foods similar in dietary property. Uniform format is needed to give NL the credibility and usefulness. Proividing nutrition information to the consumers with NL is a worldwide practice though its efficacy has been controversial. Under newly legistered health promotion law in Korean nutrition education is esxpected to take part in to improve national nutrition condition and NL would education is expected to take part in to improve national nutrition condition and NL would be a potent tool for public nutritions education. It appears to be the time to mandate NL to all the processed foods in the market. The result of present study would initiate further consumer experiments related to NL. Various interest groups such as food and nutrition professions, public health organizations, government regulatory agencies, food producers and marketers, and consumer groups need to particepate and communicate for the legislation of NL and the development of NL format.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.2
• /
• pp.144-152
• /
• 2011

Most of the models for the vehicle routing problems studied in the literature assumed constant travel times. However, those approaches may give infeasible solutions when traffic congestion causes delays in travel time. To overcome such difficulty, there have been some researches considering the change of the travel time which is called the time dependent vehicle routing problem (TDVRP). TDVRP assumes that the travel time between two locations is not only affected by the distance traveled, but by many other factors including the time of the day. In this paper, we propose a branch-and-price algorithm to solve the TDVRP. The time dependent property of the travel time is dealt with an enumeration scheme with bounding procedures in the column generation procedure identifying a profitable route. The proposed algorithm guarantees the "Non-passing" property to be held in the solutions. The algorithm was tested on problems composed of the Solomon's benchmark instances for 25 and 50 nodes. Computational results are reported.