• Journal of Digital Convergence
• /
• v.19 no.12
• /
• pp.397-404
• /
• 2021

Product image location in search engine advertising plays an important role in consumer perception when the product is relatively low involved and has functional value. The purpose of this research is to investigate the interaction effects of product image location and product type on advertising effectiveness. Building on the literature of location effects, we show that for products for which heaviness is considered a positive attribute, product image placed on the right are preferred. To test hypotheses, a 2(product image location: left vs. right) × 2(product type: single vs. bundle) experiment is conducted and a total of 144 paricipants took part in the experiment. The results revealed that respondents show higher brand attitude and purchse intention toward a bundle product's advertising with product image place on the right. The results provide implications and suggestions for improving search engine advertising and marketing strategies.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.67-76
• /
• 2020

With the fast development in wireless communications and vehicular technologies, vehicular ad hoc networks (VANETs) have enabled to deliver data between vehicles. Recently, VANETs introduce a Vehicular Cloud (VC) model for collaborating to share and use resources of vehicles to create value-added services. To construct a VC, a vehicle should search vehicles that intend to provide their own resource. The single-hop search cannot search enough provider vehicles due to a small coverage and non-line-of-sights of communications. On the other hand, the multi-hop search causes very high traffics for large coverage searching and frequent connection breakages. Recently, many Roadside Units (RSUs) have been deployed on roads to collect the information of vehicles in their own coverages and to connect them to Internet. Thus, we propose a RSU-aided vehicular resource search and cloud construction mechanism in VANETS. In the proposed mechanism, a RSU collects the information of location and mobility of vehicles and selects provider vehicles enabled to provide resources needed for constructing a VC of a requester vehicle based on the collected information. In the proposed mechanism, the criteria for determining provider vehicles to provide resources are the connection duration between each candidate vehicle and the requester vehicle, the resource size of each candidate vehicle, and its connection starting time to the requester vehicle. Simulation results verify that the proposed mechanism achieves better performance than the existing mechanism.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.4
• /
• pp.825-836
• /
• 2003

Based on customer information and financing processes in capital market, we derived individual models by applying multi-layered perceptrons, MDA, and decision tree. Further, the results from the existing single models were compared with the results from the integrated model that was developed using genetic algorithm. This study contributes not only to verifying the existing individual models and but also to overcoming the limitations of the existing approaches. We have depended upon the approaches that compare individual models and search for the best-fit model. However, this study presents a methodology to build an integrated data mining model using genetic algorithm.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1996.10a
• /
• pp.199-204
• /
• 1996

It is discssed how to detrmine the home location of vhicles in an AGVS with a loop guidepath in a way of maximizing the request-call response probabilities for all demand. Optimal home position is selected by solving the simultaneous equations easily . Statuc positioning strategy is analyzed in which a single home position is allocated to which every vehicle is outed whenever it becomes idle. The cases of unidirectional guidepath is considered only. We provide a numerical example to illustrate the search algorithm developed for the case and compare the searched optimal solutions with the others.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.241-244
• /
• 2000

The optimization method based on an enhanced genetic algorithms is proposed for multimodal function optimization in this paper This method is consisted of two main steps. The first step is global search step using the genetic algorithm(GA) and function assurance criterion(FAC). The belonging of an population to initial solution group is decided according to the FAC. The second step is to decide resemblance between individuals and research optimum solutions by single point method in reconstructive research space. Two numerical examples are also presented in this paper to comparing with conventional methods.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.799-806
• /
• 2008

In this paper, a new design for an error correcting code (ECC) is proposed. The design is aimed to build an ECC circuitry with minimal power consumption. The genetic algorithm equipped with the symbiotic mechanism is used to design a power-efficient ECC which provides single-error correction and double-error detection (SEC-DED). We formulate the selection of the parity check matrix into a collection of individual and specialized optimization problems and propose a symbiotic evolution method to search for an ECC with minimal power consumption. Finally, we conduct simulations to demonstrate the effectiveness of the proposed method.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.1613-1616
• /
• 2005

In this paper, we developed an algorithm of generating cam contour curve for hinge mechanism of folder-type mobile phone. The main feature of this hinge mechanism is that we can operate uniform torque to open or close the mobile phone. We divided the opening or closing intervals of the cam into finite sub-intervals, and then we determined the cam contour curve of each sub-interval as a parabolic curve. Finally, these finite parabolic curves form the total cam contour. We can design single cam, which composed moving cam with contour curve and fixed cam that plays only roller, and twin cam with contour curve that is made up the pair of two cams symmetrically.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.310-320
• /
• 1999

A mixed model assembly line (MMAL) is a special type of production line where a variety of product models similar in product characteristics are assembled. Determining the model sequence is an important problem for the efficient use of MMALs. This paper considers interactive multiobjective decision making problems for MMAL sequencing. Evolution program is employed as an underlying framework. In this study, a way of approximating the linear utility function is first studied. To improve its search efficiency to the solution space preferred by a decision maker, some modifications of a standard evolution program are made: operating several subpopulations instead of a single population and merging two or more subpopulations to a single subpopulation, and using a Pareto pool. Extensive computational experiments are carried out to verify the performance of the proposed approach. The computational results show that our approach is promising in solution quality.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.358-361
• /
• 2001

Fixed-mobile convergence services can be defined as the combination of previously separate fixed and mobile services, and networks and commercial practices. Examples of fixed-mobile convergence services include single voicemail box, single number and unified messaging across fixed and mobile networks. Recently as more voice is transferred to mobile networks, convergence services between fixed and mobile become more important. In Korea convergence services are only starting to become established, and are likely to become an important part of any operator's offering. In this paper, I search the different levels of fixed-mobile convergence services and the trends and regulations for fixed-mobile convergence services in major countries. And at the same time I also try to find a new direction of future regulatory principles related to fixed-mobile convergence services.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.100-115
• /
• 2004

The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.