• 제목/요약/키워드: transitive

검색결과 173건 처리시간 0.025초

관계형 데이터베이스 상품 정보 질의 처리를 위한 인덱싱 (Towards a Indexing Structure for Querying Product Information in Relational Databases)

  • 이현자;심준호
    • 한국전자거래학회지
    • /
    • 제13권4호
    • /
    • pp.209-222
    • /
    • 2008
  • 관계형 데이터베이스를 사용하여 상품 온톨로지의 저장과 관리가 현실적 방안이라고 할때, 의미적 관계에 대한 온톨로지 질의를 효과적으로 처리하기 위해서는 인덱스의 도움을 받는 것이 필요하다. 상품 온톨로지에서 의미적 관계는 상품 정보 간의 포함관계 및 분류계층 구조상의 위치관계 등 전이적 특성을 지닌 관계를 포함한다. 이 논문에서는 상품 정보 간의 포함관계 및 전이적 특성을 갖는 의미적 관계에 대한 질의를 효율적으로 처리할 수 있고, 정보의 갱신에 유리한 넘버링 기법을 사용한 인덱스 방법을 제안한다.

  • PDF

Implicit Arguments in English Middles

  • Chung, Taegoo
    • 한국영어학회지:영어학
    • /
    • 제1권2호
    • /
    • pp.331-347
    • /
    • 2001
  • In this study I investigate two implicit arguments in English middles: discharged argument and event argument. I argue that in middle formation external argument is discharged and event argument is suppressed. The proposal can account for the problems with the previous studies (Williams 1981; Keyser and Reoper 1984: Roberts 1987: Fagan 1988, 1992: Chung 2000). When a middle derives from the corresponding transitive verb, the subject argument is discharged, being an implicit argument. Argument discharge is different from argument suppression in the passives and argument deletion in the ergatives. I also argue that event argument is suppressed in middle formation. Event argument suppression is supported by the following: (i) The transitive verbs are always eventive but the corresponding middles are stative, and (ii) the middles are underlyingly eventive, (iii) the middles are “adorned” by certain manner adverbials.

  • PDF

분할 스케쥴링 알고리즘에 기반한 스케쥴러의 효율성 분석 (Efficiency Analysis of Scheduler based on the Division Scheduling Algorithm)

  • 송유진;이종근
    • 제어로봇시스템학회논문지
    • /
    • 제10권1호
    • /
    • pp.87-95
    • /
    • 2004
  • We proposed the division algorithm that was aimed at dividing system models. It used a transitive matrix to express the relation between place and transition. And the division algorithm was applied to the scheduling problem, with the division-scheduling algorithm. The division-scheduling algorithm was able to calculate the divided subnet table. And it is able to reduce the analysis complexity. In this study, we applied the proposed division algorithm and division-scheduling algorithm to flexible manufacturing system models. We compared the efficiency and performance of the division-scheduling algorithm with the Hillion algorithm, Korbaa algorithm, and Unfolding algorithm proposed in previous researches.

SCORE SEQUENCES IN ORIENTED GRAPHS

  • Pirzada, S.;Naikoo, T.A.;Shah, N.A.
    • Journal of applied mathematics & informatics
    • /
    • 제23권1_2호
    • /
    • pp.257-268
    • /
    • 2007
  • An oriented graph is a digraph with no symmetric pairs of directed arcs and without loops. The score of a vertex $v_i$ in an oriented graph D is $a_{v_i}\;(or\;simply\;a_i)=n-1+d_{v_i}^+-d_{v_i}^-,\;where\; d_{v_i}^+\;and\;d_{v_i}^-$ are the outdegree and indegree, respectively, of $v_i$ and n is the number of vertices in D. In this paper, we give a new proof of Avery's theorem and obtain some stronger inequalities for scores in oriented graphs. We also characterize strongly transitive oriented graphs.

ASYMPTOTIC AVERAGE SHADOWING PROPERTY ON A CLOSED SET

  • Lee, Manseob;Park, Junmi
    • 충청수학회지
    • /
    • 제25권1호
    • /
    • pp.27-33
    • /
    • 2012
  • Let $f$ be a difeomorphism of a closed $n$ -dimensional smooth manifold M, and $p$ be a hyperbolic periodic point of $f$. Let ${\Lambda}(p)$ be a closed set which containing $p$. In this paper, we show that (i) if $f$ has the asymptotic average shadowing property on ${\Lambda}(p)$, then ${\Lambda}(p)$ is the chain component which contains $p$. (ii) suppose $f$ has the asymptotic average shadowing property on ${\Lambda}(p)$. Then if $f|_{\Lambda(p)}$ has the $C^{1}$-stably shadowing property then it is hyperbolic.

A DEVANEY-CHAOTIC MAP WITH POSITIVE ENTROPY ON A SYMBOLIC SPACE

  • Ramesh, Shankar Bangalore;Vasu, Chetana Urva
    • 대한수학회논문집
    • /
    • 제34권3호
    • /
    • pp.967-979
    • /
    • 2019
  • Chaotic dynamical systems, preferably on a Cantor-like space with some arithmetic operations are considered as good pseudo-random number generators. There are many definitions of chaos, of which Devaney-chaos and pos itive topological entropy seem to be the strongest. Let $A=\{0,1,{\dots},p-1\}$. We define a continuous map on $A^{\mathbb{Z}}$ using addition with a carry, in combination with the shift map. We show that this map gives rise to a dynamical system with positive entropy, which is also Devaney-chaotic: i.e., it is transitive, sensitive and has a dense set of periodic points.

전기철도 정역방향 고장점표정 방법을 통한 정확도 향상을 위한 연구 (Analysis on the Method of Forward-Reverse Fault localization of Electric Railways for the Improvement of Accuracy)

  • 김명수;김성철
    • 전기학회논문지
    • /
    • 제67권12호
    • /
    • pp.1735-1742
    • /
    • 2018
  • The number of electric railway failures will increase due to the external and internal effects of electric railroads. The grounding test with 25,000V is to artificially test the transmission voltage to ground, and it is possible to cause risks of electric shock and other equipment insulation damage in neighboring enclosure. In 2016, method of fault localization changed to low - voltage at 380V from artificially high- voltage in the grounding tests since opening of Seoul Metropolitan Express Railway; The method is more accurate and safer rather than the previous one because it gets more data from unlimited grounding tests. However, an electric current falls on the track section where the track branches and vehicle bases with many lines. To precisely detect a transitive phenomenon, it is necessary to continuously study and additionally install.

WEAKLY ALMOST PERIODIC POINTS AND CHAOTIC DYNAMICS OF DISCRETE AMENABLE GROUP ACTIONS

  • Ling, Bin;Nie, Xiaoxiao;Yin, Jiandong
    • 대한수학회지
    • /
    • 제56권1호
    • /
    • pp.39-52
    • /
    • 2019
  • The aim of this paper is to introduce the notions of (quasi) weakly almost periodic point, measure center and minimal center of attraction of amenable group actions, explore the connections of levels of the orbit's topological structure of (quasi) weakly almost periodic points and study chaotic dynamics of transitive systems with full measure centers. Actually, we showed that weakly almost periodic points and quasiweakly almost periodic points have distinct orbit's topological structure and proved that there exists at least countable Li-Yorke pairs if the system contains a proper (quasi) weakly almost periodic point and that a transitive but not minimal system with a full measure center is strongly ergodically chaotic.

TOPOLOGICAL SENSITIVITY AND ITS STRONGER FORMS ON SEMIFLOWS

  • Ruchi Das;Devender Kumar;Mohammad Salman
    • 대한수학회보
    • /
    • 제61권1호
    • /
    • pp.247-262
    • /
    • 2024
  • In this paper we introduce and study the notions of topological sensitivity and its stronger forms on semiflows and on product semiflows. We give a relationship between multi-topological sensitivity and thick topological sensitivity on semiflows. We prove that for a Urysohn space X, a syndetically transitive semiflow (T, X, 𝜋) having a point of proper compact orbit is syndetic topologically sensitive. Moreover, it is proved that for a T3 space X, a transitive, nonminimal semiflow (T, X, 𝜋) having a dense set of almost periodic points is syndetic topologically sensitive. Also, wherever necessary examples/counterexamples are given.