• Journal of Internet Computing and Services
• /
• v.2 no.3
• /
• pp.71-79
• /
• 2001

In Incremental attribute evaluation algorithm, a new input attribute is exact1y compared with a previous input attribute tree, and then determine which subtrees from the old should be used in constructing the new one. In this paper incremental attribute evaluation algorithm was used to make incremental evlauation of hierarchical attribute grammar more efficient1y, and reconstructing the incremental attribute evaluation algorithm by analyzing that of Carle and Pollock, finally the incremental attribute evaluation algorithm for optimalized attribute tree d' copy was constructed by applying element of attribute !ree dcopy to a new attribute tree d' copy. Also proving that how the reused nod and type of defined parameter in input program carried out the incremental attribute evaluation by using that algorithm.

• The KIPS Transactions:PartA
• /
• v.17A no.2
• /
• pp.73-80
• /
• 2010

As the power of hardware has improved, there have been numerous researches in processing concurrently using multitasking method. The incremental evaluation is the evaluation method of reevaluating only affected parts instead of reevaluating overall program when the program has been changed. It is necessary to do more studies that improve the efficiency of concurrent incremental evaluation to do multitasking using multi-threading of Java not to do in parallel using multiprocessor. In this paper, the dependency in the dependency chart is based on the attribute that describes the real value of the variable that directly affects the semantics, thereby doing efficient evaluation. So using the dependency, this paper presents the concurrent incremental evaluation algorithm for Java Languages and proves its correctness, analyzing the efficiency of concurrent incremental evaluation by the simulation.

• Journal of Internet Computing and Services
• /
• v.10 no.2
• /
• pp.75-84
• /
• 2009

There have been numerous researches in minimizing the total cost of program development in order to improve productivity of the programs. The incremental evaluation is the evaluation method of reevaluating only affected parts instead of reevaluating overall program when the program has been changed. Since the incremental evaluation method carries its advantage, the method itself is very important when considering the execution efficiency of the program developing environment. This paper extends the dependency chart for an imperative language and presents the extended version of dependency chart which can be applied to the Object Oriented Programming Languages such 'Java'. This paper also presents the incremental evaluation algorithm for Object Oriented Programming Languages and proves its correctness, analyzing the efficiency of incremental evaluation by the simulation.

• Journal of Information Processing Systems
• /
• v.18 no.4
• /
• pp.500-509
• /
• 2022

With the rapid development of educational informatization, teaching methods become diversified characteristics, but a large number of information data restrict the evaluation on teaching subject and object in terms of the effect of English education. Therefore, this study adopts the concept of incremental learning and eigenvalue interval algorithm to improve the weighted decision tree, and builds an English education effect evaluation model based on association rules. According to the results, the average accuracy of information classification of the improved decision tree algorithm is 96.18%, the classification error rate can be as low as 0.02%, and the anti-fitting performance is good. The classification error rate between the improved decision tree algorithm and the original decision tree does not exceed 1%. The proposed educational evaluation method can effectively provide early warning of academic situation analysis, and improve the teachers' professional skills in an accelerated manner and perfect the education system.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.209-216
• /
• 2001

The effective way to apply incremental attribute grammar to a complex language process is the use of optimized algorithm. In optimized algorithm for incremental attribute grammar, the new input attribute tree should be exactly compared with the previous input attribute tree, in order to determine which subtrees from the old should be used in constructing the new one. In this paper the new optimized algorithm was reconstructed by analyzing the algorithm suggested by Carle and Pollock, and a generation process of new attribute tree d’copy was added. Through the performance evaluation for the suggested matching algorithm, the run time is approximately improved by 19.5%, compared to the result of existing algorithm.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.6 no.2
• /
• pp.164-172
• /
• 2001

This paper describes common MPPT(Maximum Power Point Tracking) control algorithm; Constant Voltage Control, P&O(Perturbation and Observation), IncCond(Incremental Conductance), and investigated it\`s efficiency. Though simulation and efficiency evaluation, the steady/transient states characteristics and efficiency of control algorithms are analyzed respectively. Also, two-mode MPPT control to improve on the existing control algorithm. Moreover, is proposed for high efficiency this paper suggests a topology for MPPT measuring efficiency and a method of examination.

• Journal of Information Processing Systems
• /
• v.5 no.2
• /
• pp.105-116
• /
• 2009

To solve the general problems surrounding the application of genetic algorithms in stereo matching, two measures are proposed. Firstly, the strategy of simplified population-based incremental learning (PBIL) is adopted to reduce the problems with memory consumption and search inefficiency, and a scheme for controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities. In addition, an alternative version of the proposed algorithm, without the use of a probability vector, is also presented for simpler set-ups. Secondly, programmable graphics-hardware (GPU) consists of multiple multi-processors and has a powerful parallelism which can perform operations in parallel at low cost. Therefore, in order to decrease the running time further, a model of the proposed algorithm, which can be run on programmable graphics-hardware (GPU), is presented for the first time. The algorithms are implemented on the CPU as well as on the GPU and are evaluated by experiments. The experimental results show that the proposed algorithm offers better performance than traditional BMA methods with a deliberate relaxation and its modified version in terms of both running speed and stability. The comparison of computation times for the algorithm both on the GPU and the CPU shows that the former has more speed-up than the latter, the bigger the image size is.

• Journal of the Korean Solar Energy Society
• /
• v.21 no.1
• /
• pp.11-20
• /
• 2001

In this paper described common MPPT(Maximum Power Point Tracking) control algorithm; Constant Voltage Control, P&O(Perturbation and Observation), IncCond(Incremental Conductance), and investigated it's efficiency. Through simulation and efficiency evaluation, analyze the steady/transient states characteristics and efficiency of control algorithms respectively. Also, To high-efficiency proposed Two-mode MPPT control for improve on the existing control algorithm. Moreover, this paper suggested a topology for MPPT measuring efficiency and a method of examination.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.247-256
• /
• 2004

This paper presents an efficient collision detection algorithm the performance of which is independent of animation speed. Most of the previous collision detection algorithms are incremental and discrete methods, which find out the neighborhood of the extreme vertex at the previous time instance in order to get an extreme vertex at each time instance. However, if an object collides with another one with a high torque, then the angular speed becomes faster. Hence, the candidate by the incremental algorithms may be farther from the real extreme vertex at this time instance. Therefore, the worst time complexity nay be $O(n^2)$, where n is the number of faces. Moreover, the total time complexity of incremental algorithms is dependent on the time step size of animation because a smaller time step yields more frequent evaluation of Euclidean distance. In this paper, we propose a new method to overcome these drawbacks. We construct a spherical extreme vertex diagram on Gauss Sphere, which has geometric properties, and then generate the distance function of a polyhedron and a plane by using this diagram. In order to efficiently compute the exact collision time, we apply the interval Newton method to the distance function.

• Journal of Power Electronics
• /
• v.19 no.6
• /
• pp.1544-1553
• /
• 2019

The efficiency of photovoltaic generation systems depends on the maximum power point tracking (MPPT) technique. Among the various schemes presented in the literature, the incremental conductance (INC) method is one of the most frequently used due to its superb tracking ability under changes in insolation and temperature. Generally, conventional INC algorithms implement a simple duty-cycle updating rule that is mainly found on the polarity of the peak-power evaluation function. However, this fails to maximize the performance in both steady-state and transient conditions. In order to overcome this limitation, a novel regulated INC (r-INC) method is proposed in this paper. Like the compensators in automatic control systems, this method applies a digital compensator to evaluate the INC function and improve the capability of power tracking. Precise modeling of a new MPPT system is also presented in the optimized design process. A 120W boost peak power tracker is utilized to obtain comparative test results and to confirm the superiority of the proposed method over existing techniques.