• Title/Summary/Keyword: 동적 정보

Search Result 5,261, Processing Time 0.038 seconds

Implementation of the mobility for Location Searching in Broadband Intelligence Wireless ATM Networks (광대역 지능 무선 ATM 망에서 위치 탐색을 위한 이동성 구현)

  • 정운석;박광채
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.3
    • /
    • pp.461-467
    • /
    • 2003
  • This paper proposes the method of mobility implementation for location searching in the intelligence wireless ATM networks that expand and apply standard broadband signaling capabilities, and analyze the performance based on the numerical algorithm. The existing B-ISDN UNI protocol stack demands the location search mechanism to determine the location of mobile terminal in the wireless ATM networks because it use single protocol through the fixed PTP interface or PTM interface that don't support terminal mobility. The proposed method make possible the dynamic mobility at a part of wireless access by minimizing the signaling load without a falling-off in system performance by using the intelligence network technology according to the expansion of ATM and B-ISDN signaling integration based on the fixed networks. We implemented the performance analysis by MFC modeling based on numerical algorithm, and realized the efficiency of expenses by carrying out the comparative signaling performance evaluation to measure the relative gains of location search service in the intelligence wireless ATM system. The obtained results have the flexibility to operate in the public B-ISDN network environment without a change of existing B-ISDN/ATM NNI signaling reference to support the wireless ATM access system, and can easily expand to correspond to terminal mobility and various multimedia services in the next broadband PCS.

Tracking Moving Object using Hierarchical Search Method (계층적 탐색기법을 이용한 이동물체 추적)

  • 방만식;김태식;김영일
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.3
    • /
    • pp.568-576
    • /
    • 2003
  • This paper proposes a moving object tracking algorithm by using hierarchical search method in dynamic scenes. Proposed algorithm is based on two main steps: generation step of initial model from different pictures, and tracking step of moving object under the time-yawing scenes. With a series of this procedure, tracking process is not only stable under far distance circumstance with respect to the previous frame but also reliable under shape variation from the 3-dimensional(3D) motion and camera sway, and consequently, by correcting position of moving object, tracking time is relatively reduced. Partial Hausdorff distance is also utilized as an estimation function to determine the similarity between model and moving object. In order to testify the performance of proposed method, the extraction and tracking performance have tested using some kinds of moving car in dynamic scenes. Experimental results showed that the proposed algorithm provides higher performance. Namely, matching order is 28.21 times on average, and considering the processing time per frame, it is 53.21ms/frame. Computation result between the tracking position and that of currently real with respect to the root-mean-square(rms) is 1.148. In the occasion of different vehicle in terms of size, color and shape, tracking performance is 98.66%. In such case as background-dependence due to the analogy to road is 95.33%, and total average is 97%.

Design and Evaluation of a Reservation-Based Hybrid Disk Bandwidth Reduction Policy for Video Servers (비디오 서버를 위한 예약기반 하이브리드 디스크 대역폭 절감 정책의 설계 및 평가)

  • Oh, Sun-Jin;Lee, Kyung-Sook;Bae, Ihn-Han
    • The KIPS Transactions:PartB
    • /
    • v.8B no.5
    • /
    • pp.523-532
    • /
    • 2001
  • A Critical issue in the performance of a video-on-demand system is the required I/O bandwidth of the Video server in order to satisfy clients requests, and it is the crucial resource that may cause delay increasingly. Several approaches such as batching and piggybacking are used to reduce the I/O demand on the video server through sharing. Bathing approach is to make single I/O request for storage server by grouping the requests for the same object. Piggybacking is th policy for altering display rates of requests in progress for the same object to merge their corresponding I/O streams into a single stream, and serve it as a group of merged requests. In this paper, we propose a reservation-based hybrid disk bandwidth reduction policy that dynamically reserves the I/O stream capacity of a video server for popular videos according to the loads of video server in order to schedule the requests for popular videos immediately. The performance of the proposed policy is evaluated through simulations, and is compared with that of bathing and piggybacking. As a result, we know that the reservation-based hybrid disk bandwidth reduction policy provides better probability of service, average waithing time and percentage of saving in frames than batching and piggybacking policy.

  • PDF

An Architecture of UPnP Bridge for Non-lP Devices with Heterogeneous Interfaces (다양한 Non-lP 장치를 위한 UPnP 브리지 구조)

  • Kang, Jeong-Seok;Choi, Yong-Soon;Park, Hong-Seong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12B
    • /
    • pp.779-789
    • /
    • 2007
  • This paper presents an architecture of UPnP Bridge for interconnecting Non-lP devices with heterogeneous network interfaces to UPnP devices on UPnP networks. The proposed UPnP Bridge provides a Virtual UPnP device that performs generic UPnP Device's functionalities on behalf of Non-lP device. This paper defines 3 types of descriptions, Device Description, Message Field Description, and Extended UPnP Service Description in order to reduce the amount of effort required to connect a non-lP device with a new interface or message format to UPnP network. By these three types of descriptions and Message conversion module, developers for Non-lP devices can easily connect the devices to UPnP network without additional programming. So UPnP control point controls Non-lP devices as generic UPnP device. Some experiments validate the proposed architecture, which are performed on a test bed consisting of UPnP network the proposed bridge, and non-lP devices with CAN and RS232 interfaces.

Intensity Based Stereo Matching Algorithm Including Boundary Information (경계선 영역 정보를 이용한 밝기값 기반 스테레오 정합)

  • Choi, Dong-Jun;Kim, Do-Hyun;Yang, Yeong-Yil
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.84-92
    • /
    • 1998
  • In this paper, we propose the novel cost functions for finding the disparity between the left and the right images in the stereo matching problem. The dynamic programming method is used in solving the stereo matching problem by Cox et al[10]. In the reference[10], only the intensity of the pixels in the epipolar line is used as the cost functions to find the corresponding pixels. We propose the two new cost functions. The information of the slope of the pixel is introduced to the constraints in determining the weights of intensity and direction(the historical information). The pixels with the higher slope are matched mainly by the intensity of pixels. As the slope becomes lower, the matching is performed mainly by the direction. Secondly, the disparity information of the previous epipolar line the pixel is used to find the disparity of the current epipolar line. If the pixel in the left epipolar line, $p-i$ and the pixel in the right epipolar line, $p-j$ satisfy the following conditions, the higher matching probability is given to the pixels, $p-i$ and $p-j$. i) The pixels, $p-i$ and $p-j$ are the pixles on the edges in the left and the right images, respectively. ⅱ) For the pixels $p-k$ and $p-l$ in the previous epipolar line, $p-k$and $p-l$ are matched and are the pixels on the same edge with $p-i$ and $p-j$, respectively. The proposed method compared with the original method[10] finds the better matching results for the test images.

  • PDF

Design and Implementation of an Open Object Management System for Spatial Data Mining (공간 데이타 마이닝을 위한 개방형 객체 관리 시스템의 설계 및 구현)

  • Yun, Jae-Kwan;Oh, Byoung-Woo;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.1 no.1 s.1
    • /
    • pp.5-18
    • /
    • 1999
  • Recently, the necessity of automatic knowledge extraction from spatial data stored in spatial databases has been increased. Spatial data mining can be defined as the extraction of implicit knowledge, spatial relationships, or other knowledge not explicitly stored in spatial databases. In order to extract useful knowledge from spatial data, an object management system that can store spatial data efficiently, provide very fast indexing & searching mechanisms, and support a distributed computing environment is needed. In this paper, we designed and implemented an open object management system for spatial data mining, that supports efficient management of spatial, aspatial, and knowledge data. In order to develop this system, we used Open OODB that is a widely used object management system. However, the lark of facilities for spatial data mining in Open OODB, we extended it to support spatial data type, dynamic class generation, object-oriented inheritance, spatial index, spatial operations, etc. In addition, for further increasement of interoperability with other spatial database management systems or data mining systems, we adopted international standards such as ODMG 2.0 for data modeling, SDTS(Spatial Data Transfer Standard) for modeling and exchanging spatial data, and OpenGIS Simple Features Specification for CORBA for connecting clients and servers efficiently.

  • PDF

Augmented Reality Board Game System and PGA (실감형 보드게임 시스템과 PGA)

  • Han, Eun-Jung;Kim, Ki-Rack;Lee, Jang-Hyung;Yoo, Chang-Hyuk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.1
    • /
    • pp.163-173
    • /
    • 2011
  • In this paper, we propose a new paradigm of augmented reality board game environment and a portable game assistant(PGA) which can help gamers with strategy information. Previous AR board games consist of a private and public space. The public space provides rules of the game and shows the scene of game. And the gamers control game pieces in the public space. The previous games use the RFIDs for recognizing positions of the pieces, and the VR/AR environment for providing the scene of the game. However the RFIDs are expansive, and the VR/AR environment is inconvenient because it uses additional devices: the DataGlove, the digital pen, and the HMD. The proposed system recognizes positions of real pieces using the computer vision technique, and uses a monitor to provide dynamic effects. In the private space, previous systems provide entire screen of game and position of specific pieces, but cannot be controled the pieces by gamers. Therefore, in this system, we provide PGA that helps the user to plan of the strategy individually using universally mobile. The PGA helps to plan the strategy in the individual area, and to play easily in the side of the user's convenience.

Dynamic Characteristics of Actuator for High Density Optical Recording Pick-up (고밀도 기록용 광픽업의 ACTUATOR 동특성)

  • 임경화;이용훈;김석중;이재원
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1995.04a
    • /
    • pp.258-263
    • /
    • 1995
  • 미래 정보와 시대에서 중추적인 역할을 할 광관련 멀티미디어 장비들은 최근 관련 산업계에서 주목을 받기 시작하고 있고 특히 기존 VTR(Video Tape Recorder) 시장을 대체할 차세대 DVDR(Digital Video Disk Recorder)는 기술전쟁이라고 할 정도로 선진 기업의 연구가 치열해지고 있다. DVDR 시스템에서는 필요한 정보들을 레이저빔을 이용한 광학신호로 바꾸어 광디스크에 기록, 재생하는 광픽업이 절대적으로 필요하게 된다. 그런데 광픽업의 위치추종기구인 Actuator는 정확한 위치추종(.+-.1.$\mu$m 오차이내)을 할 수 있는 성능이 요구되며 서보의 특성상 20KHz 이하에서 불필요한 모우드가 가진되지 않는 정밀부품이어야 하므로 Actuator 각 부품의 동적인 특성을 명확히 규명할 필요가 있다. 따라서 본 연구에서는 우선 Actuator 각 부품과 가동부 전체의 중량 및 진동해석을 통해 동특성을 조사하였다. 그리고 Actuator의 중요한 기본성능중 하나인 구동감도 확보여부를 검토할 필요가 있기 때문에 유한요소법 프로그램인 ANSYS를 이용하여 자기회로 부분에 대한 해석을 구하였다. 또한 가동부와 자기회로 등 하위부품을 조립하는 과정에서 발생하는 조립오차로 인해 불필요한 공진과 회전형상이 야기될 수 있으므로 동특성 및 문제점 파악을 위한 민감도 분석이 필요하다. 따라서 본 연구에서는 가동부의 관성 모멘트 값과 강체에 대한 일반식을 이용한 자체 프로그램을 작성하여 조립공차를 구하였다. 이와같은 과정을 통해 구해진 설계값을 바탕으로 실제 제작된 Actuator에 대해서는 비접촉식 측정방법을 통해 동특성값을 측정하였고 이를 해석값과 상호 비교하였다.동강성행렬법(dynamic stiffness matrix method)을 이용하여 해석하고자 한다. 수준임이 입증되었다. 본 연구의 결과를 토대로우리나라 젊고 건강한 남성에게 적합한 무게상수는 작업자군에 대하여 25.05kg, 학생군에 대하여 20.24kg 으로 나타나 이는 미국 NIOSH 안전기준과 대체로 일치함을 발견하였다.ive structures utilized in Client/server architecture for distribution and cooperative processing of application between server and client this study presents two different data management methods under the Client/server environment; one is "Remote Data Management Method" which uses file server or database server and. the other is "Distributed Data Management Method" using distributed database management system. The result of this study leads to the conclusion that in the client/server environment although distributed application is assumed, the data could become centralized (in the case of file server or database server) or decentralized (in the case of distributed

  • PDF

소비효율성 개념을 이용한 혁신의 이해

  • 박찬수;이정동;오동현
    • Proceedings of the Technology Innovation Conference
    • /
    • 2003.06a
    • /
    • pp.41-56
    • /
    • 2003
  • 다양한 제품들이 존재하는 시장에는 타 제품에 비하여 품질대비 가격이 낮은 혁신적인 경쟁력있는 제품과 그렇지 못한 제품들이 혼재하고 있다. 그러나 정보의 부족(limited information), 제한적 합리성(bounded rationality) 등 여러 가지 원인으로 인하여 혁신적인 제품들만이 소비자들에게 선택되어 소비되는 것은 아니다. 본 연구에서는 이러한 현상을 설명하기 위하여 소비효율성(consumption efficiency)라는 개념을 도입, 제시하고자 한다. 만약 소비효율성이 극도로 낮다면 혁신적인 제품을 내어놓는다 하더라도 소비자들에게 선택되어 이윤이 발생될 확률이 낮기 때문에 생산자 입장에서는 혁신의 유인(innovation incentive)이 낮아질 수밖에 없게 된다. 이처럼 소비효율성의 문제는 혁신의 유인과 결과를 이해하는데 중요한 단초를 제공할 수 있게 된다. 이에 반하여 혁신을 이해하기 위한 기존의 분석틀은 생산경제이론(production economics)에 기반하고 있고, 효율성의 개념도 생산효율성(production efficiency) 혹은 기술적 효율성(technical efficiency)의 범주에서 다루어져 왔다. 본 연구에서 제시하는 소비효율성의 개념은 효용이론에 근거하고 있다는 점에서 기존 연구와 차별화된다. 본 연구는 효용함수 극대화이론에서 출발하여 경계헤도닉함수(frontier hedomic function)을 도출하는 이론적 유도과정을 제시한다. 실증분석을 위해서는 SFA(Stochastic Frontier Analysis)의 방법론 체계를 적용하였다. 제시된 분석틀은 국내 PC산업의 데이터에 적용되었다. 분석의 결과 몇 가지 가정하에 국내 PC산업이 약 13%정도의 비효율성을 안고 있는 것으로 판단할 수 있으며, 초기혁신구매자(early adopter)들은 일정 정도의 비효율성을 기꺼이 감수할 것으로 분석되었다. 궤적 분석에서는 각 산업별 기술의 특성을 분석하는 것으로, 특정 기술 지식의 활용 기간을 통해 기술 주기를 도출하고, 산업 내 평균 권리 청구 항목 수를 이용하여 각 산업의 기술 범위를 비교하였다. 각각의 동적 분석을 통해 시간에 따른 변화 양상이 관찰하였고, ANOVA 분석을 이용하여 통계적 유의성을 검증하였다. 본 연구는 현재의 기술 패러다임 내에서 Pavitt이 제시한 산업 분류의 근거를 보충 설명하였고 특허 정보를 이용하여 기술혁신의 산업별 유형에 대한 폭넓은 분석방법을 제시하였다.별 시간대별 효과분석을 통하여 정책의 시행여부가 결정되어야 할 것이다. 한편, 화물전용차선의 설치로 인한 물류비용의 절감을 보다 효과적으로 달성하기 위해서는 종합류류 전산망의 시급한 구축과 함께 화물차의 적재율을 높이고 공차율을 낮출 수 있는 운송체계의 수립이 필요한 것으로 판단된다. 그라나 이러한 화물전용차선의 효과는 단기적인 치유책일 수밖에 없기 때문에 물류유통 시설의 확충을 위한 사회간접자본의 구축을 서둘러 시행하여야 할 것이다.으로 처리한 Machine oil, Phenthoate EC 및 Trichlorfon WP는 비교적 약효가 낮았다.>$^{\circ}$E/$\leq$30$^{\circ}$NW 단열군이 연구지역 내에서 지하수 유동성이 가장 높은 단열군으로 추정된다. 이러한 사실은 3개 시추공을 대상으로 실시한 시추공 내 물리검층과 정압주입시험에서도 확인된다.. It was resulted from increase of weight of single cocoon. "Manta"2.5ppm produced 22.2kg of cocoon. It is equal to 9% increase in index, as compared to that of control. In case of R-20458, the increasing

  • PDF

Pre-aggregation Index Method Based on the Spatial Hierarchy in the Spatial Data Warehouse (공간 데이터 웨어하우스에서 공간 데이터의 개념계층기반 사전집계 색인 기법)

  • Jeon, Byung-Yun;Lee, Dong-Wook;You, Byeong-Seob;Kim, Gyoung-Bae;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.11
    • /
    • pp.1421-1434
    • /
    • 2006
  • Spatial data warehouses provide analytical information for decision supports using SOLAP (Spatial On-Line Analytical Processing) operations. Many researches have been studied to reduce analysis cost of SOLAP operations using pre-aggregation methods. These methods use the index composed of fixed size nodes for supporting the concept hierarchy. Therefore, these methods have many unused entries in sparse data area. Also, it is impossible to support the concept hierarchy in dense data area. In this paper, we propose a dynamic pre-aggregation index method based on the spatial hierarchy. The proposed method uses the level of the index for supporting the concept hierarchy. In sparse data area, if sibling nodes have a few used entries, those entries are integrated in a node and the parent entries share the node. In dense data area, if a node has many objects, the node is connected with linked list of several nodes and data is stored in linked nodes. Therefore, the proposed method saves the space of unused entries by integrating nodes. Moreover it can support the concept hierarchy because a node is not divided by linked nodes. Experimental result shows that the proposed method saves both space and aggregation search cost with the similar building cost of other methods.

  • PDF