• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.189-192
• /
• 2000

This paper proposes a fuzzy-based random access controller with a superimposed frame structure (F$^2$RAC) fur voice/data-integrated wireless networks. F$^2$RAC adopts mini-slot technique for reducing contention cost, and these mini-slots of which number may dynamically vary from one frame to the next as a function of the traffic load are further partitioned into two regions for access requests coming from voice and data traffic with their respective QoS requirements. And F$^2$RAC is designed to properly determine the access regions and permission probabilities for enhancing the data packet delay while ensuring the voice packet dropping probability constraint. It mainly consists of the estimator with Pseudo-Bayesian algorithm and fuzzy logic controller with Sugeno-type of fuzzy rules. Simulation results prove that F$^2$RAC can guarantee QoS requirement of voice and provide the highest throughput efficiency and the smallest data packet delay amongst the different alternatives including PRMA［1］, IPRMA［2］, and SIR［3］.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.1-8
• /
• 2004

In this paper, we propose a method for restoring trademark and caption areas using an isophote. In our method, the image restoration problem is modeled as an optimization problem, which in our case, is solved by a cost function with isophote constraint that is minimized using a GA The technique creates an optimal connection of all pairs of isophotes disconnected by a caption in the frame. For connecting the disconnected isophotes, we estimate the value of the smoothness, given by the best chromosomes of the GA and project this value in the isophote direction. Experimental results show that the isophote operator worked better than Laplacian operator for image restoration, and the proposed method has a great possibility for automatic restoration of a region in an advertisement scene.

• Journal of IKEEE
• /
• v.15 no.1
• /
• pp.43-48
• /
• 2011

Decision problem called an optimal release policies, after testing a software system in development phase and transfer it to the user, is studied. The infinite failure non-homogeneous Poisson process models presented and propose an optimal release policies of the life distribution applied extreme distribution which used to find the minimum (or the maximum) of a number of samples of various distributions. In this paper, discuss optimal software release policies which minimize a total average software cost of development and maintenance under the constraint of satisfying a software reliability requirement. In a numerical example, extreme value distribution as another alternative of existing the Poisson execution time model and the log power model can be verified using inter-failure time data.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.89-93
• /
• 2013

This paper is estimating a target direction of arrival with incident to receiver in spatial. This paper presented covariance using constraint matrix to correlation interference signal cancellation in multi input multi output array antennas system. we proposed a target direction of arrival estimation algorithm using cost function and minimum variance method. Through simulation, we were analysis a performance to compare general SPT-LCMV algorithm and proposal algorithm. We showed that proposal algorithm improve more target estimation than general SPT-LCMV algorithm in direction of arrival.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1724-1729
• /
• 1991

This paper gives an overview of HIGIPS design concepts and prototype HIGIPS configuration, and discusses its application to recognition of the 3-D motion of a human arm. HIGIPS which employs the combination of pipeline architecture and multiprocessor architecture, is a high-speed, high-performance and low cost N * M multimicroprocessor parallel machine, where N is the number of pipeline stages and M is the number of processors in each stage. The algorithm to recognize the motion of a human arm with a single TV camera was developed on personal computer (NEC PC9801 series). As a constraint condition, some simple ring marks are used. Each joint of the arm is attached with a ring mark to obtain its centroid position when the arm moves. These centroid positions in the three-dimensional space are linked at each of the successive pictures of the moving arm to recover its overall motion. This algorithm takes about 2 seconds to process one image frame on the general-purpose personal computer. This paper mainly discuses how to partition this algorithm and execute on HIGIPS, and shows the speed up. From this application, it is clear that HIGIPS is an efficient machine for image processing and recognizing.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.6
• /
• pp.1827-1835
• /
• 1996

This paper addresses the problem of a torch path generation for the 2D laser cutting of a stock plate nested with resular or irregular parts. Under the constaint of the relative positions of parts enforced by nesting, the developed torch path algorithm generate feasible cutting path. In this paper, the basic object is a polygon( a many-slide figure) with holes. A part may be represented as a number of line segments connected end-to-end in counterclockwise order, and formed a closed contour as requied for cutting paths. The objective is to tranverse this cutting contours with a minimum path length. This paper proposes a simulated annealing based dtorch path algorithm, that is an improved version of previously suggested TSP models. Since everypiercing point of parts is not fixed in advance, the algorithm solves as relazed optimization problem for the constraint, thich is one of the main features of the proposed algorithm. For aolving the torch path optimization problem, an efficient generation mechanism of neighborhood structure and as annealing shedule were introduced. In this way, a global solution can be obtained in a reasonable time. Seveeral examples are represented to ilustrate the method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.2
• /
• pp.21-31
• /
• 1986

Consider a capacitated facility location problem in which the demands of customers are all equal and so are the capacities of facilities. Under the restriction that each customer's uniform demand be met by exactly one facility, the objective is to select a set of facilities to open, and to assign customer's demand to them so as to minimize the total cost which includes fixed costs of opening facilities as well as variable assignment costs. The problem is modelled as a pure zero-one program which may be viewed as a variant of well-known capacitated facility location problems. The purpose of this study is to develop efficient computational procedures for solving the pure zero-one facility location problems. Due to the special structure of our zero-one location problem with uniform demand, it can be converted to a location problem with the unimodular property. A Lagrangean relaxation algorithm is developed to solve the location problem. The algorithm is made efficient by employing a device which exploits the special structure of a surrogate constraint. The efficiency of the algorithm is analyzed through computational experiments with some test problems.

• Journal of the Korean Society for Precision Engineering
• /
• v.29 no.10
• /
• pp.1110-1118
• /
• 2012

In this study, for reducing the residual vibration in high speed motion control stage, an improved 5th order polynomial motion profile was developed. When a stage is moving, the current through the motor coils has the same profile of input motion profile of acceleration, therefore the characteristics of the acceleration input profile directly affect on the performance of the amplifier that includes the current control loop. Commonly low cost amplifier and motor has a narrow current control bandwidth, therefore the proposed algorithm was designed based on this practical constraint. Simulation and experimental results showed that the proposed algorithm clearly has low residual vibration characteristics than conventional 5th order polynomial motion profile on the same drive condition.

• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.129-138
• /
• 2004

In the telecommunications network, multicasting is widely used recently. Multicast tree problem is modeled as the NP-complete Steiner problem in the networks. In this paper, we study algorithms for finding efficient multicast trees with hop and node degree constraints. Multimedia service is an application of multicasting and it is required to transfer a large volume of multimedia data with QoS(Quality of Service). Though heuristics for solving the multicast tree problems with one constraint have been studied. however, there is no optimum algorithm that finds an optimum multicast tree with hop and node degree constraints up to now. In this paper, an approach for finding an efficient multicast tree that satisfies hop and node degree constraints is presented and the experimental results explain how the hop and node degree constraints affect to the total cost of a multicast tree.

• Management Science and Financial Engineering
• /
• v.10 no.2
• /
• pp.1-28
• /
• 2004

The integrated supply chain of business partners for e-Commerce in cyber space is defined as Logistics Chain if the cooperative activities are logistics-related. Logistics Chain could be managed effectively and efficiently by cooperative technologies of logistics chain execution. In this paper, we propose a routing and scheduling algorithm based on the Tabu search by adding geographical information into existing constraint for pick-up and delivery process to minimize service time and cost in logistics chain. And, we also consider an uncertainty processing for the tracing of moving object to control pick-up and delivery vehicles based on GPS/GIS/ITS. Uncertainty processing is required to minimize amount of telecommunication and database on vehicles tracing. Finally, we describe the Logistics Chain Execution (LCE) system to perform plan and control activities for postal logistics chain. To evaluate practical effects of the routing and scheduling system, we perform a pretest for the performance of the tabu search algorithm. And then we compare our result with the result of the pick-up and delivery routing plan generated manually by postmen.