• Journal of applied mathematics & informatics
• /
• 제26권5_6호
• /
• pp.1011-1020
• /
• 2008

The problem of finding Cramer rule for solutions of some restricted linear equation Ax = b has been widely discussed. Recently Wang and Qiao consider the following more general problem AXB = D, $R(X){\subset}T$, $N(X){\supset}\tilde{S}$. They present the solution of above general restricted matrix equation by using generalized inverses and give an explicit expression for the elements of the solution matrix for the matrix equation. In this paper we re-consider the restricted matrix equation and give an equivalent matrix equation to it. Through the equivalent matrix equation, we derive condensed Cramer rule for above restricted matrix equation. As an application, condensed determinantal expressions for $A_{T,S}^{(2)}$ A and $AA_{T,S}^{(2)}$ are established. Based on above results, we present a method for computing the solution of a kind of restricted matrix equation.

• Journal of Information Processing Systems
• /
• 제13권6호
• /
• pp.1496-1515
• /
• 2017

One of the most visible developments in Decision Support Systems (DSS) was the emergence of rule-based expert systems. Hence, despite their success in many sectors, developers of Medical Rule-Based Systems have met several critical problems. Firstly, the rules are related to a clearly stated subject. Secondly, a rule-based system can only learn by updating of its rule-base, since it requires explicit knowledge of the used domain. Solutions to these problems have been sought through improved techniques and tools, improved development paradigms, knowledge modeling languages and ontology, as well as advanced reasoning techniques such as case-based reasoning (CBR) which is well suited to provide decision support in the healthcare setting. However, using CBR reveals some drawbacks, mainly in its interrelated tasks: the retrieval and the adaptation. For the retrieval task, a major drawback raises when several similar cases are found and consequently several solutions. Hence, a choice for the best solution must be done. To overcome these limitations, numerous useful works related to the retrieval task were conducted with simple and convenient procedures or by combining CBR with other techniques. Through this paper, we provide a combining approach using the multi-criteria analysis (MCA) to help, the traditional retrieval task of CBR, in choosing the best solution. Afterwards, we integrate this approach in a decision model to support medical decision. We present, also, some preliminary results and suggestions to extend our approach.

• 전자공학회논문지A
• /
• 제30A권9호
• /
• pp.46-58
• /
• 1993

Owing to the nature of locality in mask layouts, it appears that most mask layout problems can be solved by transforming a part of the given mask layout into a better layout segment continuously toward a global suboptimal solution. This notion of local transformation addresses major weak points of existing mask layout processing systems, which lack both extensibility and unifiability. This paper attempts to elaborate upon developing a new rule-based mask layout transformation system wherein most of the mask layout problems can be solved under the unified framework of local mask layout transformation. The rule-based mask layout transformation system is applicable to various mask layout problems such as net extraction, mask layout compaction, mask layout editing, and design rule checking. The experimental results show that the rule-based expert system approach is an efficient means of solving those mask layout problems, and thus confronting major drawbacks of existing layout processing systems.

• 제어로봇시스템학회논문지
• /
• 제4권5호
• /
• pp.624-629
• /
• 1998

Evolutionary computation techniques can solve search problems using simulated evolution based on the ‘survival of the fittest’. Recently, the genetic programming (GP) which evolves computer programs using the genetic algorithm was introduced. In this paper, the genetic programming technique is used in order to design a rule based controller consisting of condition-action rules for an unknown system. No a priori knowledge about the structure of the controller is needed. Representation of a solution, functions and terminals in GP are analyzed, and a method of constructing a fuzzy logic controller using the obtained rule based controller is described. A simulation example using a nonlinear system shows the validity and efficiency of the proposed method.

• International Journal of Control, Automation, and Systems
• /
• 제5권3호
• /
• pp.329-336
• /
• 2007

This paper considers a fault accommodation problem for inertial navigation systems (INS) that have redundant inertial sensors such as gyroscopes and accelerometers. It is wellknown that the more sensors are used, the smaller the navigation error of INS is, which means that the error covariance of the position estimate becomes less. Thus, when it is decided that double faults occur in the inertial sensors due to fault detection and isolation (FDI), it is necessary to decide whether the faulty sensors should be excluded or not. A new accommodation rule for double faults is proposed based on the error covariance of triad-solution of redundant inertial sensors, which is related to the navigation accuracy of INS. The proposed accommodation rule provides decision rules to determine which sensors should be excluded among faulty sensors. Monte Carlo simulation is performed for dodecahedron configuration, in which case the proposed accommodation rule can be drawn in the decision space of the two-dimensional Cartesian coordinate system.

• 한국지능시스템학회논문지
• /
• 제14권1호
• /
• pp.15-19
• /
• 2004

개미군락시스템 (Ant Colony System, ACS)은 조합 최적화 문제를 해결하기 위한 기법으로 생물학적 기반의 메타휴리스틱 접근법이다. 지나간 경로에 대하여 페로몬을 분비하고 통신 매개물로 사용하는 실제 개미들의 추적 행위를 기반으로 한다. 최적 경로를 찾기 위해서는 보다 다양한 에지들에 대한 탐색이 필요하다. 기존 개미군락시스템의 지역 갱신 규칙에서는 지나간 에지에 대하여 고정된 페로몬 갱신 값을 부여하고 있다. 그러나 본 논문에서는 방문한 도시간의 거리와 해당 에지의 방문 횟수를 이용하여 페로몬을 부여한다. 보다 많은 정보를 탐색에 활용함으로써 기존의 방법에 비해 지역 최적화에 빠지지 않고 더 나은 해를 찾을 수 있었다.

• 대한전기학회논문지
• /
• 제41권8호
• /
• pp.831-840
• /
• 1992

This paper presents an efficient short-term generation scheduling method using a rule-based expert/consulting system approach to assist electric energy system operators and planners. The expert system approach is applied to improve the Dynamic Programming(DP) based generation scheduling algorithm. In the selection procedure of the feasible combinations of generating units at each stage, automatic consulting on the manipulation of several constraints such as the minimum up time, the minimum down time and the maximum running time constraints of generating units will be performed by the expert/consulting system. In order to maximize the solution feasibility, the aforementioned constraints are controlled by a rule-based expert system, that is, instead of imposing penalty cost to those constraint violated combinations, which sometimes may become the very reason of no existing solution, several constraints will be manipulated within their flexibilities using the rules and facts that are established by domain experts. In this paper, for the purpose of implementing the consulting of several constraints during the dynamic process of generation scheduling, an expert system named STGSCS is developed. As a building tool of the expert system, C Language Integrated Production System(CLIPS) is used. The effectiveness of the proposed algorithm has been demonstrated by applying it to a model electric energy system.

• 산업경영시스템학회지
• /
• 제19권39호
• /
• pp.9-18
• /
• 1996

Many algorithms have been developed for optimizing the asymmectric traveling salesman problem known as a representative NP-Complete problem. The most efficient ones of them are branch and bound algorithms based on the subtour elimination approach. To increase efficiency of the branch and bound algorithm. number of decision nodes should be decreased. For this the minimum bound that is more close at the optimal solution should be found or an effective bounding strategy should be used. If the optimal solution has been known, we may apply it usefully to branching. Because a good feasible solution should be found as soon as possible and have similar features of the optimal solution. By the way, the upper bound solution in branch and bound algorithm is most close at the optimal solution. Therefore, the upper bound solution can be used instead of the optimal solution and information of which can be applied to new branching criteria. As mentioned above, this paper will propose an effective branching rule using the information of the upper bound solution in the branch and bound algorithm. And superiority of the new branching rule will be shown by comparing with Bellmore-Malone's one and carpaneto-Toth's one that were already proposed.

• 대한기계학회논문집A
• /
• 제28권6호
• /
• pp.791-798
• /
• 2004

Fatigue crack initiation lives of round cylindrical notch specimen were investigated. Firstly, local strain approximation methods, such as the modified incremental Neuber's rule and the modified incremental Glinka's equivalent strain energy density(ESED) rule, were used to get multiaxial stress and strain state components at the notch tip. Based on the history of local stress and strain, multiaxial fatigue models were used to obtain fatigue crack initiation lives. Because the solution of Neuber's rule and Glinka's ESED rule make the upper and lower bound of local strain approximations, fatigue crack initiation lives are expected to place between life predictions by two local strain approximations. Experimental data were compared with the fatigue crack initiation life prediction results.

• 대한산업공학회지
• /
• 제39권1호
• /
• pp.10-19
• /
• 2013

Dispatching rule plays an important role in a hybrid flow shop. Finding the appropriate dispatching rule becomes more challenging when there are multiple criteria, uncertain demands, and dynamic manufacturing environment. Using a single dispatching rule for the whole shop or a set of rules based on a single criterion is not sufficient. Therefore, a multi-criteria decision making technique using 'the order preference by similarity to ideal solution' (TOPSIS) and 'analytic hierarchy process' (AHP) is presented. The proposed technique is aimed to find the most suitable set of dispatching rules under different manufacturing scenarios. A simulation based case study on a PCB manufacturing process is presented to illustrate the procedure and effectiveness of the proposed methodology.