• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1744-1746
• /
• 2004

This paper focuses on the problem of asymptotic stabilization for time-delay systems. To this end, a memoryless state feedback controller is proposed. Then, based on the Lyapunov method, a delay-dependent stabilization criterion is devised by taking the relationship between the terms in the Leibniz-Newton formula into account. Certain free weighting matrices are used to express this relationship and linear matrix inequalities (LMIs)-based algorithm to design the controller stabilizing the system.

• 전기학회논문지
• /
• 제58권11호
• /
• pp.2261-2265
• /
• 2009

In this paper, the problem of delay-dependent stability of uncertain stochastic systems with time-varying delay is considered. The uncertainties are assumed to be norm-bounded. Based on the Lyapunov stability theory, new delay-dependent stability criteria for the system are derived in terms of LMI(linear matrix inequality). Two numerical examples are given to show the effectiveness of proposed method.

• International Journal of Control, Automation, and Systems
• /
• 제6권4호
• /
• pp.515-525
• /
• 2008

In this paper, the problem of delay-dependent stabilization for singular systems with multiple internal and external incommensurate constant point delays is investigated. The condition when a singular system subject to point delays is regular independent of time delays is given and it can be easily test with numerical or algebraic methods. Based on Lyapunov-Krasovskii functional approach and the descriptor integral-inequality lemma, a sufficient condition for delay-dependent stability is obtained. The main idea is to design multiple memoryless state feedback control laws such that the resulting closed-loop system is regular independent of time delays, impulse free, and asymptotically stable via solving a strict linear matrix inequality (LMI) problem. An explicit expression for the desired memoryless state feedback control laws is also given. Finally, a numerical example illustrates the effectiveness and the availability for the proposed method.

• Bulletin of the Korean Chemical Society
• /
• 제26권11호
• /
• pp.1735-1737
• /
• 2005

We obtain probabilities at a crossing of two linearly time-dependent potentials that are constantly coupled to the other by solving a time-dependent Schrödinger equation. We find that the system which was initially localized at one state evolves to split into both states at the crossing. The probability splitting depends on the coupling strength $V_0$ such that the system stays at the initial state in its entirety when $V_0$ = 0 while it is divided equally in both states when $V_0 \rightarrow {\infty}$ . For a finite coupling the probability branching at the crossing is not even and thus a complete probability transfer at $t \rightarrow {\infty}$ is not achieved in the linear potential crossing problem. The Landau-Zener formula for transition probability at $t \rightarrow {\infty}$ is expressed in terms of the probabilities at the crossing.

• 한국컴퓨터정보학회논문지
• /
• 제24권4호
• /
• pp.51-56
• /
• 2019

In this paper, we propose an algorithm that can quickly generate and synthesize city maps in racing games. Racing games are characterized by moving a wide map rather than a fixed map, but designing and developing a wide map requires a lot of production time. This problem can be mitigated by creating a large map in the preprocessing step, but a fixed map makes the game tedious. It is also inefficient to process all the various maps in the preprocessing step. In order to solve this problem, we propose a technique to create a terrain pattern in the preprocessing process, to generate a map in real time, and to synthesize various maps randomly. In addition, we reduced unnecessary rendering computations by integrating view-dependent techniques into the proposed framework. This study was developed in Unity3D and can be used for various contents as well as racing game.

• 한국과학교육학회지
• /
• 제16권3호
• /
• pp.295-302
• /
• 1996

The purpose of this study was to investigate the effects of training and use of worked-example on chemical problem-solving learning. Schema acquisition and rule automation are the basic components of skilled problem-solving, which are dependent on appropriately focused attention and sufficient cognitive resources. Training and use of worked-example facilitate schema acquisition and rule automation, so improve problem-solving learning. The subjects of this study were 60 high school students. The average age was 17 years old. Then, they were randomly assigned to each groups and the chemical reaction problems used as experimental materials. The independent variables of this study were training and use of worked-examples and dependent variables were time for solution and the number of error. The results of this study were as follows; 1. The worked-example groups spent significantly less time on solution for acquisition problems than the conventional problem groups. 2. The long-acquisition groups spent significantly less time on solution for acquisition problems than the short-acquisition groups. 3. The modified worked-example groups did not spend significantly less time on solution for acquisition problems than the worked-example groups.

• Journal of applied mathematics & informatics
• /
• 제20권1_2호
• /
• pp.293-303
• /
• 2006

This paper describes a numerical scheme for optimal control of a time-dependent linear system to a moving final state. Discretization of the corresponding differential equations gives rise to a linear algebraic system. Defining some binary variables, we approximate the original problem by a mixed integer linear programming (MILP) problem. Numerical examples show that the resulting method is highly efficient.

• 산업경영시스템학회지
• /
• 제38권3호
• /
• pp.169-180
• /
• 2015

Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.

• Kyungpook Mathematical Journal
• /
• 제64권2호
• /
• pp.353-369
• /
• 2024

In this study, we investigate the unknown time-dependent heat source function in inverse problems. We consider three general nonlocal conditions; two classical boundary conditions and one nonlocal over-determination, condition, these genereate six different cases. The finite integration method (FIM), based on numerical integration, has been adapted to solve PDEs, and we use it to discretize the spatial domain; we use backward differences for the time variable. Since the inverse problem is ill-posed with instability, we apply regularization to reduce the instability. We use the first-order Tikhonov's regularization together with the minimization process to solve the inverse source problem. Test examples in all six cases are presented in order to illustrate the accuracy and stability of the numerical solutions.

• 충청수학회지
• /
• 제31권3호
• /
• pp.287-308
• /
• 2018

This paper deals with blow-up phenomena for an initial boundary value problem of a quasilinear parabolic equation with time-dependent coefficient in a bounded star-shaped region under nonlinear boundary flux. Using the auxiliary function method and differential inequality technique, we establish some conditions on time-dependent coefficient and nonlinear functions for which the solution u(x, t) exists globally or blows up at some finite time $t^*$. Moreover, some upper and lower bounds for $t^*$ are derived in higher dimensional spaces. Some examples are presented to illustrate applications of our results.