• 호남수학학술지
• /
• 제38권2호
• /
• pp.279-294
• /
• 2016

Half integer values of harmonic numbers and reciprocal binomial squared coeffients sums are investigated in this paper. Closed form representations and integral expressions are developed for the infiite series.

• 대한수학회논문집
• /
• 제29권2호
• /
• pp.239-255
• /
• 2014

We develop a set of identities for Euler type sums. In particular we investigate products of shifted harmonic numbers of order two and reciprocal binomial coefficients.

• Journal of Information Processing Systems
• /
• 제13권5호
• /
• pp.1089-1102
• /
• 2017

In software systems, it has been observed that a fault is often caused by an interaction between a small number of input parameters. Even for moderately sized software systems, exhaustive testing is practically impossible to achieve. This is either due to time or cost constraints. Combinatorial (t-way) testing provides a technique to select a subset of exhaustive test cases covering all of the t-way interactions, without much of a loss to the fault detection capability. In this paper, an approach is proposed to generate 2-way (pairwise) test sets using genetic algorithms. The performance of the algorithm is improved by creating an initial solution using the overlap coefficient (a similarity matrix). Two mutation strategies have also been modified to improve their efficiency. Furthermore, the mutation operator is improved by using a combination of three mutation strategies. A comparative survey of the techniques to generate t-way test sets using genetic algorithms was also conducted. It has been shown experimentally that the proposed approach generates faster results by achieving higher percentage coverage in a fewer number of generations. Additionally, the size of the mixed covering arrays was reduced in one of the six benchmark problems examined.

• 한국분말재료학회지
• /
• 제30권3호
• /
• pp.255-261
• /
• 2023

Aluminum alloys are widely utilized in diverse industries, such as automobiles, aerospace, and architecture, owing to their high specific strength and resistance to oxidation. However, to meet the increasing demands of the industry, it is necessary to design new aluminum alloys with excellent properties. Thus, a new method is required to efficiently test additively manufactured aluminum alloys with various compositions within a short period during the alloy design process. In this study, a combinatory approach using a direct energy deposition system for metal 3D printing process with a dual feeder was employed. Two types of aluminum alloy powders, namely Al6061 and Al-12Cu, were utilized for the combinatory test conducted through 3D printing. Twelve types of Al-Si-Cu-Mg alloys were manufactured during this combinatory test, and the relationship between their microstructures and properties was investigated.

• Biomolecules & Therapeutics
• /
• 제26권6호
• /
• pp.591-598
• /
• 2018

Epigenetic silencing is considered to be a major mechanism for loss of activity in tumor suppressors. Reversal of epigenetic silencing by using inhibitors of DNA methyltransferase (DNMT) or histone deacetylases (HDACs) such as 5-Aza-CdR and FK228 has shown to enhance cytotoxic activities of several anticancer agents. This study aims to assess the combinatorial effects of genesilencing reversal agents (5-Aza-CdR and FK228) and oxaliplatin in gastric cancer cells, i.e., Epstein-Barr virus (EBV)-negative SNU-638 and EBV-positive SNU-719 cells. The doublet combinatorial treatment of 5-Aza-CdR and FK228 exhibited synergistic effects in both cell lines, and this was further corroborated by Zta expression induction in SNU-719 cells. Three drug combinations as 5-Aza-CdR/FK228 followed by oxaliplatin, however, resulted in antagonistic effects in both cell lines. Simultaneous treatment with FK228 and oxaliplatin induced synergistic and additive effects in SNU-638 and SNU-719 cells, respectively. Three drug combinations as 5-Aza-CdR prior to FK228/oxaliplatin, however, again resulted in antagonistic effects in both cell lines. This work demonstrated that efficacy of doublet synergistic combination using DNMT or HDACs inhibitors can be compromised by adding the third drug in pre- or post-treatment approach in gastric cancer cells. This implies that the development of clinical trial protocols for triplet combinations using gene-silencing reversal agents should be carefully evaluated in light of their potential antagonistic effects.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.891-895
• /
• 1995

This paper describes a solid modeling system based on a systematic description of techniques for analyzing and understanding on engineering drawings. Main stress is placed on clarifying the difference between the drawing understanding and the drawing recognition. The former, in which we feel major interest, is intrinsically a difficult problem because it inherent contains combinatorial search to require more than polynomial time. Actually, understanding drawings is regarded as a process to recover the information lost in projection 3-D objects to 2-D drawings. But, solid modeling by automatic understanding of the given drawings is one of the promising approach, which is described precisely in the text. Reviewing the studies performed so far, we summarize the future direction of the project and inevitable open problems left.

• Journal of Ubiquitous Convergence Technology
• /
• 제2권1호
• /
• pp.40-50
• /
• 2008

The problem of assigning customers to satellite channels is a difficult combinatorial optimization problem and is NP-complete. For this combinatorial optimization problem, standard optimization methods take a large computation time and so genetic algorithms (GA) and ant colony optimization (ACO) can be used to obtain the best and/or optimal assignment of customers to satellite channels. In this paper, we present a comparative study of GA and ACO to this problem. Various issues related to genetic algorithms approach to this problem, such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. We also discuss an ACO for this problem. In ACO methodology, three strategies, ACO with only ranking, ACO with only max-min ant system (MMAS), and ACO with both ranking and MMAS, are considered. A comparison of these two approaches (i,e., GA and ACO) with the standard optimization method is presented to show the advantages of these approaches in terms of computation time.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2005년도 한국컴퓨터종합학술대회 논문집 Vol.32 No.1 (A)
• /
• pp.892-894
• /
• 2005

Graph partitioning provides an important tool for data clustering, but is an NP-hard combinatorial optimization problem. Spectral clustering where the clustering is performed by the eigen-decomposition of an affinity matrix [1,2]. This is a popular way of solving the graph partitioning problem. On the other hand, semidefinite relaxation, is an alternative way of relaxing combinatorial optimization. issuing to a convex optimization[4]. In this paper we present a semidefinite programming (SDP) approach to graph equi-partitioning for clustering and then we use eigen-decomposition to obtain an optimal partition set. Therefore, the method is referred to as semidefinite spectral clustering (SSC). Numerical experiments with several artificial and real data sets, demonstrate the useful behavior of our SSC. compared to existing spectral clustering methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.49.3-49
• /
• 2001

In 1994 Adelman´s pioneer work demonstrated that deoxyribonucleic acid (DNA) could be used as a medium for computation to solve mathematical problems. He described the use of DNA based computational approach to solve the Hamiltonian Path Problem (HPP). Since then a number of combinatorial problems have been analyzed by DNA computation approaches including, for example: Maximum Independent Set (MIS), Maximal Clique and Satisfaction (SAT) Problems. In the present paper we propose a method of solving another classic combinatorial optimization problem - the eraph Coloring Problem (GCP), using specifically designed circular DNA plasmids as a computation tool. The task of the analysis is to color the graph so that no two nodes ...

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제32권4호
• /
• pp.247-257
• /
• 2005

일반적으로 네트워크 설계 문제는 네트워크의 크기가 늘어남에 따라 지수적으로 복잡도가 증가하여 전통적인 방법으로는 풀이하기 힘든 NP-hard 조합 최적화 문제 중의 하나로 분류될 수 있다. 본 논문에서는 네트워크 신뢰도 제약을 고려하면서 네트워크 구축비용을 효과적으로 최소화하는, 높은 신뢰도의 네트워크 토폴로지 설계 문제를 풀기 위해 스패닝 트리를 효율적으로 표현할 수 있는 Prufer수(PN) 기반의 진화 연산법과 2-연결성을 고려하는 휴리스틱 방법으로 구성된 두 단계의 효율적인 해법을 제안한다. 즉, 먼저 스패닝 트리를 찾아내기 위해 진화 연산법 중에 보편적으로 널리 알려져 있는 유전자 알고리즘(GA)을 이용하고 그 다음으로 첫 번째 단계에서 발견한 스패닝 트리에 대해 최적의 네트워크 토폴로지를 찾기 위해서 2-연결성을 고려한 휴리스틱 방법을 적용한다. 마지막으로 수치예의 결과를 통해 제안한 해법의 성능에 대해서 살펴보도록 한다.