• Industrial Engineering and Management Systems
• /
• 제6권1호
• /
• pp.72-82
• /
• 2007

Business Rules are formal statements about the data and processes of an enterprise. They present projections of the organization's constraints and ways of working on their supporting information systems. Therefore, their collection, structuring and organization should be central activities within information systems. In an enterprise, business rules are used to represent certain aspects of a business domain (static rules) or business policy (dynamic rules). Hence, regarding problem domains in the organization, business rules are classified into two groups: static and dynamic business rules. The paper introduces a new concept of business rules, Extended Dynamic Business Rule (EDBR) which contains the results of the occurrence of business rule's action. The focus of this paper is in the organizing, defining and modeling of such business rules using Mineau's approach. Mineau's approach is an extension of Sowa's Conceptual Graph theory.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2002년도 봄 학술발표논문집 Vol.29 No.1 (B)
• /
• pp.331-333
• /
• 2002

웹그래프는 웹문서 간의 하이퍼링크를 각 웹문서의 핵심어간의 링크관계로 추상화하대 이 관계를 이용하여 핵심어의 개념 그래프를 구축하고 질의의 확장이나 영역지식을 제공하는 개념 기반 검색이 가능한 검색 시스템이다 본 논문에서는 웹그래프에서 가능했던 질의어에 대한 한 단계의 질의 확장에 그치지 않고. 최초의 질의어와 이후 확장어들에 대한 문맥을 유지하대 추가적인 다단계의 확장이 가능하도록 하는 방법을 계시한다. 검색 시스템 사용자는 최초 질의어가 속하는 해당 분야에 대한 지식이 부족한 경우, 문맥을 유지한 확장을 통하여 자신이 찾고자 하는 바를 명확히 해 나가며 세부 질의를 구축할 수 있고 해당 분야에 대한 지식을 얻는 것이 가능하다

• 한국운동역학회지
• /
• 제18권4호
• /
• pp.179-189
• /
• 2008

본 연구는 9명의 남자 중학교 초보피험자들을 대상으로 태권도 옆차기 동작의 숙련정도에 따른 운동학적 협응과정을 살펴보는 데 목적을 두었다. 이용된 변인은 최대합성직선속도, 분절간 각속도, 각도 대 각도 도면이었다. 분석결과, 연습후기로 갈수록 인접한 분절간의 운동량 전이가 잘 이루어져 각 분절의 최대합성직선속도가 유의하게 증가하였으며 분절간 각속도에서 학습후기로 갈수록 몸통에서 대퇴, 하퇴분절로의 순차적인 전이를 보였으며 던지는 듯하면서 미는 듯한 동작형태를 보였다. 엉덩관절과 무릎관절의 각도-각도 도면에서는 학습초기에는 다이나믹스한 변화를 보였으나 학습이 됨에 따라 숙련된 피험자처럼 안정적인 협응 패턴을 보여주었다.

• 디지털융복합연구
• /
• 제18권5호
• /
• pp.187-195
• /
• 2020

최근 모바일 메신저 서비스(MMS)는 사용자들에게 가장 인기가 많으며 많이 활용하는 서비스로 기업은 이를 활성화시키기 위해 노력하고 있지만 이에 대한 구체적이고 체계적인 연구는 미흡하다. 이에 본 연구는 MMS 사용자들의 지속적인 이용 의도를 알아보기 위해 398명의 10대~30대를 대상으로 MMS의 기술수용 결정 요인을 살펴보았다. 연구조사는 설문지와 SPSS 21 및 PLS-Graph 3.0을 이용하여 연구모형의 주요 결과를 도출하였다. 분석 결과 지각된 매체 풍부성은 매체 유용성과 매체 용이성에 정(+)의 영향을 주었으며, 지속적인 사용의도에 긍정적인(+) 영향을 미쳤다. 또한, 경험에 대한 조절 효과로 지각된 매체 풍부성은 매체 용이성에 정(+)의 영향을 주는 것으로 나타났다. 이러한 결과를 바탕으로 MMS의 이용 효율성을 높이기 위해 매체 풍부성, 매체 용이성, 매체 유용성 및 사용자 경험이 사용자의 지속적인 의도에 미치는 중요 변수로 MMS의 사용자 기초자료와 개발 방향을 제공할 수 있을 것이다. 향후 연구에서는 보다 다양한 변수를 활용하여 추가요인에 대한 조사와 구조모형에 대한 분석이 필요하다고 본다.

• 제어로봇시스템학회논문지
• /
• 제3권5호
• /
• pp.542-554
• /
• 1997

In this paper, we present a resource conscious approach to designing distributed real-time systems as an extension of our original approach [8][9] which was limited to single processor systems. Starting from a given task graph and a set of end-to-end constraints, we automatically generate task attributes (e.g., periods and deadlines) such that (i) the task set is schedulable, and (ii) the end-to-end timing constraints are satisfied. The method works by first transforming the end-to-end timing constraints into a set of intermediate constraints on task attributes, and then solving the intermediate constraints. The complexity of constraint solving is tackled by reducing the problem into relatively tractable parts, and then solving each sub-problem using heuristics to enhance schedulability. In this paper, we build on our single processor solution and show how it can be extended for distributed systems. The extension to distributed systems reveals many interesting sub-problems, solutions to which are presented in this paper. The main challenges arise from end-to-end propagation delay constraints, and therefore this paper focuses on our solutions for such constraints. We begin with extending our communication scheme to provide tight delay bounds across a network, while hiding the low-level details of network communication. We also develop an algorithm to decompose end-to-end bounds into local bounds on each processor of making extensive use of relative load on each processor. This results in significant decoupling of constraints on each processor, without losing its capability to find a schedulable solution. Finally, we show, how each of these parts fit into our overall methodology, using our previous results for single processor systems.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.307-309
• /
• 2004

In this study, we have evaluated and classified arthritic pathology using the auscultation of knee joint sound. Six normal persons and 11 patients with knee problem were enrolled. Six patients of Group 1 needed an orthopeadic surgery because of the ruptured wounds of meniscus or ACL(Anterior Cruciate Ligament) and 5 patients of Group 2 diagnosed as osteoarthritis. Subjects were taken knee flexion and extension being seated in a chair for 20 seconds which repeated 3 times. Also subjects stood up and sit down repeatedly in the same way. After the movement of knee was divided into 18 degrees, the pitch perturbation according to partial degrees was analyzed and the DTW(Dynamic Time Warping) method was applied for normalizing a time-axis and unpaired t-test was used for statistic results among groups. As a result, the amplitude and frequency perturbations of group 2 was higher than group 1(p<0.05) and showed a characteristic 'w-shape' in angle-amplitude graph. These results suggest that the analysis of knee joint sound might assist in early diagnosis of knee joint disease.

• Journal of Computing Science and Engineering
• /
• 제9권1호
• /
• pp.9-19
• /
• 2015

The most important challenge in the region-based abstraction method as an approach to compute the state space of time Petri Nets (TPNs) for model checking is that the method results in a huge number of regions, causing a state explosion problem. Thus, region-based abstraction methods are not appropriate for use in developing practical tools. To address this limitation, this paper applies a modification to the basic region abstraction method to be used specially for computing the state space of TPN models, so that the number of regions becomes smaller than that of the situations in which the current methods are applied. The proposed approach is based on the special features of TPN that helps us to construct suitable and small region graphs that preserve the time properties of TPN. To achieve this, we use TPN-TCTL as a timed extension of CTL for specifying a subset of properties in TPN models. Then, for model checking TPN-TCTL properties on TPN models, CTL model checking is used on TPN models by translating TPN-TCTL to the equivalent CTL. Finally, we compare our proposed method with the current region-based abstraction methods proposed for TPN models in terms of the size of the resulting region graph.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.233-238
• /
• 1993

In this paper, two diagnosis algorithms using the simple fuzzy, cognitive map (FCM) that is an useful qualitative model are proposed. The first basic algorithm is considered as a simple transition of Shiozaki's signed directed graph approach to FCM framework. And the second one is an extended version of the basic algorithm. In the extension, three important concepts, modified temporal associative memory (TAM) recall, temporal pattern matching algorithm and hierarchical decomposition are adopted. As the resultant diagnosis scheme takes short computation time, it can be used for on-line fault diagnosis of large scale and complex processes that conventional diagnosis methods cannot be applied. The diagnosis system can be trained by the basic algorithm and generates FCM model for every experienced process fault. In on-line application, the self-generated fault model FCM generates predicted pattern sequences, which are compared with observed pattern sequences to declare the origin of fault. In practical case, observed pattern sequences depend on transport time. So if predicted pattern sequences are different from observed ones, the time weighted FCM with transport delay can be used to generate predicted ones. The fault diagnosis procedure can be completed during the actual propagation since pattern sequences of tvo different faults do not coincide in general.

• 한국정보시스템학회지:정보시스템연구
• /
• 제7권1호
• /
• pp.181-208
• /
• 1998

In many literatures of model management, various schemes for representing model base schema have proposed. Ultimately, the goal is to arrive at a set of mutually supportive and synergistic methodologies and tools for the modeling problem domain and model base design. This paper focus on how best to structure and represent conceptual model of problem domain and schema of model base. Semantic concepts and modeling constructs are valuable conceptual tools for understanding the structural relationships and constraints involved in an model management environment. To this end, we reviewed the model management literature, and analyzed the constructs of modeling tools of data model management graph-based approach. Although they have good tools but most of them are not enough for the representation of structural relationships and constraints. So we wanted more powerful tools which can represent diverse constructs in a decision support modeling and model base schema design. For the design of a model base, we developed object modeling framework which uses Object Modeling Techniques (OMT). In Object Modeling Framework, model base schema are classified into conceptual schema, logical schema, and physical schema. The conceptual schema represents the user's view of problem domain, and the logical schema represents a model formatted by a particular modeling language. The schema design, this paper proposes an extension of Object Model to overcome some of the limitations exhibited by the OMT. The proposed tool, Extended Object Model(EOM) have diverse constructs for the representation of decision support problem domain and conceptual model base schema.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2002년도 춘계종합학술대회
• /
• pp.461-465
• /
• 2002

일반적인 소프트웨어 시스템은 새로운 요구와 오류의 발견으로 인해 계속적인 개발과 확장 수정이 요구되며, 어떤 프로그램에 특정 명령문의 변수에 대한 관련 명령문을 찾고 싶을 때 프로그래머는 입력자료의 값에 대해 프로그램의 실행 궤도 추적을 통해 프로그램을 분석한다. 그러므로 본 논문은 기존의 프로그램 슬라이싱 방법에 객체지향 프로그램 슬라이싱을 적용하여 프로그램의 실행 궤도를 통하여 객체지향 그래프와 슬라이싱의 알고리즘을 보인다. 객체지향 프로그램 종속성 그래프는 클래스 종속성 그래프와 클래스 계층구조 그래프로 구성된다. 여기에 제안된 알고리즘은 쉽게 확장이 가능하며 프로그램이 점진적으로 개발되는 경우에 유리하게 사용될 수 있다.