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

In this paper, we present a systematic optimization method that has flexibility of exact assignment of eigenstructure with disturbance suppression and fault isolation capability. The eigenstructure for fault isolation is assigned by the inclusion of a eigenstructure assignment problem in the objective function as well as a disturbance suppression term is also included in the objective function enhance the robustness of the control scheme. The proposed scheme is applied to designing asimple system to confirm the usefulness of the scheme.

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

In this paper, we propose a novel robust fault isolation filter design method using the left eigenstructure assignment scheme proposed b\ulcorner author. An eigenstructure assignment methodology that satisfies the required fault isolation conditions is also proposed. The proposed method guarantees that the corrupted ${\gamma}$ simultaneous faults can be isolated when the numbers of available output measurements are ${\gamma}$.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.12
• /
• pp.1-8
• /
• 1997

In this paper, a new method of state code assignment for reduction of switching activities of state transition in asynchronous circuits is proposed. The algorithm is based on a on-hot code and modifies it to reduce switching activities. To estimate switching activities as a cost functions we introduce state transition probability (STP). AS a results, the proposed algorithm has an advantage of 60% over with the conventional code assignment in terms of switching and code length of state assignment.

• Asian-Australasian Journal of Animal Sciences
• /
• v.18 no.11
• /
• pp.1529-1534
• /
• 2005

Individual-breed assignments were implemented in six swine populations using twenty six microsatellites recommended by the Food and Agriculture Organization and the International Society for Animal Genetics (FAO-ISAG). Most microsatellites exhibited high polymorphisms as shown by the number of alleles and the polymorphism information content. The assignment accuracy per locus obtained by using the Bayesian method ranged from 33.33% (CGA) to 68.47% (S0068), and the accumulated assignment accuracy of the top ten loci combination added up to 96.40%. The assignment power of microsatellites based on the Bayesian method had positive correlations with the number of alleles and the gene differential coefficient ($G_{st}$) per locus, while it has no relationship to genetic heterozygosity, polymorphism information content per locus and the exclusion probabilities under case II and case III. The percentage of corrected assignment was highest for the Bayesian method, followed by the gene frequency and distancebased methods. The assignment efficiency of microsatellites rose with increase in the number of loci used, and it can reach 98% when using a ten-locus combination. This indicated that such a set of ten microsatellites is sufficient for breed verification purposes.

• Proceedings of the Korea Information Assurance Society Conference
• /
• 2004.05a
• /
• pp.111-117
• /
• 2004

In distributed-computing environments, there is a strong demand for the authentication and the access control of distributed-shared resources. I have presented role-based access control (RBAC) concept that is in the spotlight recently. RBAC model shows the standardized access control of complicated organization's resources. In RBAC, senior role has junior role's permission by virtue of role hierarchy. But, junior role cannot perform the permission, which is granted to the senior or other role groups. Inheritances of permissions in role hierarchies are static. In order to tackle this problem, I propose a dynamic role assignment, which classified into passive role assignment and active role assignment, and design dynamic role assignment protocol and implement role assignment server.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.964-972
• /
• 2009

Wireless mesh network (WMN) is emerging a future core technology to resolve many problems derived from exist wireless networks by employing multi-interface and multi-channel. Ability to utilize multiple channels in WMNs substantially increases the effective bandwidth available to wireless network nodes. However, minimum interference channel assignment algorithms are required to use the effective bandwidth in multi-channel environments. This paper proposes a cluster-based minimum interference channel assignment (MI-CA) algorithm to improve the performance of WMN. The MI-CA algorithm is consists of Inter-Cluster and Intra-Cluster Intrchannel assignment between clusters and in the internal clusters, respectively. The Inter-Cluster channel assignment assigns a barebone channel to cluster heads and border nodes based on minimum spanning tree (MST) and the Intra-Cluster channel assignment minimizes channel interference by reassigning ortasgonal channels between cluster mespann. Our simheation results show that MI-CA can improve the performance of WMNs by minimizing channel interference.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.108-116
• /
• 2015

A missile defense system is composed of radars detecting incoming missiles aiming at defense assets, command control units making the decisions on weapon target assignment, and artillery batteries firing of defensive weapons to the incoming missiles. Although, the technology behind the development of radars and weapons is very important, effective assignment of the weapons against missile threats is much more crucial. When incoming missile targets toward valuable assets in the defense area are detected, the asset-based weapon target assignment model addresses the issue of weapon assignment to these missiles so as to maximize the total value of surviving assets threatened by them. In this paper, we present a model for an asset-based weapon assignment problem with shoot-look-shoot engagement policy and fixed set-up time between each anti-missile launch from each defense unit. Then, we show detailed linear approximation process for nonlinear portions of the model and propose final linear approximation model. After that, the proposed model is applied to several ballistic missile defense scenarios. In each defense scenario, the number of incoming missiles, the speed and the position of each missile, the number of defense artillery battery, the number of anti-missile in each artillery battery, single shot kill probability of each weapon to each target, value of assets, the air defense coverage are given. After running lpSolveAPI package of R language with the given data in each scenario in a personal computer, we summarize its weapon target assignment results specified with launch order time for each artillery battery. We also show computer processing time to get the result for each scenario.

• Industrial Engineering and Management Systems
• /
• v.2 no.1
• /
• pp.9-27
• /
• 2003

In a wafer fabrication factory, the completion time of an order is affected by many factors related to the specifics of the order and the status of the system, so is difficult to predict precisely. The level of influence of each factor on the order completion time may also depend on the production system characteristics, such as the rules for releasing and dispatching. This paper presents a method to identify those factors that significantly impact upon the order completion time under various combinations of scheduling rules. Computer simulations and statistical analyses were used to develop effective due date assignment models for improving the due date related performances. The first step of this research was to select the releasing and dispatching rules from those that were cited so frequently in related wafer fabrication factory researches. Simulation and statistical analyses were combined to identify the critical factors for predicting order completion time under various combinations of scheduling rules. In each combination of scheduling rules, two efficient due date assignment models were established by using the regression method for accurately predicting the order due date. Two due date assignment models, called the significant factor prediction model (SFM) and the key factor prediction model (KFM), are proposed to empirically compare the due date assignment rules widely used in practice. The simulation results indicate that SFM and KFM are superior to the other due date assignment rules. The releasing rule, dispatching rule and due date assignment rule have significant impacts on the due date related performances, with larger improvements coming from due date assignment and dispatching rules than from releasing rules.

• Journal of Korea Society of Industrial Information Systems
• /
• v.28 no.1
• /
• pp.27-34
• /
• 2023

The optimal assignment problem between agents and tasks is known as one of the representative problems of combinatorial optimization and an NP-hard problem. This paper covers multi agent-multi task assignment problems with uncertain completion probability. The completion probabilities are generally uncertain due to endogenous (agent or task) or exogenous factors in the system. Assignment decisions without considering uncertainty can be ineffective in a real situation that has volatility. To consider uncertain completion probability mathematically, a mathematical formulation with stochastic programming is illustrated. We also present an algorithm by using the sample average approximation method to solve the problem efficiently. The algorithm can obtain an assignment decision and the upper and lower bounds of the assignment problem. Through numerical experiments, we present the optimality gap and the variance of the gap to confirm the performances of the results. This shows the excellence and robustness of the assignment decisions obtained by the algorithm in the problem with uncertainty.

• Korean Management Science Review
• /
• v.14 no.1
• /
• pp.31-52
• /
• 1997

The Generalized Assignment Problem(GAP) determines the minimum assignment of n tasks to m workstations such that each task is assigned to exactly one workstation, subject to the capacity of a workstation. In this paper, we presented a new heuristic search algorithm for GAPs. then we tested it on 4 different benchmark sample sets of random problems generated according to uniform distribution on a microcomputer.