• Title/Summary/Keyword: Slicing data

Search Result 78, Processing Time 0.03 seconds

Fire Severity Mapping Using a Single Post-Fire Landsat 7 ETM+ Imagery (단일 시기의 Landsat 7 ETM+ 영상을 이용한 산불피해지도 작성)

  • 원강영;임정호
    • Korean Journal of Remote Sensing
    • /
    • v.17 no.1
    • /
    • pp.85-97
    • /
    • 2001
  • The KT(Kauth-Thomas) and IHS(Intensity-Hue-Saturation) transformation techniques were introduced and compared to investigate fire-scarred areas with single post-fire Landsat 7 ETM+ image. This study consists of two parts. First, using only geometrically corrected imagery, it was examined whether or not the different level of fire-damaged areas could be detected by simple slicing method within the image enhanced by the IHS transform. As a result, since the spectral distribution of each class on each IHS component was overlaid, the simple slicing method did not seem appropriate for the delineation of the areas of the different level of fire severity. Second, the image rectified by both radiometrically and topographically was enhanced by the KT transformation and the IHS transformation, respectively. Then, the images were classified by the maximum likelihood method. The cross-validation was performed for the compensation of relatively small set of ground truth data. The results showed that KT transformation produced better accuracy than IHS transformation. In addition, the KT feature spaces and the spectral distribution of IHS components were analyzed on the graph. This study has shown that, as for the detection of the different level of fire severity, the KT transformation reflects the ground physical conditions better than the IHS transformation.

Calculation of Rotation Angle of the Linear Hotwire Cutting System for VLM-s (VLM-S용 선형열선절단기의 회전각 계산)

  • Lee, Sang-Ho;An, Dong-Gyu;Yang, Dong-Yeol;Dong Yol
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.19 no.2
    • /
    • pp.87-94
    • /
    • 2002
  • Most of Rapid Prototyping (RP) process adopt a solid Computer Aided Design (CAD) model, slicing into thin layers of uniform, but not necessarily constant, thickness in the building direction. Each cross-sectional layer is successive1y deposited and at the same time, bonded onto the previous layers; the stacked layers form a physical part of the model. The objective of this study is to develop a method for calculating the rotation angle ($$\theta$_x, $\theta$_y$) of hotwire of the cutting system in the three-dimensional space for the Variable Lamination Manufacturing process using expandable polystyrene foam sheet (VLM-S). In order to examine the applicability of the developed method to VLM-S, various three-dimensional shapes. such as a screw, an extruded cross, and free surface bodies such as miniatures of the monkey(a figure of Sonokong), were made using the data obtained form the method.

Optimal Implementation of Lightweight Block Cipher PIPO on CUDA GPGPU (CUDA GPGPU 상에서 경량 블록 암호 PIPO의 최적 구현)

  • Kim, Hyun-Jun;Eum, Si-Woo;Seo, Hwa-Jeong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.32 no.6
    • /
    • pp.1035-1043
    • /
    • 2022
  • With the spread of the Internet of Things (IoT), cloud computing, and big data, the need for high-speed encryption for applications is emerging. GPU optimization can be used to validate cryptographic analysis results or reduced versions theoretically obtained by the GPU in a reasonable time. In this paper, PIPO lightweight encryption implemented in various environments was implemented on GPU. Optimally implemented considering the brute force attack on PIPO. In particular, the optimization implementation applying the bit slicing technique and the GPU elements were used as much as possible. As a result, the implementation of the proposed method showed a throughput of about 19.5 billion per second in the RTX 3060 environment, achieving a throughput of about 122 times higher than that of the previous study.

An Efficient ROLAP Cube Generation Scheme (효율적인 ROLAP 큐브 생성 방법)

  • Kim, Myung;Song, Ji-Sook
    • Journal of KIISE:Databases
    • /
    • v.29 no.2
    • /
    • pp.99-109
    • /
    • 2002
  • ROLAP(Relational Online Analytical Processing) is a process and methodology for a multidimensional data analysis that is essential to extract desired data and to derive value-added information from an enterprise data warehouse. In order to speed up query processing, most ROLAP systems pre-compute summary tables. This process is called 'cube generation' and it mostly involves intensive table sorting stages. (1) showed that it is much faster to generate ROLAP summary tables indirectly using a MOLAP(multidimensional OLAP) cube generation algorithm. In this paper, we present such an indirect ROLAP cube generation algorithm that is fast and scalable. High memory utilization is achieved by slicing the input fact table along one or more dimensions before generating summary tables. High speed is achieved by producing summary tables from their smallest parents. We showed the efficiency of our algorithm through experiments.

Dynamic Resource Reservation for Ultra-low Latency IoT Air-Interface Slice

  • Sun, Guolin;Wang, Guohui;Addo, Prince Clement;Liu, Guisong;Jiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3309-3328
    • /
    • 2017
  • The application of Internet of Things (IoT) in the next generation cellular networks imposes a new characteristic on the data traffic, where a massive number of small packets need to be transmitted. In addition, some emerging IoT-based emergency services require a real-time data delivery within a few milliseconds, referring to as ultra-low latency transmission. However, current techniques cannot provide such a low latency in combination with a mice-flow traffic. In this paper, we propose a dynamic resource reservation schema based on an air-interface slicing scheme in the context of a massive number of sensors with emergency flows. The proposed schema can achieve an air-interface latency of a few milliseconds by means of allowing emergency flows to be transported through a dedicated radio connection with guaranteed network resources. In order to schedule the delay-sensitive flows immediately, dynamic resource updating, silence-probability based collision avoidance, and window-based re-transmission are introduced to combine with the frame-slotted Aloha protocol. To evaluate performance of the proposed schema, a probabilistic model is provided to derive the analytical results, which are compared with the numerical results from Monte-Carlo simulations.

Network Slice Selection Function on M-CORD (M-CORD 기반의 네트워크 슬라이스 선택 기능)

  • Rivera, Javier Diaz;Khan, Talha Ahmed;Asif, Mehmood;Song, Wang-Cheol
    • KNOM Review
    • /
    • v.21 no.2
    • /
    • pp.35-45
    • /
    • 2018
  • As Network Slicing functionality gets applied to mobile networking, a mechanism that enables the selection of network slices becomes indispensable. Following the 3GPP Technical Specification for the 5G Architecture, the inclusion of the Network Slice Selection Function (NSSF) in order to leverage the process of slice selection is apparent. However, actual implementation of this network function needs to deal with the dynamic changes of network instances, due to this, a platform that supports the orchestration of Virtual Network Functions (VNF) is required. Our proposed solution include the use of the Central Office Rearchitected as a Data Center (CORD) platform, with the specified profile for mobile networks (M-CORD) that integrates a service orchestrator (XOS) alongside solutions oriented to Software Defined Networking (SDN), Network Function Virtualization (VNF) and virtual machine management through OpenStack, in order to provide the right ecosystem where our implementation of NSSF can obtain slice information dynamically by relying on synchronization between back-end services and network function instances.

Big Data Based Dynamic Flow Aggregation over 5G Network Slicing

  • Sun, Guolin;Mareri, Bruce;Liu, Guisong;Fang, Xiufen;Jiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4717-4737
    • /
    • 2017
  • Today, smart grids, smart homes, smart water networks, and intelligent transportation, are infrastructure systems that connect our world more than we ever thought possible and are associated with a single concept, the Internet of Things (IoT). The number of devices connected to the IoT and hence the number of traffic flow increases continuously, as well as the emergence of new applications. Although cutting-edge hardware technology can be employed to achieve a fast implementation to handle this huge data streams, there will always be a limit on size of traffic supported by a given architecture. However, recent cloud-based big data technologies fortunately offer an ideal environment to handle this issue. Moreover, the ever-increasing high volume of traffic created on demand presents great challenges for flow management. As a solution, flow aggregation decreases the number of flows needed to be processed by the network. The previous works in the literature prove that most of aggregation strategies designed for smart grids aim at optimizing system operation performance. They consider a common identifier to aggregate traffic on each device, having its independent static aggregation policy. In this paper, we propose a dynamic approach to aggregate flows based on traffic characteristics and device preferences. Our algorithm runs on a big data platform to provide an end-to-end network visibility of flows, which performs high-speed and high-volume computations to identify the clusters of similar flows and aggregate massive number of mice flows into a few meta-flows. Compared with existing solutions, our approach dynamically aggregates large number of such small flows into fewer flows, based on traffic characteristics and access node preferences. Using this approach, we alleviate the problem of processing a large amount of micro flows, and also significantly improve the accuracy of meeting the access node QoS demands. We conducted experiments, using a dataset of up to 100,000 flows, and studied the performance of our algorithm analytically. The experimental results are presented to show the promising effectiveness and scalability of our proposed approach.

Mechanical Properties Prediction by Geometric Modeling of Plain Weave Composites (평직 복합재료의 기하학적 모델링을 통한 기계적 물성 예측)

  • Kim, Myung-jun;Park, Jung-Sun
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.44 no.11
    • /
    • pp.941-948
    • /
    • 2016
  • Textile composite materials have been widely applied in aerospace structures due to their various advantages such as high specific stiffnesses and strengths, better out-of-plane performances, impact and delamination resistances, and net shape fabrications. In this paper, a modified geometric model of repeating unit cell (RUC) is suggested based on the Naik's model for 2D plain weave textile composites. The RUC geometry is defined by various parameters. The proposed model considers another parameter which is a gap length between adjacent yarns. The effective stiffnesses are predicted by using the yarn slicing technique and stress averaging technique based on iso-strain assumption. And the stiffnesses of RUC are evaluated by adjusting the gap ratio and verified by comparing with Naik's model and experimental data for 2D plain weave composite specimens.

A Method to Construct Control Flow Graphs for Java Programs by Decoupling Exception Flow Analysis from Normal Flow Analysis (예외 흐름 분석을 정상 흐름 분석과 분리하여 Java프로그램에 대한 제어 흐름 그래프를 생성하는 방법)

  • 조장우;창병모
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.5
    • /
    • pp.643-650
    • /
    • 2004
  • Control flow graph is used for Performing many Program-analysis techniques, such as data-flow and control-dependence analysis, and software-engineering techniques, such as program slicing and testings. For these analyses to be safe and useful, the CFG should incorporate the exception flows that are induced by exceptions. In previous research to construct control flow graph, normal flows and exception flows are computed at the same time, since these two flows are known to be mutually dependent. By investigating realistic Java programs, we found that the cases when these two flows are mutually dependent rarely happen. So, we can decouple exception flow analysis from normal flow analysis. In this paper we propose an analysis that estimates exception flows. We also propose exception flow graph to represent exception flows. And we show that the control flow graph that accounts for exception flows can be constructed by merging exception flow graph onto normal control flow graph.

A Study on Generation of Free Stereo Mosaic Image Using Video Sequences (비디오 프레임 영상을 이용한 자유 입체 모자이크 영상 제작에 관한 연구)

  • Noh, Myoung-Jong;Cho, Woo-Sug;Park, June-Ku
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.27 no.4
    • /
    • pp.453-460
    • /
    • 2009
  • For constructing 3D information using aerial photograph or video sequences, left and right stereo images having different viewing angle should be prepared in overlapping area. In video sequences, left and right stereo images would be generated by mosaicing left and right slice images extracted in consecutive video sequences. Therefore, this paper is focused on generating left and right stereo mosaic images that are able to construct 3D information and video sequences could be made for the best use. In the stereo mosaic generation, motion parameters between video sequences should be firstly determined. In this paper, to determine motion parameters, free mosaic method using geometric relationship, such as relative orientation parameters, between consecutive frame images without GPS/INS geo-data have applied. After determining the motion parameters, the mosaic image have generated by 4 step processes: image registration, image slicing, determining on stitching line, and 3D image mosaicking. As the result of experiment, generated stereo mosaic image and analyzed result of x, y-parallax have showed.