• Title/Summary/Keyword: Huge file system

Search Result 36, Processing Time 0.024 seconds

A Mobile Multimedia Contents Recommendation Technique Considering Users' Psychological Patterns and Situations (사용자의 심리와 상황을 고려한 맞춤형 모바일 멀티미디어 콘텐츠 추천 기법)

  • Park, Won-Ik;Shim, Woo-Je;Kim, Young-Kuk
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.2
    • /
    • pp.232-236
    • /
    • 2010
  • Nowadays, mobile users have a huge amount of multimedia contents and can use these contents anytime, anywhere by advance in computer and network techniques. However, users spend too much time for searching and managing these contents in web and local file system. Expecially, small and uncomfortable user interfaces of mobile devices make it difficult to search and manage multimedia contents. Therefore, an intelligent multimedia contents management technique is needed to use these contents more efficiently. In this paper, we propose a Personalized Mobile Multimedia Contents Provider (PMMCP) System which provides personalized multimedia contents based on users' psychological patterns and situations.

Historical Development of Russian Principle on Arrangement and Classification Archives : In Case of Russian State Historical Archive(RGIA) (러시아 기록물 분류체계의 발전 러시아국립역사기록보존소(RGIA)를 중심으로)

  • Bang, Il-Kwon
    • The Korean Journal of Archival Studies
    • /
    • no.7
    • /
    • pp.75-105
    • /
    • 2003
  • Russian State Historical Archive (Rossiiskii gosudarstvennyi istoricheskii arkhiv - RGIA) received its present name in June 1992, and before 1961 was known as TsGIA. RGIA holds the major records of high-level and central state and administrative institutions and agencies of tsarist Russia from the eighteenth century to 1910s (except the records of the Army, Navy, and the Ministry of Foreign Affairs), as well as fonds of social organizations, institutions, and individuals of prerevolutionary Russia. The main goal of this article is to assist understanding russian principle on arrangement and classification archives with its historical development focusing on one of the biggest historical archive in Russia. The primary set of historical records in RGIA remain arranged in 3-steps classification system: fond (collection) -- opis' (inventory) -- delo (file). In this general survey of RGIA author offers detailed information on the collection of archives and the system for classification of its huge amounts of primary sources in connection with influence upon historical studies. Despite the general economic crisis Russian archives are struggling to keep their doors open for public research and are exerting their energies in present electronic information to scholars and other researchers from throughout the world. The result, however, is not rewarded enough, considering the effort involved.

Development of Monte Carlo Simulation Code for the Dose Calculation of the Stereotactic Radiosurgery (뇌 정위 방사선수술의 선량 계산을 위한 몬테카를로 시뮬레이션 코드 개발)

  • Kang, Jeongku;Lee, Dong Joon
    • Progress in Medical Physics
    • /
    • v.23 no.4
    • /
    • pp.303-308
    • /
    • 2012
  • The Geant4 based Monte Carlo code for the application of stereotactic radiosurgery was developed. The probability density function and cumulative density function to determine the incident photon energy were calculated from pre-calculated energy spectrum for the linac by multiplying the weighting factors corresponding to the energy bins. The messenger class to transfer the various MLC fields generated by the planning system was used. The rotation matrix of rotateX and rotateY were used for simulating gantry and table rotation respectively. We construct accelerator world and phantom world in the main world coordinate to rotate accelerator and phantom world independently. We used dicomHandler class object to convert from the dicom binary file to the text file which contains the matrix number, pixel size, pixel's HU, bit size, padding value and high bits order. We reconstruct this class object to work fine. We also reconstruct the PrimaryGeneratorAction class to speed up the calculation time. because of the huge calculation time we discard search process of the ThitsMap and used direct access method from the first to the last element to produce the result files.

A Study of Document Format for Effective Transmission on the Internet Environments (인터넷환경하에서 효율적 전송을 위한 문서형식에 관한 연구)

  • Cho, Hyun-Yang;Choi, Hung-Sik
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.34 no.1
    • /
    • pp.229-242
    • /
    • 2000
  • Today, we are confronted with huge amount of data which contain complex documents, images and multimedia contents. Therefore a new method is needed to analyze and manage the mathematical expressions and extract new Information from them. It is more and more important to manage the document files including mathematical expressions which are generated by general-purpose word processors. Three major word processors are shared over 90% of domestic market. These are HWP, TeX and MS word. Due to the progress of Internet and digital library, it is necessary to develop a system to manage the document file containing mathematical expressions over the Web.

  • PDF

An Architecture and Experimentation for Efficient and Reliable Name Service Systems (효율적이고 신뢰성 있는 네임 서비스 시스템의 구조 및 실험)

  • 심영철;박준철;강호석;이준원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3B
    • /
    • pp.375-390
    • /
    • 2004
  • Domain Name System(DNS), one of the most important Internet services, handles mapping from host names to Internet addresses and vice versa, and precedes many Internet applications such as Web, e-mail, file transfer, etc. In this paper, we propose a structural design of a generic name server system providing name services for a huge domain for the purpose of improving the performance as well as the reliability of the system. We demonstrate the validity of the design by implementing and running a testbed system. Our testbed employs a couple of master name sowers for distributing the service overhead over two, rather than one, servers and for achieving high availability of the system as a whole. We suggest the use of dynamic update to add and delete records from a zone for which the name server has authority. The slave name servers located remotely then get a new, updated copy of the zone via incremental zone transfers(IXFRs). The experiments with the implemented testbed show that the proposed structure would easily manage increasing demands on the server power, and be highly available in the face of transient faults of a module in the system.

A Hybrid Mobile Business Card Production and Management System (하이브리드 모바일 명함제작 및 관리시스템)

  • Kim, Mok-Ryun;Park, Young-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.1
    • /
    • pp.117-128
    • /
    • 2008
  • Recently, as the increase in interaction between the person and the person, the people plentifully use the business card to exchange personal information. So, the people have many business cards. Thus, the people are liable to lose the business cards and finding a wanted business card is very difficult in the huge business cards in offline. And, the people think the business card is a way, which can express individuality. So, the people want to have the business card, which has individuality. Thus, this paper proposes the card system, which is satisfied to solve many problems of the card system in offline and express individuality. The proposed business card system can produce various business cards and puts contents such as video, photo, voice into business cards via mobile devices in anywhere, anytime. Also, this business card system follows the vCard format, which is a file format standard for personal data interchange. Finally, we provide with content-based business card retrieval using video and photo inserted into business cards. Thus, this paper proposes the hybrid business card system, which is satisfied to produce business cards expressed individuality and follows the vCard format.

  • PDF

The Design and Performance Analysis of an Effective OWL Storage System Based on the DBMS (데이터베이스 시스템에 기반한 효율적인 OWL 저장시스템 설계 및 성능분석)

  • Cha, Seong-Hwan;Kim, Seong-Sik;Kim, TaeYoung
    • The Journal of Korean Association of Computer Education
    • /
    • v.11 no.5
    • /
    • pp.77-88
    • /
    • 2008
  • Having observed the restriction of the current Web technology, the semantic Web has been developed, and it now has grown up with the core help of the W3C to a level where it recommends the OWL Web ontology language. Besides, in order to deduce the information out of OWL data, several inference systems have been developed such as Jena, Jess, and JTP. Unfortunately, however, quite few systems can effectively handle recently developed OWL data, and further, due to the limitation of file-based operation, the current inference systems cannot meet the requirements for handing huge OWL data. An efficient method for storing and searching ontology data is essential for ensuring stable information inference processes. In this study, firstly, we proposed a model based on the database management system to transform and store OWL data and to enable deduction process from the database. Secondly, we designed and implemented an effective OWL storing system based on our model. Finally, we compare our system with the previous inference systems through experimental performance analysis.

  • PDF

A Lossless Vector Data Compression Using the Hybrid Approach of BytePacking and Lempel-Ziv in Embedded DBMS (임베디드 DBMS에서 바이트패킹과 Lempel-Ziv 방법을 혼합한 무손실 벡터 데이터 압축 기법)

  • Moon, Gyeong-Gi;Joo, Yong-Jin;Park, Soo-Hong
    • Spatial Information Research
    • /
    • v.19 no.1
    • /
    • pp.107-116
    • /
    • 2011
  • Due to development of environment of wireless Internet, location based services on the basis of spatial data have been increased such as real time traffic information as well as CNS(Car Navigation System) to provide mobile user with route guidance to the destination. However, the current application adopting the file-based system has limitation of managing and storing the huge amount of spatial data. In order to supplement this challenge, research which is capable of managing large amounts of spatial data based on embedded database system is surely demanded. For this reason, this study aims to suggest the lossless compression technique by using the hybrid approach of BytePacking and Lempel-Ziv which can be applicable in DBMS so as to save a mass spatial data efficiently. We apply the proposed compression technique to actual the Seoul and Inchcon metropolitan area and compared the existing method with suggested one using the same data through analyzing the query processing duration until the reconstruction. As a result of comparison, we have come to the conclusion that suggested technique is far more performance on spatial data demanding high location accuracy than the previous techniques.

A Centroid-based Image Retrieval Scheme Using Centroid Situation Vector (Centroid 위치벡터를 이용한 영상 검색 기법)

  • 방상배;남재열;최재각
    • Journal of Broadcast Engineering
    • /
    • v.7 no.2
    • /
    • pp.126-135
    • /
    • 2002
  • An image contains various features such as color, shape, texture and location information. When only one of those features is used to retrieve an image, it is difficult to acquire satisfactory retrieval efficiency. Especially, in the database with huge capacity, such phenomenon happens frequently. Therefore, by using moi·e features, efficiency of the contents-based image retrieval (CBIR) system can be improved. This paper proposes a technique to consider location information about specific color as well as color information in image using centroid situation vector. Centroid situation vectors are calculated for specific color of the query image. Then, location similarity is determined through comparing distances between extracted centroid situation vectors of query image and target image in the database. Simulation results show that the proposed method is robust in zoom-in or zoom-out processed images and improves discrimination ability in fliped or rotated images. In addition, the suggested method reduced computational complexity by overlapping information extraction, and that improved the retrieval speed using an efficient index file.

Interoperability between NoSQL and RDBMS via Auto-mapping Scheme in Distributed Parallel Processing Environment (분산병렬처리 환경에서 오토매핑 기법을 통한 NoSQL과 RDBMS와의 연동)

  • Kim, Hee Sung;Lee, Bong Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.11
    • /
    • pp.2067-2075
    • /
    • 2017
  • Lately big data processing is considered as an emerging issue. As a huge amount of data is generated, data processing capability is getting important. In processing big data, both Hadoop distributed file system and unstructured date processing-based NoSQL data store are getting a lot of attention. However, there still exists problems and inconvenience to use NoSQL. In case of low volume data, MapReduce of NoSQL normally consumes unnecessary processing time and requires relatively much more data retrieval time than RDBMS. In order to address the NoSQL problem, in this paper, an interworking scheme between NoSQL and the conventional RDBMS is proposed. The developed auto-mapping scheme enables to choose an appropriate database (NoSQL or RDBMS) depending on the amount of data, which results in fast search time. The experimental results for a specific data set shows that the database interworking scheme reduces data searching time by 35% at the maximum.