• Title/Summary/Keyword: Space information network

Search Result 1,264, Processing Time 0.026 seconds

Data Fusion Algorithm based on Inference for Anomaly Detection in the Next-Generation Intrusion Detection (차세대 침입탐지에서 이상탐지를 위한 추론 기반 데이터 융합 알고리즘)

  • Kim, Dong-Wook;Han, Myung-Mook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.26 no.3
    • /
    • pp.233-238
    • /
    • 2016
  • In this paper, we propose the algorithms of processing the uncertainty data using data fusion for the next generation intrusion detection. In the next generation intrusion detection, a lot of data are collected by many of network sensors to discover knowledge from generating information in cyber space. It is necessary the data fusion process to extract knowledge from collected sensors data. In this paper, we have proposed method to represent the uncertainty data, by classifying where is a confidence interval in interval of uncertainty data through feature analysis of different data using inference method with Dempster-Shafer Evidence Theory. In this paper, we have implemented a detection experiment that is classified by the confidence interval using IRIS plant Data Set for anomaly detection of uncertainty data. As a result, we found that it is possible to classify data by confidence interval.

The Implementation of Customer Relationship Management (CRM) to Increase Willingness to Pay by Internet Marketing : The Case of Domestic Professional Baseball Industry in Korea (인터넷마케팅에서 CRM을 통한 지불의사 상승효과에 관한 연구 : 프로야구 산업을 중심으로)

  • Gwak, Chunglee;Hahm, Yu-Kun;Lee, Miyoung
    • Journal of Information Technology Applications and Management
    • /
    • v.21 no.1
    • /
    • pp.17-34
    • /
    • 2014
  • As the numbers of Internet users have grown dramatically in recent years due to increased use of mobile devices, businesses using internet are also expanding rapidly. Internet marketing has the advantage of expanding business without any constraint of time and space using the global network which connects tens of thousands of world's computers and mobile devices. In a way of utilizing internet marketing, the present study examines the applicability of Customer Relationship Management (CRM) to the domestic professional baseball industry in Korea. The study focuses on the issue of whether the intangible value of customer satisfaction can create higher profits. We combine both inductive and conductive methods for this study. First, we carry out a random survey of baseball spectators and find that customers are willing to pay more when their satisfaction level is improved. Next, we recognize satisfaction factors that are considered as important by customers through literature survey. Then we use Decision Tree to find which satisfaction factors are most important to each clustered customer group. Finally we estimate how much they would pay more when the most important satisfaction factor improves by each customer group. Therefore, this study demonstrates that CRM implementation to one-to-one internet marketing can improve the profitability of baseball industry. The major contribution of the present study is to show that the introduction of CRM can be used as a profit-generating strategy in various industries for future internet marketing.

Improving the Performance of Decision Boundary Feature Extraction for Neural Networks by Calculating Normal Vector of Decision Boundary Analytically (결정경계 수직벡터의 해석적 계산을 통한 신경망 결정경계 특징추출 알고리즘의 성능 개선)

  • Go, Jin-Uk;Lee, Cheol-Hui
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.39 no.3
    • /
    • pp.44-52
    • /
    • 2002
  • In this paper, we present an analytical method for decision boundary feature extraction for neural networks. It has been shown that all the features necessary to achieve the same classification accuracy xxxas in the original space can be obtained from the vectors normal to decision boundaries. However, the vector normal to the decision boundary of a neural network has been calculated numerically using a gradient approximation. This process is time-consuming and the normal vector may be inaccurately estimated. In this paper, we propose a method to improve the performance of the previous decision boundary feature extraction for neural networks by accurately calculating the normal vector When the normal vectors are computed analytically, it is possible to reduce the processing time significantly and improve the performance of the previous implementation that employs numerical approximation.

Decoupling Capacitance Allocation at the Floorplan Level for Power Supply Noise Reduction (전원 잡음을 줄이기 위한 평면계획 단계에서의 Decoupling Capacitance 할당)

  • Heo Chang-Ryong;Rim Chong-Suck
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.9 s.339
    • /
    • pp.61-72
    • /
    • 2005
  • This paper proposes a method which efficiently allocates decoupling capacitance to reduce power supply noise at the floorplan level. We observe problems of previous approach that the decoupling capacitance of each module was overestimated and the power supply noises of modules were changed by inserting additional area for decoupling capacitance, and then suggest a new approach. And, we also present a simple heuristic method which can effectively allocate white space modules for decoupling capacitance area within more faster time instead of LP technique. Experimental results show that our approach can reduce the area of decoupling capacitance to average 7.9 percent compared with Zhao's approach in [4]. Therefore both total area and wire length of nniflm result are decreased. Also, we confirm that our approach solves well the problem caused by inserting additional area. In execution time comparison, our approach shows average 11.6 percent improvement.

Toward Optimal FPGA Implementation of Deep Convolutional Neural Networks for Handwritten Hangul Character Recognition

  • Park, Hanwool;Yoo, Yechan;Park, Yoonjin;Lee, Changdae;Lee, Hakkyung;Kim, Injung;Yi, Kang
    • Journal of Computing Science and Engineering
    • /
    • v.12 no.1
    • /
    • pp.24-35
    • /
    • 2018
  • Deep convolutional neural network (DCNN) is an advanced technology in image recognition. Because of extreme computing resource requirements, DCNN implementation with software alone cannot achieve real-time requirement. Therefore, the need to implement DCNN accelerator hardware is increasing. In this paper, we present a field programmable gate array (FPGA)-based hardware accelerator design of DCNN targeting handwritten Hangul character recognition application. Also, we present design optimization techniques in SDAccel environments for searching the optimal FPGA design space. The techniques we used include memory access optimization and computing unit parallelism, and data conversion. We achieved about 11.19 ms recognition time per character with Xilinx FPGA accelerator. Our design optimization was performed with Xilinx HLS and SDAccel environment targeting Kintex XCKU115 FPGA from Xilinx. Our design outperforms CPU in terms of energy efficiency (the number of samples per unit energy) by 5.88 times, and GPGPU in terms of energy efficiency by 5 times. We expect the research results will be an alternative to GPGPU solution for real-time applications, especially in data centers or server farms where energy consumption is a critical problem.

Non-Metric Multidimensional Scaling using Simulated Annealing (담금질을 사용한 비계량 다차원 척도법)

  • Lee, Chang-Yong;Lee, Dong-Ju
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.6
    • /
    • pp.648-653
    • /
    • 2010
  • The non-metric multidimensional scaling (nMDS) is a method for analyzing the relation among objects by mapping them onto the Euclidean space. The nMDS is useful when it is difficult to use the concept of distance between pairs of objects due to non-metric dissimilarities between objects. The nMDS can be regarded as an optimization problem in which there are many local optima. Since the conventional nMDS algorithm utilizes the steepest descent method, it has a drawback in that the method can hardly find a better solution once it falls into a local optimum. To remedy this problem, in this paper, we applied the simulated annealing to the nMDS and proposed a new optimization algorithm which could search for a global optimum more effectively. We examined the algorithm using benchmarking problems and found that improvement rate of the proposed algorithm against the conventional algorithm ranged from 0.7% to 3.2%. In addition, the statistical hypothesis test also showed that the proposed algorithm outperformed the conventional one.

The Study on the Quantitative Dust Index Using Geostationary Satellite (정지기상위성 자료를 이용한 정량적 황사지수 개발 연구)

  • Kim, Mee-Ja;Kim, Yoonjae;Sohn, Eun-Ha;Kim, Kum-Lan;Ahn, Myung-Hwan
    • Atmosphere
    • /
    • v.18 no.4
    • /
    • pp.267-277
    • /
    • 2008
  • The occurrence and strength of the Asian Dust over the Korea Peninsular have been increased by the expansion of the desert area. For the continuous monitoring of the Asian Dust event, the geostationary satellites provide useful information by detecting the outbreak of the event as well as the long-range transportation of dust. The Infrared Optical Depth Index (IODI) derived from the MTSAT-1R data, indicating a quantitative index of the dust intensity, has been produced in real-time at Korea Meteorological Administration (KMA) since spring of 2007 for the forecast of Asian dust. The data processing algorithm for IODI consists of mainly two steps. The first step is to detect dust area by using brightness temperature difference between two thermal window channels which are influenced with different extinction coefficients by dust. Here we use dynamic threshold values based on the change of surface temperature. In the second step, the IODI is calculated using the ratio between current IR1 brightness temperature and the maximum brightness temperature of the last 10 days which we assume the clear sky. Validation with AOD retrieved from MODIS shows a good agreement over the ocean. Comparison of IODI with the ground based PM10 observation network in Korea shows distinct characteristics depending on the altitude of dust layer estimated from the Lidar data. In the case that the altitude of dust layer is relatively high, the intensity of IODI is larger than that of PM10. On the other hand, when the altitude of dust layer is lower, IODI seems to be relatively small comparing with PM10 measurement.

A Study on Automatic Classification of Characterized Ground Regions on Slopes by a Deep Learning based Image Segmentation (딥러닝 영상처리를 통한 비탈면의 지반 특성화 영역 자동 분류에 관한 연구)

  • Lee, Kyu Beom;Shin, Hyu-Soung;Kim, Seung Hyeon;Ha, Dae Mok;Choi, Isu
    • Tunnel and Underground Space
    • /
    • v.29 no.6
    • /
    • pp.508-522
    • /
    • 2019
  • Because of the slope failure, not only property damage but also human damage can occur, slope stability analysis should be conducted to predict and reinforce of the slope. This paper, defines the ground areas that can be characterized in terms of slope failure such as Rockmass jointset, Rockmass fault, Soil, Leakage water and Crush zone in sloped images. As a result, it was shown that the deep learning instance segmentation network can be used to recognize and automatically segment the precise shape of the ground region with different characteristics shown in the image. It showed the possibility of supporting the slope mapping work and automatically calculating the ground characteristics information of slopes necessary for decision making such as slope reinforcement.

Multi-level Shape Optimization of Lower Arm by using TOPSIS and Computational Orthogonal Array (TOPSIS와 전산직교배열을 적용한 자동차 로워암의 다수준 형상최적설계)

  • Lee, Kwang-Ki;Han, Seung-Ho
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.28 no.4
    • /
    • pp.482-489
    • /
    • 2011
  • In practical design process, designer needs to find an optimal solution by using full factorial discrete combination, rather than by using optimization algorithm considering continuous design variables. So, ANOVA(Analysis of Variance) based on an orthogonal array, i.e. Taguchi method, has been widely used in most parts of industry area. However, the Taguchi method is limited for the shape optimization by using CAE, because the multi-level and multi-objective optimization can't be carried out simultaneously. In this study, a combined method was proposed taking into account of multi-level computational orthogonal array and TOPSIS(Technique for Order preference by Similarity to Ideal Solution), which is known as a classical method of multiple attribute decision making and enables to solve various decision making or selection problems in an aspect of multi-objective optimization. The proposed method was applied to a case study of the multi-level shape optimization of lower arm used to automobile parts, and the design space was explored via an efficient application of the related CAE tools. The multi-level shape optimization was performed sequentially by applying both of the neural network model generated from seven-level four-factor computational orthogonal array and the TOPSIS. The weight and maximum stress of the lower arm, as the objective functions for the multi-level shape optimization, showed an improvement of 0.07% and 17.89%, respectively. In addition, the number of CAE carried out for the shape optimization was only 55 times in comparison to full factorial method necessary to 2,401 times.

Adaptive Image Converting for More Efficient Mobile Web Service (모바일 웹 서비스를 효율적으로 제공하기 위한 적응적 이미지 변환 기법)

  • Sim, Kun-Ho;Ko, Hee-Ae;Kim, Jong-Keun;Zhao, Mei-Hua;Lim, Yung-Hwan
    • Journal of Internet Computing and Services
    • /
    • v.12 no.2
    • /
    • pp.37-46
    • /
    • 2011
  • The importance of data service with mobile is becoming more and more significant with the development of wireless network. However, due to the several type of mobile devices and contents, there is a problem that mobile contents should be edited according to the features of the mobile devices and the service providers. Fortunately, there is some solutions that convert mobile contents automatically according to mobile operator. Nevertheless, it has some issues that the response time of content service is delayed when converting mobile contents in real-time. In this paper, we propose an image cache replacement algorithm for minizing the volume of the real-time image transformation. Also, using both of the pre-conversion method and the real-time conversion method to improve storage space and response time.