• 대한수학회지
• /
• 제52권5호
• /
• pp.1003-1021
• /
• 2015

A matrix completion problem has been exploited amply because of its abundant applications and the analysis of contractions enables us to have insight into structure and space of operators. In this article, we focus on a specific completion problem related to Hankel partial contractions. We provide concrete necessary and sufficient conditions for the existence of completion of Hankel partial contractions for both extremal and non-extremal types with lower dimensional matrices. Moreover, we give a negative answer for the conjecture presented in [8]. For our results, we use several tools such as the Nested Determinants Test (or Choleski's Algorithm), the Moore-Penrose inverse, the Schur product techniques, and a congruence of two positive semi-definite matrices; all these suggest an algorithmic approach to solve the contractive completion problem for general Hankel matrices of size $n{\times}n$ in both types.

• 한국정보과학회논문지:정보통신
• /
• 제29권5호
• /
• pp.510-523
• /
• 2002

The routers in an active network perform customized computations on the messages flowing through them, while the role of routers in the traditional packet network, such as the Internet, is to passively forward packets as fast as possible. In contrast to the Internet, the processing in active networks can be customized on a per user or per application basis. Active networks allow users to inject information into the network, where the information describes or controls a program to be executed for the users by the routers as well as the end hosts. So the network users can realize the active networks by "programming" the network behavior via the programming interface exposed to them. In this paper, we devise a network protocol model and present a verification technique for reasoning about the correctness of an active application defined using the model. The technique is developed in a platform- and language-independent way, and it is algorithmic and can be automated by computer program. We give an example dealing with network auction to illustrate the use of the model and the verification technique.

• Journal of Information Processing Systems
• /
• 제7권3호
• /
• pp.397-412
• /
• 2011

Granular Computing has emerged as a unified and coherent framework of designing, processing, and interpretation of information granules. Information granules are formalized within various frameworks such as sets (interval mathematics), fuzzy sets, rough sets, shadowed sets, probabilities (probability density functions), to name several the most visible approaches. In spite of the apparent diversity of the existing formalisms, there are some underlying commonalities articulated in terms of the fundamentals, algorithmic developments and ensuing application domains. In this study, we introduce two pivotal concepts: a principle of justifiable granularity and a method of an optimal information allocation where information granularity is regarded as an important design asset. We show that these two concepts are relevant to various formal setups of information granularity and offer constructs supporting the design of information granules and their processing. A suite of applied studies is focused on knowledge management in which case we identify several key categories of schemes present there.

• Radiation Oncology Journal
• /
• 제35권2호
• /
• pp.101-111
• /
• 2017

The number of imaging data sets has significantly increased during radiation treatment after introducing a diverse range of advanced techniques into the field of radiation oncology. As a consequence, there have been many studies proposing meaningful applications of imaging data set use. These applications commonly require a method to align the data sets at a reference. Deformable image registration (DIR) is a process which satisfies this requirement by locally registering image data sets into a reference image set. DIR identifies the spatial correspondence in order to minimize the differences between two or among multiple sets of images. This article describes clinical applications, validation, and algorithms of DIR techniques. Applications of DIR in radiation treatment include dose accumulation, mathematical modeling, automatic segmentation, and functional imaging. Validation methods discussed are based on anatomical landmarks, physical phantoms, digital phantoms, and per application purpose. DIR algorithms are also briefly reviewed with respect to two algorithmic components: similarity index and deformation models.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.908-913
• /
• 1993

The inverse kinematic solutions for redundant manipulators using the optimality augmented resolution schemes have been used without investigating the characteristics of the optimal solutions. The questions with this kind of resolution methods are answered in this paper, that is (i) the characteristics of solutions, (ii) of algorithmic singularities, (iii) their dimensionality, and (iv) the invariance of the characteristics during resolutions. 3-DOF planar redundant robot is analyzed when the inverse kinematic method is applied with the manipulability as an example.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.173-178
• /
• 1993

In this paper, we present an algorithmic technique for determining a feedback compensator which will stabilize the interval dynamic system, specifically, the robust regulator design for interval plants. The approach taken here is to allow the system parameters to live within prescribed intervals then design a dynamic feedback compensator which guarantees closed-loop system stable. The main contribution of this paper is the idea of introducing a "simplified Kharitonov's result" for low order polynomials to search for suitable compensator parameters in the compensator parameter space to make the uncertain syste robust. We also design the robust regulator which will D-stabilize (have the closed-loop poles in the left sector only) the dynamic interval system while having good performance. The nuerical examples are given to show the substantially improved robustness which results from our approach. approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.566-570
• /
• 2005

A digital controller for nonlinear time-delay system is proposed in this paper. A nonlinear time-delay system is discretized by using Taylor's discretization method. And the discretized system can be converted to a general nonlinear system. For this reason, general nonlinear controller synthesis can be applied to the discretized time-delay system. We adopted MAC controller synthesis for this study. Computer simulations are conducted to verify the performance of the proposed method. The results of simulation show good performance of the proposed controller synthesis and the proposed method is useful to control nonlinear time-delay system easily.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2010-2014
• /
• 2005

Object detection and parameter estimation in point cloud data is a relevant subject to robotics, reverse engineering, computer vision, and sport mechanics. In this paper a software is presented for fully-automatic object detection and parameter estimation in unordered, incomplete and error-contaminated point cloud with a large number of data points. The software consists of three algorithmic modules each for object identification, point segmentation, and model fitting. The newly developed algorithms for orthogonal distance fitting (ODF) play a fundamental role in each of the three modules. The ODF algorithms estimate the model parameters by minimizing the square sum of the shortest distances between the model feature and the measurement points. Curvature analysis of the local quadric surfaces fitted to small patches of point cloud provides the necessary seed information for automatic model selection, point segmentation, and model fitting. The performance of the software on a variety of point cloud data will be demonstrated live.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.914-919
• /
• 1993

The kinematic resolutions of redundancy is addressed in this paper. The governing equation for quasistatic behavior of compliance governed redundant manipulators is formulated and the repeatable property of the manipulator is proposed. Then the compliance paradigm is used to resolve the redundancy in a repeatable way. The compliance paradigm is one under which the controller simulates the imaginary manipulator which is governed to move by real joint stiffness. The equation is expressed as the weighted pseudoinverse with the configuration dependent weighting matrix. Algorithmic singularities arisen from this scheme are also discussed.

• 전자공학회논문지A
• /
• 제30A권10호
• /
• pp.67-76
• /
• 1993

This paper presents the design and implementation of SVSIM (Sogang VHDL SIMulator), a multi-level VHDL simulator, designed for the construction of an integrated VGDL design environment. The internal model of SVSIM is the hierarchical C/DFG which is extended from C/DFG to include the network hierarchy and local/glabal control informations. Hierarchical network is not flattened for simulation, resulting in the reduction of space complexity. The predufined/user-defined types except for the record type and the predefined/user-defined attributes are supported in SVSIM. Algorithmic-level descriptions can be siumlated by the support of recursive procedure/function calls. Input stimuli can be generated by command script in stimuli file or in VHDL source code. Experimential results show SVSIM can be efficiently used for the simulation of the pure behavioral descriptions, structural descriptions or mixture of these.