• Title/Summary/Keyword: similarity solution

Search Result 296, Processing Time 0.023 seconds

DDoS Attack Analysis Using the Improved ATMSim (개선된 ATMSim을 이용한 DDoS 공격 분석)

  • Jeong, Hae-Duck J.;Ryu, Myeong-Un;Ji, Min-Jun;Cho, You-Been;Ye, Sang-Kug;Lee, Jong-Suk R.
    • Journal of Internet Computing and Services
    • /
    • v.17 no.2
    • /
    • pp.19-28
    • /
    • 2016
  • Internet traffic has been significantly increasing due to the development of information and communication networks and the growing numbers of cell phone users that access networks. This paper connects to this issue by presenting a way to detect and analyze a typical DDoS attack that results in Internet breaches and network attacks, which are on the increase. To achieve this goal, we improve features and GUI of the existing ATMSim analysis package and use it. This package operates on a network flow-based analysis method, which means that normal traffic collected through an internal LAN at the Korean Bible University campus as well as anomaly traffic with DDoS attacks are generated. Self-similarity processes are used to analyze normal and anomaly traffic that are collected and generated from the improved ATMSim. Our numerical results obtained from three Hurst parameter estimate techniques show that there is quantitatively a significant difference between normal traffic and anomaly traffic from a self-similarity perspective.

Development of polygon object set matching algorithm between heterogeneous digital maps - using the genetic algorithm based on the shape similarities (형상 유사도 기반의 유전 알고리즘을 활용한 이종 수치지도 간의 면 객체 집합 정합 알고리즘 개발)

  • Huh, Yong;Lee, Jeabin
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.31 no.1
    • /
    • pp.1-9
    • /
    • 2013
  • This paper proposes a matching algorithm to find corresponding polygon feature sets between heterogeneous digital maps. The algorithm finds corresponding sets in terms of optimizing their shape similarities based on the assumption that the feature sets describing the same entities in the real world are represented in similar shapes. Then, by using a binary code, it is represented that a polygon feature is chosen for constituting a corresponding set or not. These codes are combined into a binary string as a candidate solution of the matching problem. Starting from initial candidate solutions, a genetic algorithm iteratively optimizes the candidate solutions until it meets a termination condition. Finally, it presents the solution with the highest similarity. The proposed method is applied for the topographical and cadastral maps of an urban region in Suwon, Korea to find corresponding polygon feature sets for block areas, and the results show its feasibility. The results were assessed with manual detection results, and showed overall accuracy of 0.946.

Real-time Rendering of Realistic Grasses Using Fractal and Shader-Instancing (프랙탈과 셰이더 인스턴싱 기법을 이용한 자연스러운 잔디의 실시간 렌더링)

  • Kim, Jin-Mo;Cho, Hyung-Je
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.2
    • /
    • pp.298-307
    • /
    • 2010
  • The grass is one of important components that cover the wide surfaces in the application such as game or real time simulation. Actually, it not easy to render effectively numerous grasses that grow over the wide terrain. To solve the difficulty, we must find a solution to the two contradictions in terms : quality and calculation cost. As a solution to the above-mentioned task, in this paper, we propose an efficient method to represent the natural grasses by introducing fractal theory and instancing technique. Although the existing grass representation methods make use of a simple rule of applying a basic grass model repeatedly in rendering process, on the contrary we take advantage of the basic property of fractal's self-similarity and we devise a natural representation method suited to the given environment by introducing two important growth factors such as nature of terrain and quantity of light, and finally we apply a GPU-based shader instancing technique to rendering numerous grass models in real-time.

Application of Design Axiom to Marine Design Problems (조선분야에서의 설계공리의 응용)

  • Y.S. Song;Y.S.Yang;B.S. Jang
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.36 no.3
    • /
    • pp.107-114
    • /
    • 1999
  • Design Axiom proposed by N. P. Such consists of Independence Axiom & Information Axiom. Based on the Independence Axiom, it is very useful specially for early design stage such as conceptual design to generate the design alternatives by considering both functions and structures of product. Since the Information Axiom shows that the design solution should have a least information to be the best one among the many alternatives, this axiom can be used for the best selection purpose during the preliminary design stage. In this paper, the possibility of Design Axiom in marine design application is checked by carrying out three examples of marine design. In the conceptual design of thruster, it is proven to use the Independence Axiom very effective by relating directly functional requirements with design parameters, one by one. In main engine selection example, Information Axiom is used to select best solution among alternatives by choosing the one having the minimum information quantity. For similarity based design in which the selection of changing design variables and the amount of those are important, it is proved that design axiom applied to Barge design case would be very effective and useful. As functional requirements and constrains were not clarified in early design stage, design axiom shows some difficulty for larger system design like ship which is basically carried out by an incremental and iterative process.

  • PDF

Automatic Music Summarization Method by using the Bit Error Rate of the Audio Fingerprint and a System thereof (오디오 핑거프린트의 비트에러율을 이용한 자동 음악 요약 기법 및 시스템)

  • Kim, Minseong;Park, Mansoo;Kim, Hoirin
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.4
    • /
    • pp.453-463
    • /
    • 2013
  • In this paper, we present an effective method and a system for the music summarization which automatically extract the chorus portion of a piece of music. A music summary technology is very useful for browsing a song or generating a sample music for an online music service. To develop the solution, conventional automatic music summarization methods use a 2-dimensional similarity matrix, statistical models, or clustering techniques. But our proposed method extracts the music summary by calculating BER(Bit Error Rate) between audio fingerprint blocks which are extracted from a song. But we could directly use an enormous audio fingerprint database which was already saved for a music retrieval solution. This shows the possibility of developing a various of new algorithms and solutions using the audio fingerprint database. In addition, experiments show that the proposed method captures the chorus of a song more effectively than a conventional method.

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.

Hybrid Simulated Annealing for Data Clustering (데이터 클러스터링을 위한 혼합 시뮬레이티드 어닐링)

  • Kim, Sung-Soo;Baek, Jun-Young;Kang, Beom-Soo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.2
    • /
    • pp.92-98
    • /
    • 2017
  • Data clustering determines a group of patterns using similarity measure in a dataset and is one of the most important and difficult technique in data mining. Clustering can be formally considered as a particular kind of NP-hard grouping problem. K-means algorithm which is popular and efficient, is sensitive for initialization and has the possibility to be stuck in local optimum because of hill climbing clustering method. This method is also not computationally feasible in practice, especially for large datasets and large number of clusters. Therefore, we need a robust and efficient clustering algorithm to find the global optimum (not local optimum) especially when much data is collected from many IoT (Internet of Things) devices in these days. The objective of this paper is to propose new Hybrid Simulated Annealing (HSA) which is combined simulated annealing with K-means for non-hierarchical clustering of big data. Simulated annealing (SA) is useful for diversified search in large search space and K-means is useful for converged search in predetermined search space. Our proposed method can balance the intensification and diversification to find the global optimal solution in big data clustering. The performance of HSA is validated using Iris, Wine, Glass, and Vowel UCI machine learning repository datasets comparing to previous studies by experiment and analysis. Our proposed KSAK (K-means+SA+K-means) and SAK (SA+K-means) are better than KSA(K-means+SA), SA, and K-means in our simulations. Our method has significantly improved accuracy and efficiency to find the global optimal data clustering solution for complex, real time, and costly data mining process.

Effect of Nitrogen Phosphorus and Potassium on Ginsenoside Composition of Panax Ginseng Root Grown with Nutrient Solution (영양액재배 인삼근의 진세노사이드 조성에 미치는 N.P.K.의 영향)

  • Park, Hoon;Lee, Mee-Kyung;Lee, Chong-Hwa
    • Applied Biological Chemistry
    • /
    • v.29 no.1
    • /
    • pp.78-82
    • /
    • 1986
  • Panax ginseng seedlings were grown in vermiculite with nutrient solution different in nitrogen, phosphorus ana potassium level. Ginsenoside contents of root were investigated by high performance liquid chromatogram. Elimination or increase of one of N.P.K. increased or decreased total saponin content. Nitrogen was most effective (15.5% for-N to 8.9% for 3N) and potassium least. Similar trend was shown in each ginsenoside. According to coefficient of variation in one nutrient treatment or among all nutrient treatments ginsenoside Re was most insensitive to nutrient change and also other environmental factors and Rd most sensitive. Diol content (PD) was more variable than triol (PT) and variation of PT/PD was about half of them. Variation of ginsenoside content by nutrient change had no relation with the ginsenoside content. Similarity of ginsenoside pattern slightly decreased with the difference of saponin content by nutrient change. Root weight was significantly small only in tap water plot.

  • PDF

A Study of Call Admission Control Scheme using Noncooperative Game under Homogeneous Overlay Wireless Networks (동종의 중첩 무선 네트워크에서 비협력적 게임을 이용한 호수락 제어기법의 연구)

  • Kim, Nam Sun
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.20 no.4
    • /
    • pp.1-9
    • /
    • 2015
  • This paper proposes CAC method that is more efficient for RRM using game theory combined with Multiple Attribute Decision Making(MADM). Because users request services with different Quality of Service(QoS), the network preference values to alternative networks for each service are calculated by MADM methods such as Grey Relational Analysis(GRA), Simple Additive Weighting(SAW) and Technique for Order Preference by Similarity to Ideal Solution(TOPSIS). According to a utility function representing preference value, non-cooperative game is played, and then network provider select the requested service that provide maximum payoff. The appropriate service is selected through Nash Equilibrium that is the solution of game and the game is played repeated. We analyze two overlaid networks among four Wireless LAN(WLAN) systems with different properties. Simulation results show that proposed MADM techniques have same outcomes for every game round.

A Multi-Perspective Benchmarking Framework for Estimating Usable-Security of Hospital Management System Software Based on Fuzzy Logic, ANP and TOPSIS Methods

  • Kumar, Rajeev;Ansari, Md Tarique Jamal;Baz, Abdullah;Alhakami, Hosam;Agrawal, Alka;Khan, Raees Ahmad
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.1
    • /
    • pp.240-263
    • /
    • 2021
  • One of the biggest challenges that the software industry is facing today is to create highly efficient applications without affecting the quality of healthcare system software. The demand for the provision of software with high quality protection has seen a rapid increase in the software business market. Moreover, it is worthless to offer extremely user-friendly software applications with no ideal security. Therefore a need to find optimal solutions and bridge the difference between accessibility and protection by offering accessible software services for defense has become an imminent prerequisite. Several research endeavours on usable security assessments have been performed to fill the gap between functionality and security. In this context, several Multi-Criteria Decision Making (MCDM) approaches have been implemented on different usability and security attributes so as to assess the usable-security of software systems. However, only a few specific studies are based on using the integrated approach of fuzzy Analytic Network Process (FANP) and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) technique for assessing the significant usable-security of hospital management software. Therefore, in this research study, the authors have employed an integrated methodology of fuzzy logic, ANP and TOPSIS to estimate the usable - security of Hospital Management System Software. For the intended objective, the study has taken into account 5 usable-security factors at first tier and 16 sub-factors at second tier with 6 hospital management system softwares as alternative solutions. To measure the weights of parameters and their relation with each other, Fuzzy ANP is implemented. Thereafter, Fuzzy TOPSIS methodology was employed and the rating of alternatives was calculated on the foundation of the proximity to the positive ideal solution.