• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.2
• /
• pp.68-77
• /
• 2003

The Least-Laxity First(or LLF) scheduling algorithm assigns the highest priority to a task with the least laxity, and has been proved to be optimal for a uni-processor and sub-optimal for a multi-processor. However, this algorithm Is Impractical to implement because laxity tie results in the frequent context switches among tasks. In this paper, a Modified Least-Laxity First on Multiprocessor(or MLLF/MP) scheduling algorithm is proposed to solve this problem, i.e., laxity tie results in the excessive scheduling overheads. The MLLF/MP is based on the LLF, but allows the laxity inversion. MLLF/MP continues executing the current running task as far as other tasks do not miss their deadlines. Consequently, it avoids the frequent context switches. We prove that the MLLF/MP is also sub-optimal in multiprocessor systems. By simulation results, we show that the MLLF/MP has less scheduling overheads than LLF.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1060-1065
• /
• 2005

An Independent Administrative Corporation Japan Agency for Marine-Earth Science and Technology (JAMSTEC) is developing light-and-small Autonomous Underwater Vehicles (AUV)$^{1)}$, named 'MR-X1' (Marine Robot Experimental 1), which can cruise, investigate and observe by itself without human's help. In this paper, we consider the motion control problem of 'MR-X1' and derive a controller. Since the dynamic property of 'MR-X1' is changed by the influence of the speed, the mathematical model of 'MR-X1' becomes the nonlinear model. In order to design a controller for 'MR-X1', we generally apply nonlinear control theories or linear control theories with some constant speed situation. If we design a controller by applying Linear Quadratic (LQ) optimal control theory, the obtained controller only compensates t e optimality at the designed speed situation, and does not compensate the stability at another speed situations. This paper proposes a controller design method using Linear Matrix Inequalities (LMIs)$^{2),3),4)}$, which can adapt the speed variation of 'MR-X1'. And examples of numerical analysis using our designed controller are shown.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.4
• /
• pp.414-424
• /
• 2012

Finding or automatically generating problem instance is useful for algorithm analysis/test. The topic has been of interest in the field of hardware/software engineering and theory of computation. We apply objective value-distance correlation analysis to problem spaces, as previous researchers applied it to solution spaces. According to problems, we define the objective function by (1) execution time of tested algorithm or (2) its optimality; this definition is interpreted as difficulty of the problem instance being solved. Our correlation analysis is based on the following aspects: (1) change of correlation when we use different algorithms or different distance functions for the same problem, (2) change of that when we improve the tested algorithm, (3) relation between a problem instance space and the solution space for the same problem. Our research demonstrates the way of problem instance space analysis and will accelerate the problem instance space analysis as an initiative research.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.8
• /
• pp.1487-1493
• /
• 2016

The susceptible, exposed, infectious, and recovered model (SEIR) is used extensively in the field of epidemiology. On the other hand, dissemination information among users through internet grows exponentially. This information spreading can be modeled as an epidemic. In this paper, we derive the mathematical model of SEIR in viral communication from the view of optimal control theory. Overall the methods based on classical calculus, In order to solve the optimal control problem, proved to be more efficient and accurate. According to Pontryagin's minimum principle (PMP) the Hamiltonian function must be optimized by the control variables at all points along the solution trajectory. We present our method based on the PMP and forward backward algorithm. In this algorithm, one should integrate forward in time for the state equations then integrate backward in time for the adjoint equations resulting from the optimality conditions. The problem is mathematically analyzed and numerically solved as well.

• Journal of Satellite, Information and Communications
• /
• v.11 no.2
• /
• pp.55-59
• /
• 2016

Conventional RF energy harvesting systems can harvest energy and decode information from same source as an Hybirid-AP (H-AP). However, harvesting efficiency is seriously dependent on distance between users and H-AP. Therefore, in this paper, we proposed a transmission model for RF harvesting consisting of information and power source separately called Decoupled RF Energy harvesting networks. Main purpose of this paper is to maximize energy efficiency under various constraints of transmit power from H-AP and power beacon (PB), minimum quality of service and quality of harvested power of each users. To measure proposed model's performance, we proposed optimal time scheduling algorithms for energy efficiency (EE) maximization using Lagrangian dual decomposition theory that locally maximizes the EE by obtaining suboptimal values of three arguments : transmit power of H-AP, transmit power of PB, frame splitting factor. Experiment results show that the proposed energy-efficient algorithms converge within a few iterations with its optimality and greatly improve the EE compared to that of baseline schemes.

• Journal of Science and Technology Studies
• /
• v.16 no.2
• /
• pp.33-63
• /
• 2016

This paper compares and contrasts the concept of nature and the theory of evolution held by leading synthetic biologists and transhumanists in the post-genomic era. Synthetic biology, which emerged in the early 2000s, aims to design biological systems that perform specific functions with the two key concepts of "rational design" and "directed evolution". However, synthetic biology has also raised serious concerns about the creation of man-made biological materials and the manipulation of the direction and speed of evolution. It is no wonder that transhumanists, who dream of creating new, enhanced human species, have welcomed the arrival of synthetic biology. How, then, can we deal with the nature reinvented by synthetic biology? By what means can one justify research that may affect the process of evolution? What intellectual resources do synthetic biology and transhumanism share in common? What influence would the new trend of commercialization of science and technology exert upon the development of synthetic biology? Addressing those questions, this paper argues that the moral authority of nature can be restored in this post-genomic era.

• Communications of Mathematical Education
• /
• v.37 no.1
• /
• pp.65-84
• /
• 2023

The method of Lagrange multipliers, one of the most fundamental algorithms for solving equality constrained optimization problems, has been widely used in basic mathematics for artificial intelligence (AI), linear algebra, optimization theory, and control theory. This method is an important tool that connects calculus and linear algebra. It is actively used in artificial intelligence algorithms including principal component analysis (PCA). Therefore, it is desired that instructors motivate students who first encounter this method in college calculus. In this paper, we provide an integrated perspective for instructors to teach the method of Lagrange multipliers effectively. First, we provide visualization materials and Python-based code, helping to understand the principle of this method. Second, we give a full explanation on the relation between Lagrange multiplier and eigenvalues of a matrix. Third, we give the proof of the first-order optimality condition, which is a fundamental of the method of Lagrange multipliers, and briefly introduce the generalized version of it in optimization. Finally, we give an example of PCA analysis on a real data. These materials can be utilized in class for teaching of the method of Lagrange multipliers.

• Proceedings of the KSPS conference
• /
• 1996.10a
• /
• pp.109-116
• /
• 1996

In this paper, I would like to explore the possibility that the nature of place assimilation can be captured in terms of the OCP within the Optimality Theory (Mccarthy & Prince 1999. 1995; Prince & Smolensky 1993). In derivational models, each assimilatory process would be expressed through a different autosegmental rule. However, what any such model misses is a clear generalization that all of those processes have the effect of avoiding a configuration in which two consonantal place nodes are adjacent across a syllable boundary, as illustrated in (1):(equation omitted) In a derivational model, it is a coincidence that across languages there are changes that have the result of modifying a structure of the form (1a) into the other structure that does not have adjacent consonantal place nodes (1b). OT allows us to express this effect through a constraint given in (2) that forbids adjacent place nodes: (2) OCP(PL): Adjacent place nodes are prohibited. At this point, then, a question arises as to how consonantal and vocalic place nodes are formally distinguished in the output for the purpose of applying the OCP(PL). Besides, the OCP(PL) would affect equally complex onsets and codas as well as coda-onset clusters in languages that have them such as English. To remedy this problem, following Mccarthy (1994), I assume that the canonical markedness constraint is a prohibition defined over no more than two segments, $\alpha$ and $\beta$: that is, $^{*}\{{\alpha, {\;}{\beta{\}$ with appropriate conditions imposed on $\alpha$ and $\beta$. I propose the OCP(PL) again in the following format (3) OCP(PL) (table omitted) $\alpha$ and $\beta$ are the target and the trigger of place assimilation, respectively. The '*' is a reminder that, in this format, constraints specify negative targets or prohibited configurations. Any structure matching the specifications is in violation of this constraint. Now, in correspondence terms, the meaning of the OCP(PL) is this: the constraint is violated if a consonantal place $\alpha$ is immediately followed by a consonantal place $\bebt$ in surface. One advantage of this format is that the OCP(PL) would also be invoked in dealing with place assimilation within complex coda (e.g., sink [si(equation omitted)k]): we can make the constraint scan the consonantal clusters only, excluding any intervening vowels. Finally, the onset clusters typically do not undergo place assimilation. I propose that the onsets be protected by certain constraint which ensures that the coda, not the onset loses the place feature.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.5
• /
• pp.213-217
• /
• 2001

Excessive memory buffer requirement in continuous media playback is a serious impediment of wide spread usage of on-line multimedia service. Skewed access frequency of available video files provides an opportunity of re-using the date blocks which has been loaded by one session for later usage. We present novel algorithm which minimizes the buffer requirement in multiple sessions of multimedia playbacks. In continuous media playback originated from the disk, a certain amount of memory buffer is required to synchronize asynchronous disk. Read operation and synchronous playback operation. As aggregate playback bandwodth increases, larger amount of buffer needs to be allocated for this synchronization purpose. The focus of this work is to study the asymptotic behavior of the synchronization buffer requirement and to develop an algorithm coping with this excessive buffer requirement under bandwidth congestioon. We argue that in a large scale continuous media server, it may not be necessary to read the blocks for each session directly from the disk. The beauty of our work lies in the fact that it dynamically adapts to disk utilization of the server and finds the optimal way of servicinh the individual sessions while minimizing the overall buffer space requirement. Optimality of the proposed algorithm is shown by proof. The effectiveness and performance of the proposed scheme is examined via simulation.