• The Journal of the Korea Contents Association
• /
• v.13 no.7
• /
• pp.386-394
• /
• 2013

The purpose of the current study was to investigate the difference in recreation specialization levels based on the levels of leisure constraint negotiation and to examine the effect of leisure constraint negotiation on recreation specialization. A total of 374 skiers Kyonggi and Kangwon provinces was selected using the cluster sampling method. All respondents were divided into 3 groups based on the levels of leisure constraint negotiation and one-was ANOVA and regression analysis were conducted. The main findings were as follows: First, skiers were divided into 3 groups(high, middle, low) by the K-mean cluster analysis. Second, there were differences in past experience, centrality of life, financial investment, and overall recreation specialization based on the levels of leisure constraint negotiation. Finally, leisure constrain negotiation had a positive effect on recreation specialization.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1560-1571
• /
• 2006

In order to transmit multimedia streams over the network with a timely changing channel bandwidth such as Internet, scalable video coding schemes have been studied to represent video in flexible bitstream. Much research has been made on how to represent encoded media(such as video) bitstream in scalable ways. In this paper, rte propose an optimal selection of the objects for MPEG-4 bitstream adaptation to meet a given constraint. We adopt a multiple choice knapsack problem with multi-step selection for the MPEG-4 objects with different bit-rate scaling levels in the MPEG-4 bitstream. The bitstream adaptation based on the optimal selection result is then to fetch the necessary parts of the MPEG-4 bitstream to constitute an adapted version of the original MPEG-4 binary resource. The experiment results show that the optimal selection of MPEG-4 objects for a given constraint can promisingly be made which meets the given constraint.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.917-920
• /
• 2016

SpSF algorithm is direction-of-arrival estimation algorithm based on sparse representation of incident signlas. Cost function to be optimized for DOA estimation is multi-dimensional nonlinear function, which is hard to handle for optimization. After some manipulation, the problem can be cast into convex optimiztion problem. Convex optimization problem tuns out to be constrained optimization problem, where the parameter in the constraint has to be determined. The solution of the convex optimization problem is dependent on the specific parameter value in the constraint. In this paper, we propose a rule-of-thumb for determining the parameter value in the constraint. Based on the fact that the noise in the array elements is complex Gaussian distributed with zero mean, the average of the Frobenius norm of the matrix in the constraint can be rigorously derived. The parameter in the constrint is set to be two times the average of the Frobenius norm of the matrix in the constraint. It is shown that the SpSF algorithm actually works with the parameter value set by the method proposed in this paper.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.217-220
• /
• 2000

This paper studies a real-time VBR traffic characterization. There are two big approaches to determine traffic. One is a statistic approach and the other is a deterministic approach. This paper proposes a new constraint function, what we called “Sub-Sum Constraint Function”(SSCF). This function is mainly based on a deterministic approach and uses a statistic approach. It predicts and calculates the next rate with a present information about the stream. SSCF captures the intuitive bounded by a rate lower than its peak rate and closer to its long-term average rate. This model makes a order of the constraint function much less than any other works (O(n)). It can also be mapped on a token bucket algorithm which consists of r (token rate) and b (token depth). We use a concept, EB(effective bandwidth) for a utility of our function and comparing with other techniques such as CBR, average VBR. We simulated 21 multimedia sources for verifying the utility of our function.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.7
• /
• pp.42-51
• /
• 1992

This paper suggests a measure constraint locus which is the loci of points satisfying the necessary constraint for optimality of a measure in the configuration space. The characterization of four measures for singularity avoidance is worked out by using the measure constraint locus. It gives a global look at the performance of an inverse kinematic algorithm whien each of measures in a kinematically redundant robot is used. The invertible workspace without singularities and the topological properties both on the configuration and operational spaces are analyzed. We discuss also some limitations, based on the topological arguments of measure constraint locus, of the inverse kinematic algorithms, and compare global properties of each of measure. Therfore, a new concept called measure constraint locus gives a methodology for obtaining a conservative joint trajectory without singularities for almost entire workspace.

• Journal of Welding and Joining
• /
• v.20 no.3
• /
• pp.129-137
• /
• 2002

This study presents a new method to derive the constraint coefficient from the degree of angular deformation caused by welding, as measured experimentally by varying the shape of welded joints and the magnitude of constraints and from analysis results given by the elastic FEM method. The equivalent load was then calculated with this constraint coefficient. The validity of the numerical analysis involved in this new method was confirmed by its agreement with the experimental results. As for the effects of the constraints based on the shape of the welded joints in the case of Butt welding when the constraint coefficients are not considered, the deformed quantity produced by analysis is larger that produced by experiment and consequently is largely affected by the constraints. However, in the case of Fillet welding, the deformed quantity is seldom affected regardless of constraint coefficient considerations.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.4
• /
• pp.27-34
• /
• 2019

The course timetabling problem is a kind of very complex combinatorial optimization problems, which is known as an NP-complete problem. Sometimes a given course timetabling problem can be accompanied by many constraints. At this time, even if only one constraint is violated, it can be an infeasible timetable. Therefore, it is very difficult to make an automated course timetabling system for a complex real-world course timetabling problem. This paper introduces an automated course timetabling system using constraint programming. The target problem has 26 constraints in total, and they are expressed as 24 constraints and an objective function in constraint programming. Currently, we are making a timetable through this system and applying the result to the actual class. Members' satisfaction is also much higher than manual results. We expect this paper can be a guide for making an automated course timetabling system.

• Management & Information Systems Review
• /
• v.35 no.1
• /
• pp.69-84
• /
• 2016

This study set the research model to examine the correlation between Word-of-Mouth constraint factors, efforts to negotiate pertaining to these, Flow and Word-of-Mouth intent based on the theory of leisure constrain when it comes to the correlation between consumers' Word-of-Mouth constraint factors and Word-of-Mouth. Correlation among the variables were verified in an empirical manner. Results of this study are summarized as follows. After verifying the hypotheses, all the hypotheses were adopted excluding the hypotheses of two results (Hypothesis 1, hypotheses 5). Detailed results regarding this are as follows. First, the following is the effect of the Intrapersonal Constraint and Word-of-Mouth constraint factors on the Word-of-Mouth constraint negotiation effort. Interpersonal Constraint and Structural Constraint exert positive (-) effect on the Word-of-Mouth constraint negotiation effort. In case of Intrapersonal Constraint, negative (-) effect was demonstrated. Thus, this was statistically significant although dismissed from hypothesis verification. Second, the following is the result of examining the structural correlation between Word-of-Mouth constraint negotiation effort, Flow and Word-of-Mouth. Word-of-Mouth constraint negotiation effort exerts positive (-) effect on the Flow, but it was not statistically effective in case of the Word-of-Mouth. Lastly, it is possible to see that the Flow plays the role of a medium since it exerted positive (-) effect on the Word-of-Mouth. Results of this study are expected to provide key theoretical and working level implications as well as general understanding of the Word-of-Mouth constraint factors, consumers' Flow and Word-of-Mouth.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.249-268
• /
• 2014

Relevance feedback is an effective tool to bridge the gap between superficial image contents and medically-relevant sense in content-based medical image retrieval. In this paper, we propose an interactive medical image search framework based on pairwise constraint propagation. The basic idea is to obtain pairwise constraints from user feedback and propagate them to the entire image set to reconstruct the similarity matrix, and then rank medical images on this new manifold. In contrast to most of the algorithms that only concern manifold structure, the proposed method integrates pairwise constraint information in a feedback procedure and resolves the small sample size and the asymmetrical training typically in relevance feedback. We also introduce a long-term feedback strategy for our retrieval tasks. Experiments on two medical image datasets indicate the proposed approach can significantly improve the performance of medical image retrieval. The experiments also indicate that the proposed approach outperforms previous relevance feedback models.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.1-12
• /
• 2009

Iterative algorithms are proposed for the least-squares symmetric solution of AXB = E with a submatrix constraint. We characterize the linear mappings from their independent element space to the constrained solution sets, study their properties and use these properties to propose two matrix iterative algorithms that can find the minimum and quasi-minimum norm solution based on the classical LSQR algorithm for solving the unconstrained LS problem. Numerical results are provided that show the efficiency of the proposed methods.