• Title/Summary/Keyword: Approximation algorithm

Search Result 980, Processing Time 0.031 seconds

Approximation of Multiple Trait Effective Daughter Contribution by Dairy Proven Bulls for MACE (젖소 국제유전능력 평가를 위한 종모우별 다형질 Effective Daughter Contribution 추정)

  • Cho, Kwang-Hyun;Choi, Tae-Jeong;Cho, Chung-Il;Park, Kyung-Do;Do, Kyoung-Tag;Oh, Jae-Don;Lee, Hak-Kyo;Kong, Hong-Sik;Lee, Joon-Ho
    • Journal of Animal Science and Technology
    • /
    • v.55 no.5
    • /
    • pp.399-403
    • /
    • 2013
  • This study was conducted to investigate the basic concept of multiple trait effective daughter contribution (MTEDC) for dairy cattle sires and calculate effective daughter contribution (EDC) by applying a five lactation multiple trait model using milk yield test records of daughters for the Multiple-trait Across Country Evaluation (MACE). Milk yield data and pedigree information of 301,551 cows that were the progeny of 2,046 Korean and imported dairy bulls were collected from the National Agricultural Cooperative Federation and used in this study. For MTEDC approximation, the reliability of the breeding value was separated based on parents average, own yield deviation and mate adjusted progeny contribution. EDC was then calculated by lactation using these reliabilities. The average number of recorded daughters per sire by lactations were 140.57, 94.24, 55.14, 29.20 and 14.06 from the first to fifth lactation, respectively. However, the average EDC per sire by lactation using the five lactation multiple trait model was 113.49, 89.28, 73.56, 54.02 and 35.08 from the first to fifth lactation, respectively, while the decrease of EDC in late lactations was comparably lower than the average number of recorded daughters per sire. These findings indicate that the availability of daughters without late lactation records is increased by genetic correlation using the multiple trait model. Owing to the relatedness between the EDC and reliability of the estimated breeding value for sire, understanding the MTEDC algorithm and continuous monitoring of EDC is required for correct MACE application of the five lactation multiple trait model.

Development of Intelligent ATP System Using Genetic Algorithm (유전 알고리듬을 적용한 지능형 ATP 시스템 개발)

  • Kim, Tai-Young
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.131-145
    • /
    • 2010
  • The framework for making a coordinated decision for large-scale facilities has become an important issue in supply chain(SC) management research. The competitive business environment requires companies to continuously search for the ways to achieve high efficiency and lower operational costs. In the areas of production/distribution planning, many researchers and practitioners have developedand evaluated the deterministic models to coordinate important and interrelated logistic decisions such as capacity management, inventory allocation, and vehicle routing. They initially have investigated the various process of SC separately and later become more interested in such problems encompassing the whole SC system. The accurate quotation of ATP(Available-To-Promise) plays a very important role in enhancing customer satisfaction and fill rate maximization. The complexity for intelligent manufacturing system, which includes all the linkages among procurement, production, and distribution, makes the accurate quotation of ATP be a quite difficult job. In addition to, many researchers assumed ATP model with integer time. However, in industry practices, integer times are very rare and the model developed using integer times is therefore approximating the real system. Various alternative models for an ATP system with time lags have been developed and evaluated. In most cases, these models have assumed that the time lags are integer multiples of a unit time grid. However, integer time lags are very rare in practices, and therefore models developed using integer time lags only approximate real systems. The differences occurring by this approximation frequently result in significant accuracy degradations. To introduce the ATP model with time lags, we first introduce the dynamic production function. Hackman and Leachman's dynamic production function in initiated research directly related to the topic of this paper. They propose a modeling framework for a system with non-integer time lags and show how to apply the framework to a variety of systems including continues time series, manufacturing resource planning and critical path method. Their formulation requires no additional variables or constraints and is capable of representing real world systems more accurately. Previously, to cope with non-integer time lags, they usually model a concerned system either by rounding lags to the nearest integers or by subdividing the time grid to make the lags become integer multiples of the grid. But each approach has a critical weakness: the first approach underestimates, potentially leading to infeasibilities or overestimates lead times, potentially resulting in excessive work-inprocesses. The second approach drastically inflates the problem size. We consider an optimized ATP system with non-integer time lag in supply chain management. We focus on a worldwide headquarter, distribution centers, and manufacturing facilities are globally networked. We develop a mixed integer programming(MIP) model for ATP process, which has the definition of required data flow. The illustrative ATP module shows the proposed system is largely affected inSCM. The system we are concerned is composed of a multiple production facility with multiple products, multiple distribution centers and multiple customers. For the system, we consider an ATP scheduling and capacity allocationproblem. In this study, we proposed the model for the ATP system in SCM using the dynamic production function considering the non-integer time lags. The model is developed under the framework suitable for the non-integer lags and, therefore, is more accurate than the models we usually encounter. We developed intelligent ATP System for this model using genetic algorithm. We focus on a capacitated production planning and capacity allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using an evolutionary system to solve it efficiently. This method makes it possible for the population to reach the approximate solution easily. Moreover, we designed and utilized a representation scheme that allows the proposed models to represent real variables. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solutions converge to the optimum quickly.

Rate Control based on linear relation for H.264/MPEG-4 AVC (선형 관계를 이용한 H.264/MPEG-4 AVC 비트율 제어 방법)

  • Na Hyeong-Youl;Lim Sung-Chang;Lee Yung-Lyul
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.1 s.307
    • /
    • pp.27-38
    • /
    • 2006
  • The main purpose of rate control is to achieve the highest video quality when bandwidth or storage capacity is limited. For this purpose, we need a rate control algorithm which is adaptively controlled by the motion information of sequences, scene change, buffer capacity and time-varing bandwitdh channels. A rate-control method in the encoder requires the accurate estimation of target bit for each frame and the low end-to-end delay for transmitting video data by intelligent selection of encoding parameters. In this paper, we suggest three kinds of linear relation in the encoder to satisfy the characteristics of rate control. The first relation is that between the percentage of zero quantized transformed coefficients(p) and coded bits. Second relation is that between the PSNR of encoded frame and its Quantization parameter(QP). Finally, we can find out a linear approximation between QP and p. According to the experimental analysis, the proposed method results in an efficient rate control in terms of the bit estimation, the buffer capacity, and PSNR compared with the existing rate control in the H.264 JM 9.3.

A Signal Readout System for CNT Sensor Arrays (CNT 센서 어레이를 위한 신호 검출 시스템)

  • Shin, Young-San;Wee, Jae-Kyung;Song, In-Chae
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.9
    • /
    • pp.31-39
    • /
    • 2011
  • In this paper, we propose a signal readout system with small area and low power consumption for CNT sensor arrays. The proposed system consists of signal readout circuitry, a digital controller, and UART I/O. The key components of the signal readout circuitry are 64 transimpedance amplifiers (TIA) and SAR-ADC with 11-bit resolution. The TIA adopts an active input current mirror (AICM) for voltage biasing and current amplification of a sensor. The proposed architecture can reduce area and power without sampling rate degradation because the 64 TIAs share a variable gain amplifier (VGA) which needs large area and high power due to resistive feedback. In addition, the SAR-ADC is designed for low power with modified algorithm where the operation of the lower bits can be skipped according to an input voltage level. The operation of ADC is controlled by a digital controller based on UART protocol. The data of ADC can be monitored on a computer terminal. The signal readout circuitry was designed with 0.13${\mu}m$ CMOS technology. It occupies the area of 0.173 $mm^2$ and consumes 77.06${\mu}W$ at the conversion rate of 640 samples/s. According to measurement, the linearity error is under 5.3% in the input sensing current range of 10nA - 10${\mu}A$. The UART I/O and the digital controller were designed with 0.18${\mu}m$ CMOS technology and their area is 0.251 $mm^2$.

Fast GPU Implementation for the Solution of Tridiagonal Matrix Systems (삼중대각행렬 시스템 풀이의 빠른 GPU 구현)

  • Kim, Yong-Hee;Lee, Sung-Kee
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.11_12
    • /
    • pp.692-704
    • /
    • 2005
  • With the improvement of computer hardware, GPUs(Graphics Processor Units) have tremendous memory bandwidth and computation power. This leads GPUs to use in general purpose computation. Especially, GPU implementation of compute-intensive physics based simulations is actively studied. In the solution of differential equations which are base of physics simulations, tridiagonal matrix systems occur repeatedly by finite-difference approximation. From the point of view of physics based simulations, fast solution of tridiagonal matrix system is important research field. We propose a fast GPU implementation for the solution of tridiagonal matrix systems. In this paper, we implement the cyclic reduction(also known as odd-even reduction) algorithm which is a popular choice for vector processors. We obtained a considerable performance improvement for solving tridiagonal matrix systems over Thomas method and conjugate gradient method. Thomas method is well known as a method for solving tridiagonal matrix systems on CPU and conjugate gradient method has shown good results on GPU. We experimented our proposed method by applying it to heat conduction, advection-diffusion, and shallow water simulations. The results of these simulations have shown a remarkable performance of over 35 frame-per-second on the 1024x1024 grid.

Animation Generation for Chinese Character Learning on Mobile Devices (모바일 한자 학습 애니메이션 생성)

  • Koo, Sang-Ok;Jang, Hyun-Gyu;Jung, Soon-Ki
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.12
    • /
    • pp.894-906
    • /
    • 2006
  • There are many difficulties to develop a mobile contents due to many constraints on mobile environments. It is difficult to make a good mobile contents with only visual reduction of existing contents on wire Internet. Therefore, it is essential to devise the data representation and to develop the authoring tool to meet the needs of the mobile contents market. We suggest the compact mobile contents to learn Chinese characters and developed its authoring tool. The animation which our system produces is realistic as if someone writes letters with pen or brush. Moreover, our authoring tool makes a user generate a Chinese character animation easily and rapidly although she or he has not many knowledge in computer graphics, mobile programming or Chinese characters. The method to generate the stroke animation is following: We take basic character shape information represented with several contours from TTF(TrueType Font) and get the information for the stroke segmentation and stroke ordering from simple user input. And then, we decompose whole character shape into some strokes by using polygonal approximation technique. Next, the stroke animation for each stroke is automatically generated by the scan line algorithm ordered by the stroke direction. Finally, the ordered scan lines are compressed into some integers by reducing coordinate redundancy As a result, the stroke animation of our system is even smaller than GIF animation. Our method can be extended to rendering and animation of Hangul or general 2D shape based on vector graphics. We have the plan to find the method to automate the stroke segmentation and ordering without user input.

A Study on Depth Data Extraction for Object Based on Camera Calibration of Known Patterns (기지 패턴의 카메라 Calibration에 기반한 물체의 깊이 데이터 추출에 관한 연구)

  • 조현우;서경호;김태효
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2001.06a
    • /
    • pp.173-176
    • /
    • 2001
  • In this thesis, a new measurement system is implemented for depth data extraction based on the camera calibration of the known pattern. The relation between 3D world coordinate and 2D image coordinate is analyzed. A new camera calibration algorithm is established from the analysis and then, the internal variables and external variables of the CCD camera are obtained. Suppose that the measurement plane is horizontal plane, from the 2D plane equation and coordinate transformation equation the approximation values corresponding minimum values using Newton-Rabbson method is obtained and they are stored into the look-up table for real time processing . A slit laser light is projected onto the object, and a 2D image obtained on the x-z plane in the measurement system. A 3D shape image can be obtained as the 2D (x-z)images are continuously acquired, during the object is moving to the y direction. The 3D shape images are displayed on computer monitor by use of OpenGL software. In a measuremental result, we found that the resolution of pixels have $\pm$ 1% of error in depth data. It seems that the error components are due to the vibration of mechanic and optical system. We expect that the measurement system need some of mechanic stability and precision optical system in order to improve the system.

  • PDF

Reduction of Chattering Error of Reed Switch Sensor for Remote Measurement of Water Flow Meter (리드 스위치 센서를 이용한 원격 검침용 상수도 계량기에서 채터링 오차 감소 방안 연구)

  • Ayurzana, Odgerel;Kim, Hie-Sik
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.44 no.4 s.316
    • /
    • pp.42-47
    • /
    • 2007
  • To reduce the chattering errors of reed switch sensors in the automatic remote measurement of water meter a reed switch sensor was analyzed and improved. The operation of reed switch sensors can be described as a mechanical contact switch by approximation of permanent magnet piece to generate an electrical pulse. The reed switch sensors are used mostly in measurement application to detect the rotational or translational displacement. To apply for water flow measurement devices, the reed switch sensors should keep high reliability. They are applied for the electronic digital type of water flow meters. The reed switch sensor is just mounted simply on the conventional mechanical type flow meter. A small magnet is attached on a pointer of the water meter counter rotor. Inside the reed sensor two steel leaf springs make mechanical contact and apart repeatedly as rotation of flow meter counter. The counting electrical contact pulses can be converted as the water flow amount. The MCU sends the digital flow rate data to the server using the wireless communication network. But the digital data is occurred difference or won by chattering noise. The reed switch sensor contains chattering error by it self at the force equivalent position. The vibrations such as passing vehicle near to the switch sensor installed location causes chattering. In order to reduce chattering error, most system uses just software methods, for example using filter algorithm and also statistical calibration methods. The chattering errors were reduced by changing leaf spring structure using mechanical characteristics.

The Effect of Internal Row on Marine Riser Dynamics (Riser의 내부유체 흐름이 Riser 동적반응에 미치는 영향)

  • Hong, Nam-Seeg
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.7 no.1
    • /
    • pp.75-90
    • /
    • 1995
  • A mathematical model for the dynamic analysis of a riser system with the inclusion of internal flow and nonlinear effects due to large structural displacements is developed to investigate the effect of internal flow on marine riser dynamics. The riser system accounts fir the nonlinear boundary conditions and includes a steady flow inside the pipe which is modeled as an extensible or inextensible. tubular beam subject to nonlinear three dimensional hydrodynamic loads such as current or wave excitation. Galerkin's finite element approximation and time incremental operator are implemented to derive the matrix equation of equilibrium for the finite element system and the extensibility or inextensibility condition is used to reduce degree of freedom of the system and the required computational time in the case of a nonlinear model. The algorithm is implemented to develop computer programs used in several numerical applications. The investigations of the effect of infernal flow on riser vibration due to current or wave loading are performed according to the change of various parameters such as top tension, internal flow velocity, current velocity, wave period, and so on. It is found that the effect of internal flow can be controlled by the increase of top tension. However, careful consideration has to be given in the design point particularly for the long riser under the harmonic loading such as waves. And it is also found that the consideration of nonlinear effects due to large structural displacements increases the effect of internal flow on riser dynamics.

  • PDF

Ensemble Learning with Support Vector Machines for Bond Rating (회사채 신용등급 예측을 위한 SVM 앙상블학습)

  • Kim, Myoung-Jong
    • Journal of Intelligence and Information Systems
    • /
    • v.18 no.2
    • /
    • pp.29-45
    • /
    • 2012
  • Bond rating is regarded as an important event for measuring financial risk of companies and for determining the investment returns of investors. As a result, it has been a popular research topic for researchers to predict companies' credit ratings by applying statistical and machine learning techniques. The statistical techniques, including multiple regression, multiple discriminant analysis (MDA), logistic models (LOGIT), and probit analysis, have been traditionally used in bond rating. However, one major drawback is that it should be based on strict assumptions. Such strict assumptions include linearity, normality, independence among predictor variables and pre-existing functional forms relating the criterion variablesand the predictor variables. Those strict assumptions of traditional statistics have limited their application to the real world. Machine learning techniques also used in bond rating prediction models include decision trees (DT), neural networks (NN), and Support Vector Machine (SVM). Especially, SVM is recognized as a new and promising classification and regression analysis method. SVM learns a separating hyperplane that can maximize the margin between two categories. SVM is simple enough to be analyzed mathematical, and leads to high performance in practical applications. SVM implements the structuralrisk minimization principle and searches to minimize an upper bound of the generalization error. In addition, the solution of SVM may be a global optimum and thus, overfitting is unlikely to occur with SVM. In addition, SVM does not require too many data sample for training since it builds prediction models by only using some representative sample near the boundaries called support vectors. A number of experimental researches have indicated that SVM has been successfully applied in a variety of pattern recognition fields. However, there are three major drawbacks that can be potential causes for degrading SVM's performance. First, SVM is originally proposed for solving binary-class classification problems. Methods for combining SVMs for multi-class classification such as One-Against-One, One-Against-All have been proposed, but they do not improve the performance in multi-class classification problem as much as SVM for binary-class classification. Second, approximation algorithms (e.g. decomposition methods, sequential minimal optimization algorithm) could be used for effective multi-class computation to reduce computation time, but it could deteriorate classification performance. Third, the difficulty in multi-class prediction problems is in data imbalance problem that can occur when the number of instances in one class greatly outnumbers the number of instances in the other class. Such data sets often cause a default classifier to be built due to skewed boundary and thus the reduction in the classification accuracy of such a classifier. SVM ensemble learning is one of machine learning methods to cope with the above drawbacks. Ensemble learning is a method for improving the performance of classification and prediction algorithms. AdaBoost is one of the widely used ensemble learning techniques. It constructs a composite classifier by sequentially training classifiers while increasing weight on the misclassified observations through iterations. The observations that are incorrectly predicted by previous classifiers are chosen more often than examples that are correctly predicted. Thus Boosting attempts to produce new classifiers that are better able to predict examples for which the current ensemble's performance is poor. In this way, it can reinforce the training of the misclassified observations of the minority class. This paper proposes a multiclass Geometric Mean-based Boosting (MGM-Boost) to resolve multiclass prediction problem. Since MGM-Boost introduces the notion of geometric mean into AdaBoost, it can perform learning process considering the geometric mean-based accuracy and errors of multiclass. This study applies MGM-Boost to the real-world bond rating case for Korean companies to examine the feasibility of MGM-Boost. 10-fold cross validations for threetimes with different random seeds are performed in order to ensure that the comparison among three different classifiers does not happen by chance. For each of 10-fold cross validation, the entire data set is first partitioned into tenequal-sized sets, and then each set is in turn used as the test set while the classifier trains on the other nine sets. That is, cross-validated folds have been tested independently of each algorithm. Through these steps, we have obtained the results for classifiers on each of the 30 experiments. In the comparison of arithmetic mean-based prediction accuracy between individual classifiers, MGM-Boost (52.95%) shows higher prediction accuracy than both AdaBoost (51.69%) and SVM (49.47%). MGM-Boost (28.12%) also shows the higher prediction accuracy than AdaBoost (24.65%) and SVM (15.42%)in terms of geometric mean-based prediction accuracy. T-test is used to examine whether the performance of each classifiers for 30 folds is significantly different. The results indicate that performance of MGM-Boost is significantly different from AdaBoost and SVM classifiers at 1% level. These results mean that MGM-Boost can provide robust and stable solutions to multi-classproblems such as bond rating.