• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.572-574
• /
• 2011

This paper is a research on an operating system(TinyOS) and nesC programming methods. TinyOS is being used for development of USN in many domestic/foreign research institutes, universities and companies. We are describing about the TinyOS and nesC programming methods and characteristics.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.98-101
• /
• 2004

Linear Programming(LP) is the term used for defining a wide range of optimization problems in which the objective function to be minimized or maximized is linear in the unknown variables and the constraints are a combination of linear equalities and inequalities. LP problems occur in many real-life economic situations where profits are to be maximized or costs minimized with constraint limits on resources. While the simplex method introduced in a later reference can be used for hand solution of LP problems, computer use becomes necessary even for a small number of variables. Problems involving diet decisions, transportation, production and manufacturing, product mix, engineering limit analysis in design, airline scheduling, and so on are solved using computers. This technique is called Sequential Linear Programming (SLP). This paper describes LP's problems and solves a LP's problems using the neural networks.

• Geomechanics and Engineering
• /
• v.18 no.4
• /
• pp.373-389
• /
• 2019

It is important to study the problem of durability for tunnel structures. As a main influence on the durability of tunnel structures, carbonation-induced corrosion is studied. For the complicated environment of tunnel structures, based on the data samples from real engineering examples, the intelligent method (genetic programming) is used to construct the service life prediction model of tunnel structures. Based on the model, the prediction of service life for tunnel structures in carbonation environments is studied. Using the data samples from some tunnel engineering examples in China under carbonation environment, the proposed method is verified. In addition, the performance of the proposed prediction model is compared with that of the artificial neural network method. Finally, the effect of two main controlling parameters, the population size and sample size, on the performance of the prediction model by genetic programming is analyzed in detail.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.620-626
• /
• 2004

For general nonlinear processes, it is difficult to control with a linear model-based control method and nonlinear controls are considered. Among the numerous approaches suggested, the most rigorous approach is to use dynamic optimization. Many general engineering problems like control, scheduling, planning etc. are expressed by functional optimization problem and most of them can be changed into dynamic programming (DP) problems. However the DP problems are used in just few cases because as the size of the problem grows, the dynamic programming approach is suffered from the burden of calculation which is called as 'curse of dimensionality'. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach is proposed by Bertsekas and Tsitsiklis (1996). To get the solution of seriously nonlinear process control, the interest in NDP approach is enlarged and NDP algorithm is applied to diverse areas such as retailing, finance, inventory management, communication networks, etc. and it has been extended to chemical engineering parts. In the NDP approach, we select the optimal control input policy to minimize the value of cost which is calculated by the sum of current stage cost and future stages cost starting from the next state. The cost value is related with a weight square sum of error and input movement. During the calculation of optimal input policy, if the approximate cost function by using simulation data is utilized with Bellman iteration, the burden of calculation can be relieved and the curse of dimensionality problem of DP can be overcome. It is very important issue how to construct the cost-to-go function which has a good approximate performance. The neural network is one of the eager learning methods and it works as a global approximator to cost-to-go function. In this algorithm, the training of neural network is important and difficult part, and it gives significant effect on the performance of control. To avoid the difficulty in neural network training, the lazy learning method like k-nearest neighbor method can be exploited. The training is unnecessary for this method but requires more computation time and greater data storage. The pH neutralization process has long been taken as a representative benchmark problem of nonlin ar chemical process control due to its nonlinearity and time-varying nature. In this study, the NDP algorithm was applied to pH neutralization process. At first, the pH neutralization process control to use NDP algorithm was performed through simulations with various approximators. The global and local approximators are used for NDP calculation. After that, the verification of NDP in real system was made by pH neutralization experiment. The control results by NDP algorithm was compared with those by the PI controller which is traditionally used, in both simulations and experiments. From the comparison of results, the control by NDP algorithm showed faster and better control performance than PI controller. In addition to that, the control by NDP algorithm showed the good results when it applied to the cases with disturbances and multiple set point changes.

• KCID journal
• /
• v.3 no.1
• /
• pp.32-39
• /
• 1996

Analyses of flow rates and pressures in pipe networks are crucial in determining pipe diameters. In this study the nonlinear programming has been applied to compute pipe Hon in a looped pipe network. The required theoretical background is described to app

• Korean Journal of Mathematics
• /
• v.4 no.1
• /
• pp.7-16
• /
• 1996

The optimization problems with quadratic constraints often appear in various fields such as network flows and computer tomography. In this paper, we propose an algorithm for solving those problems and prove the convergence of the proposed algorithm.

• Journal of Satellite, Information and Communications
• /
• v.7 no.3
• /
• pp.130-134
• /
• 2012

This paper introduces a home network service system using a low-cost wireless router on OpenWrt which can be remotely controled by Android devices. The proposed system consists of an embedded system development platform for home network service control based on OpemWrt embedded Linux, an embedded system development platform, a remote control on Android, and a home linghting device made by an interface board with LEDs. The prototype system is made of a wireless router of Buffalo, WZR-HP-G450H, Arduino Uno interface board with LEDs, and an Android development kit of HBE-SM5-S421. The operation was performed by TCP/IP programming for Android remote control, socket programming between Android development kit and wireless router, and UART communication programming between the interface board and wireless router. The implementation result shows that a low cost home network systme could be implemented with a wireless router.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.1-19
• /
• 1994

A generalized network problem is a special class of linear programming problem whose coefficient matrix contains at most two nonzero elements per column. A generalized network problem with 0-1 flow restrictions is called an integer generalized network(IGN) problem. In this paper, we presented a branch and bound algorithm for the IGN that uses network relaxation. To improve the procedure, we develop various strategies, each of which employs different node selection criterion and/or branching variable selection criterion. We test these solution strategies and compare their efficiencies with LINDO on 70 randomly generated problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.21
• /
• pp.51-60
• /
• 1990

In this paper we deal with the miniaml cost network flow problem with uncertain arc capacity constraints. When the arc capacities are fuzzy with linear L-R type membership function, using parametric programming procedure, we reduced it to the deterministic minimal cost network flow problem which can be solved by various typical network flow algorithms. A modified Algorithm using the Out-of-kilter algorithm is developed.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.3
• /
• pp.122-129
• /
• 2024

Though programming education has been stressed recently, the elementary, middle, and high school students are having trouble in programming education. Most programming environments for them are based on block coding, which hinders them from moving to text coding. The traditional PC environment has also troubles such as maintenance problems. In this situation, mobile applications can be considered as alternative programming environments. This paper addresses the design and implementation of coding applications for mobile devices. As a prototype, a Scheme interpreter mobile app is proposed, where Scheme is used for programming courses at MIT since it supports multi-paradigm programming. The implementation has the advantage of not consuming the network bandwidth since it is designed as a standalone application. According to the benchmark result, the execution time on Android devices, relative to that on a desktop, was 131% for the Derivative and 157% for the Tak. Further, the maximum execution times for the benchmark programs on the Android device were 19.8ms for the Derivative and 131.15ms for the Tak benchmark. This confirms that when selecting an Android device for programming education purposes, there are no significant constraints for training.