• The Journal of Engineering Research
• /
• v.7 no.1
• /
• pp.17-28
• /
• 2005

A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem (CSP) in which variables and constraints are distributed among multiple automated agents. A CSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI (Distributed AI) that are concerned with finding a consistent combination of agent actions can be formalized as distributed CPSs. The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-marking. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid. Furthermore, we describe that the agent can be available to hold multiple variables in the searching scheme.

• IE interfaces
• /
• v.25 no.1
• /
• pp.96-105
• /
• 2012

Recently, the interoperability has become more important to enhance the net-centric capabilities of the warfighter. DITA (Defense Information Technical stAndard) is the set of IT standards for improving interoperability, scalability, effectiveness, and efficiency. In this paper, we analyzed the standardizing process to derive the selection criteria and structurized the derived selection criteria using the KJ (Kawakita Jiro) method. Finally, we developed an evaluation model for selecting a standard for DITA using AHP (Analytic Hierarchy Process). As a result, we present eight selection criteria (maintainability, trend, stability, portability, effect of other standard, constraint of the network, and applicability to the systems). We also applied some examples that several IT standards to our selection model for validating the model. We expect our model to help to decide objectively whether the new standard can be listed in DITA.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2008.10b
• /
• pp.292-297
• /
• 2008

복잡한 시맨틱을 포함한 웹 문서를 정확히 범주화하고 이 과정을 자동화하기 위해서는 인간의 지식체계를 수용할 수 있는 표준화, 지능화, 자동화된 문서표현 및 분류기술이 필요하다. 이를 위해 키워드 빈도수, 문서내 키워드들의 관련성, 시소러스의 활용, 확률기법 적용 등에 사용자의도(intention) 정보를 활용한 범주화와 조정 프로세스를 도입하였다. 웹 문서 분류과정에서 시소러스 등을 사용하는 지식베이스 문서분류와 비 감독 학습을 하는 사전 지식체계(a priori)가 없는 유사성 문서분류 방법에 의도정보를 사용할 수 있도록 기반체계를 설계하였고 다시 이 두 방법의 차이는 Hybrid조정프로세스에서 조정하였다. 본 연구에서 설계된 HDCI(Hybrid Document Classification with Intention) 모델은 위의 웹 문서 분류과정과 이를 제어 및 보조하는 사용자 의도 분석과정으로 구성되어 있다. 의도분석과정에 키워드와 함께 제공된 사용자 의도는 도메인 지식(domain Knowledge)을 이용하여 의도간 계층트리(intention hierarchy tree)를 구성하고 이는 문서 분류시 제약(constraint) 또는 가이드의 역할로 사용자 의도 프로파일(profile) 또는 문서 특성 대표 키워드를 추출하게 된다. HDCI는 문서간 유사성에 근거한 상향식(bottom-up)의 확률적인 접근에서 통제 및 안내의 역할을 수행하고 지식베이스(시소러스) 접근 방식에서 다양성에 한계가 있는 키워들 간 관계설정의 정확도를 높인다.

• Journal of KIISE:Software and Applications
• /
• v.29 no.5
• /
• pp.336-344
• /
• 2002

In concurrent object-oriented languages, inheritance and concurrence are the primary features. But concurrent objects and inheritance have conflicting characteristics thereby simultaneously use of them causes the problem, so called inheritance anomaly, which requires code redefinition of inherited methods to maintain integrity of objects. In this paper, to solve this inheritance anomaly without broken of encapsulation, we introduce the state abstraction concept and map internal states of the encapsulated object into abstract slates. And also, we design the inheritance interface for efficient inheritance. Through the inheritance interface containing abstract state set, though redefinition of the method is incurred, we can remove the influence of other classes in inheritance hierarchy. And also, we can solve the inheritance anomaly problems.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.11-22
• /
• 2004

A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem(CSP) in which variables and constraints are distributed among multiple automated agents. ACSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI (Distributed AI) that are concerned with finding a consistent combination of agent actions can be formalized as distributed CAPs. In recent years, many new backtracking algorithms for solving distributed CSPs have been proposed. But most of all, they have common drawbacks that the algorithm assumes the priority of agents is static. In this thesis, we establish a basic algorithm for solving distributed CSPs called dynamic priority search algorithm that is more efficient than common backtracking algorithms in which the priority order is static. In this algorithm, agents act asynchronously and concurrently based on their local knowledge without any global control, and have a flexible organization, in which the hierarchical order is changed dynamically, while the completeness of the algorithm is guaranteed. And we showed that the dynamic priority search algorithm can solve various problems, such as the distributed 200-queens problem, the distributed graph-coloring problem that common backtracking algorithm fails to solve within a reasonable amount of time. The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-making. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid. Furthermore, we describe that the agent can be available to hold multiple variables in the searching scheme.

• The Journal of the Korea Contents Association
• /
• v.18 no.9
• /
• pp.433-440
• /
• 2018

I investigated whether network structure of legislators affects legislative performance in a cosponsorship network. I presented the theoretical basis with network closure and structural holes, and analyzed the network in the 19th National Assembly of Republic of Korea. In the directed and weighted network, each tie means that cosponsors support the bill sponsors proposed. The performance was measured by the number of initiatives and the ratio of reflected legislation, and the network structure was measured by size, density, hierarchy, and constraint. I found that the legislators with brokerage structure have a lot of initiatives in making connection with many legislators in various groups and the legislators with hierarchical structure have the higher ratio of reflected legislation with the continuous and strong support from the members of their group. I also found that the network of ruling party lawmaker is more hierarchical than the network of opposition lawmaker.

• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.2
• /
• pp.99-105
• /
• 2010

Photovoltaic system is the core one among the new and renewable energy of the low Carbon and green growth. Recently, the necessity developing PV is emerging since its of less green hose gas emissions. However, a survey or research on the PV system has been hardly performed. It's not easy to find a appropriate location in consideration of environment. These circumstances encourages a systematic approach for the PV system development. The purpose of this study is to propose a methodology of the location analysis for developing PV system. With this, constraint and location criteria with weights of Analytic Hierarchy Process are established and quantification method of each factor is presented. The location analysis of PV system using the GIS were generalized and the results of analysis for redundant topographic features were presented as 3 criteria of the suitability rank.

• Proceedings of the KSPS conference
• /
• 1996.10a
• /
• pp.246-246
• /
• 1996

Purpose: Some of the properties of the prosodic phrasing and some acoustic and phonological effects of contrastive focus on the tonal pattern of Seoul Korean is explored based on a brief experiment of analyzing the fundamental frequency(=FO) contour of the speech of the author. Data Base and Analysis Procedures: The examples were chosen to contain mostly nasal and liquid consonants, since it is difficult to track down the formants in stops and fricatives during their corresponding consonantal intervals and stops may yield an effect of unwanted increase in the FO value due to their burst into the following vowel. All examples were recorded three times and the spectrum of the most stable repetition was generated, from which the FO contour of each sentence was obtained, the peaks with a value higher than 250Hz being interpreted as a high tone (=H). The result is then discussed within the prosodic hierarchy framework of Selkirk (1986) and compared with the tonal pattern of the Northern Kyungsang dialect of Korean reported in Kenstowicz & Sohn (1996). Prosodic Phrasing: In N.K. Korean, H never appears both on the object and on the verb in a neutral sentence, which indicates the object and the verb form a single Phonological Phrase ($={\phi}$), given that there is only one pitch peak for each $={\phi}$. However, Seoul Korean shows that both the object and the verb have H of their own, indicating that they are not contained in one $={\phi}$. This violates the Optimality constraint of Wrap-XP (=Enclose a lexical head and its arguments in one $={\phi}$), while N.K. Korean obeys the constraint by grouping a VP in a single $={\phi}$. This asymmetry can be resolved through a constraint that favors the separate grouping of each lexical category and is ranked higher than Wrap-XP in Seoul Korean but vice versa in N.K. Korean; $Align-x^{lex}$ (=Align the left edge of a lexical category with that of a $={\phi}$). (1) nuna-ka manll-ll mEk-nIn-ta ('sister-NOM garlic-ACC eat-PRES-DECL') a. (LLH) (LLH) (HLL) ----Seoul Korean b. (LLH) (LLL LHL) ----N.K. Korean Focus and Phrasing: Two major effects of contrastive focus on phonological phrasing are found in Seoul Korean: (a) the peak of an Intonatioanl Phrase (=IP) falls on the focused element; and (b) focus has the effect of deleting all the following prosodic structures. A focused element always attracts the peak of IP, showing an increase of approximately 30Hz compared with the peak of a non-focused IP. When a subject is focused, no H appears either on the object or on the verb and a focused object is never followed by a verb with H. The post-focus deletion of prosodic boundaries is forced through the interaction of StressFocus (=If F is a focus and DF is its semantic domain, the highest prominence in DF will be within F) and Rightmost-IP (=The peak of an IP projects from the rightmost $={\phi}$). First Stress-F requires the peak of IP to fall on the focused element. Then to avoid violating Rightmost-IP, all the boundaries after the focused element should delete, minimizing the number of $={\phi}$'s intervening from the right edge of IP. (2) (omitted) Conclusion: In general, there seems to be no direct alignment constraints between the syntactically focused element and the edge of $={\phi}$ determined in phonology; all the alignment effects come from a single requirement that the peak of IP projects from the rightmost $={\phi}$ as proposed in Truckenbrodt (1995).