• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.607-620
• /
• 2002

In this paper, we consider the updating problems to reconstruct the biconnected-components and to reconstruct the weighted shortest path in response to the topology change of the network. We propose two distributed algorithms. The first algorithm solves the updating problem that reconstructs the biconnected-components after the several processors and links are added and deleted. Its bit complexity is O((n'+a+d)log n'), its message complexity is O(n'+a+d), the ideal time complexity is O(n'), and the space complexity is O(e long n+e' log n'). The second algorithm solves the updating problem that reconstructs the weighted shortest path. Its message complexity and ideal-time complexity are $O(u^2+a+n')$ respectively.

• Proceedings of the KIEE Conference
• /
• 2003.07e
• /
• pp.106-109
• /
• 2003

The repeatability error creeps in every corner of mechanical design as mechanical design becomes diverse and complicated. Inkjet printing has inherent repeatability error problem due to its nature of seamless incremental image synthesis of partial images. Without the calibration for the repeatability error realization of high print quality or enhancement of other printing performance could be impaired. Printer designers have met this recurrent problem even before the inception of inkjet print device and contrived various solutions as their own intelectual proprietary. Also, it is a trend to perform necessary calibration without painstaking human intervention. To come up with another useful and proprietary solution has become an important ingredient in inkjet printer design. This paper presents such a solution developed at Digital Printing Division of Samsung Electronics Company.

• Journal of computational fluids engineering
• /
• v.18 no.4
• /
• pp.53-60
• /
• 2013

The boron transport model has been implemented into the CUPID code to simulate the boron transport phenomena of the PWR. The boron concentration conservation was confirmed through a simulation of a conceptual boron transport problem in which water with a constant inlet boron concentration injected into an inlet of the 2-dimensional vertical flow tube. The step wise boron transport problem showed that the numerical diffusion of the boron concentration can be reduced by the second order convection scheme. In order to assess the adaptability of the developed boron transport model to the realistic situation, the ROCOM test was simulated by using the CUPID implemented with the boron transportation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.329-338
• /
• 2007

This paper presents a dispatching algorithm for nonidentical parallel machines problem considering rework, sequence dependent setup times and release times. For each pair of a machine and a job type, rework probability of each job on a machine can be known through historical data acquisition. The heuristic scheduling scheme named by EDDR (Earliest Due Date with Rework probability) algorithm is proposed in this paper making use of the rework probability. The proposed dispatching algorithm is measured by two objective function value: 1) total tardiness and 2) the number of reworked jobs, respectively. The extensive computational results show that the proposed algorithm gives very efficient schedules superior to the existing dispatching algorithms.

• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.185-196
• /
• 2018

Based on World Health Organization (WHO) children and adults have a problem with their oral health, such as Dental cavities and periodontal disease. It is not easy to obtain the high convince level of result of the dental and periodontal diseases. Because each of them have different degrees of uncertainty and there have several discounting factors (error rates) in different of survey. To solve this problem we propose the Dezert-Smarandache Theory (DSmT) for efficient combination of uncertain, imprecise and highly conflicting sources of information. Moreover, we apply the SEFP as a context reasoning. Finally, we make the simulation by using 12 surveys and compare Propotional Conflict Redistribution 5 (PCR5) and Dempster-Shafer Theory (DST) to show the belief or probability for the low, a heavy, high and ultra-high risk situation.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2008.10a
• /
• pp.961-964
• /
• 2008

The MgO protective layer of PDP has a strong influence on address delay. The relation, however, is not clearly understood due to the difficulty of analysis which is caused by surface charging. This paper suggests a way to avoid the charging problem and shows the correlation between workfunction measured by UPS and address delay.

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

An optimization approach is used to solve the division problem of working area, and a cost function is defined to represent the constraints on the solution, which is then mapped onto the Hopfield neural network for minimization. Each neuron in the network represents a possible combination among many components. Division is achieved by initializing each neuron that represents a possible combination and then allowing the network settle down into a stable state. The network uses the initialized inputs and the compatibility measures among components in order to divide working area.

• Journal of the Korea Convergence Society
• /
• v.9 no.4
• /
• pp.179-188
• /
• 2018

The aim of this study was to test the effect of consultant's problem-solving ability on consulting services. A questionnaire was conducted for the staff of companies that were consulted, the research models and hypotheses were tested by structural equation. As a result of this study, the moderating effect of the consultant 's problem-solving ability and the fit of the research model were confirmed. In this study, defining the problem solving ability of the consultant as an major variable was a new attempt on the research of the consultant's competence. We expect that this study will promote various research on consultant's problem-solving ability and encourage consultants to re-recognize their problem-solving ability. We will conduct research to develop a a tool for measuring the problem-solving ability of consultants recognized as the limitation of this study.

• Journal of information and communication convergence engineering
• /
• v.10 no.1
• /
• pp.1-4
• /
• 2012

Given separated points divided by a line, called a wall, in a plane, we aim to make a gate in the wall to connect the separated points to each other. In this setting, the problem is to find a location for the gate that minimizes the average distance between the points. The problem is a variant of the well-known facility location problem, which is extensively studied in the fields of operations research, location theory, theoretical computer science, and so on. In this paper, we consider the $L^1$-distance of the points in the plane. The points are projected onto the wall and so the problem is transformed to a proximity problem of points on a line. Then it is shown that the transformed problem is related to the weighted median problem of points on the line. Therefore, we obtain an O(n log n)-time algorithm to solve our problem.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.394-401
• /
• 2003

We consider a PCB grouping problem arising from the electronic industry. Given a surface mounting device, several types of PCBs and a number of component feeders used to assemble the PCBs. the optimization problem is the PCB grouping problem while minimizing setup time of component feeders. We formulate the problem as an Integer programming model and propose a column generation approach to solve the Integer programming formulation. In this approach we decompose the original problem Into master problem and column generation subproblem Starting with a few columns in the master problem. we generate new columns successively by solving subproblem optimally. To solve the subproblem. we use a branrh-and-rut approach. Computational experiments show that our solution approach gives high quality solutions in a reasonable computing time.