• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권3호
• /
• pp.341-357
• /
• 2010

Forward Error Correction (FEC) techniques have been adopted to overcome packet losses and to improve the quality of video delivery. The efficiency of the FEC has been significantly compromised, however, due to the characteristics of the wireless channel such as burst packet loss, channel fluctuation and lack of Quality of Service (QoS) support. We propose herein an Adaptive Cross-layer FEC mechanism (ACFEC) to enhance the quality of video streaming over 802.11 WLANs. Under the conventional approaches, FEC functions are implemented on the application layer, and required feedback information to calculate redundancy rates. Our proposed ACFEC mechanism, however, leverages the functionalities of different network layers. The Automatic Repeat reQuest (ARQ) function on the Media Access Control (MAC) layer can detect packet losses. Through cooperation with the User Datagram Protocol (UDP), the redundancy rates are adaptively controlled based on the packet loss information. The experiment results demonstrate that the ACFEC mechanism is able to adaptively adjust and control the redundancy rates and, thereby, to overcome both of temporary and persistent channel fluctuations. Consequently, the proposed mechanism, under various network conditions, performs better in recovery than the conventional methods, while generating a much less volume of redundant traffic.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2003년도 추계학술대회 및 정기총회
• /
• pp.89-92
• /
• 2003

It is often that a large-scale linear programming(LP) problem may contain many constraints which are redundant or cause infeasibility on account of inefficient formulation or some errors in data input. Presolving or preprocessing is a series of operations which removes the underlying redundancy or detects infeasibility in the given LP problem. It is essential for the speedup of an LP system solving large-scale problems to implement presolving techniques. For the recovery of an optimal solution for the original problem from an optimal solution for the presolved problem, a special procedure, so called postsolving, must be applied. In this paper, we present how a postsolving procedure is constructed and implemented in LPABO, a interior-point based LP system. Briefly, all presolving processes are logged in a data structure in LPABO, and after the end of the solution method an optimal solution for the original problem is obtained by tracing the logs. In each stage of the postsolving procedure, the optimality of intermediate solutions is maintained. We tested our postsolving procedure on Netlib, Gondzio and Kennington LP data sets, and concluded that the computational burden of the procedure is relatively negligible compared with the total solving time.

• 품질경영학회지
• /
• 제47권4호
• /
• pp.701-711
• /
• 2019

Purpose: The problem of optimizing redundancy allocation in multi-level systems is considered when each item in a multi-level system has alternative items with the same function. The number of redundancy of multi-level system is allocated to maximize the reliability of the system under path set and cost limitation constraints. Methods: Based on cost limitation and path set constraints, a mathematical model is established to maximize system reliability. Particle swarm optimization is employed for redundant allocation and verified by numerical experiments. Results: Comparing the particle swarm optimization method and the memetic algorithm for the 3 and 4 level systems, the particle swarm optimization method showed better performance for solution quality and search time. Particularly, the particle swarm optimization showed much less than the memetic algorithm for variation of results. Conclusion: The proposed particle swarm optimization considerably shortens the time to search for a feasible solution in MRAP with path set constraints. PS optimization is expected to reduce search time and propose the better solution for various problems related to MRAP.

• 대한기계학회논문집A
• /
• 제33권10호
• /
• pp.1014-1022
• /
• 2009

A biped robot in locomotion can be regarded to be kinetically redundant in that the link-chain from its foot on the ground to its swing foot has more degrees of freedom that needed to realize stable bipedal locomotion. This paper proposes a new method to generate a trajectory for bipedal locomotion based on this redundancy, which directly generates a locomotion trajectory at the joint level unlike some other methods such as LIPM (linear inverted-pendulum mode) and GCIPM (gravity-compensated inverted-pendulum mode), each of which generates a trajectory of the center of gravity or the hip link under the assumption of the dominance of the hip-link inertia before generating the trajectory of the whole links at the joint level. For the stability of the trajectory generated in the proposed method, a stability condition based on the ZMP (zero-moment point) is used as a constraint as well as other kinetic constraints for bipedal motions. A 6-DOF biped robot is used to show how a stable locomotion trajectory can be generated in the sagittal plane by the proposed method and to demonstrate the feasibility of the proposed method.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.37-58
• /
• 1997

An AI approach with tabu search is designed to solve multi-level knapsack problems. The approach performs intelligent actions with memories of historic data and learning effect. These action are developed ont only by observing the attributes of the optimal solution, the solution space, and its corresponding path to the optimal, but also by applying human intelligence, experience, and intuition with respect to the search strategies. The approach intensifies, or diversifies the search process appropriately in time and space. In order to create a good neighborhood structure, this approach uses two powerful choice rules that emphasize the impact of candidate variables on the current solution with respect to their profit contribution. "Pseudo moves", similar to "aspirations", support these choice rules during the evaluation process. For the purpose of visiting as many relevant points as possible, strategic oscillation between feasible and infeasible solutions around the boundary is applied. To avoid redundant moves, short-term (tabu-lists), intemediate-term (cycle-detection), and long-term (recording frequency and significant solutions for diversfication) memories are used. Test results show that among the 45 generated problems (these problems pose significant or insurmountable challenges to exact methods) the approach produces the optimal solutions in 39 cases.lutions in 39 cases.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2000년도 춘계정기학술대회 e-Business를 위한 지능형 정보기술 / 한국지능정보시스템학회
• /
• pp.333-340
• /
• 2000

Research on group decisions and electronic meeting systems have been increasing rapidly according to the widespread of Internet technology. Although various issues have been raised in empirical research, we will try to solve an issue on idea categorizing in the group decision making process of electronic meeting systems. Idea categorizing used at existing group decision support systems was performed in a top-down procedure and mostly b participants; manual work. This resulted in tacking as long in idea categorizing as it does for idea generating clustering an idea in multiple categories, and identifying almost similar redundant categories. However such methods have critical limitation in the electronic meeting systems, we suggest an intelligent idea categorizing methodology which is a bottom-up approach. This method consists of steps to present idea using keywords, identifying keywords' affinity, computing similarity among ideas, and clustering ideas. This methodology allows participants to interact iteratively for clear manifestation of ambiguous ideas. We also developed a prototype system, IIC (intelligent idea categorizer) and evaluated its performance using the comparision experimetn with other systems. IIC is not a general purposed system, but it produces a good result in a given specific domain.

• 한국컴퓨터정보학회논문지
• /
• 제21권10호
• /
• pp.125-133
• /
• 2016

In this paper, we propose a real-time fault monitoring and dual system design of the countdown time-generating system, which is the main component of the mission control system. The countdown time-generating system produces a countdown signal that is distributed to mission control system devices. The stability of the countdown signal is essential for the main launch-related devices because they perform reserved functions based on the countdown time information received from the countdown time-generating system. Therefore, a reliable and fault-tolerant design is required for the countdown time-generating system. To ensure system reliability, component devices should be redundant and faults should be monitored in real time to manage the device changeover from Active mode to Standby mode upon fault detection. In addition, designing different methods for mode changeover based on fault classification is necessary for appropriate changeover. This study presents a real-time fault monitoring and changeover system, which is based on the dual system design of countdown time-generating devices, as well as experiment on real-time fault monitoring and changeover based on fault inputs.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.514-517
• /
• 1996

In solving multi-level knapsack problems, conventional heuristic approaches often assume a short-sighted plan within a static decision enviornment to find a near optimal solution. These conventional approaches are inflexible, and lack the ability to adapt to different problem structures. This research approaches the problem from a totally different viewpoint, and a new method is designed and implemented. This method performs intelligent actions based on memories of historic data and learning. These actions are developed not only by observing the attributes of the optimal solution, the solution space, and its corresponding path to the optimal solution, but also by applying human intelligence, experience, and intuition with respect to the search strategies. The method intensifies, or diversifies the search process appropriately in time and space. In order to create a good neighborhood structure, this method uses two powerful choice rules that emphasize the impact of candidate variables on the current solution with respect to their profit contribution. A side effect of so-called "pseudo moves", similar to "aspirations", supports these choice rules during the evaluation process. For the purpose of visiting as many relevant points as possible, strategic oscillation between feasible and infeasible solutions around the boundary is applied for intensification. To avoid redundant moves, short-term (tabu-lists), intermediate-term (cycle detection), and long-term (recording frequency and significant solutions for diversification) memories are used. Test results show that among the 45 generated problems (these problems pose significant or insurmountable challenges to exact methods) the approach produces the optimal solutions in 39 cases.lutions in 39 cases.

• Archives of Plastic Surgery
• /
• 제44권5호
• /
• pp.457-468
• /
• 2017

Background Abdominoplasty, with or without liposuction, is among the most frequently performed aesthetic procedures. Its main objective is to improve the body contour by means of excising redundant skin and fat tissue. Although abdominoplasty is considered a safe procedure with high satisfaction rates, intraoperative and postoperative complications can become a challenge for the surgical team. The aim of this article is to offer a synopsis of the most common complications arising after abdominoplasty, along with evidence-based guidelines about how to prevent and treat them. Methods A systematic MEDLINE search strategy was designed using appropriate Medical Subject Headings (MeSH) terms, and references were scanned for further relevant articles. Results According to the published case series, local complications are considerably more common than complications with systemic repercussions. Approximately 10% to 20% of patients suffer a local complication following abdominoplasty, while fewer than 1% suffer a systemic complication. Prevention and management strategies are critically discussed for complications including seroma, haematoma, infection, skin necrosis, suture extrusions, hypertrophic scars, neurological symptoms, umbilical anomalies, deep venous thrombosis and pulmonary thromboembolism, respiratory distress, and death. Conclusions The complications of abdominoplasty vary in severity and in the impact they have on the aesthetic outcomes. Recommendations for prevention and management are based on various levels of evidence, with a risk of observer bias. However, most complications can be treated appropriately following the current standards, with satisfactory results.

• Archives of Plastic Surgery
• /
• 제45권4호
• /
• pp.319-324
• /
• 2018

Perforator flaps are becoming increasingly common, and as primary thinning techniques are being developed, the need for secondary contouring of flaps is decreasing. However, many reconstructive flap procedures still incorporate secondary debulking to improve the functional and aesthetic outcomes. Direct excision, liposuction, tissue shaving with an arthroscopic cartilage shaver, and skin grafting are the four major methods used for secondary debulking. Direct excision is primarily applied in flaps where the skin is redundant, even though the volume is not excessive. However, due to the limited range of excision, performing a staged excision is recommended. Liposuction can reduce the amount of subcutaneous tissue of the flap and protect the vascular pedicles. However, the main drawback of this method is its limited ability to remove fibrotic tissues, for which the use of a shaver may be more convenient. The main drawback of using a shaver is that it is difficult to simultaneously remove excess skin. Skin grafting enables the removal of sufficient excess tissue to recover the contour of the normal limb and to improve the color match, facilitating excellent aesthetic results.