• 대한수학회논문집
• /
• 제32권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
• /
• 제40권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
• /
• 제35권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
• /
• 제34권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.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2008년도 춘계종합학술대회 A
• /
• pp.801-804
• /
• 2008

얼굴 추출 과정은 얼굴 인식 과정의 가장 선행되는 과정이라고 할 수 있다. 하지만 얼굴이라는 객체는 매우 고유동적인 성격을 가지고 있어서 접근하는 방법을 어떻게 하느냐에 따라서 그 결과가 매우 달라지는 경우가 많다. 본 논문은 배경 속에 들어가 있는 얼굴이라는 객체를 CbCr 분포 맵에 기반을 둔 색상 정보와 세그멘테이션, 레이블링을 통해 추출, 색상 정보와 에지 정보를 이용하여 눈 영역을 검출하고 개폐 여부를 검증하는 알고리즘을 수행하였다.

• 한국콘텐츠학회논문지
• /
• 제11권12호
• /
• pp.511-521
• /
• 2011

영상 입출력 장치 사용이 증가함에 따라 컬러영상 내 문자영역 추출의 중요성 또한 높아지고 있다. 본 논문은 이러한 영상 내 문자영역을 효과적으로 추출하기 위해 레이블링 기법과 화소 단위의 밝기값 변화에 기반한 문자영역 추출 방법을 제안한다. 제안하는 방법은 레이블링 및 필터링 과정을 통해 비문자 영역을 미리 제거하고, 밝기값의 변화가 큰 문자영역의 특성을 이용하여 문자영역 후보군을 추출한 후 노이즈 제거 및 문자영역 병합의 후처리 과정을 통해 문자영역을 추출한다. 제안한 방법의 강점은 기존 방법보다 단순하면서도 높은 정확성에 있다. 실험 결과 제안한 방법의 정확도와 재현율, 비문자 추출의 역 비율(IRNTE)은 각각 99.59%, 98.65%, 82.30%로 측정되었다.

• 한국멀티미디어학회논문지
• /
• 제3권5호
• /
• pp.454-460
• /
• 2000

영상과 같은 다양하고 복잡한 데이터 검색은 기존의 키워드를 이용한 검색이 아닌 내용 기반 검색 방법이 요구된다. 본 논문에서는 물체의 위치 이동이나 회전, 크기 변화 등과 같은 각종 변환에 민감하지 않은 불변모멘트(invariant moments)값의 특성을 이용하여 사용자 질의로서 입력된 객체를 효율적으로 검색할 수 있는 시스템을 구현하였다. 영상내의 단일 객체뿐만 아니라 다중 객체들도 효과적으로 검출하기 위해 레이블링(labeling) 알고리즘을 적용해 각각의 객체를 따로 분리하여 불변모멘트를 적용하는 방법을 이용했다. 또한, 검색 시간 단축 및 영상의 효율적인 인덱싱(indexing)을 위해 해싱을 응용한 기법을 적용하였다. 실험결과, precision 85%, recall 23%의 높은 검색효율을 보였고 기존의 전체 영상의 특징을 가지고는 정확히 표현할 수 없는 객체들의 모양을 정확히 표현해 줌으로써 보다 정화한 검색 결과를 얻을 수 있었다.

• 약학회지
• /
• 제30권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
• /
• 제30권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.

• 대한산업공학회지
• /
• 제37권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.