• ETRI Journal
• /
• v.39 no.3
• /
• pp.345-352
• /
• 2017

Traffic management is a highly beneficial mechanism for satisfying quality-of-service requirements and overcoming the resource scarcity problems in networks. This paper introduces an optimal connection admission control mechanism to decrease the packet loss ratio and end-to-end delay in cognitive radio sensor networks (CRSNs). This mechanism admits data flows based on the value of information sent by the sensor nodes, the network state, and the estimated required resources of the data flows. The number of required channels of each data flow is estimated using a proposed formula that is inspired by a graph coloring approach. The proposed admission control mechanism is formulated as a semi-Markov decision process and a linear programming problem is derived to obtain the optimal admission control policy for obtaining the maximum reward. Simulation results demonstrate that the proposed mechanism outperforms a recently proposed admission control mechanism in CRSNs.

• Bulletin of the Korean Chemical Society
• /
• v.31 no.9
• /
• pp.2565-2570
• /
• 2010

The orthorhombic $MgB_2C_2$ structure contains well-separated parallel graphite-like $B_2C_2^{2-}$ layers which extend infinitely in two dimensions. Three possible ways to distribute B and C atoms in the hexagonal sublattice sites are adopted. Band structures for the hypothetical distribution patterns are examined to assess the electronic stability of these phases and to account for the observed arrangement by means of extended Huckel tight-binding calculations. The preferred choice is the layer with B and C alternating strictly so that B is nearest neighbor to C and vice versa. A rationale for this is given. Due to the alternation of B and C within the honeycomb layers, $MgB_2C_2$ is a band insulator, which through partial substitution of Mg with Li, is predicted to turn metallic with holes in the $\sigma$ bands at the Fermi level.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3151-3156
• /
• 1998

대학의 시간표 문제를 해결하기 위해서 시간표의 문제는 종종 그래프 착색 알고리즘으로 표현된다. 각 노드를 강좌로, 에지는 연결된 강좌간에는 동일한 시간에 서로 배정이 불가능한 조건으로 표시한다. 그러나 순수한 그래프 착색 알고리즘은 바로 대학의 시간표 문제에 적용하기 곤란하다. 그 이유는 대부분의 시간표 문제에서 강좌는 한시간 이상으로 존재하고 이들은 반드시 연속된 시간에 배정이 되어야 한다는 등의 제약 조건을 갖기 때문이다. 이 문제를 해결하기 위하여 적용된 것이 가중치 그래프 착색 알고리즘이다. 이 경우 각 노드는 강의 시간의 길이의 값을 갖게 된다. 이와 관련된 기존의 연구가 진행되었으나 탐색의 시간이 지수적으로 증가하거나 해의 질이 뛰어나지는 못하였다 라는 단점을 갖고 있다. 따라서 본 연구에서는 새로운 가중치 그래프의 착색 방법을 제안한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.753-758
• /
• 2010

In this paper we propose an efficient marker tracking system that exploits IR and web cameras. The proposed method solves the marker swap problem and allows for fast and responsive marker tracking. We use color information gathered from the IR reflector to assign a unique identification to each marker. We can locate each marker withthe IR camera and also identify the marker uniquely by using color information provided by the web camera. The experiment results show that marker swapping can be eliminated effectively. Furthermore, our approach allows for faster and more responsive marker tracking.

• Journal of the Society of Cosmetic Scientists of Korea
• /
• v.24 no.3
• /
• pp.73-80
• /
• 1998

This Study was performed to get the suitable oil dispersion agent by assessment of color strength of organic pigment in non-aqueous systems. Organic pigment is used as a color expression material with other body pigments in the make-up products. But occasionally aggregation or agglomeration occurs for the lack of affinity with medium, This function is the cause of disturbing homogeneous dispersion, and then bring about an instability of products. Our study, research of dispersion mechanism between the pigment and oil phase, has been executed to solve this problem, and find a oil dispersion agent having optimum dispersion condition. Generally dispersion is related to between the solid-liquid mutual properties and electrical phenomena associated with solid-liquid interface. This factor is determined to input energy, milling time, optical properties, particle size, rheological properties, etc. Ideal dispersion state is told that coloring primary solid particle is homogeneously dispersed in medium. Good dispersed colorants are strongly and clearly appeared. We are already known that the particle size of organic pigment, chemical properties and viscosity of medium, refractive index. Consequently We determine the affinity of medium and organic pigment by measuring of color strength in the same mechanical condition. UV-VISIBLE RECORDING SPECTRO PHOTOMETER is used for measuring apparatus. We can decided the dispersion level of oil dispersion agent by measuring absorbance of color strength in the visible range that diluted medium for colloid colorant particles.

• The KIPS Transactions:PartA
• /
• v.10A no.2
• /
• pp.137-140
• /
• 2003

Recently, CG (Conjugate Gradient) scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for interior eigenvalues for the following eigenvalue problem, Ax＝λx (1) The given matrix A is assummed to be large and sparse, and symmetric. Also, the method is very amenable to parallel computations. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. We compare the parallel preconditioners for the computation of the interior eigenvalues of a symmetric matrix by CG-type method. The considered preconditioners are Point-SSOR, ILU (0) in the multi-coloring order, and Multi-Color Block SSOR (Symmetric Succesive OverRelaxation). We conducted our experiments on the CRAY­T3E with 128 nodes. The MPI (Message Passing Interface) library was adopted for the interprocessor communications. The test matrices are up to $512{\times}512$ in dimensions and were created from the discretizations of the elliptic PDE. All things considered the MC-BSSOR seems to be most robust preconditioner.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.11-22
• /
• 2004

A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem(CSP) in which variables and constraints are distributed among multiple automated agents. ACSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI (Distributed AI) that are concerned with finding a consistent combination of agent actions can be formalized as distributed CAPs. In recent years, many new backtracking algorithms for solving distributed CSPs have been proposed. But most of all, they have common drawbacks that the algorithm assumes the priority of agents is static. In this thesis, we establish a basic algorithm for solving distributed CSPs called dynamic priority search algorithm that is more efficient than common backtracking algorithms in which the priority order is static. In this algorithm, agents act asynchronously and concurrently based on their local knowledge without any global control, and have a flexible organization, in which the hierarchical order is changed dynamically, while the completeness of the algorithm is guaranteed. And we showed that the dynamic priority search algorithm can solve various problems, such as the distributed 200-queens problem, the distributed graph-coloring problem that common backtracking algorithm fails to solve within a reasonable amount of time. The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-making. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid. Furthermore, we describe that the agent can be available to hold multiple variables in the searching scheme.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.58 no.2
• /
• pp.185-189
• /
• 2013

Daeripjami, a novel black rice variety developed by conventional breeding has high contents of Cyanidin-3-glucoside(C3G) and a more strong antioxidant than normal black rice. This study aimed at informing ordinary people of the superiority of Daeripjami, a variety of rice proven to be superb physiologically and valuable as natural coloring, and making it popular by examing the physicochemical features of the rice. Recently, an increasing number of people in modern society are suffering from various adult diseases and atopic diseases. Therefore, in order to resolve the problem by making people consume more C3G, the main coloring contained in functional rice Daeripjami. The general components of Daeripjami, Superjami, Heugjinju and Ilpum were compared, As for water content, Ilpum took first place, followed by Heugjinju, Daeripjami and Superjami, As for crude protein and fat content, Heugjinju was highest, followed by Daeripjami, Superjami and Ilpum. This indicated that Daeripjami likely has better cooking qualities than Heugjinju. Amylose content turned out to be related with the volume, stickness and retrogradation of cook rice. As Heugjinju contained more amylose than Daeripjami, the latter was expected to have better eating quality than the former. The 1000 grain weight of daeripjami was 1.67 times heavier than that of Heugjinju. The C3G content of Daeripjami is 3.49 times higher compared with that of Heugjinju. As for total polyphenol and electron donating ability, Daeripjami was high in physiological functionality.

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.2
• /
• pp.1-9
• /
• 2018

In this paper, we propose a method to restore corrupted black and white facial images to color. Previous studies have shown that when coloring damaged black and white photographs, such as old ID photographs, the area around the damaged area is often incorrectly colored. To solve this problem, this paper proposes a method of restoring the damaged area of input photo first and then performing colorization based on the result. The proposed method consists of two steps: BEGAN (Boundary Equivalent Generative Adversarial Networks) model based restoration and CNN (Convolutional Neural Network) based coloring. Our method uses the BEGAN model, which enables a clearer and higher resolution image restoration than the existing methods using the DCGAN (Deep Convolutional Generative Adversarial Networks) model for image restoration, and performs colorization based on the restored black and white image. Finally, we confirmed that the experimental results of various types of facial images and masks can show realistic color restoration results in many cases compared with the previous studies.

• Journal of the Korea Fashion and Costume Design Association
• /
• v.9 no.2
• /
• pp.85-92
• /
• 2007

This study focused on bean-juice treatment method which have dyeing property to indigo, yellow soil, sappan wood, cochineal and also on the possibility of applying to mordanting. This is different from the active mordanting using chemicals. Natural mordants with development of dyeing are not harmful, also are the medicines for disease. Limestone and ash neutralize the acidic soil. bean-juice protein adhere to cellulose surface and change the physical properties of protein so that coloring of dye is better than before and film non-soluble in water is made. Therefore the color made from bean-juice process lasts after washing. This study try to show one of the ways to improve the current method using the heavy metal which can have bad effects for environment and human being. Bean-juice(raw bean, heated bean) treatment method can be the way to fix the natural dyeing problem of bad dyeing. Bean-juice had been treated under various condition with pre-treatment, post-treatment and raw bean, heated bean. Following results are obtained in this study. In the case of Indigo dyeing, pre-treatment of heated bean shows the biggest difference of color. In the case of yellow soil dyeing, pre-treatment of raw bean-juice shows the biggest gap of color. Pre-treatment of heated bean in sappan wood dyeing case and post-treatment of raw bean show bigger color difference than pre-treatment of raw bean. In cochineal dyeing, raw bean pre-treatment shows the biggest color difference.