• Investigative Magnetic Resonance Imaging
• /
• 제19권1호
• /
• pp.19-30
• /
• 2015

Purpose: A new compressed sensing technique by iterative truncation of small transformed coefficients (ITSC) is proposed for fast cardiac CINE MRI. Materials and Methods: The proposed reconstruction is composed of two processes: truncation of the small transformed coefficients in the r-f domain, and restoration of the measured data in the k-t domain. The two processes are sequentially applied iteratively until the reconstructed images converge, with the assumption that the cardiac CINE images are inherently sparse in the r-f domain. A novel sampling strategy to reduce the normalized mean square error of the reconstructed images is proposed. Results: The technique shows the least normalized mean square error among the four methods under comparison (zero filling, view sharing, k-t FOCUSS, and ITSC). Application of ITSC for multi-slice cardiac CINE imaging was tested with the number of slices of 2 to 8 in a single breath-hold, to demonstrate the clinical usefulness of the technique. Conclusion: Reconstructed images with the compression factors of 3-4 appear very close to the images without compression. Furthermore the proposed algorithm is computationally efficient and is stable without using matrix inversion during the reconstruction.

• Journal of the Korean Statistical Society
• /
• 제34권1호
• /
• pp.61-71
• /
• 2005

A class of asymmetric ARCH processes is proposed via binary random power transformations. This class accommodates traditional nonlinear models such as threshold ARCH (Rabemanjara and Zacoian (1993)) and Box-Cox type ARCH models(Higgins and Bera (1992)). Stationarity condition of the model is addressed. Iterative least squares(ILS) and pseudo maximum like-lihood(PML) methods are discussed for estimating parameters and related algorithms are presented. Illustrative analysis for Korea Stock Prices Index (KOSPI) data is conducted.

• Kyungpook Mathematical Journal
• /
• 제61권2호
• /
• pp.279-308
• /
• 2021

The purpose of this paper is to introduce a class of contractive pairs of mappings satisfying a Zamfirescu-type inequality, but controlled with altering distance functions and with parameters satisfying the so-called Geraghty condition in the framework of b-metric spaces. For this class of mappings we prove the existence of points of coincidence, the convergence and stability of the Jungck, Jungck-Mann and Jungck-Ishikawa iterative processes and the existence and uniqueness of its common fixed points.

• 제어로봇시스템학회논문지
• /
• 제2권3호
• /
• pp.148-157
• /
• 1996

Availability of input trajectories corresponding to desired output trajectories is often important in designing control systems for batch and other transient processes. In this paper, we propose a predictive control-type model-based iterative learning algorithm which is applicable to finding the nominal input trajectories of a linear time-invariant batch process. Unlike the other existing learning control algorithms, the proposed algorithm can be applied to nonsquare systems and has an ability to adjust noise sensitivity as well as convergence rate. A simple model identification technique with which performance of the proposed learning algorithm can be significantly enhanced is also proposed. Performance of the proposed learning algorithm is demonstrated through numerical simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권2호
• /
• pp.1148-1161
• /
• 2017

The success of a business process management system stands or falls on the quality of the business processes. Many experiments therefore have been devoting considerable attention to the modeling and analysis of business processes in process-centered organizations. One of those experiments is to apply the probabilistic theories to the analytical evaluations of business process models in order to improve their qualities. In this paper, we excogitate a conceptual way of applying a probability theory of proportions into modeling business processes. There are three types of routing patterns such as sequential, disjunctive, conjunctive and iterative routing patterns in modeling business processes, into which the proportion theory is applicable. This paper focuses on applying the proportion theory to the disjunctive routing patterns, in particular, and formally named proportional information control net that is the formal representation of a corresponding business process model. In this paper, we propose a conceptual approach to discover a proportional information control net from the enactment event histories of the corresponding business process, and describe the details of a series of procedural frameworks and operational mechanisms formally and graphically supporting the proposed approach. We strongly believe that the conceptual approach with the proportional information control net ought to be very useful to improve the quality of business processes by adapting to the reengineering and redesigning the corresponding business processes.

• 한국통신학회논문지
• /
• 제17권8호
• /
• pp.891-897
• /
• 1992

본 논문은 일반반복 화상 처리가 화상 전체에 화사의 정보와 상관없이 일률적인 방법으로 적용함으로서 생기는 비 효율성을 고려하여 처리하는 화소의 주변 화상 정보를 이용하여 평면 부분과 윤곽 부부느이 처리회수를 달리하여 주므로서 시각적인 효과와 동시에 처리 시간을 단축하는 국부 반복 복원 방법을 제안하였다. 국부 반복 복원 방법은 일반 반복, 복원 알고리즘을 적용하여 윤곽 부분을 집중 복원하고 평면 부분은 복원없이 통과하는 방법으로, 여기에 사용된 일반 반복 알고리즘이 수렴하면 국분 반복 복원도 수렴하게 됨을 이용하였다. 각각 처리된 화상,MSE, 처리 시간등을 비교하여 그 효율성을 확인하였다.

• 대한수학회논문집
• /
• 제34권4호
• /
• pp.1157-1162
• /
• 2019

In this paper, we extend the study of general convergence theorems for the Picard iteration of Proinov contraction from the class of continuous mappings to the class of discontinuous mappings. As a by product we provide a new affirmative answer to the open problem posed in [20].

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1999년도 제14차 학술회의논문집
• /
• pp.57-60
• /
• 1999

An optimal control technique designed for simultaneous tracking and quality control for batch processes. The proposed technique is designed by transforming quadratic-criterion based iterative learning control(Q-ILC) into linear quadratic control problem. For real-time quality inferential control, the quality is modeled by linear combination of control input around target qualify and then the relationship between quality and control input can be transformed into time-varying linear state space model. With this state space model, the real-time quality inferential control can be incorporated to LQ control Problem. As a consequence, both the quality variable as well as other controlled variables can progressively reduce their control error as the batch number increases while rejecting real-time disturbances, and finally reach the best achievable states dictated by a quadratic criterion even in case that there is significant model error Also the computational burden is much reduced since the most computation is calculated in off-line. The Proposed control technique is applied to a semi-batch reactor model where series-parallelreactions take place.

• 대한수학회지
• /
• 제36권6호
• /
• pp.1061-1073
• /
• 1999

Let X be a real normed linear space. Let T : D(T) ⊂ X \longrightarrow X be a uniformly continuous and ∮-strongly quasi-accretive mapping. Let {${\alpha}$n}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} , {${\beta}$n}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} be two real sequences in [0, 1] satisfying the following conditions: (ⅰ) ${\alpha}$n \longrightarrow0, ${\beta}$n \longrightarrow0, as n \longrightarrow$\infty$ (ⅱ) {{{{ SUM from { { n}=0} to inf }}}} ${\alpha}$=$\infty$. Set Sx=x-Tx for all x $\in$D(T). Assume that {u}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} and {v}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} are two sequences in D(T) satisfying {{{{ SUM from { { n}=0} to inf }}}}∥un∥<$\infty$ and vn\longrightarrow0 as n\longrightarrow$\infty$. Suppose that, for any given x0$\in$X, the Ishikawa type iteration sequence {xn}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} with errors defined by (IS)1 xn+1=(1-${\alpha}$n)xn+${\alpha}$nSyn+un, yn=(1-${\beta}$n)x+${\beta}$nSxn+vn for all n=0, 1, 2 … is well-defined. we prove that {xn}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} converges strongly to the unique zero of T if and only if {Syn}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} is bounded. Several related results deal with iterative approximations of fixed points of ∮-hemicontractions by the ishikawa iteration with errors in a normed linear space. Certain conditions on the iterative parameters {${\alpha}$n}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} , {${\beta}$n}{{{{ { }`_{n=0 } ^{$\infty$ } }}}} and t are also given which guarantee the strong convergence of the iteration processes.

• 대한기계학회논문집A
• /
• 제24권5호
• /
• pp.1215-1230
• /
• 2000

Parallel Approaches using Cray T3E which is NIPP (Massively Parallel Processors) machine are presented for the efficient computation of the finite element analysis of 3-D shape rolling processes. D omain decomposition method coupled with parallel linear equation solver is used. Domain decomposition is applied for obtaining element tangent stifffiess matrices and residual vectors. Direct and iterative parallel algorithms are used for solving the linear equations. Direct algorithm is_parallel version of direct banded matrix solver. For iterative algorithms, the well-known preconditioned conjugate gradient solver with Jacobi preconditioner is also employed. Moreover a new effective iterative scheme with block inverse matrix preconditioner, which is named by present authors, is presented and its results are compared with the one using Jacobi preconditioner. PVM and MPI are used for message passing and synchronization between processors. The performance and efficiency of each algorithm is discussed and comparisons are made among different algorithms.