• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권5호
• /
• pp.2122-2140
• /
• 2020

Proper and precise embedding of commercial ads within Webpages requires Ad-hoc analysis and understanding of their content. By the successful implementation of this step, both publishers and advertisers gain mutual benefits through increasing their revenues on the one hand, and improving user experience on the other. In this research work, we propose a novel multi-level context-based ads serving approach through which ads will be served at generic publisher websites based on their contextual relevance. In the proposed approach, knowledge encoded in domain-specific and generic semantic repositories is exploited in order to analyze and segment Webpages into sets of contextually-relevant segments. Semantically-enhanced indexes are also constructed to index ads based on their textual descriptions provided by advertisers. A modified cosine similarity matching algorithm is employed to embed each ad from the Ads repository into one or more contextually-relevant segments. In order to validate our proposal, we have implemented a prototype of an ad serving system with two datasets that consist of (11429 ads and 93 documents) and (11000 documents and 15 ads), respectively. To demonstrate the effectiveness of the proposed techniques, we experimentally tested the proposed method and compared the produced results against five baseline metrics that can be used in the context of ad serving systems. In addition, we compared the results produced by our system with other state-of-the-art models. Findings demonstrate that the accuracy of conventional ad matching techniques has improved by exploiting the proposed semantically-enhanced context-based ad serving model.

• 지구물리와물리탐사
• /
• 제15권4호
• /
• pp.219-226
• /
• 2012

이 연구에서는 국내에서 연구가 미약했었던 중성자검층 수치모델링을 이용하여 다양한 시추공 환경에서의 검출기 반응을 분석하였다. 이를 위해 중성자검층 환경을 MCNP 알고리듬으로 구현하여 시뮬레이션을 수행하였다. MCNP 알고리듬은 방사선 수송 시뮬레이션이 및 3차원 기하구조 표현이 가능하여 다양한 분야에서 전세계적으로 많이 이용되고 있다. 먼저 시뮬레이션 결과를 검증하기 위해, 기존 연구의 검출기반응 결과 그래프를 이용하여 비교 분석하였다. 중성자 검층 반응 분석이 가능한 중성자 검층기의 일반적인 특징에 기초하여 수학적으로 중성자검층기 모형을 구성하여 반응을 계산하였다. 먼저, 석회암, 사암, 돌로마이트 등과 같은 매질에서 공극률을 다양하게 변화시켜 가며 수치 계산함으로써, 이 연구에서 고려하고 있는 중성자검층기의 교정곡선(calibration chart)을 도출하였다. 이에 기초하여, 실제 중성자검층 시 고려해야 할 공내수 유무에 의한 반응 변화, 염수가 중성자검층에 미치는 영향 등을 분석함으로써 시추공 환경 변화에 따라 보다 정확하게 공극률을 해석할 수 있는 기틀을 마련하고자 한다.

• 전기학회논문지
• /
• 제67권8호
• /
• pp.1071-1079
• /
• 2018

In this study, the design methodology as well as network architecture of Support Vector Machine based Polynomial Neural Network, which is a kind of the dynamically generated neural networks, is introduced. The Support Vector Machine based polynomial neural networks is given as a novel network architecture redesigned with the aid of polynomial neural networks and Support Vector Machine. The generic polynomial neural networks, whose nodes are made of polynomials, are dynamically generated in each layer-wise. The individual nodes of the support vector machine based polynomial neural networks is constructed as a support vector machine, and the nodes as well as layers of the support vector machine based polynomial neural networks are dynamically generated as like the generation process of the generic polynomial neural networks. Support vector machine is well known as a sort of robust pattern classifiers. In addition, in order to enhance the structural flexibility as well as the classification performance of the proposed classifier, multi-objective particle swarm optimization is used. In other words, the optimization algorithm leads to sequentially successive generation of each layer of support vector based polynomial neural networks. The bench mark data sets are used to demonstrate the pattern classification performance of the proposed classifiers through the comparison of the generalization ability of the proposed classifier with some already studied classifiers.

• International Journal of Control, Automation, and Systems
• /
• 제3권3호
• /
• pp.430-443
• /
• 2005

A general construction algorithm of the Grassmann space parameters in linear systems - so-called, the Plucker matrix, 'L' in m-input, p-output, n-th order static output feedback systems and the Plucker matrix, $'L^{aug}'$ in augmented (m+d)-input, (p+d)-output, (n+d)-th order static output feedback systems - is presented for numerical checking of necessary conditions of complete static and complete minimum d-th order dynamic output feedback pole-assignments, respectively, and also for discernment of deterministic computation condition of their pole-assignable real solutions. Through the construction of L, it is shown that certain generically pole-assignable strictly proper mp > n system is actually none pole-assignable over any (real and complex) output feedbacks, by intrinsic rank deficiency of some submatrix of L. And it is also concretely illustrated that this none pole-assignable mp > n system by static output feedback can be arbitrary pole-assignable system via minimum d-th order dynamic output feedback, which is constructed by deterministic computation under full­rank of some submatrix of $L^{aug}$.

• Journal of Computing Science and Engineering
• /
• 제3권1호
• /
• pp.27-58
• /
• 2009

Aggregation join queries are an important class of queries over data streams. These queries involve both join and aggregation operations, with window-based joins followed by an aggregation on the join output. All existing research address join query optimization and aggregation query optimization as separate problems. We observe that, by putting them within the same scope of query optimization, more efficient query execution plans are possible through more versatile query transformations. The enabling idea is to perform aggregation before join so that the join execution time may be reduced. There has been some research done on such query transformations in relational databases, but none has been done in data streams. Doing it in data streams brings new challenges due to the incremental and continuous arrival of tuples. These challenges are addressed in this paper. Specifically, we first present a query processing model geared to facilitate query transformations and propose a query transformation rule specialized to work with streams. The rule is simple and yet covers all possible cases of transformation. Then we present a generic query processing algorithm that works with all alternative query execution plans possible with the transformation, and develop the cost formulas of the query execution plans. Based on the processing algorithm, we validate the rule theoretically by proving the equivalence of query execution plans. Finally, through extensive experiments, we validate the cost formulas and study the performances of alternative query execution plans.

• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2011년도 제37회 추계학술대회논문집
• /
• pp.127-134
• /
• 2011

유전알고리즘을 사용하여 액체로켓엔진의 연소실 압력과 노즐 확장비, O/F 비 등 주요 설계변수를 최적화하였다. 대상엔진은 LO2/RP-1을 추진제로 사용하는 개방형 가스발생기 사이클을 대상으로 하였다. 연소실의 물성치는 CEA2를 이용하였으며, 무게 산출은 참고문헌을 바탕으로 모델링 하였다. 최적설계의 목적함수는 비추력과 추력중량비를 다중목표로 설정하여 가중치 방법을 사용하였다. 유전알고리즘을 최적화 과정을 거친 결과 비추력은 최대 4%, 추력중량비는 최대 23% 정도 증가하였다. 또한 다양한 추력에 대해서 Pareto frontier line을 얻었다.

• 상하수도학회지
• /
• 제32권2호
• /
• pp.107-113
• /
• 2018

Maintaining adequate residual chlorine concentration is an important criteria to provide secure drinking water. The chlorine decay can be influenced by unstable flow due to the transient event caused by operation of hydraulic devices in the pipeline system. In order to understand the relationship between the transient event and the chlorine decay, the probability density function based on the water demand curve of a hypothetical water distribution system was used. The irregular transient events and the same number of events with regular interval were assumed and the fate of chlorine decay was compared. The chlorine decay was modeled using a generic chlorine decay model with optimized parameters to minimize the root mean square error between the experimental chlorine concentration and the simulated chlorine concentration using genetic algorithm. As a result, the chlorine decay can be determined through the number of transients regardless of the occurrence intervals.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.217-224
• /
• 2003

ISO 14649 is a new interface (or language) standard for the CAD-CAM -CNC chain, currently under establishment by ISO TC184 SCI and SC4 . Upon completion, it will replace ISO 6983, so called M amp; G codes used for CNC since 1950' s. As the new language is being established, a new CNC controller called STEP-CNC (STEP­compliant CNC), capable of carrying out various intelligent tasks using the new language as an input, receives worldwide attention. In this paper, we present a distributed architecture for STEP-NC system based on the generic paradigm of STEP-NC. The STEP-NC system is consisted of 3 sub-systems: 1) CGS (Code Generation System), 2) CES (Code Edit System), and 3) ACS (Autonomous Control System). Also presented in this paper is algorithm for delta volume decomposition, a crucial algorithm for developing CGS. First method is based on the cutting tool and the second method is based on the turning features commonly used in the shop floor. An illustrative example is given to compare the two methods, and to illustrate usage scenario of the delta volume in the turning STEP- NC system under development.

• 한국통신학회논문지
• /
• 제33권11B호
• /
• pp.981-988
• /
• 2008

본 논문에서는 MANET에서 효율적인 AODV 알고리즘을 제안한다. MANET에서는 전송 채널이 에러와 손실이 높기 때문에 홉 수를 절대적인 네트워크의 메트릭으로 볼 수 없다는 점이다. 제안된 기법은 크로스레이어 디자인을 이용하여 데이터 링크 계층에서 FER을 주기적으로 측정한 후, 각 노드는 링크 상태의 가중치를 AODV 프로토콜의 예약된 필드로 전송하는 방법을 사용하였다. 효과적인 경로 설정을 위해서 가중치의 합을 비교해서 채널 상태가 양호한 링크를 경로 설정에 사용하도록 설계하였다. 제안된 AODV는 기존 AODV 방식에 비하여 throughput, 라우팅 오버헤드 및 평균 전송 지연시간을 향상시킨다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 A
• /
• pp.6-9
• /
• 2001

This paper presents a new method which applies a genetic algorithm(GA) for determining which sectionalizing switch to operate in order to solve the distribution system loss minimization re-configuration problem. The distribution system loss minimization re-configuration problem is in essence a 0-1 planning problem which means that for typical system scales the number of combinations requiring searches becomes extremely large. In order to deal with this problem, a new approach which applies a GA was presented. Briefly, GA are a type of random number search method, however, they incorporate a multi-point search feature. Further, every point is not is not separately and respectively renewed, therefore, if parallel processing is applied, we can expect a fast solution algorithm to result.