• Title/Summary/Keyword: Access Patterns

Search Result 418, Processing Time 0.024 seconds

A Study on the Web Service-Hacking Pattern Recognition System (웹서비스-해킹패턴 인지시스템에 관한 연구)

  • Lim, Chae-Gyun;Ahn, Da-Seon;Kim, Kyu-Ho;Lee, Ki-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.109-114
    • /
    • 2009
  • Recently, web 2.0 is becoming issue can provide a web based services and the technology is developing rapidly. In addition a variety of platforms on the web and SDK(Software Development Kit) is available from various aspects, web services, a trend that is rapidly growing user. But the development of security systems cannot follow the speed and These weaknesses are provided in the Web service by using illegal methods of information acquisition. Therefore, in this paper, we analyzed information for checking a variety of illegal access on Web services. Also, we designed and implemented Web Service-Hacking Pattern Recognition System for which warns the dangerous fact that as recognized hacking through comparisons the hacking patterns which have classified from the hacking method of existing system.

  • PDF

Distributed Coordination Protocol for Ad Hoc Cognitive Radio Networks

  • Kim, Mi-Ryeong;Yoo, Sang-Jo
    • Journal of Communications and Networks
    • /
    • v.14 no.1
    • /
    • pp.51-62
    • /
    • 2012
  • The exponential growth in wireless services has resulted in an overly crowded spectrum. The current state of spectrum allocation indicates that most usable frequencies have already been occupied. This makes one pessimistic about the feasibility of integrating emerging wireless services such as large-scale sensor networks into the existing communication infrastructure. Cognitive radio is an emerging dynamic spectrum access technology that can be used for flexibly and efficiently achieving open spectrum sharing. Cognitive radio is an intelligent wireless communication system that is aware of its radio environment and that is capable of adapting its operation to statistical variations of the radio frequency. In ad hoc cognitive radio networks, a common control channel (CCC) is usually used for supporting transmission coordination and spectrum-related information exchange. Determining a CCC in distributed networks is a challenging research issue because the spectrum availability at each ad hoc node is quite different and dynamic due to the interference between and coexistence of primary users. In this paper, we propose a novel CCC selection protocol that is implemented in a distributed way according to the appearance patterns of primary systems and connectivity among nodes. The proposed protocol minimizes the possibility of CCC disruption by primary user activities and maximizes node connectivity when the control channel is set up. It also facilitates adaptive recovery of the control channel when the primary user is detected on that channel.

Dynamic ATC Computation for Real-Time Power Markets

  • Venkaiah, Ch.;Kumar, D.M. Vinod;Murali, K.
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.2
    • /
    • pp.209-219
    • /
    • 2010
  • In this paper, a novel dynamic available transfer capability (DATC) has been computed for real time applications using three different intelligent techniques viz. i) back propagation algorithm (BPA), ii) radial basis function (RBF), and iii) adaptive neuro fuzzy inference system (ANFIS) for the first time. The conventional method of DATC is tedious and time consuming. DATC is concerned with calculating the maximum increase in point to point transfer such that the transient response remains stable and viable. The ATC information is to be continuously updated in real time and made available to market participants through an internet based Open Access Same time Information System (OASIS). The independent system operator (ISO) evaluates the transaction in real time on the basis of DATC information. The dynamic contingency screening method [1] has been utilized and critical contingencies are selected for the computation of DATC using the energy function based potential energy boundary surface (PEBS) method. The PEBS based DATC has been utilized to generate patterns for the intelligent techniques. The three different intelligent methods are tested on New England 68-bus 16 machine and 39-bus 10 machine systems and results are compared with the conventional PEBS method.

HA-PVFS : A PVFS File System supporting High Data Availability Adaptive to Temporal Locality (HA-PVFS : 시간적 지역성에 적응적인 데이터 고가용성을 지원하는 PVFS 파일 시스템)

  • Sim Sang-Man;Han Sae-Young;Park Sung-Yong
    • The KIPS Transactions:PartA
    • /
    • v.13A no.3 s.100
    • /
    • pp.241-252
    • /
    • 2006
  • In cluster file systems, the availability of files has been supported by replicating entire files or generating parities on parity servers. However, those methods require very large temporal and spatial cost, and cannot handle massive failures situation on the file system. So we propose HA-PVFS, a cluster file system supporting high data availability adaptive to temporal locality. HA-PVFS restricts replication or parity generation to some important files, for that it employs an efficient algorithm to estimate file access patterns from limited information. Moreover, in order to minimize the performance degradation of the file system, it uses delayed update method and relay replication.

RAH-tree : A Efficient Index Scheme for Spatial Data with Skewed Access Patterns (RAH-tree : 편향 접근 패턴을 갖는 공간 데이터에 대한 효율적인 색인 기법)

  • Choi Keun-Ha;Lee Seung-Joong;Jung Sungwon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.31-33
    • /
    • 2005
  • GPS및 PDA의 발달로 인해서 위치 기반 서비스(LBS), 차량항법장치(CNS), 지리정보시스템(GIS)등 공간 데이터를 다루는 응용프로그램들이 급속하게 보급되었다. 이러한 응용프로그램은 높이 균등 색인 기법을 사용하여 원하는 데이터에 대한 색인을 제공하였다. 그러나 모든 공간 객체는 서로 상이한 접근 빈도를 가지고 있음에도 불구하고 기존의 공간색인 기법은 접근 빈도를 고려하지 못하는 단점을 가지고 있었다. 또한 기존의 빈도수만을 고려한 공간 객체의 색인 방법은 접근 빈도에 따른 편향성(skewed)은 제공하지만 공간 객체에 대한 지역성을 반영하지 못한다. 본 논문에서는 밀집되어 있는 공간 객체의 접근 빈도를 반영해서 편향된 색인 트리를 생성하는 기법을 제안한다. 이형 클러스터링으로 분포되어 있는 전체 영역에 대해서 Zahn의 클러스터링 알고리즘을 변형시켜서 다단계 세부영역을 구분한다. 이렇게 구간된 세부영역에 대해서 거리적 인접성과 접근 빈도수의 합을 이용해서 색인 트리를 생성한다. 다단계로 구성된 전체영역에 대해서 하향식 방식으로 편향된 색인 트리를 생성함으로써, 접근 빈도가 높은 공간 객체에 대해서 빠른 탐색이 가능하게 한다.

  • PDF

Insulation Ageing Diagnosis Using HFPD Pattern Analysis (HFPD 패턴분석을 이용한 절연열화 진단)

  • Kim, Deok-Keun;Yeo, In-Sun;Lim, Jang-Seob;Lee, Jin
    • Proceedings of the KIEE Conference
    • /
    • 2003.07c
    • /
    • pp.1726-1728
    • /
    • 2003
  • The aging diagnosis method using partial discharge measurement detects discharge signals that critical cause of failure in insulation material operated a long time and can diagnose aging state of insulation materials with an aging analysis algorithm. The HFPD measurement method is a technique to analyze aging state of high voltage insulation materials and detect higher frequency signals than conventional PD measurement method therefore it takes less noise effect and could execute active line measurement. It is possible to analyze main discharge phenomena and obtain access to aging progress occurred in insulation materials through accumulation of HFPD signals during determined interval and expression of fractal dimension using statistical process of accumulated signals. The HFPD signals that occurred in each applied voltages are measured during 180 cycles and accumulated to the same phase of one cycle. These patterns that made by previous method are normalized with logarithm function and than inputted to neural networks. The aging diagnosis of insulation material was possible and the recognition ratio of neural network appeared very high.

  • PDF

An Efficient Buffer Management Technique Using Spatial and Temporal Locality (공간 시간 근접성을 이용한 효율적인 버퍼 관리 기법)

  • Min, Jun-Ki
    • The KIPS Transactions:PartD
    • /
    • v.16D no.2
    • /
    • pp.153-160
    • /
    • 2009
  • Efficient buffer management is closely related to system performance. Thus, much research has been performed on various buffer management techniques. However, many of the proposed techniques utilize the temporal locality of access patterns. In spatial database environments, there exists not only the temporal locality but also spatial locality, where the objects in the recently accessed regions will be accessed again in the near future. Thus, in this paper, we present a buffer management technique, called BEAT, which utilizes both the temporal locality and spatial locality in spatial database environments. The experimental results with real-life and synthetic data demonstrate the efficiency of BEAT.

Ferroelectric characteristics of PZT capacitors fabricated by using chemical mechanical polishing process with change of process parameters (화학적기계적연마 공정으로 제조한 PZT 캐패시터의 공정 조건에 따른 강유전 특성 연구)

  • Jun, Young-Kil;Jung, Pan-Gum;Ko, Pil-Ju;Kim, Nam-Hoon;Lee, Woo-Sun
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2007.11a
    • /
    • pp.66-66
    • /
    • 2007
  • Lead zirconate titanate (PZT) is one of the most attractive perovskite-type materials for ferroelectric random access memory (FRAM) due to its higher remanant polarization and the ability to withstand higher coercive fields. We first applied the damascene process using chemical mechanical polishing (CMP) to fabricate the PZT thin film capacitor to solve the problems of plasma etching including low etching profile and ion charging. The $0.8{\times}0.8\;{\mu}m$ square patterns of silicon dioxide on Pt/Ti/$SiO_2$/Si substrate were coated by sol-gel method with the precursor solution of PZT. Damascene process by CMP was performed to pattern the PZT thin film with the vertical sidewall and no plasma damage. The polarization-voltage (P-V) characteristics of PZT capacitors and the current-voltage characteristics (I-V) were examined by change of process parameters. To examine the CMP induced damage to PZT capacitor, the domain structure of the polished PZT thin film was also investigated by piezoresponse force microscopy (PFM).

  • PDF

Performance Analysis of Parity Cache enabled RAID Level 5 for DDR Memory Storage Device (패리티 캐시를 이용한 DDR 메모리 저장 장치용 RAID 레벨 5의 성능 분석)

  • Gu, Bon-Gen;Kwak, Yun-Sik;Cheong, Seung-Kook;Hwang, Jung-Yeon
    • Journal of Advanced Navigation Technology
    • /
    • v.14 no.6
    • /
    • pp.916-927
    • /
    • 2010
  • In this paper, we analyze the performance of the parity cache enabled RAID level-5 via the simulation. This RAID system consists of the DDR memory-based storage devices. To do this, we develop the simulation model and suggest the basic performance analysis data which we want to get via the simulation. And we implement the simulator based on the simulation model and execute the simulator. From the result of the simulation, we expect that the parity cache enabled RAID level-5 configured by the DDR memory based storage devices has the positive effectiveness to the enhancing of the storage system performance if the storage access patterns of applications are tuned.

Fine Granule View Materialization in Data Cubes (데이타 큐브에서 세분화된 뷰 실체화 기법)

  • Kim, Min-Jeong;Jeong, Yeon-Dong;Park, Ung-Je;Kim, Myeong-Ho
    • Journal of KIISE:Databases
    • /
    • v.28 no.4
    • /
    • pp.587-595
    • /
    • 2001
  • Precomputation and materialization of parts. commonly called views of a data cube is a common technique in data warehouses The view is defined as the result of a query which is defined through aggregate functions In this paper we introduce the concept of fine granule view. The fine granule view is the result of a query defined through aggregate functions and the range on each dimension, where the subdivision of each dimension is based on queries access patterns. For the representation and selection of fine granule views to materialize, we define the ANO-OR cube graph and AND-OR minimum cost graph. With these structures, we propose a fine granule view materialization method. And through experiments, we evaluate the performance of the proposed method.

  • PDF