• 제목/요약/키워드: Selection efficiency

검색결과 1,643건 처리시간 0.029초

CAPP에서 공정계획 선정을 위한 유전 알고리즘 접근 (A Genetic Algorithm A, pp.oach for Process Plan Selection on the CAPP)

  • 문치웅;김형수;이상준
    • 지능정보연구
    • /
    • 제4권1호
    • /
    • pp.1-10
    • /
    • 1998
  • Process planning is a very complex task and requires the dynamic informatioon of shop foor and market situations. Process plan selection is one of the main problems in the process planning. In this paper, we propose a new process plan selection model considering operation flexibility for the computer aided process planing. The model is formulated as a 0-1 integer programming considering realistic shop factors such as production volume, machining time, machine capacity, transportation time and capacity of tractors such as production volume, machining time, machine capacity, transportation time capacity of transfer device. The objective of the model is to minimize the sum of the processing and transportation time for all parts. A genetic algorithm a, pp.oach is developed to solve the model. The efficiency of the proposed a, pp.oach is verified with numerical examples.

  • PDF

PBS(Pairwise Broadcast Synchronization)를 위한 노드 쌍 선택 알고리즘 (Pair-nodes Selection Algorithm for PBS (Pairwise Broadcast Synchronization))

  • 배시규
    • 한국멀티미디어학회논문지
    • /
    • 제21권11호
    • /
    • pp.1288-1296
    • /
    • 2018
  • PBS(Pairwise Broadcast Synchronization) is a well-known synchronization scheme for WSN(Wireless Sensor Networks). As PBS needs the set of node-pairs for network-wide synchronization by over-hearing, GPA(Group-Wise Pair Selection Algorithm) was also proposed after PBS. However, GPA is complex and requires too many message transmissions, leading to much power consumption. Besides, GPA is not appropriate to topology change or mobile wireless sensor networks. So, we propose a new and energy-efficient pair-node selection algorithm for PBS. The proposed scheme's performance has been evaluated and compared with GPA by simulation. The results are shown to be better than GPA.

A Parameter Selection Method for Multi-Element Resonant Converters with a Resonant Zero Point

  • Wang, Yifeng;Yang, Liang;Li, Guodong;Tu, Shijie
    • Journal of Power Electronics
    • /
    • 제18권2호
    • /
    • pp.332-342
    • /
    • 2018
  • This paper proposes a parameter design method for multi-element resonant converters (MERCs) with a unique resonant zero point (RZP). This method is mainly composed of four steps. These steps include program filtration, loss comparison, 3D figure fine-tuning and priority compromise. It features easy implementation, effectiveness and universal applicability for almost all of the existing RZP-MERCs. Meanwhile, other design methods are always exclusive for a specific topology. In addition, a novel dual-CTL converter is also proposed here. It belongs to the RZP-MERC family and is designed in detail to explain the process of parameter selection. The performance of the proposed method is verified experimentally on a 500W prototype. The obtained results indicate that with the selected parameters, an extensive dc voltage gain is obtained. It also possesses over-current protection and minimal switching loss. The designed converter achieves high efficiencies among wide load ranges, and the peak efficiency reaches 96.9%.

MDPDE의 조율모수 선택에 관한 연구 (A study on tuning parameter selection for MDPDE)

  • 유동현;김병수
    • Journal of the Korean Data and Information Science Society
    • /
    • 제26권3호
    • /
    • pp.549-559
    • /
    • 2015
  • MDPDE는 이상치에 강건한 성질을 가진 추정량으로써 최대우도추정량의 대안으로 많은 연구자들에 의해 연구되어 왔다. MDPDE는 조율모수에 따라 성질이 변하게 되는데, 로버스트성과 점근효율성이 서로 상충하는 현상으로 인해 최적의 조율모수를 선택하는 것은 쉽지 않다. 본 연구에서는 MDPDE의 최적의 조율모수를 선택하는 방법으로 Fujisawa와 Eguchi (2006)가 제시한 방법과 Warwick (2006)이 제시한 방법을 소개하고, 모의실험을 통해 비교분석하였다. 연구 결과 Warwick (2006)의 방법은 특정한 경우 매우 작은 조율모수를 선택하게 될 수도 있다는 사실을 알 수 있었는데, 같은 경우에 Fujisawa와 Eguchi (2006)의 방법은 이러한 현상을 보이지 않았다. 따라서, Fujisawa와 Eguchi (2006)의 방법이 범용적으로 사용하기에 적절하다고 판단된다.

Screening methods for drought and salinity tolerance with transgenic rice seedlings

  • Song, Jae-Young;Song, Seon-Kyeong;Yu, Dal-A;Kim, Me-Sun;Kang, Kwon Kyoo;Cho, Yong-Gu
    • 한국작물학회:학술대회논문집
    • /
    • 한국작물학회 2017년도 9th Asian Crop Science Association conference
    • /
    • pp.165-165
    • /
    • 2017
  • Abiotic stress is one of the major serious limiting factors in rice (Oryza sativa) and caused rice production losses. It is important to precisely screen valuable genetic resources for improving stress tolerance and understanding tolerance mechanism to abiotic stresses. Because there are differences of experiment designs for screening of tolerant plant in several studies related to abiotic stress, this study has performed to provide the rapid and efficiency screening method for selection of tolerance rice to drought and salinity stresses. Two week-old rice seedlings that reached about three leaf stage were treated with drought and salinity stresses and examined tolerant levels with tolerant and susceptible control varieties, and transgenic plants. To determine the optimum concentration for the selection of drought and salinity condition, tolerant, susceptible and wild-type plants were grown under three soil moisture contents (5, 10 and 20% water contents) and three NaCl concentrations (100, 200 and 250 mM) for 10 days at seedling stage. 200 mM NaCl concentration and 5% moisture content soil were determined as the optimum conditions, respectively. The described methodologies in this study are simple and efficiency and might help the selection of drought and salinity tolerance plants at the 3,4-leaf-seedling stage.

  • PDF

A New Cluster Head Selection Technique based on Remaining Energy of Each Node for Energy Efficiency in WSN

  • Subedi, Sagun;Lee, Sang-Il;Lee, Jae-Hee
    • International journal of advanced smart convergence
    • /
    • 제9권2호
    • /
    • pp.185-194
    • /
    • 2020
  • Designing of a hierarchical clustering algorithm is one of the numerous approaches to minimize the energy consumption of the Wireless Sensor Networks (WSNs). In this paper, a homogeneous and randomly deployed sensor nodes is considered. These sensors are energy constrained elements. The nominal selection of the Cluster Head (CH) which falls under the clustering part of the network protocol is studied and compared to Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. CHs in this proposed process is the function of total remaining energy of each node as well as total average energy of the whole arrangement. The algorithm considers initial energy, optimum value of cluster heads to elect the next group of cluster heads for the network as well as residual energy. Total remaining energy of each node is compared to total average energy of the system and if the result is positive, these nodes are eligible to become CH in the very next round. Analysis and numerical simulations quantify the efficiency and Average Energy Ratio (AER) of the proposed system.

In Vitro Selection of Hammerhead Ribozymes with Optimized Stems I and III

  • Sim, So-Yeong;Kim, Se-Mi;Kim, Ha-Dong;Ahn, Jeong-Keun;Lee, Young-Hoon;Cho, Bong-Rae;Park, In-Won
    • BMB Reports
    • /
    • 제31권2호
    • /
    • pp.177-182
    • /
    • 1998
  • A pool of cis-acting hammerhead ribozymes randomized in their substrate recognition sequences was constructed. A variety of active cis-acting ribozymes which had various structures of stems I and III was selected from the pool by in vitro selection. The selected ribozymes were cloned and sequenced. The relationship between the cleavage efficiency and base-pairing in stems I and III of the selected ribozymes was investigated. The ribozymes with the smaller difference in folding energies between the active conformation and the stable but inactive conformation showed a tendency to have the better cleavage efficiency. The optimum length of stem I was 5 or 6 bases while the longer stem III, in general, appeared to be required for efficient cleavage. The specificity of the ribozyme reaction is discussed in terms of the length of stems I and III.

  • PDF

A Novel Technique for Detection of Repacked Android Application Using Constant Key Point Selection Based Hashing and Limited Binary Pattern Texture Feature Extraction

  • MA Rahim Khan;Manoj Kumar Jain
    • International Journal of Computer Science & Network Security
    • /
    • 제23권9호
    • /
    • pp.141-149
    • /
    • 2023
  • Repacked mobile apps constitute about 78% of all malware of Android, and it greatly affects the technical ecosystem of Android. Although many methods exist for repacked app detection, most of them suffer from performance issues. In this manuscript, a novel method using the Constant Key Point Selection and Limited Binary Pattern (CKPS: LBP) Feature extraction-based Hashing is proposed for the identification of repacked android applications through the visual similarity, which is a notable feature of repacked applications. The results from the experiment prove that the proposed method can effectively detect the apps that are similar visually even that are even under the double fold content manipulations. From the experimental analysis, it proved that the proposed CKPS: LBP method has a better efficiency of detecting 1354 similar applications from a repository of 95124 applications and also the computational time was 0.91 seconds within which a user could get the decision of whether the app repacked. The overall efficiency of the proposed algorithm is 41% greater than the average of other methods, and the time complexity is found to have been reduced by 31%. The collision probability of the Hashes was 41% better than the average value of the other state of the art methods.

DEA/AHP 모형을 이용한 R&D 프로젝트 선정모형 및 Web 기반 R&D 프로젝트 선정시스템 개발 (Development of R&D Project Selection Model and Web-based R&D Project Selection System using Hybrid DEA/AHP Model)

  • 이덕주;배성식;강진수
    • 대한산업공학회지
    • /
    • 제32권1호
    • /
    • pp.18-28
    • /
    • 2006
  • Some issues which should be considered in an R&D project selection problem are as follows: First, quantitative analysis on the efficiencies of R&D projects is required to guarantee objective validity in the evaluation of the projects. For this reason, the methodology for selecting R&D projects should be based on mathematical models that perform quantitative analysis. Second, in general there are ordinal factors like Likert-scale in the data for evaluating R&D projects. Previous researches, however, couldn't suggest explicit methods incorporating these ordinal factors into models. Third, for the R&D project selection problems with limited resources like budget, it is necessary to decide the perfect ranking of the all projects. This paper develops a mathematical model that can be applicable to the problems of selecting R&D projects with the previous features. In this paper, we improve the original DEA model for evaluating efficiency to incorporate ordinal factors and suggest a new model which can decide the perfect ranking of all projects by merging the improved DEA model and AHP method. Furthermore a web-based R&D project selection system using the DEA/AHP model suggested in this paper is developed and illustrated.

Swarm Intelligence-based Power Allocation and Relay Selection Algorithm for wireless cooperative network

  • Xing, Yaxin;Chen, Yueyun;Lv, Chen;Gong, Zheng;Xu, Ling
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권3호
    • /
    • pp.1111-1130
    • /
    • 2016
  • Cooperative communications can significantly improve the wireless transmission performance with the help of relay nodes. In cooperative communication networks, relay selection and power allocation are two key issues. In this paper, we propose a relay selection and power allocation scheme RS-PA-PSACO (Relay Selection-Power Allocation-Particle Swarm Ant Colony Optimization) based on PSACO (Particle Swarm Ant Colony Optimization) algorithm. This scheme can effectively reduce the computational complexity and select the optimal relay nodes. As one of the swarm intelligence algorithms, PSACO which combined both PSO (Particle Swarm Optimization) and ACO (Ant Colony Optimization) algorithms is effective to solve non-linear optimization problems through a fast global search at a low cost. The proposed RS-PA-PSACO algorithm can simultaneously obtain the optimal solutions of relay selection and power allocation to minimize the SER (Symbol Error Rate) with a fixed total power constraint both in AF (Amplify and Forward) and DF (Decode and Forward) modes. Simulation results show that the proposed scheme improves the system performance significantly both in reliability and power efficiency at a low complexity.