• 제목/요약/키워드: Local mapping

검색결과 367건 처리시간 0.025초

ABSTRACT FUNCTIONAL DIFFERENTIAL EQUATIONS IN BANACH SPACES

  • Jeong, Jin-Gyo;Shin, Ki-Yeon
    • 대한수학회지
    • /
    • 제34권3호
    • /
    • pp.501-503
    • /
    • 1997
  • The existence of a unique local generalized solution for the abstract functional evolution problem of the type $$ (FDE:\phi) x'(t) + A(t, x_t)x(t) \ni G(t, x_t), t \in [0, T], x_0 = \phi $$ in a general Banach spaces is considered. It is shown that $(FDE:\phi)$ could be considered with well-known fixed point theory and recent results for the functional differential equations involving the operator A(t).

  • PDF

MONOTONICITY OF EUCLIDEAN CURVATURE UNDER LOCALLY UNIVALENT FUNCTIONS

  • Song, Tai-Sung
    • East Asian mathematical journal
    • /
    • 제17권2호
    • /
    • pp.303-308
    • /
    • 2001
  • Let K($z,\gamma$) denote the euclidean curvature of the curve $\gamma$ at the point z. Flinn and Osgood proved that if f is a univalent mapping of the open unit disk D={z:|z|<1} into itself with f(0)=0 and |f'(0)|<1, then $K(0,\gamma){\leq}K(0,f\;o\;\gamma)$ for any $C^2$ curve $\gamma$ on D through the origin with $K(0,\gamma){\geq}4$. In this paper we establish a generalization of the Flinn-Osgood Monotonicity Theorem.

  • PDF

A Trust Management Model for PACS-Grid

  • Cho, Hyun-Sook;Lee, Bong-Hwan;Lee, Kyu-Won;Lee, Hyoung
    • Journal of information and communication convergence engineering
    • /
    • 제5권2호
    • /
    • pp.144-149
    • /
    • 2007
  • Grid technologies make it possible for IT resources to be shared across organizational and security domains. The traditional identity-based access control mechanisms are unscalable and difficult to manage. Thus, we propose the FAS (Federation Agent Server) model which is composed of three modules: Certificate Conversion Module (CCM), Role Decision Module (RDM), and Authorization Decision Module (ADM). The proposed FAS model is an extended Role-Based Access Control (RBAC) model which provides resource access capabilities based on roles assigned to the users. FAS can solve the problem of assigning multiple identities to a shared local name in grid-map file and mapping the remote entity's identity to a local name manually.

Learning Framework for Robust Planning and Real-Time Execution Control

  • Wang, Gi-Nam;Yu, Gang
    • Management Science and Financial Engineering
    • /
    • 제8권1호
    • /
    • pp.53-75
    • /
    • 2002
  • In this Paper, an attempt is made to establish a learning framework for robust planning and real-time execution control. Necessary definitions and concepts are clearly presented to describe real-time operational control in response to Plan disruptions. A general mathematical framework for disruption recovery is also laid out. Global disruption model is decomposed into suitable number of local disruption models. Execution Pattern is designed to capture local disruptions using decomposed-reverse neural mappings, and to further demonstrate how the decomposed-reverse mappings could be applied for solving disrubtion recovery problems. Two decomposed-reverse neural mappings, N-K-M and M-K-N are employed to produce transportation solutions in react-time. A potential extension is also discussed using the proposed mapping principle and other hybrid heuristics. Experimental results are provided to verify the proposed approach.

2-D IIR digital filter에 대한 systolic array구현 (Implementation of systolic array for 2-D IIR digital filters)

  • 김수현
    • 한국음향학회:학술대회논문집
    • /
    • 한국음향학회 1992년도 학술논문발표회 논문집 제11권 1호
    • /
    • pp.29-32
    • /
    • 1992
  • In this paper, a systolic array structure is derived from the realization of 2-D IIR digital filters directed from the SFG(signal flow graph). After realized the 1-D formed partial systolic array, we implemented the complete systolic array to be cascaded 1-D form. The cascading of partial systolic arrays reduce the storage element which sued to delay input signal. 1-D systolic array is derived from that DG is designed through local communication approach and then it mapping to SFG. The derived structure is very simple and has high throughput because during new imput sample is supplied, new output is obtained every sampling period. And broadcast input signal is eliminated. Since the systolic array has property of regularity, modularity, local interconnection and highly synchronized multiprocessing, thus is very suitable for VLSI implementation.

  • PDF

그리드 서비스를 위한 사용자 데이터 관리 시스템 설계 (Design of User Data Management System for Grid Service)

  • 오영주;김법균;안동언;정성종
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.224-226
    • /
    • 2005
  • Grid computing enables the fundamental computing shift from a localized resource computing model to a fully-distributed virtual organization with shared resources. In the grid computing environment, grid users usually get access rights by mapping their credential to local account. The mapped total account is temporally belongs to grid user. So, data on the secondary storage, which is produced by grid operation, can increase the load of system administration or can issue grid user's privacy. In this paper, we design a data management system for grid user to cover these problems. This system implements template account mechanism and manages local grid data.

  • PDF

SLAM of a Mobile Robot using Thinning-based Topological Information

  • Lee, Yong-Ju;Kwon, Tae-Bum;Song, Jae-Bok
    • International Journal of Control, Automation, and Systems
    • /
    • 제5권5호
    • /
    • pp.577-583
    • /
    • 2007
  • Simultaneous Localization and Mapping (SLAM) is the process of building a map of an unknown environment and simultaneously localizing a robot relative to this map. SLAM is very important for the indoor navigation of a mobile robot and much research has been conducted on this subject. Although feature-based SLAM using an Extended Kalman Filter (EKF) is widely used, it has shortcomings in that the computational complexity grows in proportion to the square of the number of features. This prohibits EKF-SLAM from operating in real time and makes it unfeasible in large environments where many features exist. This paper presents an algorithm which reduces the computational complexity of EKF-SLAM by using topological information (TI) extracted through a thinning process. The global map can be divided into local areas using the nodes of a thinning-based topological map. SLAM is then performed in local instead of global areas. Experimental results for various environments show that the performance and efficiency of the proposed EKF-SLAM/TI scheme are excellent.

PIV/LIF기법에 의한 교반혼합기 내의 속도장과 농도장 동시 측정 (Simultaneous Measurement of Velocity and Concentration Field in a Stirred Mixer Using PIV/LIF Technique)

  • 정은호;윤상열;김경천
    • 대한기계학회논문집B
    • /
    • 제27권4호
    • /
    • pp.504-510
    • /
    • 2003
  • Simultaneous measurements of turbulent velocity and concentration field in a stirred mixer tank are carried out by using PIV/LIF technique. Instantaneous velocity fields are measured with a 1K$\times$1K CCD camera adopting the frame straddle method while the concentration fields are obtained by measuring the fluorescence intensity of Rhodamine B tracer excited by the second pulse of Nd:Yag laser light. Image distortion due to the camera view-angle is compensated by a mapping function. It is found that the general features of the mixing pattern are quite dependent on the local flow characteristics during the rapid decay of mean concentration. However, the small scale mixing seems to be independent on the local turbulent velocity fluctuation.

RGB 공간상의 국부 영역 블록의 왜곡척도를 고려한 칼라 영상 양자화 (Color image quantization considering distortion measure of local region block on RGB space)

  • 박양우;이응주;김경만;엄태억;하영호
    • 한국통신학회논문지
    • /
    • 제21권4호
    • /
    • pp.848-854
    • /
    • 1996
  • Many image display devices allow only a limited number of colors to be simultaneously displayed. in disphaying of natural color image using color palette, it is necessary to construct an optimal color palette and the optimal mapping of each pixed of the original image to a color from the palette. In this paper, we proposed the clustering algorithm using local region block centered one color cluster in the prequantized 3-D histogram. Cluster pairs which have the least distortion error are merged by considering distortion measure. The clustering process is continued until to obtain the desired number of colors. The same as the clustering process, original color value. The proposed algorithm incroporated with a spatial activity weighting value which is reflected sensitivity of HVS quantization errors in smoothing region. This method produces high quality display images and considerably reduces computation time.

  • PDF