• The KIPS Transactions:PartA
• /
• v.18A no.3
• /
• pp.115-122
• /
• 2011

It is very hard to obtain a general algorithm for solution of all the constraint satisfaction optimization problems. However, if the whole problem is separated into subproblems by characteristics of decision variables, we can assume that an algorithm to obtain solutions of these subproblems is easier. Under the assumption, we propose a problem classifying rule which subdivide the whole problem, and develop backtracking algorithms fit for these subproblems. One of the methods of finding a quick solution is efficiently arrange for any order of the search tree nodes. We choose the cluster head positioning problem in wireless sensor networks in which static characteristics is dominant and interference minimization problem of RFID readers that has hybrid mixture of static and dynamic characteristics. For these problems, we develop optimal variable ordering algorithms, and compare with the conventional methods. As a result of classifying the problem into subproblems, we can realize a backtracking framework for systematic search. We also have shown that developed backtracking algorithms have good performance in their quality.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.1007-1014
• /
• 2005

A generation of rules or patterns for detecting attacks from network is very difficult. Detection rules and patterns are usually generated by Expert's experiences that consume many man-power, management expense, time and so on. This paper proposes statistical methods that effectively detect intrusion and attacks without expert's experiences. The methods are to select useful measures in measures of network connection(session) and to detect attacks. We extracted the network session data of normal and each attack, and selected useful measures for detecting attacks using relative entropy. And we made probability patterns, and detected attacks using likelihood ratio testing. The detecting method controled detection rate and false positive rate using threshold. We evaluated the performance of the proposed method using KDD CUP 99 Data set. This paper shows the results that are to compare the proposed method and detection rules of decision tree algorithm. So we can know that the proposed methods are useful for detecting Intrusion and attacks.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.1
• /
• pp.79-85
• /
• 2006

This paper presents a strategy and tactic for robot soccer using furry logic mediator that determines robot action depending on the positions and the roles of adjacent two robots. Conventional Q-learning algorithm, where the number of states increases exponentially with the number of robots, is not suitable for a robot soccer system, because it needs so much calculation that processing cannot be accomplished in real time. A modular Q-teaming algorithm reduces a number of states by partitioning the concerned area, where mediator algorithm for cooperation of robots is used additionally. The proposed scheme implements the mediator algorithm among robots by fuzzy logic system, where simple fuzzy rules make the calculation easy and hence proper for robot soccer system. The simulation of MiroSot shows the feasibility of the proposed scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.12
• /
• pp.161-169
• /
• 2014

Digital forensics is the process of proving criminal charges by collecting and analyzing digital evidence which is related to the crime in question. Most digital forensic research is focused on digital forensic techniques themselves or cyber crime. In this paper, we designed a digital forensics-criminal investigation linked model in order to effectively apply digital forensics to various types of criminal investigations. Digital forensic ontology was developed based on this model. For more effective application of digital forensics to criminal investigation we derived specific application fields. The ontology has legality rules and adequacy rules, so it can support investigative decision-making. The ontology can be developed into an intelligent criminal investigation system.

• Journal of Arbitration Studies
• /
• v.21 no.2
• /
• pp.65-83
• /
• 2011

The purpose of Emergency Arbitrator System is to provide parties with the possibility of obtaining interim measures before constitution of the arbitral tribunal. This paper examines the Emergency Arbitrator System set forth in Article 32 and Appendix II of Arbitration Rules of Stockholm Chamber of Commerce (SCC) in comparison with Article 37 of ICDR International Arbitration Rules. This paper also provides a case study of 4 Decisions rendered by Emergency Arbitrators under the auspices of SCC in 2010. It was found that it took only 4 days on average from the date upon which the request for emergency interim measures was registered to SCC to the decision rendered by Emergency Arbitrators. The figures of average days reflect its rapidity well, one of the most preferred characteristics of arbitration. However, a case study of SCC decisions shows that only one request for interim measures was successfully granted. In other words, it was found that the requirements for granting of interim measures by emergency arbitrator were quite strictly applied. If interim measures is to be granted, it was found that the requesting party should prove to satisfy the requirements for granting of interim measures as follows: First, the requesting party has to demonstrate that it may suffer irreparable or serious harm in commercially-sensible, not in a strictly literal sense unless the interim measure is granted. Second, the party requesting interim measures has to persuade the Emergency Arbitrator that the request was of an urgent nature. Third, the requesting party is required to meet the reasonable possibility that it may succeed on the merits of the claim.

• Journal of Arbitration Studies
• /
• v.21 no.2
• /
• pp.3-25
• /
• 2011

국제상사중재를 다루는 중재판정부의 중재인은 당사자들 간의 유효한 합의를 통하여 구속력 있는 중재판정을 행사할 권한을 가진다. 중재계약에 다른 정함이 없는 한 중재인의 판정권에 대한 결정은 중재인 자신이 내린다. 중재인은 중재합의에 의하여 그 권한이 부여된 사건에 대해서만 권한을 갖게 되나, 명시적으로 그 권한에 따라야 하는 사건 외에 당해 사건을 해결하기 위하여 처리하지 않으면 안 될 모든 문제, 즉 당해 사건과 절단될 수 없는 형태로 연계되어 있는 문제 또는 그 부차적인 조건의 문제를 해결하여야 하는 책임을 지게 된다. 중재판정부는 그 자율적인 권한범위를 규율하는 권한을 가지며, 그 권한 속에는 중재합의의 존부 또는 효력에 관한 것도 포함된다. 중재인의 판정권에 이의가 있는 당사자는 법원에 중재계약의 부존재 무효 확인을 청구할 수 있고, 중재판정이 이미 내려진 경우에는 중재판정취소의 소를 제기하거나, 집행판결에서 이의를 제기할 수 있다. 우리 중재법의 입장에서 국제중재판정의 판정기준에 대해 는 중재판정부는 당사자들이 지정한 법에 따라 중재판정을 내려야 하며, 특정 국가의 법 또는 법체계가 지정된 경우에 달리 명시되지 아니하는 한 그 국가의 국제사법이 아닌 분쟁의 실체법을 지정한 것으로 보고 있다. 국제중재의 법적 안정성, 예측가능성의 관점에서 실정법을 그 판단의 규준으로 삼는다. 한국의 국제중재의 특성은 국제성 중립성, 보편성을 보장받는 점이다. 중재인 구성원은 세계 각국의 국적을 가진 전문 중재인들이 참가하고 있다. 중재절차에 있어서도 중재인은 실체법이나 절차법, 또는 법률의 상충에 관계없이 어느 특정법률을 적용하도록 강요받지 않고 각각의 경우에 가장 적합한 법률에 따르며 중재판정부의 진행절차는 국제중재규칙에 의해 규율된다.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.77-86
• /
• 2008

The Web information sources can be regarded as the largest distributed database to the users. By virtually integrating the distributed information sources and regarding them as a single huge database, we can query the database to extract information. This capability is important to develop Web application programs. We have to infer a database schema from browsing-oriented Web documents in order to integrate databases. This paper presents a heuristic algorithm to infer the XML Schema fully automatically from semi-structured Web documents. The algorithm first extracts candidate pattern regions based on predefined structure-making tags, and determines a target pattern region using a few heuristic factors, and then derives XML Schema extraction rules from the target pattern region. The schema extraction rule is represented in XQuery, which makes development of various application systems possible using open standard XML tools. We also present the experimental results for several public web sources to show the effectiveness of the algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.96-106
• /
• 1999

Case-Base Reasoning(CBR) solves the new problems by reusing the solutions to previously solved problems. But, there are differences between previously known case and a new problems. To solve this problem Case-Based System have to adapt the solution of the case to suit a new situation. In current CBR systems, case adaptation is usually performed by rule-based method that use rules hand-coded by the system developer. So, CBR system designer faces knowledge acquisition bottleneck akin to those found in traditional expert system design. To solve this problem, in this thesis, we present an automatic learning method of case adaptation knowledge using case base, we use a method of comparing cases in the case base to learn adaptation knowledge. The system is tested in the domain for the decision of travel-price. The result shows accuracy improvement in comparison with case retrieval-only system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.747-752
• /
• 2011

Microarray classification typically possesses two striking attributes: (1) classifier design and error estimation are based on remarkably small samples and (2) cross-validation error estimation is employed in the majority of the papers. A Microarray data of ovarian cancer consists of the expressions of thens of thousands of genes, and there is no systematic procedure to analyze this information instantaneously. In this paper, gene markers are selected by ranking genes according to statistics, popular classification rules - linear discriminant analysis, k-nearest-neighbor and decision trees - has been performed comparing classification accuracy of data selecting gene markers and not selecting gene markers. The Result that apply linear classification analysis at Microarray data set including marker gene that are selected using ANOVA method represent the highest classification accuracy of 97.78% and the lowest prediction error estimate.

• Journal of Digital Contents Society
• /
• v.2 no.1
• /
• pp.51-61
• /
• 2001

The FLC(Fuzzy Logic Controller) is stronger to the disturbance and has the excellent characteristic to the overshoot of the initialized value than the classical controller, and also can carry out the proper control being out of all relation to the mathematical model and parameter value of the system. But it has the restriction which can't adopt the environment changes of the control system because of generating the fuzzy control rule through an expert's experience and the fixed value of the once determined control rule, and also can't converge correctly to the desired value because of haying the minute error of the controller output value. Now there are many suggested methods to eliminate the minute error, we also suggest the GA-FNNIC(Genetic Algorithm Fuzzy Neural Network Intelligence Controller) combined FLC with NN(Neural Network) and GA(Genetic Algorithm). In this paper, we compare the suggested GA-FNNIC with FLC and analyze the output characteristics, convergence speed, overshoot and rising time. Finally we show that the GA-FNNIC converge correctly to the desirable value without any error.