• Title/Summary/Keyword: 가중치 합 비교

Search Result 69, Processing Time 0.036 seconds

A Object-Based Image Retrieval Using Feature Analysis and Fractal Dimension (특징 분석과 프랙탈 차원을 이용한 객체 기반 영상검색)

  • 이정봉;박장춘
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.2
    • /
    • pp.173-186
    • /
    • 2004
  • This paper proposed the content-based retrieval system as a method for performing image retrieval through the effective feature extraction of the object of significant meaning based on the characteristics of man's visual system. To allow the object region of interest to be primarily detected, the region, being comparatively large size, greatly different from the background color and located in the middle of the image, was judged as the major object with a meaning. To get the original features of the image, the cumulative sum of tile declination difference vector the segment of the object contour had and the signature of the bipartite object were extracted and used in the form of being applied to the rotation of the object and the change of the size after partition of the total length of the object contour of the image into the normalized segment. Starting with this form feature, it was possible to make a retrieval robust to any change in translation, rotation and scaling by combining information on the texture sample, color and eccentricity and measuring the degree of similarity. It responded less sensitively to the phenomenon of distortion of the object feature due to the partial change or damage of the region. Also, the method of imposing a different weight of similarity on the image feature based on the relationship of complexity between measured objects using the fractal dimension by the Boxing-Counting Dimension minimized the wrong retrieval and showed more efficient retrieval rate.

  • PDF

A Performance Analysis by Adjusting Learning Methods in Stock Price Prediction Model Using LSTM (LSTM을 이용한 주가예측 모델의 학습방법에 따른 성능분석)

  • Jung, Jongjin;Kim, Jiyeon
    • Journal of Digital Convergence
    • /
    • v.18 no.11
    • /
    • pp.259-266
    • /
    • 2020
  • Many developments have been steadily carried out by researchers with applying knowledge-based expert system or machine learning algorithms to the financial field. In particular, it is now common to perform knowledge based system trading in using stock prices. Recently, deep learning technologies have been applied to real fields of stock trading marketplace as GPU performance and large scaled data have been supported enough. Especially, LSTM has been tried to apply to stock price prediction because of its compatibility for time series data. In this paper, we implement stock price prediction using LSTM. In modeling of LSTM, we propose a fitness combination of model parameters and activation functions for best performance. Specifically, we propose suitable selection methods of initializers of weights and bias, regularizers to avoid over-fitting, activation functions and optimization methods. We also compare model performances according to the different selections of the above important modeling considering factors on the real-world stock price data of global major companies. Finally, our experimental work brings a fitness method of applying LSTM model to stock price prediction.

A Study on Developing the Index for Forest Sustainability in Korea (산림지속성 지수 개발에 관한 기초연구)

  • Kim, Joon-Soon;Kim, Joong Myung;Sung, Joo Han
    • Journal of Korean Society of Forest Science
    • /
    • v.94 no.3 s.160
    • /
    • pp.183-190
    • /
    • 2005
  • This study was carried out to find out the possibility for developing methodologies on the index for forest sustainability and to assess sustainability indices of metropolitan and provincial districts based on conditions of their forest health and management programmes in Korea. To find out some indicators to be utilized in developing the forest sustainability indices, total 84 possible indicators were selected and combined from 69 major programmes contained in the 4th Forest Development Plan and the Forest Vision for 21st Century and other 15 indicators selected separately from other forest policies. Those candidate indicators were reviewed throughly under evaluation processes and 33 indicators were finally chosen in developing the forest sustainability indices. Those indicators were classified into 3 categories, namely indicators for pressure, state, and response. Forest health could be represented by pressure and state indicators, while forest management programmes could be assessed by response indicators. Scores of importance for each indicator were assigned through Delphi survey and analyzed to project the extra weight value by summing rankings given to each index an applied to the standardized value of each index. Forest sustainability indices of metropolitan and provincial districts were analyzed and compared, based on relevant data of the year 2002. This study was kind a preliminary one in forest sustainability index and the names of metropolitan and provincial districts were not identified in this study. The indices could be very valuable in assessing quantitatively the level of forest health and intensity of forest management programmes in each districts and comparisons could be made among them, if all self-governing districts agree unanimously on the indices of forest sustainability and relevant indicators chosen in the study.

A Derivation of the Representative Unit Hydrograph from Multiperiod Complex Storm by Linear Programming (선형계획법(線型計劃法)에 의한 대표단위도(代表單位圖) 유도(誘導))

  • Kwon, Oh Hun;Ryu, Tae Sang;Yoo, Ju Hwan
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.13 no.2
    • /
    • pp.173-182
    • /
    • 1993
  • This paper presents an algorithm to derive the representative unit hydrograph for the real environment of a watershed. For a given watershed, the conventional methods give several different unit hydrographs by storm events. In this study the LP model is somewhat modified based on the previous study by Mays et also as follows: the objective function is designed to minimize the sum of weighted residuals. An additional constraint of moving average is added to prevent the unit hydrograph from the occurence of oscillation which was not active in Mays's paper. Configuration of rainfall matrix was improved to reduce its dimension in accordance with Diskin's review point. In spite of the superiority of LP approach in terms of representativeness, all the methods were very sensitive to the validity of baseflow separation and rainfall-loss. Several methods of the separations for rainfall excesses and direct runoffs were applied and no preferred methods were identified. This is the matter of judgement considering catchment and rainfall characteristics. This algorithm was applied to a real watershed of the Wi stream in the Nak-dong river. Compared with the IHP results by conventional methods, this optimized representative unit hydrograph demonstrated relatively smaller and shorter values in terms of the peak discharge and the basin lag respectively, and the oscillation of its falling limb successfully eliminated owing to the additional constraints of moving averages.

  • PDF

An analysis on the development of a new multicasting method for telecommunication networking (텔레커뮤니케이션 네트워크상 멀티캐스팅 신기술 개발 분석)

  • Cho, Myeong-Rai
    • Asia-Pacific Journal of Business Venturing and Entrepreneurship
    • /
    • v.5 no.3
    • /
    • pp.27-45
    • /
    • 2010
  • It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast routing protocol that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

  • PDF

Overlay Multicast Tree Building Algorithm for MDST and MST in Complete Network (완전 연결된 네트워크에서 MDST와 MST 목적을 갖는 오버레이 멀티캐스트 트리구현 알고리즘)

  • Cho, Myeong-Rai
    • 한국벤처창업학회:학술대회논문집
    • /
    • 2010.08a
    • /
    • pp.71-89
    • /
    • 2010
  • It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast tree building problem that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

  • PDF

Selection of Accident Frequency Area through Accident Cost Analysis (비용분석을 통한 교통사고 누적지역 선정방안)

  • Lee, Jung-Beom
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.21 no.2
    • /
    • pp.33-43
    • /
    • 2022
  • The number of car crashes increases along with the increasing number of vehicles. Hence, diverse initiatives on traffic accidents have been implemented, targeting zero crash fatalities. According to the 3rd Traffic Safety Master Plan of 2016, the current standard selecting road accident black spots prioritizes locations with the high cumulative death toll. While this standard is suitable for roads that a city government manages to some extent, it is not suitable for roads less than 20 meters that a borough (Gu) handles. The roads under the supervision of a borough do not have enough death toll, and thus improvements on its road accident black spots are highly limited. In addition, discovering the causes of traffic accidents is not easy when the number of car accidents is obtained by considering only fatal accidents, which are relatively low in number. Therefore, including all traffic accidents might identify causes of accidents and result in better advancements. Therefore, this research follows rational decision-making and suggests new National Traffic Safety Master Plan standards. These new standards are obtained by comparing accident costs between the location of fatal crashes and road accident black spots. The analysis result shows that considering all types of accidents yields better results. For example, a Three-way Intersection in front of Zion Day Care Center, one of the selected spots under the current standard, has lower road crash costs than Sinchon Intersection, a selected spot under a new standard. Therefore, the study concludes that the standards to select road accident black spots need to include traffic accident severity and road crash costs.

A Development and Application of the Landscape Evaluation Model Based on the Biotope Classification (비오톱 유형분류를 기반으로 한 경관평가 모형개발 및 적용)

  • Park, Cheon-Jin;Ra, Jung-Hwa;Cho, Hyun-Ju;Kim, Jin-Hyo;Kwon, Oh-Sung
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.40 no.4
    • /
    • pp.114-126
    • /
    • 2012
  • The purpose of this study is to find ways of the view evaluation of biotope classification before development by selecting an area, which is as large as about $10.0km^2$ around Non Gong Up, Auk Po Myun, Dalsung Gun, Daugu where the large project has been planned, as a subject of this study. The results of this study are as follows. Because of the classification of biotope, there are 23 kinds of types that are subdivided into 140 types. Three surveys for selecting the assessment indicators were performed. The first survey analyzed the importance of 22 selected assessment indicators based on the evaluation of an existing literature review and on the spot research. The second survey performed factor analysis and reclassified the value indicators. The third survey computed additive values of the selected assessment indicators. It used a method of standardizing the average importance of indicators by making their sum equal by 10. Theses additive values were then multiplied by each grade of indicators in order to make a final evaluation. The number of assessment indicators finally selected through the survey of asking specialist is vitality elements, visual obstructs elements etc 19. According to the result of evaluation of 1st, 1 grade spaces which especially valuable is analyzed that 7 spaces, 2 grade spaces for 4, 3 grade spaces for 5, 4 grade space for 2, 5 grade space for 5. Because of the evaluation of 2st, 1 grade spaces which especially valuable(1a, 1b) is analyzed that 15 spaces, 2 grade spaces which valuable is analyzed that 28 space. As the evaluation of site suitability model of this study couldn't have high applicability to other similar area because of having only one site as a subject, it is needed to do synthesize and standardization of various examples to have higher objectivity later.

Game Theoretic Optimization of Investment Portfolio Considering the Performance of Information Security Countermeasure (정보보호 대책의 성능을 고려한 투자 포트폴리오의 게임 이론적 최적화)

  • Lee, Sang-Hoon;Kim, Tae-Sung
    • Journal of Intelligence and Information Systems
    • /
    • v.26 no.3
    • /
    • pp.37-50
    • /
    • 2020
  • Information security has become an important issue in the world. Various information and communication technologies, such as the Internet of Things, big data, cloud, and artificial intelligence, are developing, and the need for information security is increasing. Although the necessity of information security is expanding according to the development of information and communication technology, interest in information security investment is insufficient. In general, measuring the effect of information security investment is difficult, so appropriate investment is not being practice, and organizations are decreasing their information security investment. In addition, since the types and specification of information security measures are diverse, it is difficult to compare and evaluate the information security countermeasures objectively, and there is a lack of decision-making methods about information security investment. To develop the organization, policies and decisions related to information security are essential, and measuring the effect of information security investment is necessary. Therefore, this study proposes a method of constructing an investment portfolio for information security measures using game theory and derives an optimal defence probability. Using the two-person game model, the information security manager and the attacker are assumed to be the game players, and the information security countermeasures and information security threats are assumed as the strategy of the players, respectively. A zero-sum game that the sum of the players' payoffs is zero is assumed, and we derive a solution of a mixed strategy game in which a strategy is selected according to probability distribution among strategies. In the real world, there are various types of information security threats exist, so multiple information security measures should be considered to maintain the appropriate information security level of information systems. We assume that the defence ratio of the information security countermeasures is known, and we derive the optimal solution of the mixed strategy game using linear programming. The contributions of this study are as follows. First, we conduct analysis using real performance data of information security measures. Information security managers of organizations can use the methodology suggested in this study to make practical decisions when establishing investment portfolio for information security countermeasures. Second, the investment weight of information security countermeasures is derived. Since we derive the weight of each information security measure, not just whether or not information security measures have been invested, it is easy to construct an information security investment portfolio in a situation where investment decisions need to be made in consideration of a number of information security countermeasures. Finally, it is possible to find the optimal defence probability after constructing an investment portfolio of information security countermeasures. The information security managers of organizations can measure the specific investment effect by drawing out information security countermeasures that fit the organization's information security investment budget. Also, numerical examples are presented and computational results are analyzed. Based on the performance of various information security countermeasures: Firewall, IPS, and Antivirus, data related to information security measures are collected to construct a portfolio of information security countermeasures. The defence ratio of the information security countermeasures is created using a uniform distribution, and a coverage of performance is derived based on the report of each information security countermeasure. According to numerical examples that considered Firewall, IPS, and Antivirus as information security countermeasures, the investment weights of Firewall, IPS, and Antivirus are optimized to 60.74%, 39.26%, and 0%, respectively. The result shows that the defence probability of the organization is maximized to 83.87%. When the methodology and examples of this study are used in practice, information security managers can consider various types of information security measures, and the appropriate investment level of each measure can be reflected in the organization's budget.