• East Asian mathematical journal
• /
• v.33 no.4
• /
• pp.333-351
• /
• 2017

Schools are expected to ultimately moderate the difference of inequality issues among social groups and reduce the achievement gaps. This study investigates this expectation, in particular, how students' mathematics achievements are influenced by their parents' education at the individual level and by collective responsibility for teaching at the school level as well as the interaction of the two. Using a two-level hierarchical linear model, this study indicates that a school collective responsibility has a larger positive effect on students' mathematics achievement when their parents' education level is high. This means that school's collective responsibility accelerates inequity in students' mathematics achievement. Knowing that collective responsibility has less of an effect on students whose parents' education is not high, researchers, schools, and school districts should continue to search for school effects that have more of a positive impact on the relationship between mathematics achievement for students whose parents' education is not high in order to have more equitable results for all students.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.5
• /
• pp.295-304
• /
• 2003

In this paper, we proposed a hardware-oriented Genetic Algorithm Processor(GAP) based on subpopulation architecture for high-performance convergence and reducing computation time. The proposed architecture was applied to enhancing population diversity for correspondence to premature convergence. In addition, the crossover operator selection and linear ranking subpop selection were newly employed for efficient exploration. As stochastic search space selection through linear ranking and suitable genetic operator selection with respect to the convergence state of each subpopulation was used, the elapsed time of searching optimal solution was shortened. In the experiments, the computation speed was increased by over $10\%$ compared to survival-based GA and Modified-tournament GA. Especially, increased by over $20\%$ in the multi-modal function. The proposed Subpop GA processor was implemented on FPGA device APEX EP20K600EBC652-3 of AGENT 2000 design kit.

• IE interfaces
• /
• v.14 no.2
• /
• pp.190-197
• /
• 2001

Growth curves including Logistic and Gompertz functions are widely used in forecasting the market demand. To estimated the parameters of those functions, we use the non-linear least square method. However, it is difficult to set up the starting points for each parameter. If a wrong starting point is selected, the result reveals the local optimum or does not converge to a certain value. The purpose of this paper is to resolve the problem of selecting a starting point. Especially, rescaling the market data using the national economic index make it possible to figure out the range of parameters and to utilize the grid search method. Applications to some real data are also included.

• Proceedings of the KAIS Fall Conference
• /
• 2001.05a
• /
• pp.103-107
• /
• 2001

This study is simulation about buckling behavior under axial compression which is cylindrical panel laminated USN125 and USN150 made by various winding angle. And also this study compare with linear and nonlinear FDEM theory, and FEM theory. To solve the objective function and the design variables, this study use the linear and nonlinear buckling theories or FDEM and nonlinear search optimum design method of ADS for minimum weight design on which stiffened laminated composite cylindrical panel with stiffener that R-type section.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.1
• /
• pp.87-92
• /
• 2002

Placement is an important step in the physical design of VLSI circuits. It is the problem of placing a set of circuit modules on a chip to optimize the circuit performance. The most popular algorithms for placement include the cluster growth, simulated annealing and integer linear programming. In this paper we propose a stochastic evolution algorithm searching solution space for the placement problem, and then compare it with simulated annealing by analyzing the results of each implementation.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.3
• /
• pp.42-48
• /
• 2002

Placement is an important step in the physical design of VLSI circuits. It is the problem of placing a set of circuit modules on a chip to optimize the circuit performance. The most popular algorithms for placement include the cluster growth, simulated annealing and integer linear programming. In this paper we propose a genetic algorithm searching solution space for the placement problem, and then compare it with simulated annealing by analyzing the results of each implementation.

• Journal of information and communication convergence engineering
• /
• v.20 no.2
• /
• pp.73-78
• /
• 2022

Based on experimental measurements conducted on many different practical wireless communication systems, ambient noise has been shown to be decidedly non-Gaussian owing to impulsive phenomena. However, most multiuser detection techniques proposed thus far have considered Gaussian noise only. They may therefore suffer from a considerable performance loss in the presence of impulsive ambient noise. In this paper, we consider a large-scale multiuser multiple-input multiple-output system in the presence of non-Gaussian noise and propose a genetic algorithm (GA) based detector for large-dimensional multiuser signal detection. The proposed algorithm is more robust than linear multi-user detectors for non-Gaussian noise because it uses a multi-directional search to manipulate and maintain a population of potential solutions. Meanwhile, the proposed GA-based algorithm has a comparable complexity because it does not require any complicated computations (e.g., a matrix inverse or derivation). The simulation results show that the GA offers a performance gain over the linear minimum mean square error algorithm for both non-Gaussian and Gaussian noise.

• East Asian mathematical journal
• /
• v.25 no.1
• /
• pp.55-68
• /
• 2009

In this paper we propose new large-update primal-dual inte-rior point algorithms for $P_*(\kappa)$ linear complementarity problems(LCPs). New search directions and proximity measures are proposed based on the kernel function$\psi(t)=\frac{t^{p+1}-1}{p+1}+\frac{e^{\frac{1}{t}}-e}{e}$,$p{\in}$[0,1]. We showed that if a strictly feasible starting point is available, then the algorithm has $O((1+2\kappa)(logn)^{2}n^{\frac{1}{p+1}}log\frac{n}{\varepsilon}$ complexity bound.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.07a
• /
• pp.37-38
• /
• 2022

농산물의 산지 가격이나 도매가격이 등락하면, 즉시 또는 일정한 시차 이후에 소비자가격도 등락한다. 본 논문에서는 선형회귀모델을 통해 쌀 가격을 예측하고 쌀 가격에 영향을 미치는 날씨의 시기를 찾아보고자 한다. 이에 따라 KAMIS, 기상자료개방포털, KOSIS에서 수집한 날씨, 생산량, 그리고 소비자물가 등락률 데이터를 이용하여 쌀 가격 예측을 수행하고, 날씨 데이터와 쌀 가격 데이터의 날짜 간격을 두어 날씨가 쌀 가격에 영향을 미치는 시기를 알아보았다. 모델 평가 결과, 2개월 간격을 두고 예측한 RMSE가 164.135로 가장 큰 영향을 미쳤다. 본 연구를 기반으로 향후 다른 농산물의 가격 예측도 가능할 것이며 농산물에 영향을 미치는 변수의 시기도 예측할 수 있을 것으로 기대한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.2
• /
• pp.478-493
• /
• 2024

In this paper, the Mixed Integer Linear Programming (MILP) model is improved for searching differential characteristics of block cipher Midori-64, and 4 search strategies of differential path are given. By using strategy IV, set 1 S-box on the top of the distinguisher to be active, and set 3 S-boxes at the bottom to be active and the difference to be the same, then we obtain a 5-round differential characteristics. Based on the distinguisher, we attack 12-round Midori-64 with data and time complexities of 2⁶³ and 2^103.83, respectively. To our best knowledge, these results are superior to current ones.