• Title/Summary/Keyword: gray optimization

Search Result 41, Processing Time 0.027 seconds

Fast Response Driving of TFT LCD for Motion Picture

  • Choi, Yu-Jin;Mo, Soon-Hee;Bae, Young-Min;Lim, Young-Jin
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2002.08a
    • /
    • pp.449-451
    • /
    • 2002
  • We reported the algorithm of driving scheme that enhances moving picture property by improving gray-to-gray response time. Here, we report result of simulation for estimation of driving voltage to reduce response time, and experimental result. We investigated optimization of algorithm so that minimum size of LUT can support to reducing the gray-to-gray response time within 1 frame period, and with single algorithm it is possible to apply the algorithm to various kinds of LC material. So in our system there is no external EEPROM.

  • PDF

An Efficient Optimization Technique for Node Clustering in VANETs Using Gray Wolf Optimization

  • Khan, Muhammad Fahad;Aadil, Farhan;Maqsood, Muazzam;Khan, Salabat;Bukhari, Bilal Haider
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4228-4247
    • /
    • 2018
  • Many methods have been developed for the vehicles to create clusters in vehicular ad hoc networks (VANETs). Usually, nodes are vehicles in the VANETs, and they are dynamic in nature. Clusters of vehicles are made for making the communication between the network nodes. Cluster Heads (CHs) are selected in each cluster for managing the whole cluster. This CH maintains the communication in the same cluster and with outside the other cluster. The lifetime of the cluster should be longer for increasing the performance of the network. Meanwhile, lesser the CH's in the network also lead to efficient communication in the VANETs. In this paper, a novel algorithm for clustering which is based on the social behavior of Gray Wolf Optimization (GWO) for VANET named as Intelligent Clustering using Gray Wolf Optimization (ICGWO) is proposed. This clustering based algorithm provides the optimized solution for smooth and robust communication in the VANETs. The key parameters of proposed algorithm are grid size, load balance factor (LBF), the speed of the nodes, directions and transmission range. The ICGWO is compared with the well-known meta-heuristics, Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO) for clustering in VANETs. Experiments are performed by varying the key parameters of the ICGWO, for measuring the effectiveness of the proposed algorithm. These parameters include grid sizes, transmission ranges, and a number of nodes. The effectiveness of the proposed algorithm is evaluated in terms of optimization of number of cluster with respect to transmission range, grid size and number of nodes. ICGWO selects the 10% of the nodes as CHs where as CLPSO and MOPSO selects the 13% and 14% respectively.

A Study on Computational Efficiency Enhancement by Using Full Gray Code Genetic Algorithm (전 영역 그레이코드 유전자 알고리듬의 효율성 증대에 관한 연구)

  • 이원창;성활경
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.10
    • /
    • pp.169-176
    • /
    • 2003
  • Genetic algorithm (GA), which has a powerful searching ability and is comparatively easy to use and also to apply, is in the spotlight in the field of the optimization for mechanical systems these days. However, it also contains some problems of slow convergence and low efficiency caused by a huge amount of repetitive computation. To improve the processing efficiency of repetitive computation, some papers have proposed paralleled GA these days. There are some cases that mention the use of gray code or suggest using gray code partially in GA to raise its slow convergence. Gray code is an encoding of numbers so that adjacent numbers have a single digit differing by 1. A binary gray code with n digits corresponds to a hamiltonian path on an n-dimensional hypercube (including direction reversals). The term gray code is open used to refer to a reflected code, or more specifically still, the binary reflected gray code. However, according to proposed reports, gray code GA has lower convergence about 10-20% comparing with binary code GA without presenting any results. This study proposes new Full gray code GA (FGGA) applying a gray code throughout all basic operation fields of GA, which has a good data processing ability to improve the slow convergence of binary code GA.

Machinability investigation of gray cast iron in turning with ceramics and CBN tools: Modeling and optimization using desirability function approach

  • Boutheyna Gasmi;Boutheyna Gasmi;Septi Boucherit;Salim Chihaoui;Tarek Mabrouki
    • Structural Engineering and Mechanics
    • /
    • v.86 no.1
    • /
    • pp.119-137
    • /
    • 2023
  • The purpose of this research is to assess the performance of CBN and ceramic tools during the dry turning of gray cast iron EN GJL-350. During the turning operation, the variable machining parameters are cutting speed, feed rate, depth of cut and type of the cutting material. This contribution consists of two sections, the first one deals with the performance evaluation of four materials in terms of evolution of flank wear, surface roughness (2D and 3D) and cutting forces. The focus of the second section is on statistical analysis, followed by modeling and optimization. The experiments are conducted according to the Taguchi design L32 and based on ANOVA approach to quantify the impact of input factors on the output parameters, namely, the surface roughness (Ra), the cutting force (Fz), the cutting power (Pc), specific cutting energy (Ecs). The RSM method was used to create prediction models of several technical factors (Ra, Fz, Pc, Ecs and MRR). Subsequently, the desirability function approach was used to achieve a multi-objective optimization that encompasses the output parameters simultaneously. The aim is to obtain optimal cutting regimes, following several cases of optimization often encountered in industry. The results found show that the CBN tool is the most efficient cutting material compared to the three ceramics. The optimal combination for the first case where the importance is the same for the different outputs is Vc=660 m/min, f=0.116 mm/rev, ap=0.232 mm and the material CBN. The optimization results have been verified by carrying out confirmation tests.

Optimization of Color and Gray Scale using Brightness Control in CRT Color Monitor

  • Kim, Hong-Suk;Park, Seung-Ok;Baek, Jung-Ki
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2000.01a
    • /
    • pp.75-76
    • /
    • 2000
  • Tone reproduction characteristics of color and gray have a great influence on the picture quality in visual display. In this study, we optimized tone reproduction characteristics of color and gray of CRT monitor by setting brightness to the optimum level, in which offsets for RGB channels can be assumed to zero. The optimum brightness level could be found by measuring a few tones of neutral for the combination of 2 levels of brightness and 2 levels of contrast. As the result, the relationship between normalized DAC count and normalized luminance of primary color or gray has been simply presented by gamma and result in good phosphor constancy.

  • PDF

3-D Topology Optimization by a Nodal Density Method Based on a SIMP Algorithm (SIMP 기반 절점밀도법에 의한 3 차원 위상최적화)

  • Kim, Cheol;Fang, Nan
    • Proceedings of the KSME Conference
    • /
    • 2008.11a
    • /
    • pp.412-417
    • /
    • 2008
  • In a traditional topology optimization method, material properties are usually distributed by finite element density and visualized by a gray level image. The distribution method based on element density is adequate for a great mass of 2-D topology optimization problems. However, when it is used for 3-D topology optimization, it is always difficult to obtain a smooth model representation, and easily appears a virtualconnect phenomenon especially in a low-density domain. The 3-D structural topology optimization method has been developed using the node density instead of the element density that is based on SIMP (solid isotropic microstructure with penalization) algorithm. A computer code based on Matlab was written to validate the proposed method. When it was compared to the element density as design variable, this method could get a more uniform density distribution. To show the usefulness of this method, several typical examples of structure topology optimization are presented.

  • PDF

Structural monitoring and maintenance by quantitative forecast model via gray models

  • C.C. Hung;T. Nguyen
    • Structural Monitoring and Maintenance
    • /
    • v.10 no.2
    • /
    • pp.175-190
    • /
    • 2023
  • This article aims to quantitatively predict the snowmelt in extreme cold regions, considering a combination of grayscale and neural models. The traditional non-equidistant GM(1,1) prediction model is optimized by adjusting the time-distance weight matrix, optimizing the background value of the differential equation and optimizing the initial value of the model, and using the BP neural network for the first. The adjusted ice forecast model has an accuracy of 0.984 and posterior variance and the average forecast error value is 1.46%. Compared with the GM(1,1) and BP network models, the accuracy of the prediction results has been significantly improved, and the quantitative prediction of the ice sheet is more accurate. The monitoring and maintenance of the structure by quantitative prediction model by gray models was clearly demonstrated in the model.

Design of multi-span steel box girder using lion pride optimization algorithm

  • Kaveh, A.;Mahjoubi, S.
    • Smart Structures and Systems
    • /
    • v.20 no.5
    • /
    • pp.607-618
    • /
    • 2017
  • In this research, a newly developed nature-inspired optimization method, the Lion Pride Optimization algorithm (LPOA), is utilized for optimal design of composite steel box girder bridges. A composite box girder bridge is one of the common types of bridges used for medium spans due to their economic, aesthetic, and structural benefits. The aim of the present optimization procedure is to provide a feasible set of design variables in order to minimize the weight of the steel trapezoidal box girders. The solution space is delimited by different types of design constraints specified by the American Association of State Highway and Transportation Officials. Additionally, the optimal solution obtained by LPOA is compared to the results of other well-established meta-heuristic algorithms, namely Gray Wolf Optimization (GWO), Ant Lion Optimizer (ALO) and the results of former researches. By this comparison the capability of the LPOA in optimal design of composite steel box girder bridges is demonstrated.

A Study of A Design Optimization Problem with Many Design Variables Using Genetic Algorithm (유전자 알고리듬을 이용할 대량의 설계변수를 가지는 문제의 최적화에 관한 연구)

  • 이원창;성활경
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.11
    • /
    • pp.117-126
    • /
    • 2003
  • GA(genetic algorithm) has a powerful searching ability and is comparatively easy to use and to apply as well. By that reason, GA is in the spotlight these days as an optimization skill for mechanical systems.$^1$However, GA has a low efficiency caused by a huge amount of repetitive computation and an inefficiency that GA meanders near the optimum. It also can be shown a phenomenon such as genetic drifting which converges to a wrong solution.$^{8}$ These defects are the reasons why GA is not widdy applied to real world problems. However, the low efficiency problem and the meandering problem of GA can be overcomed by introducing parallel computation$^{7}$ and gray code$^4$, respectively. Standard GA(SGA)$^{9}$ works fine on small to medium scale problems. However, SGA done not work well for large-scale problems. Large-scale problems with more than 500-bit of sere's have never been tested and published in papers. In the result of using the SGA, the powerful searching ability of SGA doesn't have no effect on optimizing the problem that has 96 design valuables and 1536 bits of gene's length. So it converges to a solution which is not considered as a global optimum. Therefore, this study proposes ExpGA(experience GA) which is a new genetic algorithm made by applying a new probability parameter called by the experience value. Furthermore, this study finds the solution throughout the whole field searching, with applying ExpGA which is a optimization technique for the structure having genetic drifting by the standard GA and not making a optimization close to the best fitted value. In addition to them, this study also makes a research about the possibility of GA as a optimization technique of large-scale design variable problems.

Infrared Reflector Design using the Phase Field Method for Infrared Stealth Effect (적외선 피탐지를 위한 페이즈 필드법 기반의 적외선 반사층 설계)

  • Heo, Namjoon;Yoo, Jeonghoon
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.28 no.1
    • /
    • pp.63-69
    • /
    • 2015
  • In this paper, infrared reflector design targeting infrared stealth effect is presented using structural optimization based on the phase field method. The analysis model was determined to accomplish the design that an incident infrared wave was reflected to a desired direction. The design process was to maximize the objective value at the measuring domain located in a target region and the design objective was set to the Poynting vector value which represents the energy flux. Optimization results were obtained according to the variation of some parameter values related to the phase field method. The model with a maximum objective value was selected as the final optimal model. The optimal model was modified to eliminate the gray scale using the cut-off method and it confirmed improved performance. In addition, to check the desired effect in the middle wave infrared range(MWIR), the analysis was performed by changing the input wavelength. The finite element analysis and optimization process were performed by using the commercial package COMSOL combined with the Matlab programming.