• 제목/요약/키워드: exhaustive

검색결과 416건 처리시간 0.024초

Development of Query Transformation Method by Cost Optimization

  • Altayeva, Aigerim Bakatkaliyevna;Yoon, Youngmi;Cho, Young Im
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제16권1호
    • /
    • pp.36-43
    • /
    • 2016
  • The transformation time among queries in the database management system (DBMS) is responsible for the execution time of users' queries, because a conventional DBMS does not consider the transformation cost when queries are transformed for execution. To reduce the transformation time (cost reduction) during execution, we propose an optimal query transformation method by exploring queries from a cost-based point of view. This cost-based point of view means considering the cost whenever queries are transformed for execution. Toward that end, we explore and compare set off heuristic, linear, and exhaustive cost-based transformations. Further, we describe practical methods of cost-based transformation integration and some query transformation problems. Our results show that, some cost-based transformations significantly improve query execution time. For instance, linear and heuristic transformed queries work 43% and 74% better than exhaustive queries.

여분소자 라인을 이용한 배열구조의 재구성 방법 (Reconfiguration method for array structures using spare element lines)

  • 김형석;최상방
    • 전자공학회논문지C
    • /
    • 제34C권2호
    • /
    • pp.50-60
    • /
    • 1997
  • Reconfiguration of a memory array using spare rows and columns has been known to be a useful technique to improve the yield. When the numbers of spare rows and scolumns are limited, respectively, the repair problem is known to be NP-complete. In this paper, we propose the reconfiguration algorithm for an array of memory cells using faulty cel clustering, which removes rows and columns algrithm is the simplest reconfiguration method with the time complexity of $O(n^2)$, where n is the number of faulty cells, however the repair rate is very low. Whereas the exhaustive search algorithm has a high repair rate, but the time complexity is $O(2^n)$. The proposed algorithm provides the same repair rate as the exhaustive search algorithm for almost all cases and runs as fast as the greedy method. It has the time complexity of $O(n^3)$ in the worst case. We show that the propsed algorithm provides more efficient solutions than other algorithms using simulations.

  • PDF

Lucifer 형태의 암호화 알고리듬에 관한 연구 (A Study on Lucifer-Type Encryption Algorithm)

  • 강해동;이창순;문상재
    • 대한전자공학회논문지
    • /
    • 제26권3호
    • /
    • pp.32-39
    • /
    • 1989
  • 본 논문에서는 Lucifer의 카이바이트 사용스케줄과 펼쳐진 콘볼루션 레지스터를 변화시키면서 32, 64, 그리고 256비트 블록크기 Lucifer형태의 암호화 알고리듬을 제시하고 이들의 심볼간 상호의존도와 exhaustive 암호 분석의 비도를 비교 조사한다. 또 키이 interruption 위치 변경과 autoclave방식의 대체상자 입력 등의 심볼간 상호의존도를 개선하는 방법들도 제시한다.

  • PDF

Optimal design of reinforced concrete beams: A review

  • Rahmanian, Ima;Lucet, Yves;Tesfamariam, Solomon
    • Computers and Concrete
    • /
    • 제13권4호
    • /
    • pp.457-482
    • /
    • 2014
  • This paper summarizes available literature on the optimization of reinforced concrete (RC) beams. The objective of optimization (e.g. minimum cost or weight), the design variables and the constraints considered by different studies vary widely and therefore, different optimization methods have been employed to provide the optimal design of RC beams, whether as isolated structural components or as part of a structural frame. The review of literature suggests that nonlinear deterministic approaches can be efficiently employed to provide optimal design of RC beams, given the small number of variables. This paper also presents spreadsheet implementation of cost optimization of RC beams in the familiar MS Excel environment to illustrate the efficiency of the exhaustive enumeration method for such small discrete search spaces and to promote its use by engineers and researchers. Furthermore, a sensitivity analysis is performed on the contribution of various design parameters to the variability of the overall cost of RC beams.

Enhanced Hybrid XOR-based Artificial Bee Colony Using PSO Algorithm for Energy Efficient Binary Optimization

  • Baguda, Yakubu S.
    • International Journal of Computer Science & Network Security
    • /
    • 제21권11호
    • /
    • pp.312-320
    • /
    • 2021
  • Increase in computational cost and exhaustive search can lead to more complexity and computational energy. Thus, there is need for effective and efficient scheme to reduce the complexity to achieve optimal energy utilization. This will improve the energy efficiency and enhance the proficiency in terms of the resources needed to achieve convergence. This paper primarily focuses on the development of hybrid swarm intelligence scheme for reducing the computational complexity in binary optimization. In order to reduce the complexity, both artificial bee colony (ABC) and particle swarm optimization (PSO) have been employed to effectively minimize the exhaustive search and increase convergence. First, a new approach using ABC and PSO has been proposed and developed to solve the binary optimization problem. Second, the scout for good quality food sources is accomplished through the deployment of PSO in order to optimally search and explore the best source. Extensive experimental simulations conducted have demonstrate that the proposed scheme outperforms the ABC approaches for reducing complexity and energy consumption in terms of convergence, search and error minimization performance measures.

Machine learning-based categorization of source terms for risk assessment of nuclear power plants

  • Jin, Kyungho;Cho, Jaehyun;Kim, Sung-yeop
    • Nuclear Engineering and Technology
    • /
    • 제54권9호
    • /
    • pp.3336-3346
    • /
    • 2022
  • In general, a number of severe accident scenarios derived from Level 2 probabilistic safety assessment (PSA) are typically grouped into several categories to efficiently evaluate their potential impacts on the public with the assumption that scenarios within the same group have similar source term characteristics. To date, however, grouping by similar source terms has been completely reliant on qualitative methods such as logical trees or expert judgements. Recently, an exhaustive simulation approach has been developed to provide quantitative information on the source terms of a large number of severe accident scenarios. With this motivation, this paper proposes a machine learning-based categorization method based on exhaustive simulation for grouping scenarios with similar accident consequences. The proposed method employs clustering with an autoencoder for grouping unlabeled scenarios after dimensionality reductions and feature extractions from the source term data. To validate the suggested method, source term data for 658 severe accident scenarios were used. Results confirmed that the proposed method successfully characterized the severe accident scenarios with similar behavior more precisely than the conventional grouping method.

RAGMD를 이용한 클러스터 기반의 영상 검색 기법 (Cluster-based Image Retrieval Method Using RAGMD)

  • 정성환;이우선
    • 정보처리학회논문지B
    • /
    • 제9B권1호
    • /
    • pp.113-118
    • /
    • 2002
  • 본 논문에서는 클러스터 기반의 영상 검색 기법을 제시한다. 이 기법은 클러스터링 기법인 RAGMD를 이용하여 유사한 영상들을 클러스터로 분류한 후, 관련 클러스터로부터 영상을 검색하는 방법이다. 영상 검색시에 먼저, 전체 영상 데이터베이스를 차례대로 일일이 검색하는 것이 아니라, 질의 영상과 유사한 클러스터인 유사 영상 소집단에서 검색한다. 그러므로 이 방법은 직접 검색(Exhaustive Retrieval)과 거의 같은 검색 정밀도(Precision)를 유지하면서 검색 시간을 단축할 수 있다. 약 2,400개의 실제 영상들로 구성된 영상 데이터베이스를 사용한 실험에서, 제안된 검색 방법이 직접 검색과 거의 같은 정밀도를 유지하면서 약 18배의 빠른 검색 시간을 보였으며, 질의 영상과 같은 클래스에 속한 유사한 영상들을 더 많이 검색하는 것으로 나타났다.

PS-LTE 환경에서 최적기지국 위치 선정 (Optimal Positioning of the Base Stations in PS-LTE Systems)

  • 김현우;이상훈;윤현구;최용훈
    • 한국통신학회논문지
    • /
    • 제41권4호
    • /
    • pp.467-478
    • /
    • 2016
  • 본 논문에서는 PS-LTE(Public Safety-Long Term Evolution) 환경에서 단독기지국의 설치에 있어서 전체 사용자의 데이터 처리량을 최대화하는 PSO(Particle Swarm Optimization)기반의 최적기지국 위치 선정 방법을 제안한다. 또한 전체 재난 지역을 탐색하여 최적의 위치를 찾는 완전탐색(Exhaustive Search) 방법, 임의보행(Random Walk) 이동모형을 적용하여 위치를 선정하는 방법, 기지국 균일 배치방법과의 성능을 비교하였다. 제안하는 방법의 경우 모든 지역을 탐색하여 최적위치를 찾는 완전탐색 방법과 유사한 최적위치 및 전체 사용자의 데이터 처리량(Throughput)을 갖지만, 최적해 수렴시간에 있어서 완전탐색의 경우 재난지역의 크기가 커질수록 증가하지만, 제안하는 방법 경우 빠른 수렴 시간 및 거의 일정한 수렴시간을 갖는 것을 알 수 있다.

Anti-fatigue effects of Elaeagnus multiflora fruit extracts in mice

  • Jung, Myung-A;Jo, Ara;Shin, Jawon;Kang, Huwon;Kim, Yujin;Oh, Dool-Ri;Choi, Chul-yung
    • Journal of Applied Biological Chemistry
    • /
    • 제63권1호
    • /
    • pp.69-74
    • /
    • 2020
  • The fruit, leaves, and roots of Elaeagnus multiflora Thunb. have been used in traditional Chinese medicine to treat cough, diarrhea, and itching. However, the anti-fatigue effects of E. multiflora fruit (EMF) extract have not been studied in detail. The aim of this study was to examine the effect of EMF on fatigue and exercise performance in BALB/c mice. EMF was orally administered to mice at four doses (10, 50, 100, and 200 mg/kg/day) for 2 weeks. The anti-fatigue activity was evaluated by determining the exhaustive swimming time. Blood lactate and glucose levels and serum lactate levels after a 10 min swimming time, as well as ammonia, creatine kinase (CK), blood urea nitrogen (BUN), lactate dehydrogenase (LDH), and glycogen contents after exhaustive swimming time were measured. The exhaustive swimming time of the EMF 200 group was significantly increased (p <0.01). The EMF groups showed significantly low levels of CK, BUN, LDH, and lactate compared with the control group (p <0.05). Increased liver glycogen was observed in the EMF 200 group (p <0.05). These results suggest that EMF can be utilized as an efficacious natural resource for its anti-fatigue effects.

데이터마이닝 기법을 활용한 불법주차 영향요인 분석 (A Study on the Analysis Effect Factors of Illegal Parking Using Data Mining Techniques)

  • 이창희;김명수;서소민
    • 한국ITS학회 논문지
    • /
    • 제13권4호
    • /
    • pp.63-72
    • /
    • 2014
  • 우리나라는 급속한 경제발전과 고속성장으로 생활수준이 향상되면서 자동차 수요가 급격히 증가함에 따라 교통혼잡, 교통사고, 주차문제 등의 문제가 발생되고 있다. 자동차 증가로 인한 주차문제 중 불법주차는 교통혼잡을 야기하고 주차공간으로 인한 이웃간 분쟁의 원인이 되어 사회적 문제로 대두되고 있다. 이에 본 연구에서는 지방 광역시중 승용차 수단분담률이 높음에도 불구하고 불법주차 단속건수가 상대적을 적은 대전광역시를 대상으로 주차조사를 실시하였으며 불법주차에 대한 원론적인 문제를 파악하기 위해 의사결정나무모형 Exhaustive CHAID분석을 통하여 운전자들의 주차행위에 있어 불법주차를 선택하는 과정과 그에 따른 영향요인을 탐색하여 불법주차의 원인을 파악하고 해결하는 방안을 제시하고자 한다. 분석결과 불법주차를 선택하는 영향요인으로는 거리, 단속경험, 직업, 이용시간대 순으로 영향을 미치는 것으로 나타났으며 예측 모형은 최종적으로 4가지 노드가 도출되었다. 분석결과에 따른 불법주차의 해결방안으로는 공영주차장의 추가설치와 생계유지 및 조업차량의 주차공간 확보가 우선되어야 하고 불법주차 단속강화와 시민의식 고취를 위한 캠페인의 활성화가 필요하다.