• Title/Summary/Keyword: optimal pairs

Search Result 153, Processing Time 0.028 seconds

Effect of Piezoactuator Length Variation for Vibration Control of Beams (보의 진동제어를 위한 압전 액추에이터의 길이변화 효과 연구)

  • Lee, Young-Sup
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.18 no.11
    • /
    • pp.1185-1191
    • /
    • 2008
  • This paper presents an approach to define an optimal piezoactuator length to actively control structural vibration. The optimal ratio of the piezoactuator length against the beam length when a pair of piezoceramic actuator and accelerometer is used to suppress unwanted vibration with direct velocity feedback(DVFB) control strategy is not clearly defined so far. It is well known that DVFB control can be very useful when a pair of sensor and actuator is collocated on structures with a high gain and excellent stability. It is considered that three different collocated Pairs of piezoelectric actuators (20, 50 and 100 mm long) and accelerometers installed on three identical clamped-clamped beams($30{\times}20{\times}1mm$). The response of each sensor-actuator pair requires strictly positive real(SPR) property to apply a high feedback gain. However the length of the piezoactuator affects the SPR property of the sensor-actuator response. Intensive simulation and experiment show the effect of the actuator length variation is strongly related with the frequency range of the SPR property. Thus an optimal length ratio was suggested to obtain relevant performance with a good stability under the DVFB strategy.

Optimal Offer Strategies for Energy Storage System Integrated Wind Power Producers in the Day-Ahead Energy and Regulation Markets

  • Son, Seungwoo;Han, Sini;Roh, Jae Hyung;Lee, Duehee
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.6
    • /
    • pp.2236-2244
    • /
    • 2018
  • We make optimal consecutive offer curves for an energy storage system (ESS) integrated wind power producer (WPP) in the co-optimized day-ahead energy and regulation markets. We build the offer curves by solving multi-stage stochastic optimization (MSSO) problems based on the scenarios of pairs consisting of real-time price and wind power forecasts through the progressive hedging method (PHM). We also use the rolling horizon method (RHM) to build the consecutive offer curves for several hours in chronological order. We test the profitability of the offer curves by using the data sampled from the Iberian Peninsula. We show that the offer curves obtained by solving MSSO problems with the PHM and RHM have a higher profitability than offer curves obtained by solving deterministic problems.

Method of Deciding Optimal Double Pairs When Players are Ordered (실력이 순서화된 경우에 대한 복식조 편성방법)

  • Cho, Dae-Hyeon
    • The Korean Journal of Applied Statistics
    • /
    • v.22 no.6
    • /
    • pp.1331-1343
    • /
    • 2009
  • In this paper, we are interested in tennis games and the best of all matches that is fair to most of all participants. Especially when players are ordered in accordance with their playing ability, we are interested in finding the best of all matches that is even with each other's playing pair. We propose a loss function And using our proposed loss function, we get a best match that obtains the minimal loss according to the number of games for given participants.

Cyclic Vector Multiplication Algorithm Based on a Special Class of Gauss Period Normal Basis

  • Kato, Hidehiro;Nogami, Yasuyuki;Yoshida, Tomoki;Morikawa, Yoshitaka
    • ETRI Journal
    • /
    • v.29 no.6
    • /
    • pp.769-778
    • /
    • 2007
  • This paper proposes a multiplication algorithm for $F_{p^m}$, which can be efficiently applied to many pairs of characteristic p and extension degree m except for the case that 8p divides m(p-1). It uses a special class of type- Gauss period normal bases. This algorithm has several advantages: it is easily parallelized; Frobenius mapping is easily carried out since its basis is a normal basis; its calculation cost is clearly given; and it is sufficiently practical and useful when parameters k and m are small.

  • PDF

Method of Deciding Optimal Double Pairs (라운드로빙 방식을 응용한 복식조 편성방법)

  • Cho, Dae-Hyeon
    • The Korean Journal of Applied Statistics
    • /
    • v.21 no.6
    • /
    • pp.1015-1026
    • /
    • 2008
  • In this paper, we are interested in tennis games and the best of all matches that is fair to most of all participants. We introduce a loss function. And using our introduced loss function and round robin method, we get a best match that obtains the minimal loss according to the number of participants.

Decision Making Model for Optimal Earthwork Allocation Planning (최적 토량배분 계획을 위한 의사결정 모델)

  • Gwak, Han-Seong;Seo, Byoung-Wook;Lee, Dong-Eun
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2016.05a
    • /
    • pp.162-163
    • /
    • 2016
  • This paper presents a mathematical model for optimizing earthwork allocation plan that minimizes earthwork cost. The model takes into account operational constraints in the real-world earthwork such as material-type (i.e., quality level of material) and quantities excavated from cut-sections, required quality of material and quantities for each embankment layer, top-down cutting and bottom-up filling constraints, and allocation orders. These constraints are successfully handled by assuming the rock-earth material as the three dimensional (3D) blocks. The study is of value to project scheduler because the model identifies the optimal earth allocation plan (i.e., haul direction (cut and fill pairs), quantities of soil, type of material, and order of allocations) expeditiously and is developed as an automated system for usability. It is also relevant to estimator in that it computes more realistic earthworks costs estimation. The economic impact and validity of the mathematical model was confirmed by performing test cases.

  • PDF

Color image quantization considering distortion measure of local region block on RGB space (RGB 공간상의 국부 영역 블록의 왜곡척도를 고려한 칼라 영상 양자화)

  • 박양우;이응주;김경만;엄태억;하영호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.4
    • /
    • pp.848-854
    • /
    • 1996
  • Many image display devices allow only a limited number of colors to be simultaneously displayed. in disphaying of natural color image using color palette, it is necessary to construct an optimal color palette and the optimal mapping of each pixed of the original image to a color from the palette. In this paper, we proposed the clustering algorithm using local region block centered one color cluster in the prequantized 3-D histogram. Cluster pairs which have the least distortion error are merged by considering distortion measure. The clustering process is continued until to obtain the desired number of colors. The same as the clustering process, original color value. The proposed algorithm incroporated with a spatial activity weighting value which is reflected sensitivity of HVS quantization errors in smoothing region. This method produces high quality display images and considerably reduces computation time.

  • PDF

Optimal Algorithm of Path in the Part-Matching Process (부품 조립 공정에서 경로의 최적화 알고리즘)

  • Oh, Je-Hui;Cha, Young-Youp
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.14 no.8
    • /
    • pp.122-129
    • /
    • 1997
  • In this paper, we propose a Hopfield model for solving the part-matching in case that is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and total path of part-connections. Therefore, this kind of problem is referred to as a combinatiorial optimization problem. First of all, we review the theoretical basis for Hopfield model and present two optimal algorithms of part-matching. The first algorithm is Traveling Salesman Problem(TSP) which improved the original and the second algorithm is Wdighted Matching Problem (WMP). Finally, we show demonstration through com- puter simulation and analyze the stability and feasibility of the generated solutions for the proposed con- nection methods. Therefore, we prove that the second algorithm is better than the first algorithm.

  • PDF

Optimization of a microarray for fission yeast

  • Kim, Dong-Uk;Lee, Minho;Han, Sangjo;Nam, Miyoung;Lee, Sol;Lee, Jaewoong;Woo, Jihye;Kim, Dongsup;Hoe, Kwang-Lae
    • Genomics & Informatics
    • /
    • v.17 no.3
    • /
    • pp.28.1-28.9
    • /
    • 2019
  • Bar-code (tag) microarrays of yeast gene-deletion collections facilitate the systematic identification of genes required for growth in any condition of interest. Anti-sense strands of amplified bar-codes hybridize with ~10,000 (5,000 each for up-and down-tags) different kinds of sense-strand probes on an array. In this study, we optimized the hybridization processes of an array for fission yeast. Compared to the first version of the array (11 ㎛, 100K) consisting of three sectors with probe pairs (perfect match and mismatch), the second version (11 ㎛, 48K) could represent ~10,000 up-/ down-tags in quadruplicate along with 1,508 negative controls in quadruplicate and a single set of 1,000 unique negative controls at random dispersed positions without mismatch pairs. For PCR, the optimal annealing temperature (maximizing yield and minimizing extra bands) was 58℃ for both tags. Intriguingly, up-tags required 3× higher amounts of blocking oligonucleotides than down-tags. A 1:1 mix ratio between up- and down-tags was satisfactory. A lower temperature (25℃) was optimal for cultivation instead of a normal temperature (30℃) because of extra temperature-sensitive mutants in a subset of the deletion library. Activation of frozen pooled cells for >1 day showed better resolution of intensity than no activation. A tag intensity analysis showed that tag(s) of 4,316 of the 4,526 strains tested were represented at least once; 3,706 strains were represented by both tags, 4,072 strains by up-tags only, and 3,950 strains by down-tags only. The results indicate that this microarray will be a powerful analytical platform for elucidating currently unknown gene functions.

Searching for Optimal Ensemble of Feature-classifier Pairs in Gene Expression Profile using Genetic Algorithm (유전알고리즘을 이용한 유전자발현 데이타상의 특징-분류기쌍 최적 앙상블 탐색)

  • 박찬호;조성배
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.4
    • /
    • pp.525-536
    • /
    • 2004
  • Gene expression profile is numerical data of gene expression level from organism, measured on the microarray. Generally, each specific tissue indicates different expression levels in related genes, so that we can classify disease with gene expression profile. Because all genes are not related to disease, it is needed to select related genes that is called feature selection, and it is needed to classify selected genes properly. This paper Proposes GA based method for searching optimal ensemble of feature-classifier pairs that are composed with seven feature selection methods based on correlation, similarity, and information theory, and six representative classifiers. In experimental results with leave-one-out cross validation on two gene expression Profiles related to cancers, we can find ensembles that produce much superior to all individual feature-classifier fairs for Lymphoma dataset and Colon dataset.