• Management & Information Systems Review
• /
• v.38 no.2
• /
• pp.209-223
• /
• 2019

The purpose of this study was to stimulate the online word-of-mouth advertising by developing the concept of word-of-mouth constraint factors and measurement tools in connection with the SNS advertising on social networks. To achieve the objective of this study, this study was conducted in 3 phases. First, the exploratory investigation(target group interview, in-depth interview, and expert interview) was performed to determine the concept and scope of the word-of-mouth constraint based on literature study and qualitative investigation method. Second, the reliability and validity of the measurement questions were verified through the survey in order to refine the developed measurement items. Third, the predictive validity of measurement items was verified by examining the relationship with other major construct concept for which the developed measurement items were different. Based on the results of study, 6 components and a total of 23 measurement questions for those components were derived. Each was called intrapersonal and interpersonal constraint(psychological sensitivity, compensatory sensitivity, and other person assessment), structural constraint(reliability, informativity, and entertainment). We developed the measurement questions related to word-of-mouth constraint based on qualitative study and quantitative study and holistically examined the social and psychological, environmental interruption factors acting as the word-of-mouth constraint factors for SNS advertising in terms of SNS achievements and evaluation from the perspective of word-of-mouth constraint. The results will lead to creation of basic framework for systematic and empirical research on the online word-of-mouth constraint and to achievement of effective SNS word-of-mouth advertising.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.12 no.3
• /
• pp.109-121
• /
• 2004

This paper presents an optimal design method for structure-borne durability of a vehicle body structure. Structure-borne durability design requires a new design that can increase fatigue lives of critical areas in a structure and must prohibit transition phenomenon of critical areas that results from modification of the structure at the same time. Therefore, the optimization problem fur structure-borne durability design are consists of an objective function and design constraints of 2 types; type 1-constraint that increases fatigue lives of the critical areas to the required design limits and type 2-constraint that prohibits transition phenomenon of critical areas. The durability design problem is generally dynamic because a designer must consider the dynamic behavior such as fatigue analyses according to the structure modification during the optimal design process. This design scheme, however, requires such high computational cost that the design method cannot be applicable. For the purpose of efficiency of the durability design, we presents a method which carry out the equivalent static design problem instead of the dynamic one. In the proposed method, dynamic design constraints for fatigue life, are replaced to the equivalent static design constraints for stress/strain coefficients. The equivalent static design constraints are computed from static or eigen-value analyses. We carry out an optimal design for structure-borne durability of the newly developed bus and verify the effectiveness of the proposed method by examination of the result.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.2
• /
• pp.92-101
• /
• 2002

The Job Shop Scheduling Problem(JSSP) is concerned with schedule of m different machines and n jobs where each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. The purpose of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the large scale job shop scheduling. The proposed heuristic method is based on a Tabu Search(TS) and on a Constraint Satisfaction Technique(CST). In this paper, ILOG libraries is used to embody the job shop model, and a CST is developed for this model to generate the increased solution. Then, TS is employed to overcome the increased search time of CST on the increased problem size md to refine the next-current solution. Also, this paper presents the new way of finding neighbourhood solution using TS. On applying TS, a new way of finding neighbourhood solution is presented. Computational experiments on well known sets of MT and LA problem instances show that, in several cases, our approach yields better results than the other heuristic procedures discussed In literature.

• Structural Engineering and Mechanics
• /
• v.54 no.6
• /
• pp.1153-1174
• /
• 2015

Deployable structures have gained more and more applications in space and civil structures, while it takes a large amount of computational resources to analyze this kind of multibody systems using common analysis methods. This paper presents a new approach for dynamic analysis of multibody systems consisting of both rigid bars and arbitrarily shaped rigid bodies. The bars and rigid bodies are connected through their nodes by ideal pin joints, which are usually fundamental components of deployable structures. Utilizing the Moore-Penrose generalized inverse matrix, equations of motion and constraint equations of the bars and rigid bodies are formulated with nodal Cartesian coordinates as unknowns. Based on the constraint equations, the nodal displacements are expressed as linear combination of the independent modes of the rigid body displacements, i.e., the null space orthogonal basis of the constraint matrix. The proposed method has less unknowns and a simple formulation compared with common multibody dynamic methods. An analysis program for the proposed method is developed, and its validity and efficiency are investigated by analyses of several representative numerical examples, where good accuracy and efficiency are demonstrated through comparison with commercial software package ADAMS.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.492-492
• /
• 2000

This paper proposes LQ optimal controller design method based on the modal decomposition. Here, the design problem of linear time-invariant systems is considered by using pencil model. The mathematical model based on matrix pencil is one of the most general representation of the system. By adding some conditions the model can be reduced to traditional system models. In pencil model, the state feedback is considered as an algebraic constraint between the state variable and the control input variable. The algebraic constraint on pencil model is called purely static mode, and is included in infinite mode. Therefore, the information of the constant gain controller is included in the purely static mode of the augmented system which consists of the plant and the control conditions. We pay attention to the coordinate transformation matrix, and LQ optimal controller is derived from the algebraic constraint of the internal variable. The proposed method is applied to the numerical examples, and the results are verified.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2338-2353
• /
• 2015

In this paper, the optimal power allocation algorithm that minimizes the aggregate bit error rate (BER) of the secondary user (SU) in a downlink orthogonal frequency division multiplexing (OFDM) based cognitive radio (CR) system, while subjecting to the interference power constraint and the transmit power constraint, is investigated under the assumption that the instantaneous channel state information (CSI) of the interference links between the secondary transmitter and the primary receiver, and between the primary transmitter and the secondary receiver is perfectly known. Besides, a suboptimal algorithm with less complexity is also proposed. In order to deal with more practical situations, we further assume that only the channel distribution information (CDI) of the interference links is available and propose heuristic power allocation algorithms based on bisection search method to minimize the aggregate BER under the interference outage constraint and the transmit power constraint. Simulation results are presented to verify the effectiveness of the proposed algorithms.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2003.09a
• /
• pp.217-221
• /
• 2003

Variation of decision variables for optimal remediation using the pump-and-treat method is examined to estimate the effect of the degree of concentration constraint. Simulation-optimization method using genetic algorithm is applied to minimize the total pumping volume. In total volume minimization strategy, the remediation time increases rapidly prior to significant increase in pumping rates. When the concentration constraint is set severer, the more wells are required and the well on the down-gradient direction from the plume hot-spot gives more efficient remediation performance than that on the hot-spot position. These results show that the more profitable strategy for remediation can be achieved by increasing the required remediation time than raising the pumping rate until the time reaches a certain limitation level. So, the remediation time has to be considered as one of the essential decision variables fer optimal remediation design.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.8
• /
• pp.484-489
• /
• 2004

When the energy resource available to a particular plant (be it coal, oil, gas, water, or nuclear fuel) is a limiting factor in the operation of the plant, the entire economic dispatch calculation must be done differently. Each economic dispatch calculation must account for what happened before and what will happen in the future. This paper presents a formulation and a solution method for the optimization problem with a fuel constraint in a competitive electricity market. Take-or- Pay (TOP) contract for an energy resource is the typical constraint as a limiting factor. Two approaches are proposed in this paper for modeling the dispatch calculation in a market mechanism. The approaches differ in the subject who considers and inserts the fuel-constraint into its optimization problem. Market operator and each power producer having a TOP contract are assumed as such subjects. The two approaches are compared from the viewpoint of profits. surplus. and social welfare on the basis of Nash Equilibrium.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.10a
• /
• pp.271-278
• /
• 2002

Structural optimization using improved higer-order convex approximation is proposed in this paper. The proposed method is a generalization of the convex approximation method. The order of the approximation function for each constraint is automatically adjusted in the optimization process. And also the order of each design variable is differently adjusted. This self-adjusted capability makes the approximate constraint values conservative enough to maintain the optimum design point of the approximate problem in feasible region. The efficiency of proposed algorithm, compared with conventional algorithm is successfully demonstrated in the Three-bar Truss example.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.953-956
• /
• 2000

Application specific DSPs often employ irregular datapath structures with distributed registers. In the scheduling phase of retargetable compilation, resolution of register usage conflicts comes to be a new constraint for such datapaths. This paper presents a method of register constraint analysis which attempts to minimize the number of the spill codes required for resolving the register usage conflicts. It searches for a set of ordering restrictions among operations which sequentialize the lifetimes of the values residing in the same register as much as possible and thus minimize the number of the register conflict. Experimental results show that a combination of the proposed register constraint, analysis and list-based scheduling reduces the number of the register spills into 25%.