• Title/Summary/Keyword: Minimum Performance

Search Result 3,174, Processing Time 0.027 seconds

On the Application for Minimum Server Cores in Public Sector (공공부문 도입서버의 최소코어수 적용에 관한 고찰)

  • Lee, Tae-Hoon;Ra, Jong-Hei
    • Journal of Digital Convergence
    • /
    • v.9 no.3
    • /
    • pp.213-223
    • /
    • 2011
  • Today, information resource management is key task in the data-centre as like as NCIA(National computing integration Agency of Korea). In IRM, the server's performance is one of the core elements, it must be importantly managed during whole of system life cycle. As first step of such management is in purchase phase, it is very important that the optimum specification is determined. The server's specification contains such as performance of core, criteria for performance verification, minimum cores, etc. There is constant controversy concerning the minimum cores. In this article, we present criteria for determination of the minimum cores that considered three aspects: (1) Costly aspect as TCO(Total Cost of Ownership, (2) Environmental aspect as Green IT (3) Technical aspect as RAS(Reliability, Availability, Serviceability) functionality. Finally, we propose scheme to ideally determinate the minimum cores.

A Minimum Interference Channel Assignment Algorithm for Performance Improvement of Large-Scale Wireless Mesh Networks (대규모 무선 메쉬 네트워크의 성능 향상을 위한 최소 간섭 채널 할당 알고리즘)

  • Ryu, Min-Woo;Cha, Si-Ho;Cho, Kuk-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.964-972
    • /
    • 2009
  • Wireless mesh network (WMN) is emerging a future core technology to resolve many problems derived from exist wireless networks by employing multi-interface and multi-channel. Ability to utilize multiple channels in WMNs substantially increases the effective bandwidth available to wireless network nodes. However, minimum interference channel assignment algorithms are required to use the effective bandwidth in multi-channel environments. This paper proposes a cluster-based minimum interference channel assignment (MI-CA) algorithm to improve the performance of WMN. The MI-CA algorithm is consists of Inter-Cluster and Intra-Cluster Intrchannel assignment between clusters and in the internal clusters, respectively. The Inter-Cluster channel assignment assigns a barebone channel to cluster heads and border nodes based on minimum spanning tree (MST) and the Intra-Cluster channel assignment minimizes channel interference by reassigning ortasgonal channels between cluster mespann. Our simheation results show that MI-CA can improve the performance of WMNs by minimizing channel interference.

Optimization of Fermentation Processes with Singular Approximation and Minimum Principle (Singular Approximation과 Minimum Principle을 이용한 발효공정의 최적화)

  • 이중헌;정재철;박영훈
    • Microbiology and Biotechnology Letters
    • /
    • v.27 no.3
    • /
    • pp.223-229
    • /
    • 1999
  • The two optimal control algorithms, singular approximation and minimum principle, were compared in this paper. The switching time with singular approximation was determined with mathematical derivation and the optimal control profile of specific growth rate was also calculated with minimum principle. The optimal control profiles were calculated by making simple model correlating the specific cell growth rate and specific product formation rate. The optimal control profiles calculated by singular approximation approach were similar to stepwise form of those calculatd by minimum principles. With the minimum principle, the product concentration was 8% more than that of singular approximation. This performance difference was due to a linearization of a nonlinear function with singular approximation. This optimal approaches were applicable to any system with different optimal cell growth and product formation.

  • PDF

Applying Genetic Algorithm to the Minimum Vertex Cover Problem (Minimum Vertex Cover 문제에 대한 유전알고리즘 적용)

  • Han, Keun-Hee;Kim, Chan-Soo
    • The KIPS Transactions:PartB
    • /
    • v.15B no.6
    • /
    • pp.609-612
    • /
    • 2008
  • Let G = (V, E) be a simple undirected graph. The Minimum Vertex Cover (MVC) problem is to find a minimum subset C of V such that for every edge, at least one of its endpoints should be included in C. Like many other graph theoretic problems this problem is also known to be NP-hard. In this paper, we propose a genetic algorithm called LeafGA for MVC problem and show the performance of the proposed algorithm by applying it to several published benchmark graphs.

Performance Analysis of Linear Array Antenna for Anti-jamming GPS Systems (항재밍 GPS 시스템을 위한 선형 어레이 안테나 성능 분석)

  • Kim, Kiyun
    • Journal of Satellite, Information and Communications
    • /
    • v.10 no.4
    • /
    • pp.46-51
    • /
    • 2015
  • In this paper, I design a linear array antenna simulator for anti-jamming GPS systems and perform various performance analysis by simulation. First, I generate simulated transmission signals through the analysis of GPS satellite signal structure, and analyze SNR(Signal to Noise power Ratio) performance of linear array antenna according to number of arrays under noise environments. In addition, I analyze the performance of the anti-jamming beam pattern using MMSE(Minimum Mean Square Error) signal processing method, and also analyze the anti-jamming performance considering antenna calibration problem when there are different delays between arrays.

Plot Size for Investigating Forest Community Structure(II) -Adequate Plot Area of Tree Stratum in a Mixed Forest Community at T$\v{o}$kyusan Area- (삼림군집구조 조사를 위한 조사구 크기에 관한 연구(II) -덕유산지역 혼효림군집 교목층의 적정 조사구 면적-)

  • Park, In-Hyeop;Ryu, Chang-Hee;Cho, Woo
    • Korean Journal of Environment and Ecology
    • /
    • v.7 no.2
    • /
    • pp.187-191
    • /
    • 1994
  • A mixed forest community in Tokyusan was studied to determine the adequate plot area of tree stratum for investigating forest community structure. Nineteen nested plots were set up in the studied forest community, and species-area curve and performance curve were established. According to species-area curve, the minimum plot area where a given percentage increase in plot area produced less than the same percentage increase in number of species was 500$m^2$. The minimum plot area where a given percentage increase in plot area produced less than the half of the percentage increase in number of species was 1,000$m^2$. According to performance curve of the importance values of the major species, the minimum plot area where the importance value of the major species was distinguished from each other was 900$m^2$, and the minimum plot area was 500$m^2$ except for a big tree of Pinus densiflora distributed unexpectedly. According to performance curve of species diversity, the minimum plot area was 400$m^2$. Similarity indices between plot area above 900$m^2$ and total plot area were more than 90% and similarity indices between plot area above 400$m^2$ and total plot area were more than 85%. It may be as a conclusion that minimum plot area was generally about 500$m^2$ and in case of requiring more accuracy, minimum plot area was about 1,000$m^2$.

  • PDF

Effect of connection rotation capacities on seismic performance of IMF systems

  • Han, Sang Whan;Moon, Ki-Hoon;Ha, Sung Jin
    • Earthquakes and Structures
    • /
    • v.10 no.1
    • /
    • pp.73-89
    • /
    • 2016
  • The seismic performance of moment frames could vary according to the rotation capacity of their connections. The minimum rotation capacity of moment connections for steel intermediate moment frames (IMF) was defined as 0.02 radian in AISC 341-10. This study evaluated the seismic performance of IMF frames with connections having a rotation capacity of 0.02 radian. For this purpose, thirty IMFs were designed according to current seismic design provisions considering different design parameters such as the number of stories, span length, and seismic design categories. The procedure specified in FEMA P695 was used for conducting seismic performance evaluation. It was observed that the rotation capacity of 0.02 radian could not guarantee the satisfactory seismic performance of IMFs. This study also conducted seismic performance evaluation for IMFs with connections having the rotation capacity of 3% and ductile connections for proposing the minimum rotation capacity of IMF connections.

Bus Reconfiguration Strategy Based on Local Minimum Tree Search for the Event Processing of Automated Distribution Substation (자동화된 변전소의 이벤트 발생시 준최적 탐색법에 기반한 모선 재구성 전략의 개발)

  • Ko Yun-Seok
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.53 no.10
    • /
    • pp.565-572
    • /
    • 2004
  • This paper proposes an expert system which can enhance the accuracy of real-time bus reconfiguration strategy by adopting local minimum tree search method and minimize the spreading effect of the fault by considering totally the operating condition when a main transformer fault occurs in the automated substation. The local minimum tree search method to expand the best-first search method. This method has an advantage which can improve the performance of solution within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. And, second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules for the obtained switching candidate set. Also, this paper studies the generalized distribution substation modelling using graph theory and a substation database is designed based on the study result. The inference engine of the expert system and the substation database is implemented in MFC function of Visual C++. Finally, the performance and effectiveness of the proposed expert system is verified by comparing the best-first search solution and local minimum tree search solution based on diversity event simulations for typical distribution substation.

Analysis of computational fluid dynamics on design of nozzle for integrated cryogenic gas and MQL(minimum quantity lubrication) (극저온 가스와 MQL(minimum quantity lubrication)의 복합 분사를 위한 하이브리드 노즐 설계에 관한 전산유체역학 해석)

  • Song, Ki-Hyeok;Shin, Bong-Cheol;Yoon, Gil-Sang;Ha, Seok-Jae
    • Design & Manufacturing
    • /
    • v.13 no.3
    • /
    • pp.41-47
    • /
    • 2019
  • In conventional machining, the use of cutting fluid is essential to reduce cutting heat and to improve machining quality. However, to increase the performance of cutting fluids, various chemical components have been added. However, these chemical components during machining have a negative impact on the health of workers and cutting environment. In current machining, environment-friendly machining is conducted using MQL (minimum quantity lubrication) or cryogenic air spraying to minimize the harmful effects. In this study, the injection nozzle that can combined injecting minimum quantity lubrication(MQL) and cryogenic gas was designed and the shape optimization was performed by using computational fluid dynamics(CFD) and design of experiment(DOE). Performance verification was performed for the designed nozzle. The diameter of the sprayed fluid at a distance of 30 mm from the nozzle was analyzed to be 21 mm. It was also analyzed to lower the aerosol temperature to about 260~270K.

Minimum Row Weight and Polar Spectrum Based Puncture Polar Codes Construction Algorithm

  • Liu Daofu;Guo Rui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.8
    • /
    • pp.2157-2169
    • /
    • 2023
  • In order to handle the problem that puncture patterns will change the position distribution of original information bits and frozen bits in polar codes, which affects performance of puncture polar codes further, a minimum row weight and polar spectrum based puncture polar codes construction algorithm (called PA-MRWP) is proposed in this paper. The algorithm calculates row weight of generator matrix and sorts the row weight in ascending order first. Next, the positions with the minimum row weight are selected as initial puncture positions. If the rows with the same row weight cannot all be punctured, polar spectrum based auxiliary puncture scheme is used. In sub-channels with the same row weight, rows corresponding to the polarized sub-channels with higher reliability are selected as puncture positions to construct puncture vector, and the reliability is calculated based on polar spectrum. It is actually a two-step selection strategy, the proposed minimum row weight puncture (MRWP) algorithm is used for primary selection and polar spectrum based auxiliary puncture is used for adjustment. Simulation results show that, compared with worst quality puncture (WQP) algorithm, the proposed PA-MRWP algorithm and Gaussian approximation-aided minimum row weight puncture (GA-MRWP) algorithm provide gains of about 0.46 dB and 0.29 dB at bit error rate (BER) of 10-4, respectively when code length N=400, code rate R=1/2. In addition, the proposed puncture algorithms improve the BER performance significantly with respect to quasi-uniform puncture (QUP) algorithm.