• Title/Summary/Keyword: 3DAV

Search Result 16, Processing Time 0.026 seconds

Design of a WebDAV Sewer using Apache and PostgreSQL (Apache와 PostgreSQL을 이용한 WebDAV 서버의 설계)

  • 정혜영;안건태;박희종;문남두;이명준
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.397-399
    • /
    • 2004
  • 분산된 작업 공간의 사용자가 인터넷을 통하여 협업을 할 수 있도록 하기 위하여 WebDAV 명세가 W3C의 IETF의 작업 그룹에 의해서 1992년 2월에 발표되었다. WebDAV는 HTTP/1.1을 확장한 웹 통신프로토콜로서, 인터넷을 통하여 광범위하고 다양한 콘텐츠의 비동기적인 협업을 지원하기 위한 표준 하부 구조를 제공한다. 이러한 명세를 지원하는 WebDAV 서버의 주요 기능은 HTTP/1.1의 기본적인 웹 서버의 기능을 제공하면서 확장된 WebDAV 명세의 기능을 제공하는 것이다. 본 논문에서 설계한 WebDAV 서버는 WebDAV를 지원하고 있는 공개 소프트웨어인 아파치 웹 서버의 mod_dav 모듈을 확장한 것으로 WebDAV의 자원과 속성 및 잠금 정보를 기존의 파일 시스템의 파일 형태로 관리하고 있는 것을 자원의 속성과 잠금 정보 부분을 PostgreSQL 데이터베이스에서 관리하도록 하였다. WebDAV 자원의 속성과 잠금 정보를 파일로 관리함으로 인한 성능 저하와 확장성의 문제를 해결할 수 있다.

  • PDF

Design of a Collaborative System Client based on WebDAV (WebDAV기반 협업시스템 클라이언트의 설계)

  • 신원준;황의윤;김진홍;문남두;이명준
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10c
    • /
    • pp.478-480
    • /
    • 2004
  • 네트워크의 발달로 인하여 지역적으로 원거리에 위치한 다수의 사용자들이 공동 작업을 수행할 수 있는 다양한 기술들이 개발되었다. 공동작업을 지원하는 협업시스템은 HTTP 프로토콜을 사용하거나 또는 각자의 고유한 통신 프로토콜들을 정의하여 구현하였다. 이러한 방법은 협업시스템 간의 상호 운용성이 결여되는 문제를 발생시켰다. W3C의 IETF에서는 협업지원을 위한 WebDAV 명세가 발표되었다. WebDAV는 웹상의 공동 저작활동을 지원하기 위한 표준프로콜로서, 원거리에 있는 사용자들 간에 인터넷상의 파일을 편집하고 관리할 수 있도록 해주는 HTTP의 확장이다. 이를 이용하여 협업시스템을 구성하면 협업시스템 간의 상호 운용성을 높일 수 있을 것이 다. 협업시스템의 클라이언트는 협업지원 서버의 자원들을 효율적으로 이용할 수하고 팀원들 간의 상호작용이 원활 하게 이루어 져야한다. 이러한 요구 조건을 고려하여 본 논문에서는 WebDAV 프로토콜을 이용한 협업시스템의 클라이언트를 설계하였다. 고급기능으로 사용자가 협업지원 서버의 파일을 편집할 때 자동으로 저작프로그램을 연결하고 저작프로그램을 종료할 때 파일의 변화된 내용과 파일의 버전관리를 실시간으로 서버에 적용될 수 있게 디자인하였다. 또한 드래그앤드롭(Drag & Drop)을 통한 파일이동을 지원하고 파일의 읽기모드와 쓰기모드를 지원하는 기능을 설계하였다.

  • PDF

Development of a WebDAV-based Smartphone Collaborative Application (웹데브 기반의 스마트폰 협업 어플리케이션 개발)

  • Lee, Hong-Chang;Kim, Bo-Hyeon;Lee, Myung-Joon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.3
    • /
    • pp.680-690
    • /
    • 2011
  • To support asynchronous collaboration among remote users, collaborative applications provide collaboration services and environment through virtual workspaces. In general, collaborative applications support collaboration based on desktop-based personal computers, using the features such as resource sharing or asynchronous communication among users. Unfortunately, since those applications mainly run on personal computers, they do not easily support collaborative works in various places. In this paper, we describe the development of smartphone collaborative application which provides effective collaboration facilities like resource sharing through various types of workspaces or group communication, communicating with a WebDAV-based collaboration server. The developed application provides users with high accessibility through multi-touch/touch-slide based user-interfaces in mobile environment. To support effective communication with a collaboration server, we also present a WebDAV-based collaboration library using a collaboration protocol designed to analyze easily the responses from the collaboration server.

Disparity Estimation Algorithm using Variable Blocks and Search Ranges (가변블록 및 가변 탐색구간을 이용한 시차추정 알고리즘)

  • Koh Je hyun;Song Hyok;Yoo Ji sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4C
    • /
    • pp.253-261
    • /
    • 2005
  • In this paper, we propose an efficient block-based disparity estimation algorithm fur multiple view image coding in EE2 and EE3 in 3DAV. The proposed method emphasizes on visual quality improvement to satisfy the requirements for multiple view generation. Therefore, we perform an adaptive disparity estimation that constructs variable blocks by considering given image features. Examining neighboring features around desired block search range is set up to decrease complexity and additional information than only using quad-tree coding through applying binary-tree and quad-tree coding by taking into account stereo image feature having big disparity. The experimental results show that the proposed method improves PSNR about 1 to 2dB compared to existing other methods and decreases computational complexity up to maximum 68 percentages than FBMA.

Digital Hologram Compression Technique By Hybrid Video Coding (하이브리드 비디오 코팅에 의한 디지털 홀로그램 압축기술)

  • Seo, Young-Ho;Choi, Hyun-Jun;Kang, Hoon-Jong;Lee, Seung-Hyun;Kim, Dong-Wook
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.5 s.305
    • /
    • pp.29-40
    • /
    • 2005
  • According as base of digital hologram has been magnified, discussion of compression technology is expected as a international standard which defines the compression technique of 3D image and video has been progressed in form of 3DAV which is a part of MPEG. As we can identify in case of 3DAV, the coding technique has high possibility to be formed into the hybrid type which is a merged, refined, or mixid with the various previous technique. Therefore, we wish to present the relationship between various image/video coding techniques and digital hologram In this paper, we propose an efficient coding method of digital hologram using standard compression tools for video and image. At first, we convert fringe patterns into video data using a principle of CGH(Computer Generated Hologram), and then encode it. In this research, we propose a compression algorithm is made up of various method such as pre-processing for transform, local segmentation with global information of object image, frequency transform for coding, scanning to make fringe to video stream, classification of coefficients, and hybrid video coding. Finally the proposed hybrid compression algorithm is all of these methods. The tool for still image coding is JPEG2000, and the toots for video coding include various international compression algorithm such as MPEG-2, MPEG-4, and H.264 and various lossless compression algorithm. The proposed algorithm illustrated that it have better properties for reconstruction than the previous researches on far greater compression rate above from four times to eight times as much. Therefore we expect that the proposed technique for digital hologram coding is to be a good preceding research.

Post Trajectory Insertion Performance Analysis of Korea Pathfinder Lunar Orbiter Using SpaceX Falcon 9

  • Young-Joo Song;Jonghee Bae;SeungBum Hong;Jun Bang;Donghun Lee
    • Journal of Astronomy and Space Sciences
    • /
    • v.40 no.3
    • /
    • pp.123-129
    • /
    • 2023
  • This paper presents an analysis of the trans-lunar trajectory insertion performance of the Korea Pathfinder Lunar Orbiter (KPLO), the first lunar exploration spacecraft of the Republic of Korea. The successful launch conducted on August 4, 2022 (UTC), utilized the SpaceX Falcon 9 rocket from Cape Canaveral Space Force Station. The trans-lunar trajectory insertion performance plays a crucial role in ensuring the overall mission success by directly influencing the spacecraft's onboard fuel consumption. Following separation from the launch vehicle (LV), a comprehensive analysis of the trajectory insertion performance was performed by the KPLO flight dynamics (FD) team. Both orbit parameter message (OPM) and orbit determination (OD) solutions were employed using deep space network (DSN) tracking measurements. As a result, the KPLO was accurately inserted into the ballistic lunar transfer (BLT) trajectory, satisfying all separation requirements at the target interface point (TIP), including launch injection energy per unit mass (C3), right ascension of the injection orbit apoapsis vector (RAV), and declination of the injection orbit apoapsis vector (DAV). The precise BLT trajectory insertion facilitated the smoother operation of the KPLO's remainder mission phase and enabled the utilization of reserved fuel, consequently significantly enhancing the possibilities of an extended mission.

PosCFS+: A Self-Managed File Service in Personal Area Network

  • Lee, Woo-Joong;Kim, Shi-Ne;Park, Chan-Ik
    • ETRI Journal
    • /
    • v.29 no.3
    • /
    • pp.281-291
    • /
    • 2007
  • Wearable computers consisting of various small devices such as smart phones, digital cameras, MP3 players and specialized I/O devices in personal area networks will play an important role in future ubiquitous computing. In this environment, accessing user data is quite complex due to the dynamic and heterogeneous characteristics of the underlying networks. Moreover, since the amount of user data increases rapidly, automatic data backup management is also critical. To overcome these challenges, several studies have been conducted including our previously proposed file service system, PosCFS, which could be adapted to the requirements with a virtualization technique allowing per-user global namespace for managing and accessing data stored on physical storage spaces detected in PAN. In this paper, we present a smart file service framework, PosCFS+ which is an improved and extended version of our previous work. Performance improvement is made possible by redesigning the metadata management scheme based on database and keywords rather than ontology. In addition, the automatic data replication management is newly designed based on the OSD protocol.

  • PDF

ON HARMONIC CONVOLUTIONS INVOLVING A VERTICAL STRIP MAPPING

  • Kumar, Raj;Gupta, Sushma;Singh, Sukhjit;Dorff, Michael
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.1
    • /
    • pp.105-123
    • /
    • 2015
  • Let $f_{\beta}=h_{\beta}+\bar{g}_{\beta}$ and $F_a=H_a+\bar{G}_a$ be harmonic mappings obtained by shearing of analytic mappings $h_{\beta}+g_{\beta}=1/(2isin{\beta})log\((1+ze^{i{\beta}})/(1+ze^{-i{\beta}})\)$, 0 < ${\beta}$ < ${\pi}$ and $H_a+G_a=z/(1-z)$, respectively. Kumar et al. [7] conjectured that if ${\omega}(z)=e^{i{\theta}}z^n({\theta}{\in}\mathbb{R},n{\in}\mathbb{N})$ and ${\omega}_a(z)=(a-z)/(1-az)$, $a{\in}(-1,1)$ are dilatations of $f_{\beta}$ and $F_a$, respectively, then $F_a\tilde{\ast}f_{\beta}{\in}S^0_H$ and is convex in the direction of the real axis, provided $a{\in}[(n-2)/(n+2),1)$. They claimed to have verified the result for n = 1, 2, 3 and 4 only. In the present paper, we settle the above conjecture, in the affirmative, for ${\beta}={\pi}/2$ and for all $n{\in}\mathbb{N}$.

Preliminary Analysis on Launch Opportunities for Sun-Earth Lagrange Points Mission from NARO Space Center

  • Song, Young-Joo;Lee, Donghun
    • Journal of Astronomy and Space Sciences
    • /
    • v.38 no.2
    • /
    • pp.145-155
    • /
    • 2021
  • In this work, preliminary launch opportunities from NARO Space Center to the Sun-Earth Lagrange point are analyzed. Among five different Sun-Earth Lagrange points, L1 and L2 points are selected as suitable candidates for, respectively, solar and astrophysics missions. With high fidelity dynamics models, the L1 and L2 point targeting problem is formulated regarding the location of NARO Space Center and relevant Target Interface Point (TIP) for each different launch date is derived including launch injection energy per unit mass (C3), Right ascension of the injection orbit Apoapsis Vector (RAV) and Declination of the injection orbit Apoapsis Vector (DAV). Potential launch periods to achieve L1 and L2 transfer trajectory are also investigated regarding coasting characteristics from NARO Space Center. The magnitude of the Lagrange Orbit Insertion (LOI) burn, as well as the Orbit Maintenance (OM) maneuver to maintain more than one year of mission orbit around the Lagrange points, is also derived as an example. Even the current work has been made under many assumptions as there are no specific mission goals currently defined yet, so results from the current work could be a good starting point to extend diversities of future Korean deep-space missions.