• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.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.

• Geophysics and Geophysical Exploration
• /
• v.15 no.4
• /
• pp.219-226
• /
• 2012

This study provides an analysis on results of neutron logging for various borehole environments through numerical simulation based on a Monte Carlo N-Particle (MCNP) code developed and maintained by Los Alamos National Laboratory. MCNP is suitable for the simulation of neutron logging since the algorithm can simulate transport of nuclear particles in three-dimensional geometry. Rather than simulating a specific tool of a particular service company between many commercial neutron tools, we have constructed a generic thermal neutron tool characterizing commercial tools. This study makes calibration chart of the neutron logging tool for materials (e.g., limestone, sandstone and dolomite) with various porosities. Further, we provides correction charts for the generic neutron logging tool to analyze responses of the tool under various borehole conditions by considering brine-filled borehole fluid and void water, and presence of borehole fluid.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.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
• /
• v.3 no.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
• /
• v.3 no.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.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2011.11a
• /
• pp.127-134
• /
• 2011

A genetic algorithm (GA) has been employed to optimize the major design variables of the liquid rocket engine. Pressure of the main combustion chamber, nozzle expansion ratio and O/F ratio have been selected as design variables. The target engine has the open gas generator cycle using the LO2/RP-1 propellant. The gas properties of the combustion chamber have been obtained from CEA2 and the mass has been estimated using reference data. The objective function has been set as multi-objective function with the specific impulse and thrust to weight ratio using the weight method. The result shows about 4% improvement of the specific impulse and 23% increase of the thrust to weight ratio. The Pareto frontier line has been also obtained for various thrust requirements.

• Journal of Korean Society of Water and Wastewater
• /
• v.32 no.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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11B
• /
• pp.981-988
• /
• 2008

In this paper, the efficient AODV routing algorithm in MANET is proposed. Because transmission channel has a high error rate and loss in MANET, the number of hops can't be regarded as an absolute network metric. After measuring FER periodically at the data link layer using cross-layer design, the scheme that every node forwards the weight of link status in the reserved field of AODV protocol is used. In order to find the efficient route, we design AODV to be able to select an optimal route that has a good channel status by evaluating the sum of weight. The proposed AODV improves throughput, routing overhead and average end-to-end delay in comparison with the generic AODV.

• Proceedings of the KIEE Conference
• /
• 2001.07a
• /
• 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.