• 제목/요약/키워드: Effective rank

검색결과 427건 처리시간 0.023초

Particle Swarm Assisted Genetic Algorithm for the Optimal Design of Flexbeam Sections

  • Dhadwal, Manoj Kumar;Lim, Kyu Baek;Jung, Sung Nam;Kim, Tae Joo
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제14권4호
    • /
    • pp.341-349
    • /
    • 2013
  • This paper considers the optimum design of flexbeam cross-sections for a full-scale bearingless helicopter rotor, using an efficient hybrid optimization algorithm based on particle swarm optimization, and an improved genetic algorithm, with an effective constraint handling scheme for constrained nonlinear optimization. The basic operators of the genetic algorithm, of crossover and mutation, are revisited, and a new rank-based multi-parent crossover operator is utilized. The rank-based crossover operator simultaneously enhances both the local, and the global exploration. The benchmark results demonstrate remarkable improvements, in terms of efficiency and robustness, as compared to other state-of-the-art algorithms. The developed algorithm is adopted for two baseline flexbeam section designs, and optimum cross-section configurations are obtained with less function evaluations, and less computation time.

Unsupervised feature selection using orthogonal decomposition and low-rank approximation

  • Lim, Hyunki
    • 한국컴퓨터정보학회논문지
    • /
    • 제27권5호
    • /
    • pp.77-84
    • /
    • 2022
  • 본 논문에서는 새로운 비지도 특징 선별 기법을 제안한다. 기존 비지도 방식의 특징 선별 기법들은 특징을 선별하기 위해 가상의 레이블 데이터를 정하고 주어진 데이터를 이 레이블 데이터에 사영하는 회귀 분석 방식으로 특징을 선별하였다. 하지만 가상의 레이블은 데이터로부터 생성되기 때문에 사영된 공간이 비슷하게 형성될 수 있다. 따라서 기존의 방법들에서는 제한된 공간에서만 특징이 선택될 수 있었다. 이를 해소하기 위해 본 논문에서는 직교 사영과 저랭크 근사를 이용하여 특징을 선별한다. 이 문제를 해소하기 위해 가상의 레이블을 직교 사영하고 이 공간에 데이터를 사영할 수 있도록 한다. 이를 통해 더 주요한 특징 선별을 기대할 수 있다. 그리고 사영을 위한 변환 행렬에 저랭크 제한을 두어 더 효과적으로 저차원 공간의 특징을 선별할 수 있도록 한다. 이 목표를 달성하기 위해 본 논문에서는 비용 함수를 설계하고 효율적인 최적화 방법을 제안한다. 여섯 개의 데이터에 대한 실험 결과는 제안된 방법이 대부분의 경우 기존의 비지도 특징 선별 기법보다 좋은 성능을 보여주었다.

Floristic Characterization of the Temperate Oak Forests in the Korean Peninsula Using High-rank Taxa

  • Kim, Jong-Won
    • Journal of Plant Biology
    • /
    • 제39권2호
    • /
    • pp.149-159
    • /
    • 1996
  • The order of Rhododendro-Quercetalia mongolicae representing temperate oak forests in Korea was characterized in terms of presence of taxa of different rank. 140 releves were analysed for percentage contribution of each species, genera and families in syntaxa under consideration as well as extracton of diagnostic genera and families for syntaxa by an ordination technique. The Rhododendro-Quercetalia is characterized by high diversity of tree and shrub species contributing 40% of the total floristic composition as well as by a high contribution of the genus Rhododendron and the absence of the genus Fagus, characteristic of the QuercoFagetea sensu lato. The character families for the Rhododendron and Quercus include Liliaceae and Compositae, whereas Acer, Carex, Viola, Rhododendron and Quercus are the most common among genera. Rhododendron and Quercus are regarded as the transgressive cheractergenera, whereas the families of Pinaceae and Ericaceae are considered companions (in sense of the terminology of the Braun-Blanquet syntaxonomy) for the order. Family appeared to be an inadequate rank for diagnoses of alliances and suballiances. On the other hand, genus was found to be the most effective rank in differentiating the alliances and suballiances. The Lindero-Quercenion shares the same character-genera with the order Rhododendro-Quercetalia. Character genera of the suballiances Callicarpo-quercenion are Carpinus, Styrax, Smilax and Callicarpa, and those of the Pino-Quercion list Euonymus, Saussurea and Tilia.

  • PDF

Importance Assessment of Multiple Microgrids Network Based on Modified PageRank Algorithm

  • Yeonwoo LEE
    • 한국인공지능학회지
    • /
    • 제11권2호
    • /
    • pp.1-6
    • /
    • 2023
  • This paper presents a comprehensive scheme for assessing the importance of multiple microgrids (MGs) network that includes distributed energy resources (DERs), renewable energy systems (RESs), and energy storage system (ESS) facilities. Due to the uncertainty of severe weather, large-scale cascading failures are inevitable in energy networks. making the assessment of the structural vulnerability of the energy network an attractive research theme. This attention has led to the identification of the importance of measuring energy nodes. In multiple MG networks, the energy nodes are regarded as one MG. This paper presents a modified PageRank algorithm to assess the importance of MGs that include multiple DERs and ESS. With the importance rank order list of the multiple MG networks, the core MG (or node) of power production and consumption can be identified. Identifying such an MG is useful in preventing cascading failures by distributing the concentration on the core node, while increasing the effective link connection of the energy flow and energy trade. This scheme can be applied to identify the most profitable MG in the energy trade market so that the deployment operation of the MG connection can be decided to increase the effectiveness of energy usages. By identifying the important MG nodes in the network, it can help improve the resilience and robustness of the power grid system against large-scale cascading failures and other unexpected events. The proposed algorithm can point out which MG node is important in the MGs power grid network and thus, it could prevent the cascading failure by distributing the important MG node's role to other MG nodes.

순위 차 확산 필터를 이용한 스페클 잡음 제거 (Speckle Noise Removal by Rank-ordered Differences Diffusion Filter)

  • 예철수
    • 대한원격탐사학회지
    • /
    • 제25권1호
    • /
    • pp.21-30
    • /
    • 2009
  • 본 논문의 목적은 원격 탐사 영상에서 잡음을 제거하기 위해 중심 화소와 통계적으로 유사한 이웃화소들을 선택하늘 방법을 제시하고 이 결과를 평균 곡률 확산과 결합하는 방법을 제시하는데 있다. 균일한 밝기값 영역에 속하는 화소들을 검출하기 위해 이웃 화소들을 순차적으로 선택할 때 그 선택하는 순서에 따라 선택된 영역의 통계적 특성이 달라지므로 이웃 화소의 선택 순서는 매우 중요하다. 본 논문에서는 통계적으로 유사한 특성을 가지는 이웃 화소를 선택하기 위해서 중심 화소와 이웃 화소의 밝기값 차를 계산하고 이를 크기 순으로 정렬하여 얻어지는 순위 차 벡터(rank-ordered differences vector)를 이용하는 효과적인 방법을 제안한다. 순위 차 벡터의 항들을 영역 확장 방법을 이용하여 균일 순위 차 벡터(homogeneous rank-ordered differences vector)와 이상점 순위 차 벡터 (outlier rank-ordered differences vector)로 분할한다. 균일 순위 차 벡터의 항에 속하는 이웃 화소에 대해서만 중심 화소의 밝기값 갱신에 기여하도록 확산 계수를 선택적으로 할당하는 라인 프로세스를 평균 곡률 확산에 결합한다. 제안한 방법은 모든 이웃 화소를 이용하여 중심 화소의 밝기값을 갱신하는 기존의 잡음 제거 필터에 비해 잡음 제거 효과가 뛰어남을 항공 영상 및 TerraSAR-X 위성 영상을 이용한 실험을 통해 확인하였다.

Nonparametric Procedures for Finding Minimum Effective Dose in a One-Way Layout

  • Kim, Hyeonjeong;Kim, Dongjae
    • Communications for Statistical Applications and Methods
    • /
    • 제9권3호
    • /
    • pp.693-701
    • /
    • 2002
  • When the lowest dose level compared with zero-dose control has significant difference in effect, it is referred as minimum effective dose (MED). In this paper, we discuss several nonparametric methods for finding MED using updated rank at each sequential test step in small sample size and suggest new nonparametric procedures based on placement. Monte Carlo Simulation is adapted to compare power and Familywise Error Rate(FWE) of the new procedures with those of discussed nonparametric tests for finding MED.

하이퍼텍스트 정보 관점에서 의도적으로 왜곡된 웹 페이지의 검출에 관한 연구 (Detecting Intentionally Biased Web Pages In terms of Hypertext Information)

  • 이우기
    • 한국컴퓨터정보학회논문지
    • /
    • 제10권1호
    • /
    • pp.59-66
    • /
    • 2005
  • 웹(World Wide Web)은 정보의 저장 및 검색에 있어서 보편적인 매체가 되고 있다 웹에서는 일반적으로 검색엔진(Web search engine)을 통해 정보 검색을 수행하지만, 그 결과가 사용자의 요구와 늘 일치하는 것은 아니며 때로는 의도적으로 조작된 검색 결과가 제시되기도 한다. 웹 페이지에 대한 평가를 조작하는 것을 의도적 조작이라고 부른다. 최근에 가장 각광을 받는 링크 기반 검색 방식에는 의도적 조작이 상대적으로 어렵지만, 링크 기반 검색 방식의 대표격인 구글의 페이지 점수법(PageRank algorithm)도 구글밤처럼 조작할 수 있는 방법이 있다 본 논문에서는 기본적으로 링크 기반 검색 방식을 기초로 웹을 하나의 유향그래프(directed graph)로 인식하여 각 웹 페이지들은 하나의 노드로, 하이퍼텍스트 링크를 에지(edge)로 표현하며. 하이퍼텍스트 정보관점에서 링크 내역과 대상 페이지(target page) 사이의 유사도(similarity)를 구하고. 이것을 이용하여 페이지 점수화 (PageRank) 접근법의 전이 행렬(transition matrix)을 재구성하는 방법을 취했다 결과적으로 기존의 점수화 방법과 비교하여 효과가 $60\%$ 이상 될 수 있음을 입증했다.

  • PDF

Multiview-based Spectral Weighted and Low-Rank for Row-sparsity Hyperspectral Unmixing

  • Zhang, Shuaiyang;Hua, Wenshen;Liu, Jie;Li, Gang;Wang, Qianghui
    • Current Optics and Photonics
    • /
    • 제5권4호
    • /
    • pp.431-443
    • /
    • 2021
  • Sparse unmixing has been proven to be an effective method for hyperspectral unmixing. Hyperspectral images contain rich spectral and spatial information. The means to make full use of spectral information, spatial information, and enhanced sparsity constraints are the main research directions to improve the accuracy of sparse unmixing. However, many algorithms only focus on one or two of these factors, because it is difficult to construct an unmixing model that considers all three factors. To address this issue, a novel algorithm called multiview-based spectral weighted and low-rank row-sparsity unmixing is proposed. A multiview data set is generated through spectral partitioning, and then spectral weighting is imposed on it to exploit the abundant spectral information. The row-sparsity approach, which controls the sparsity by the l2,0 norm, outperforms the single-sparsity approach in many scenarios. Many algorithms use convex relaxation methods to solve the l2,0 norm to avoid the NP-hard problem, but this will reduce sparsity and unmixing accuracy. In this paper, a row-hard-threshold function is introduced to solve the l2,0 norm directly, which guarantees the sparsity of the results. The high spatial correlation of hyperspectral images is associated with low column rank; therefore, the low-rank constraint is adopted to utilize spatial information. Experiments with simulated and real data prove that the proposed algorithm can obtain better unmixing results.

종합병원 간호인력에 따른 직무만족${\cdot}$환자만족 비교 (Job Satisfaction and Patient Satisfaction Related to Nurse Staffing)

  • 김종경
    • 간호행정학회지
    • /
    • 제13권1호
    • /
    • pp.98-108
    • /
    • 2007
  • Purpose: The objective of this research was to explore the levels of patient satisfaction and job satisfaction according to the level of nurse manpower, in order to provide effective management for nurses. Methods: The research was conducted from November 1 to December 30, 2006, with a survey of 310 nurses and 240 patients at eight tertiary hospitals in Seoul. Data were collected according to the level of nurse manpower from the first (a nurse vs. patient ratio of below 2.0) to the sixth (a ratio of over 4.0) rank. The survey tools were used Park-Yoon's job satisfaction (1992) and Wandelt and Ager (1974)'s patient satisfaction. The acquired data were analyzed with SPSS $PC^+$ 12.0 program using descriptive methods, ${\chi}^2$ test, ANCOVA, and Scheffe. Results: Overall job satisfaction of nurses showed 3.10 and patient satisfaction of patients showed 4.15. Analysis based on the level of nurse manpower showed that hospitals of first and second rank had higher scores than those of lower rank for nurse's job satisfaction and patient satisfaction. Conclusion: Hospitals with a higher level of nurse manpower showed higher score of nurse's job satisfaction and patient satisfaction.

  • PDF

Cellular Traffic Offloading through Opportunistic Communications Based on Human Mobility

  • Li, Zhigang;Shi, Yan;Chen, Shanzhi;Zhao, Jingwen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권3호
    • /
    • pp.872-885
    • /
    • 2015
  • The rapid increase of smart mobile devices and mobile applications has led to explosive growth of data traffic in cellular network. Offloading data traffic becomes one of the most urgent technical problems. Recent work has proposed to exploit opportunistic communications to offload cellular traffic for mobile data dissemination services, especially for accepting large delayed data. The basic idea is to deliver the data to only part of subscribers (called target-nodes) via the cellular network, and allow target-nodes to disseminate the data through opportunistic communications. Human mobility shows temporal and spatial characteristics and predictability, which can be used as effective guidance efficient opportunistic communication. Therefore, based on the regularity of human mobility we propose NodeRank algorithm which uses the encounter characteristics between nodes to choose target nodes. Different from the existing work which only using encounter frequency, NodeRank algorithm combined the contact time and inter-contact time meanwhile to ensure integrity and availability of message delivery. The simulation results based on real-world mobility traces show the performance advantages of NodeRank in offloading efficiency and network redundant copies.