• Korean Journal of Logic
• /
• v.21 no.2
• /
• pp.175-207
• /
• 2018

Since Kit Fine's influential paper, Essence and Modality (1994), many philosophers have doubted the prospects of modalism, according to which we can analyze the concept of essence with that of de re modality. However, some philosophers have tried to save modalism against Fine's counterexamples seriously. In this paper, we examine two such attempts which appeal to some kind of 'impossible possibilities.' We argue that such attempts have strong tendency to end in either a metaphysical picture which is very similar to Fine's or a concept of essence which is quite different from Fine's. For this reason, we claim that Fine has no reason to worry about such attempts.

• ICROS
• /
• v.6 no.3
• /
• pp.82-90
• /
• 2000

본 논문에서는 관리제어시스템의 사양으로 주어진 언어가 일반적으로 제어불가능이거나 관측불가능인 상황하에서 관리제어기 설계에 대한 문제를 다룬다. 먼저 사양언어가 제어불가능인 겨우 제어가능성의 성질들을 이용하여 사양언어에 근사한 최고 제어가능 부언의 및 최적 닫힘 제어가능 초언어를 유도해내고 이를 바탕으로 관리제어기를 설계한다 그리고 사양언어가 관측불가능인 경우는 관측가능성의 집합연산에 대한 성질들을 이용하여 사양언어에 가장 근사하면서 관측가능인 초언어 및 관측가능성보다 강한 조건인 표준성을 도입하여 관측가능 부언어 등을 유도하고 이를 토대로 관리제어기를 설계힌다 나아가 사양언어가 제어불가능이면서 관측불가능인 경우의 관리제어가 설계에 대해 결과를 확장한다.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.2
• /
• pp.1-8
• /
• 2002

By now, Schedulers for RMS and EDF are implemented for real-time Linux Scheduler. These Schedulers are used for do not consider there's characteristics. Missing Schedulability-test cause result that increase deadline miss rate. Also The present real-time Linux causes system halt Because of scheduling for unschedulable tasks . These appearances are very fatal for real-time system. Therefor, In this paper The peaceful schedulability-test use scheduler which is proper characteristics of RMS and EDF scheduling methods. This scheduler keeps deadline and eliminates system halt from scheduling unschedulable tasks. In this paper, we propose the schedulability-test algorithm and scheduler select algorithm for the effective management of tasks sets.

• Journal of Korean Philosophical Society
• /
• v.123
• /
• pp.27-56
• /
• 2012

Das Ziel dieser Abhandlung ist die Unterscheidung zwischen der kognitiven und ontischen Ununterscheidbarkeit. Jene zeigt sich als die Ununterscheidbarkeit, die aus dem Fehler des Identifizierens erfolgt. Diese besteht in der $Selbstidentit{\ddot{a}}t$ jedes individuellen Seienden. Um der Untersuchung der zwei Arten der Ununterscheidbarkeit willen soll die $Identit{\ddot{a}}t$ als Begrifflichkeit von dem Identifizieren als der subjektiven $T{\ddot{a}}tigkeit$ unterschieden werden. $W{\ddot{a}}hrend$ das kognitiv Ununterscheidbare nicht immer das Identische sein kann, ist das ontisch Ununterscheidbare notwendig das Identische. Durch diese Unterscheidung zwischen den beiden Konzeptionen der Ununterscheidbarkeit kann der Sinn des Leibniz'schen Satzes der $Identit{\ddot{a}}t$ des Ununterscheidbaren (principium identitatisindiscernibilium) deutlicher erhellt werden, indem diese Unterscheidung die kritische $Verst{\ddot{a}}rkung$ seines Satzes impliziert. Die Denkbarkeit der Duplikate, die intrinsisch $v{\ddot{o}}llig$ identisch qualifiziert sind, gilt als der bedeutsamste Einwand gegen seinen Satz der $Identit{\ddot{a}}t$. Aber der $Identit{\ddot{a}}tssatz$ - principium identitatis indiscernibilium - ist noch $g{\ddot{u}}ltig$, weil diese Duplikate letztendlich mittels der raumzeitlichen Relationsbeschaffenheit unterscheidbar sind. Hierdurch wird die grundlegende bzw. unentbehrliche Funktion der $Subjektivit{\ddot{a}}t$, die die raumzeitliche Relationsbeschaffenheit $erm{\ddot{o}}glicht$, $erl{\ddot{a}}utert$. $Daf{\ddot{u}}r$ wird Hegels $Erkl{\ddot{a}}rung$ vom $Identit{\ddot{a}}tsbegriff$ und Leibniz bearbeitet.

• Korean Journal of Logic
• /
• v.17 no.1
• /
• pp.137-181
• /
• 2014

I will propose the radical indeterminacy for solving the higher-order vagueness' dilemma. The radical indeterminacy means that the indeterminacy of 'a is P' implies the indeterminacy of 'a is a borderline case of P.' I will compose my argument two steps: first I will suggest conditions for overcoming the dilemma by analyzing its structure and second I will offer the radical indeterminacy that satisfies aforementioned conditions. I think the higher-order vagueness' dilemma occurs owing to the misunderstanding about the unclarity or the indeterminacy of borderline cases that is an basic intuition of vagueness. So conditions for solving the dilemma are also criteria of adequacy on the theory of vagueness. Thus I will propose II-rule that satisfies above conditions and the radical indeterminacy as a new understanding about vagueness.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.1
• /
• pp.80-88
• /
• 2001

The existed approaches to analyzing real-time schedulability take place exponential time and space complexity of this methods, since these uses a fixed priority scheduling and/or traverse all possible state spaces. This paper judges whether it is satisfied a given deadlines for real-time processes regarding a minimum execution time of process, periodic, deadline and a synchronizion time of processes by using the transaction rules of process algebra, and proposes a retrieval algorithm for unschedulable processes based on GUI environment. And we implement and evaluate the scheduling state analyzer that displays visually the result of schedulabiliy analysis for real-time processes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.7
• /
• pp.902-906
• /
• 2004

A separation principle of the Takagj-Sugeno (T-S) fuzzy-model-based observer-control is investigated. When the premise variables are able to be measured or directly computed from the outputs of the T-S fuzzy system and the fuzzy inference rules for the plant, control, and observer share the premise parts, the T-S fuzzy-model-based observer and the T-S fuzzy-model-based control can be separately designed such that the global stabilizability is guaranteed by the fuzzy observer-based output-feedback control. In this case, the global separation principle is well established. On the other hand, when the premise variables are unmeasurable or cannot be computed from the outputs, they should also be estimated. We examine the separation principle of this case. If the decay rates of the T-S fuzzy-model-based control and observer are sufficiently fast, the global separation is assured. Otherwise we show that the separation principle holds locally.

• Journal of Digital Contents Society
• /
• v.9 no.4
• /
• pp.561-568
• /
• 2008

Research on the flow shop model has mainly been centered around periodic tasks scheduling. In this paper, we present an algorithm using synthetic utilization that can check the schedulability of aperiodic local tasks and aperiodic end-to-end tasks with precedence relation in the flow shop model. If the scheduling algorithm for aperiodic end-to-end tasks executed in the multiple stage pipeline is applied to the flow shop model, sometimes the actually schedulable tasks are decided to be not schedulable because of the fact that the actually unschedulable tasks are decided to be schedulable. The algorithm presented in this paper solves the problem, and the simulation shows that the schedulability increases 10%.

• Convergence Security Journal
• /
• v.23 no.5
• /
• pp.143-150
• /
• 2023

Applications on physically unclonable circuits (PUFs) for implementing and utilizing security protocols with hardware is on the rise. PUFs have the capability to perform functions such as authentication, prevention of replication, and secure storage of critical information in integrated circuits and security systems. Through the implementation of physically unclonable circuits, a wide range of security features, including confidentiality, integrity, and availability, can be applied. Therefore, PUFs are promising candidate to build secure integrated circuits and hardware systems. However, in order that PUFs possess security features, PUFs should possess characteristics such as unpredictability, uniqueness, and robustness characteristics. This study provides a detailed explanation and introduction of the methods to characterize the PUF properties. By applying the results, it becomes possible to quantitatively evaluate the characteristics of implemented PUFs and assess their availabilities for security system applications.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11a
• /
• pp.417-420
• /
• 2003

요즘은 여러 멀티미디어 데이터가 기존의 PC에서 재생되는 것이 아니라 핸드폰, PDA와 같은 이동단말기에서 재생되기가 요구되고 있다 멀티미디어 데이터의 용량이 크고 시간에 종속적인 연속 미디어이기 때문에 데이터의 일부론 미리 가져와서 재생하는 Prefetch기법이 필요하다. 영역 분할 기법과 재생가능성 분석기법을 통해서 멀티미디어 프리젠테이션의 재생가능 여부를 분석하고 재생이 불가능한 프리젠테이션은 EPOB지정을 이용한 Prefetch기법을 적용한 후 재생가능 여부를 판단한다. Prefetch하는 시점과 데이터의 양을 지정함으로서 원활한 멀티미디어 프리젠테이션을 재생 할 수 있다.