• Title/Summary/Keyword: Dynamic access time

Search Result 281, Processing Time 0.025 seconds

Design and Implementation of Web Mail Integration System Using XML (XML을 이용한 웹 메일 통합 시스템의 설계 및 구현)

  • Kwon Jung-Sik;Cho Dae-Jea
    • The Journal of the Korea Contents Association
    • /
    • v.4 no.4
    • /
    • pp.89-97
    • /
    • 2004
  • Web-Mail Services are implemented with SMTP and POP3 in these days. These web mail services provide not only the basic sending and receiving functions but also additional functions for user. However, the sent and received data are stored in the web mail server. So general web mail users can't process their mail data if they have not access ID for the web mail server. In this paper, we design and implement WMIS (Web Mail Integration System) using XML. In the proposed system, mail data and user's environments in the old web mail system are transformed into XML documents and inserted into database. In order to store XML data into database, we use dynamic document processing method and analyze XML file by record unit. When the users change their mail accounts, they easily can establish the web environments and their mail data. Because the transformed XML document is converted into WML easily, the WMIS can reduce development cost, labors and time.

  • PDF

Design of Web Robot Engine Using Distributed Collection Model Processing (분산수집 모델을 이용한 웹 로봇의 설계 및 구현)

  • Kim, Dae-Yu;Kim, Jung-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.1
    • /
    • pp.115-121
    • /
    • 2010
  • As internet becomes widespread, a lot of information is opened to public and users of Internet can access effectively information using web searching service. To construct web searching service, the web searching method for collecting of information is needed to obtain web page view. As a number of web page view increases, it is necessary to collect information of high quality information to be searched, therefore, a variety of web engine for searching mechanism is developed. Method of link extraction with javascript in dynamic web page and design of web searching robot are presented m this paper. To evaluate performance analyzes, we fixed one searching model with the proposed method. The searching time takes 2 minute 67 sec for 299 web pages and 12.33 sec for 10 searching model.

A Study for the Screen Door Motor System Driving Stiffness of Dynamic Load Condition (스크린 도어 모터 시스템의 동하중 상태 구동강성 검증)

  • Lee, Jung-Hyun;Lee, Seon-Bong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.2
    • /
    • pp.164-170
    • /
    • 2016
  • The initial urban railway was only required to perform its role as means of transportation. As the time of staying in an underground platform was extended, it has been faced with the issues of environmental improvement as a living space. Therefore, the sliding automatic door, which is the basis of the screen door, is used widely for large distribution stores, hospitals, restaurants, and public offices for customers' convenience and as a convenient method to control access. Therefore, screen doors are required for the purpose of customers' convenience, securing safety, establishing pleasant station buildings, and energy savings. It would be also necessary to develop the optimal design technology for a screen door system through the design of element parts and to ensure reliability. Therefore, this paper calculated, interpreted, and verified the theoretical weight of the composition parts to verify the design drive hardness of the motor for screen doors necessary for the safety of subways.

Metadata Management Method for Consistency and Recency in Digital Library (디지탈 도서관 환경에서 일관성과 최근성을 고려한 메타데이타 관리 방법)

  • Lee, Hai-Min;Park, Seog
    • Journal of KIISE:Databases
    • /
    • v.27 no.1
    • /
    • pp.22-32
    • /
    • 2000
  • The Digital Library is the integrated system of Information Retrieval System(IRS) and Database Management system(DBMS). In the Digital Library environment where dynamic query and update processes are required, however, the existing transaction management methods cause the following problems. First, since the traditional consistency criteria is too restrictive, it causes increment of query processing time and cannot guarantee the reflection of recency. Second, query result could be unreliable because the consistency criteria between source data and metadata is not defined. This paper models the access to metadata based on Dublin Core as query transactions and update transactions, and gives the efficient method to manage them. Particularly, this paper describes the consistency criteria of metadata which takes it Into consideration the consistency between the result of query transaction and status of source data in the Digital Library, that is different from the consistency criteria in traditional transaction management. It also presents analysis of the view point of query transaction to reflect recency and proposes metadata management to guarantee recency within metadata consistency.

  • PDF

An Agent System for Efficient VOD Services on Web (효율적 웹 기반 VOD 서비스를 위한 에이전트 시스템)

  • Lee Kyung-Hee;Han Jeong-Hye;Kim Dong-Ho
    • Journal of Digital Contents Society
    • /
    • v.2 no.1
    • /
    • pp.73-79
    • /
    • 2001
  • Most of the existing algorithms try to disseminate the multimedia contents of internet service provider(ISP), without taking into account the needs and characteristics of specific websites including e-learning systems with web-based .educational contents. Sometimes the client must select the best one among the replicated repositories. However, this is a less reliable approach because clients' selections are made without prior information on server load capacity. In this paper we propose an agent system inspired by the need of improving QoS of delivering web-based educational multimedia contents without incurring long access delays. This agent system consists of three components, Analyzer, Knowledge Base, and Automaton embedded the capacity algorithm. It analyzes and investigates traffic information collected from individual replicated server by learners' requests, and selects a server which is available and is expected to provide the fastest latency time and the lowest loaded capacity, and achieves high performance by dynamic replicating web resources among multiple repositories.

  • PDF

$(Ba, Sr)TiO_3$박막의 전기적 성질과 전도기구 해석

  • 정용국;손병근;이창효
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2000.02a
    • /
    • pp.69-69
    • /
    • 2000
  • (Ba, Sr)TiO3 (BST)[1-3] 박막은 유전상수가 크고 고주파에서도 유전특성 저하가 적기 때문에 ULSI DRAM(Dynamic Random Access Memory)에 응용 가능한 물질로 최근 각광을 받고 있다. 하지만, 아직 BST 박막을 DRSM에 바로 적용하기 위해선 몇 가지 문제점이 있다. 그 중 누설전류 문제는 디바이스 응용시 매우 중요한 요소이다. 특히, DRAM에서 refresh time와 직접적인 관련이 있어 디바이스 내의 신뢰도 및 전력소모를 결정하는 주된 인자가 된다. 지금까지, BST 박막의 인가전업, 온도, 그리고 전극물질에 따른 누설전류 현상들이 고찰되었고, 이에 관한 많은 전도기구 모델들이 제시되었다. Schottky emission, Poole-Frenkel emission, space charge limited conduction 등이 그 대표적인 예이다. 하지만 아쉽게도 BST 박막의 정확한 누설 전류 전도 기구를 완전히 설명하는데는 아직 한계가 있다. 따라서 본 연구에서는 제작된 BST 커패시터 내의 기본적인 전기적 성질을 조사하고, 정확한 누설전류 기구 규명에 초점을 두고자 한다. 이를 위해 기존의 여러 기구들과 비교 분석할 것이다. 하부전극으로 사용하기 위해 스퍼터링 방법으로 p-Si(100) 기판위에 RuO2 박막을 약 120nm 증착하였다. 증착전의 chamberso의 초기압력은 5$\times$10-6 Torr이하의 압력으로 유지시켰다. Ar/O2의 비는 이전 실험에서 최적화된 9/1로 하였다. BST 박막 증착 시 5분간 pre-sputtering을 실시한 후 하부전극 기판위에 BST 박막을 증착하였다. 증착이 끝난 후 시편을 상온까지 냉각시킨 후 꺼내었다. 전기적 특성을 측정하기 상부전극으로 RuO2와 Al 박막을 각각 상온에서 100nm 증착하였다. 이때 hole mask를 이용하여 반경이 140um인 원형의 상부전극을 증착하였다. BST 박막의 증착온도가 증가하고 Ar/O2 비가 감소할수록 제작된 BST-커패시터의 전기적 성질이 우수하였다. 증착온도 $600^{\circ}C$, ASr/O2=5/5에서 증착된 막의 누설전류는 4.56$\times$10-8 A/cm2, 유전상수는 600 정도의 값을 나타내었다. 인가전압에 따른 BST 커패시터의 transition-current는 Curie-von Schweider 모델을 따랐다. BST 박막의 누설전류 전도기구는 기존의 Schottky 모델이 아니라 modified-Schottky 무델로 잘 설명되었다. Modified-Schottky 모델을 통해 BST 박막의 광학적 유전율 $\varepsilon$$\infty$=4.9, 이동도 $\mu$=0.019 cm2/V-s, 장벽 높이 $\psi$b=0.79 eV를 구하였다.

  • PDF

A Study on Dynamic Code Analysis Method using 2nd Generation PT(Processor Trace) (2세대 PT(Processor Trace)를 이용한 동적 코드분석 방법 연구)

  • Kim, Hyuncheol
    • Convergence Security Journal
    • /
    • v.19 no.1
    • /
    • pp.97-101
    • /
    • 2019
  • If the operating system's core file contains an Intel PT, the debugger can not only check the program state at the time of the crash, but can also reconfigure the control flow that caused the crash. We can also extend the execution trace scope to the entire system to debug kernel panics and other system hangs. The second-generation PT, the WinIPT library, includes an Intel PT driver with additional code to run process and core-specific traces through the IOCTL and registry mechanisms provided by Windows 10 (RS5). In other words, the PT trace information, which was limited access only by the first generation PT, can be executed by process and core by the IOCTL and registry mechanism provided by the operating system in the second generation PT. In this paper, we compare and describe methods for collecting, storing, decoding and detecting malicious codes of data packets in a window environment using 1/2 generation PT.

An efficient privacy-preserving data sharing scheme in social network (소셜 네트워크에 적합한 효율적인 프라이버시 보호 데이터 공유 기법)

  • Jeon, Doo-Hyun;Chun, Ji-Young;Jeong, Ik-Rae
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.3
    • /
    • pp.447-461
    • /
    • 2012
  • A social network service(SNS) is gaining popularity as a new real-time information sharing mechanism. However, the user's privacy infringement is occurred frequently because the information that is shared through a social network include the private information such as user's identity or lifestyle patterns. To resolve this problem, the research about privacy preserving data sharing in social network are being proceed actively. In this paper, we proposed the efficient scheme for privacy preserving data sharing in social network. The proposed scheme provides an efficient conjunctive keyword search functionality. And, users who granted access right to storage server can store and search data in storage server. Also,, our scheme provide join/revocation functionality suited to the characteristics of a dynamic social network.

A Low-Cost RFID Tag Search Protocol Preventing the Reuse of Mobile Reader's Tag-List (모바일 리더의 태그 리스트 재사용을 방지하는 저비용 RFID 태그 검색 프로토콜)

  • Yeo, Don-Gu;Lee, Sang-Rae;Choi, Hyun-Woo;Jang, Jae-Hoon;Youm, Heung-Youl
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.1
    • /
    • pp.143-151
    • /
    • 2011
  • When a real-time data transfer is not possible between a reader and a back-end server in the mobile environment, the reader should support a capability to search a certain tag without communicating with a back-end server. Some recent papers related to the mobile reader-based tag search protocol have addressed privacy concerns for the reader and the tags. However, to our best knowledge, there are no papers addressing the problem arising from reusing tag lists existed in the mobile reader. In other words, there arise a problem that a mobile reader which has lost an right to access to a specific tag is able to search that tag by reusing a tag list for searching a particular tag. If mobile reader having an unauthorized tag list, the mobile reader can reuse a particular tag list. Our protocol provides the enhanced secure tag lists preventing the reuse of the tag lists and an efficient tag search protocol based on dynamic identity in the mobile reader-based RFID environments.

Machine Learning-based Optimal VNF Deployment Prediction (기계학습 기반 VNF 최적 배치 예측 기술연구)

  • Park, Suhyun;Kim, Hee-Gon;Hong, Jibum;Yoo, Jae-Hyung;Hong, James Won-Ki
    • KNOM Review
    • /
    • v.23 no.1
    • /
    • pp.34-42
    • /
    • 2020
  • Network Function Virtualization (NFV) environment can deal with dynamic changes in traffic status with appropriate deployment and scaling of Virtualized Network Function (VNF). However, determining and applying the optimal VNF deployment is a complicated and difficult task. In particular, it is necessary to predict the situation at a future point because it takes for the process to be applied and the deployment decision to the actual NFV environment. In this paper, we randomly generate service requests in Multiaccess Edge Computing (MEC) topology, then obtain training data for machine learning model from an Integer Linear Programming (ILP) solution. We use the simulation data to train the machine learning model which predicts the optimal VNF deployment in a predefined future point. The prediction model shows the accuracy over 90% compared to the ILP solution in a 5-minute future time point.