• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1445-1454
• /
• 1999

광역 조건식의 계산은 분산 프로그램의 수행을 테스트 또는 디버깅하기 위한 방법으로 활 발히 연구되고 있다. 이제까지 주로 연구된 광역조건식은 AND 또는 OR 광역 조건식 등이 있는데, 특히 AND 광역 조건식은 분산 프로그램의 동시적 조건을 표현하는데 유용하여 효율적인 검색 알고리즘이 활발히 연구되었다. 분산프로그램의 수행오류로서 공유자원의 배타적 접근조건은 가장 중요하고 일반적인 경우라 할 수 있다. 본 논문에서는 XOR 연산을 이용하여 공유자원 프로그램의 오류 검색을 위한 광역조건식을 기술하는 방식에 대해 제안하였다. XOR 연산을 이용한 광역 조건식은 연산자 중 많아야 하나의 지역조건식만이 참일 때 전체 조건식이 참이 되는데 이러한 성질은 여러 프로세스 중 한번에 하나만이 공유자원에 배타적으로 접근할 수 있는 조건을 표현하는데 매우 유용하다. n 개의 프로세스로 이루어진 분산프로그램에서 한개의 공유자원에 대한 배타적 접근 조건을 기술하기 위해서 AND로 연결된 광역조건식을 이용하면 O(n2)개의 광역 조건식이 필요한데 반해 XOR 연산으로는 하나의 조건식으로 나타낼 수 있다. 더구나 XOR 연산을 이용한 광역조건식은 최근 소개된 겹치는 구간의 개념을 활용하면 매우 간단하게 검색할 수 있다. 본 논문에서는 겹치는 구간을 찾는 검색 알고리즘을 소개하고 증명하였다.Abstract Detecting global predicates is an useful tool for debugging and testing a distributed program. Past research has considered several restricted forms of predicates, including conjunctive or disjunctive form of predicates. Especially, conjunctive predicates have attracted main attention not only because they are useful to describe simultaneous conditions in a distributed program, but also because it is possible to find algorithms to evaluate them within reasonable time bound. Detecting errors in accessing shared resources are the most popular and important constraints of distributed programs. In this paper, we introduced an exclusive OR predicates as a model of global predicates to describe shared resource conditions in distributed programs. An exclusive OR predicate holds only when at most one operand is true, which is useful to describe mutual exclusion conditions of distributed programs where only one process should be allowed to access the shared resource at a time. One exclusive OR predicate is enough to describe mutual exclusion condition of n processes with one shared resource, while it takes O(n2) conjunctive predicates. Moreover, exclusive OR condition is easily detectable using the concept of overlapping intervals introduced by Venkatesan and Dathan. An off-line algorithm for evaluating exclusive OR global predicates is presented with a correctness proof.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.441-450
• /
• 2008

Recently, access control on form-based web information systems has become one of the useful methods for implementing client systems in a service-oriented architecture. In particular, XForms language is being adopted in many systems as a description language for XML-based user interfaces and server interactions. In this paper, we propose an efficient algorithm for the evaluation of XPath-based access rules for XForms pages. In this model, an XForms page is a sequence of queries and the client system performs user interface realization along with XPath rule evaluations. XPath rules have instance-dependent predicates, which for the most part are shared between rules. For the efficient evaluation of shared predicate expressions in access control rules, we proposed a predicate graph model that reuses the previously evaluated results for the same context node. This approach guarantees that each predicate expression is evaluated for the relevant xml node only once.

• English Language & Literature Teaching
• /
• v.12 no.2
• /
• pp.177-194
• /
• 2006

Snyder (2001) proposes that complex predicate constructions are interrelated by shared dependence on a single parameter, the Compounding Parameter, and that the global application of the parameter explains the simultaneous acquisition of the complex predicate constructions and N-N compounds in L1 acquisition of English. Slabakova (2002) examined the status of the Compounding Parameter in the acquisition of L2 Spanish by instructed learners. The result of the study, however, was not compatible with the prediction of the Compounding Parameter, possibly due to the availability of negative evidence in the input. Building upon Slabakova's study, this paper examines the status of the Compounding Parameter in naturalistic L2 learning. It is shown that the naturalistic L2 learners do not acquire the complex predicate constructions and N-N compounds concurrently contra to the prediction of the Compounding Parameter. It is suggested that the validity of the Compounding Parameter as a theoretical construct be reconsidered.

• Language and Information
• /
• v.2 no.2
• /
• pp.155-183
• /
• 1998

The purpose of this paper is to explore the syntactic criteria for determining a secondary predicates as a predicate modifier or a conjunction, and to formalize the semantic aspects of the [-ke] structure as a predicate in Korean. Syntactically, the [-ke] structure is considered to be a secondary predicate when the shared arguments appear in both the [-ke] structure and the main verb structure. On the other hand, if they do not appear in both structures, the [-ke] structure is considered to be a connective element. Semantically the [-ke] structure has numerous aspects such as depictives, resultatives, objectivity, and emphasis. The depictives of the secondary predicate can be formalize as $p{\wedge}q$ where p represents a propositional expression of the secondary predicate and q is a propositional expression of the main verb. Resultatives have the logical form $q{\rightarrow}{\Box}p$, because the consequence has to always be true. However, objectivity has the logical form $q{\rightarrow}{\diamondsuit}p$, because the consequence can be either true or false. Emphasis is represented as $q{\rightarrow}p{\uparrow}$ because the secondary predicate represents the polarity of the event.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.1
• /
• pp.1-6
• /
• 2003

As the condition evaluation of the active rules is performed whenever an event occurs, the performance of the system is influenced greatly depending on the conditions Processing method. Therefore, a study on evaluating the conditions of active rules becomes a very important element for enhancing the performance of active database. and the processing time of the calculation generated from the conditions must be minimized in order to improve the Performance. In this paper, the tree processing system which can effectively Process the join and selection operations is proposed. The experimental results show that tree processing system has the lower evaluation cost for the conditions processing of the active rules than the existing methods.

• The Journal of Korean Medicine
• /
• v.37 no.3
• /
• pp.87-96
• /
• 2016

Objectives: Through this study, it would be expected to compare the characteristics of medicinal and acupuncture treatment. Method: Ontology DB of traditional Korean medicine has been used comparing medicinal and acupuncture treatment. Terms of the efficacy and the method of treatment were divided to predicate and object. And two groups were compared through contrasting the frequency of occurrence of significant words. Results: Predicates utilized more in medicinal treatment are the character ryeom[斂], go[固], pa[破], nae[內], and tu [透]. Predicates utilized more in acupuncture treatment are the character so[疏], jo[調], and seo[舒]. Object utilized more in acupuncture treatment is the character gi[氣]. Object utilized more in medicinal treatment is the character jeong[精]. Conclusions: In terms about the efficacy of acupuncture, there are many expressions associated with Qi[氣]. But expressions associated with Jing[精] are rare compare to medicinal treatment. There is a difference in language that represents the efficacy between medicinal and acupuncture treatment. In addition, there are some terms about efficacy that are not shared with each other due to the differences in disease treatment and the different branches of the two theories.