• Journal of KIISE:Software and Applications
• /
• v.37 no.4
• /
• pp.282-296
• /
• 2010

OWL is an ontology language for the Semantic Web, and suited to modelling the knowledge of a specific domain in the real-world. Ontology also can infer new implicit knowledge from the explicit knowledge. However, the modeled knowledge cannot be complete as the whole of the common-sense of the human cannot be represented totally. Ontology do not concern handling nonmonotonic reasoning to detect incomplete modeling such as the integrity constraints and exceptions. A default rule can handle the exception about a specific class in ontology. Integrity constraint can be clear that restrictions on class define which and how many relationships the instances of that class must hold. In this paper, we propose a practical reasoning system for open and closed-world reasoning that supports a novel hybrid integration of ontology based on open world assumption (OWA) and non-monotonic rule based on closed-world assumption (CWA). The system utilizes a method to solve the problem which occurs when dealing with the incomplete knowledge under the OWA. The method uses the answer set programming (ASP) to find a solution. ASP is a logic-program, which can be seen as the computational embodiment of non-monotonic reasoning, and enables a query based on CWA to knowledge base (KB) of description logic. Our system not only finds practical cases from examples by the Protege, which require non-monotonic reasoning, but also estimates novel reasoning results for the cases based on KB which realizes a transparent integration of rules and ontologies supported by some well-known projects.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2648-2650
• /
• 2000

The PID tuning algorithm which can be applied generally to processes with varies dynamic characteristics is proposed by Wang[7]. However, it can be applied well to process model without zeros and with $\angle$G(jw)=-${\pi}$/2 and -${\pi}$ point in Nyquist curve, but it gives unsatisfactory tuning performance for processes with zeros and without $\angle$G(jW)=-${\pi}$/2 and -${\pi}$ in Nyquist curve. In this paper, the method which improve it using Pade reduction method is proposed. Satisfactory responses can be expected for processes with various dynamics, including those with low or high order, small or large dead time, monotonic or oscillatory responses. Simulation examples are given to show the effectiveness and flexibility of the controller in handling processes of different characteristics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.1
• /
• pp.202-215
• /
• 2023

This paper proposes a non-orthogonal multiple access (NOMA) based low-complexity relaying approach for multiuser cellular two-way relay channels (CTWRCs). In the proposed scheme, the relay detects the signal using successive interference cancellation (SIC) and re-generates the transmit signal with zero-forcing (ZF) transmit precoding. The achievable data rates of the NOMA-based multiuser two-way relaying (TWR) approach is analyzed. We further study the power allocation among different data streams to maximize the weighted sum-rate (WSR). We re-form the resultant non-convex problem into a standard monotonic program. Then, we design a polyblock outer approximation algorithm to sovle the WSR problem.The proposed optimal power allocation algorithm converges fast and it is shown that the NOMA-TWR-OPA scheme outperforms a NOMA benchmark scheme and conventional TWR schemes.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.747-752
• /
• 2004

Researches about scheduling of the distributed real-time systems have been proposed. However, they have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. So this paper proposes a new scheduling method for distributed real-time systems consisting of sporadic and periodic tasks with precedence relations and sporadic and periodic messages, guaranteeing end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic (RM) scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.52-63
• /
• 2009

The problem of scheduling simply periodic task systems upon a uniform multiprocessor is considered. Partitioning of periodic task systems requires solving the bin-packing problem, which is known to be intractable (NP-hard in the strong sense). This paper presents a global scheduling algorithm which transforms a given simply periodic task system into another using a "task-splitting" technique. Each transformed simply periodic task system is guaranteed to be successfully scheduled upon any uniform multiprocessor using a partitioned scheduling algorithm. It is proven that the proposed algorithm achieves the theoretical maximum utilization bound upon any uniform multiprocessor platform.

• Journal of Advanced Navigation Technology
• /
• v.19 no.6
• /
• pp.636-642
• /
• 2015

This paper presents an application of heuristic harmony search (HS) optimization algorithm for the identification of linear continuous time-delay system from step response. Identification model is first-order plus dead time (FOPDT), which describes a linear monotonic process quite well in most chemical processes and HAVC process and is often sufficient for PID controller tuning. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the identification method has been demonstrated through a number of simulation examples.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.5
• /
• pp.783-791
• /
• 2006

In e-Trade, Real-Time System(RTS) plays a very important role. Each task is set with limited time, and appointed regulations must be followed because it can be greatly damaged if it cannot be executed in limited time. In e-Trade, the scheduling possibility techniques generally use periodical tasks; however, it is necessary to study more stable prediction scheduling possibility algorithm by using other task timing conditions and non-periodical task scheduling tasks. This study proposed an algorithm to increase the prediction possibility using individual task utilization rate, and presented scheduling possibility conditions using existing whole task utilization rate and the proposed algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.2
• /
• pp.175-185
• /
• 2005

The scheduling methods of the distributed real-time systems have been proposed. However, they have some weak points. They did not schedule both sporadic and periodic tasks and messages at the same time or did not consider the end-to-end constraints such as precedence relations between sporadic tasks. This means that system scheduling must guarantee the constraints of practical systems and be applicable to them. This paper proposes a new scheduling method that can be applied to more practical model of distributed real-time systems. System model consists of sporadic and periodic tasks with precedence relations and sporadic and periodic messages and has end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.5
• /
• pp.689-696
• /
• 2005

Finite failure NHPP models presented in the literature exhibit either constant, monotonic increasing or monotonic decreasing failure occurrence rates per fault. In this paper, Goel-Okumoto and Yamada-Ohba-Osaki model was reviewed, proposes the Kappa(2) reliability model, which can capture the nomotonic decreasing nature of the failure occurrence rate per fault. Algorithm to estimate the parameters used to maximum likelihood estimator and bisection method, model selection based on sum of the squared errors and Kolmogorov distance, for the sake of efficient model, was employed. Analysis of failure using real data set, SYS2(Allen P.Nikora and Michael R.Lyu), for the sake of proposing two parameter of the Kappa distribution, was employed. This analysis of failure data compared with the Kappa model and the existing model using arithmetic and Laplace trend tests, bias tests is presented.

• Convergence Security Journal
• /
• v.7 no.3
• /
• pp.51-60
• /
• 2007

Infinite failure NHPP models presented in the literature exhibit either constant, monotonic increasing or monotonic decreasing failure occurrence rates per fault. In this paper, exponential distribution and Rayleigh distribution model was reviewed, proposes the mixture reliability model, which made out efficiency substituted for situation for failure time Algorithm to estimate the parameters used to maximum likelihood estimator and bisection method, model selection based on SSE and Kolmogorov distance, for the sake of efficient model, was employed. Analysis of failure using S27 data set for the sake of proposing shape parameter of the mixture distribution was employed. This analysis of failure data compared with the mixture distribution model and the existing model(using arithmetic and Laplace trend tests, bias tests) is presented.