• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.197-201
• /
• 2003

We study in this paper both distributed power control and removal algorithms for multimedia CDMA wireless networks. In our study, users can have different data rates as well as different quality of service (QoS) requirements. We derive a necessary and sufficient condition for the fully distributed power control (FDPC) algorithm to find a feasible power set. We also prove that, if the maximal power level is used at the start, then the distributed constrained power control (DCPC) algorithm is equivalent to the FDPC algorithm. For the connection removal algorithm, we prove that the non-reinitialized removal algorithm finds a feasible power set faster and employs smaller power levels than the reinitialized one does. Performances of some connection removal criteria are also studied. Our simulation results reveal that the smallest normalized CIR (SNC) and largest CIR requirement (LCR) criteria result in smaller outage probability than the smallest CIR (SC) criterion in a multimedia environment.

• The Journal of the Korea Contents Association
• /
• v.4 no.2
• /
• pp.50-60
• /
• 2004

Recently, most of the embedded system is required not only many functions but also real-time characteristics in purpose. In the hard real-time system, especially, strict deadline of periodic task can affect the performance of the system. In this paper, we design and implement the scheduler based on RM(Rate-Monotonic) rule. This scheduler makes feasible patterns based on EDF(Earliest deadline first) rule with extended schedulability inspection before execution, for periodic task-set that has high CPU utilization and then, execute periodic task-set depended on feasible patterns. The feasible pattern formed into EDF rule is capable of the efficiency of CPU up to 100 percentage and by the referenced execution of the feasible pattern is possible of removing the red-time scheduling overhead that is the defect of the order of dynamic assignment rule.

• Korean Journal of Social Welfare
• /
• v.69 no.3
• /
• pp.289-315
• /
• 2017

Debate on basic income expanded worldwide as well as in South Korea. However, the expansion of these discussion has led to vigorous arguments for and against the various claims of basic income. In order to introduce basic income in Korea, discussing on the picture of Korean welfare state which includes basic income is important. In this study, 'Ideal Model of Korean Basic Income (and Welfare State)'is discussed and theoretically constructed using fuzzy-set ideal type approach, and feasible paths in realizing Korean basic income are suggested. This study attempts to contribute to a practical discussion on taking feasible and reasonable path to realize full basic income in Korean welfare state.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.4
• /
• pp.113-128
• /
• 2016

This paper proposes a Bi-level Genetic Algorithm for the Fixed Charge Transportation Problem with Non-linear Unit Cost. The problem has the property of mixed integer program with non-linear objective function and linear constraints. The bi-level procedure consists of the upper-GA and the lower-GA. While the upper-GA optimize the connectivity between each supply and demand pair, the lower-GA optimize the amount of transportation between the pairs set to be connected by the upper-GA. In the upper-GA, the feasibility of the connectivity are verified, and if a connectivity is not feasible, it is modified so as to be feasible. In the lower-GA, a simple method is used to obtain a pivot feasible solution under the restriction of the connectivity determined by the upper-GA. The obtained pivot feasible solution is utilized to generate the initial generation of chromosomes. The computational experiment is performed on the selected problems with several non-linear objective functions. The performance of the proposed procedure is analyzed with the result of experiment.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.351-360
• /
• 2005

This paper finds a new class of generalized convex function which satisfies the following properties: It's level set is $\eta$-convex set; Every feasible Kuhn-Tucker point is a global minimum; If Slater's constraint qualification holds, then every minimum point is Kuhn-Tucker point; Weak duality and strong duality hold between primal problem and it's Mond-Weir dual problem.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.4
• /
• pp.237-243
• /
• 1997

A new method is introduced for the interpolation in NURBS Surface. This method uses the basis functions to assign the parameter values to the arbitrary set of geometric data and uses the iteration method to compute the control net. The advantages of this method are the feasible transformation of the data set to the matrix form and the effective surface generation as a result, especially to the design engineer.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.623-624
• /
• 2008

We present a level set method for numerical shape optimization of electromagnetic systems. The level set method does not only lead to efficient computational schemes, but also is able to handle topological changes such as merging, splitting and even disappearing of connected components. The velocity field on boundaries is obtained by a shape derivative of continuum sensitivity analysis using the material derivative concept and an adjoint variable technique. Two numerical results of dielectric optimization between electrodes showed that the level set method is feasible and effective in solving shape optimization problems of electromagnetic systems.

• Korean Journal of Construction Engineering and Management
• /
• v.12 no.4
• /
• pp.50-58
• /
• 2011

Lean concept is management philosophy that defines a customer's value and eliminates wasteful and impeditive factors. Management philosophy of Lean in the construction industry is referred to as "Lean Construction". Now this concept has expanded to achieve effective productivity during the design phase. Currently the norm of the domestic design process has been Point-based Design(PBD). It involves selecting a single structurally-feasible design option early and then refining that single design as more information becomes available throughout the design process. This single design is then re-worked until a solution is found that is feasible for all parties. On the contrary, Set-based Design(SBD) is based on lean processes to eliminate waste and improve project productivity. It focuses on keeping the design space as open as long as possible, to allow "subdesign" to advance and not labeling them as secondary in importance. Preserving the maximum number of feasible designs as long as possible reduces the likelihood that rework will be necessary and allows all project participants to utilize their unique expertise to make the project successful. This study proposes that the design methodology of minimizing waste and increasing productivity through SBD of AHP, one of the decision making process so as to compare PBD with SBD and tries to find decision making process and then suggest that application methodology through performs case study of SBD process.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.1
• /
• pp.263-272
• /
• 2016

By using the finite projective geometry method, the separating properties of linear constant-weight codes are presented. An algorithm is given for computing the cardinality of separating coordinate positions of certain disjoint codeword sets of linear constant-weight codes.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.83-86
• /
• 1996

In this paper we study the problem of augmenting a physical network to improve the topology for new survivable network architectures. We are given a graph G=(V,E,F), where V is a set of nodes that represents transmission systems which be interconnected by physical links, and E is a collection of edges that represent the possible pairs of nodes between which a direct transmission link can be placed. F, a subset of E is defined as a set of the existing direct links, and E/F is defined as a set of edges for the possible new connection. The cost of establishing network $N_{H}$=(V,H,F) is defined by the sum of the costs of the individual links contained in new link set H. We call that $N_{H}$=(V,H,F) is feasible if certain connectivity constrints can be satisfied in $N_{H}$=(V,H,F). The computational goal for the suggested model is to find a minimum cost network among the feasible solutions. For a k edge (node) connected component S .subeq. F, we charactrize some optimality conditions with respect to S. By this characterization we can find part of the network that formed by only F-edges. We do not need to augment E/F edges for these components in an optimal solution. Hence we shrink the related component into a node. We study some good primal heuristics by considering construction and exchange ideas. For the construction heuristics, we use some greedy methods and relaxation methods. For the improvement heuristics we generalize known exchange heuristics such as two-optimal cycle, three-optimal cycle, pretzel, quezel and one-optimal heuristics. Some computational experiments show that our heuristic is more efficient than some well known heuristics.stics.