• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.4
• /
• pp.77-84
• /
• 2001

Since Hopfield introduced the neural network for liner programming problems many papers have been published about it and some of them are about nonlinear programming problems Therefore nonlinear, cost function problem has been solved however nonlinear constraints problem has not been solved In this paper I have proposed the general nonlinear programming neural networks which minimize cost function with nonlinear constraints.

• Korean Management Science Review
• /
• v.23 no.2
• /
• pp.161-174
• /
• 2006

In this paper, we consider a network optimization problem arising from the deployment of BcN access network. BcN convergence services requires that access networks satisfy QoS meausres. BcN services have two types of traffics : stream traffic and elastic traffic. Stream traffic uses blocking probability as a QoS measure, while elastic traffic uses delay factor as a QoS measure. Incorporating the QoS requirements, we formulate the problem as a nonlinear mixed-integer Programming model. The Proposed model seeks to find a minimum cost dimensioning solution, while satisfying the QoS requirement. We propose two local search heuristic algorithms for solving the problem, and develop a network design system that implements the developed heuristic algorithms. We demonstrate the computational efficacy of the proposed algorithm by solving a realistic network design problem.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.184-197
• /
• 2015

This paper builds on a recent method, chain routing with even energy consumption (CREEC), for designing a wireless sensor network with chain topology and for scheduling the communication to ensure even average energy consumption in the network. In here a new suboptimal design is proposed and compared with the CREEC design. The chain topology in CREEC is reconfigured after each group of n converge-casts with the goal of making the energy consumption along the new paths between the nodes in the chain as even as possible. The new method described in this paper designs a single near-optimal Hamiltonian circuit, used to obtain multiple chains having only the terminal nodes different at different converge-casts. The advantage of the new scheme is that for the whole life of the network most of the communication takes place between same pairs of nodes, therefore keeping topology reconfigurations at a minimum. The optimal scheduling of the communication between the network and base station in order to maximize network lifetime, given the chosen minimum length circuit, becomes a simple linear programming problem which needs to be solved only once, at the initialization stage. The maximum lifetime obtained when using any combination of chains is shown to be upper bounded by the solution of a suitable linear programming problem. The upper bounds show that the proposed method provides near-optimal solutions for several wireless sensor network parameter sets.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.3
• /
• pp.250-259
• /
• 2001

Given a tree structured network in which each node has its own demand and also stands for a candidate location of a potential facility, such as plant or warehouse, a capacitated facility location problem on the network (CFLPOT) is to decide capacitated facility locations so that the total demand occurred on the network can be satisfied from those facilities with the minimum cost. In this paper, we first introduce a mixed integer programming formulation for CFLPOT with two additional assumptions, the indivisible demand assumption and the contiguity assumption and then show that it can be reformulated as a tree partitioning problem with an exponential number of variables. We then show that it can be solved in O($n^2b$) time by utilizing the limited column generation method developed by Shaw (1993), where n is the total number of nodes in the network and b is the maximum facility capacity. We also develop a depth-first dynamic programming algorithm with a running time of O(nb) for finding the locally maximal reduced cost which plays an important role in the limited column generation method. Finally, we implement our algorithms on a set of randomly generated problems and report the computational results.

• Journal of information and communication convergence engineering
• /
• v.6 no.4
• /
• pp.448-453
• /
• 2008

This study describes design and development techniques of estimation models for process modeling. One case study is undertaken to design a model using standard gas furnace data. Neural networks (NN) and genetic programming (GP) are each employed to model the crucial relationships between input factors and output responses. In the case study, two models were generated by using 70% training data and evaluated by using 30% testing data for genetic programming and neural network modeling. The model performance was compared by using RMSE values, which were calculated based on the model outputs. The average RMSE for training and testing were 0.8925 (training) and 0.9951 (testing) for the NN model, and 0.707227 (training) and 0.673150 (testing) for the GP model, respectively. As concern the results, the NN model has a strong advantage in model training (using the all data for training), and the GP model appears to have an advantage in model testing (using the separated data for training and testing). The performance reproducibility of the GP model is good, so this approach appears suitable for modeling physical fabrication processes.

• Journal of KIISE:Information Networking
• /
• v.37 no.1
• /
• pp.8-15
• /
• 2010

In this study, we present an extended complex event model by considering both of the complex event and the aspect-oriented programming. We propose an advanced scheme for the event specification suited for the event correlation based network management systems by merging these two models. Specifically, we extend the model to support hierarchical event structures and let the model recognize point-cuts of aspect-oriented programming as events. We provide the event operators designed to specify the events on instances and handle temporal relations of the instances. Lastly, we compare the proposed model with other event models and present the benefits of it.

• Proceedings of the Korea Database Society Conference
• /
• 1995.12a
• /
• pp.3-19
• /
• 1995

시스템 Technology ★ Server Technology - 운영환경구축 ★ Network 구성설계 - ATM, FDDI, NMS ★ Client/Server시스템 구성별 Bench Marking ★ Windows 메뉴 및 GUI 설계 ★다기능 PC 운영환경 설정 시스템 Technology ★ Data Base Technology - DB Administration - BB Performance Tuning ★ System Integration Technology - Application Integration - System Flow Control - Task Control - Applicational Interface - S/W Down Load 시스템 Technology ★ Memory Optimization ★ IBM/Facom Host API ★ 영상전화 Customizing - Intel Proshare ★ Auto Dialing - CTI Link ★ IC-Card Interface 시스템 Technology ★ Sound 처리 - Voice Mail - 음절 처리 ★ Image 처리 ★도움말 처리 - Hyper Text 시스템 Technology ★ Socket Programming - 긴급메일 - Peer to peer message switching ★ Set Up Programming -Install Shield ★ DB Access Programming - DB-Library ★ TCP/IP Programming(중략)

• International Journal of Computer Science & Network Security
• /
• v.22 no.1
• /
• pp.105-112
• /
• 2022

The development and spread of IT-technologies has raised interest in teaching programming pupils. The article deals with problems related to programming and ways to overcome them. The importance of programming skills is emphasized, as this process promotes the formation of algorithmic thinking of pupils. The authors determined the level of pupils' interest to programing learning depending on the age. The analysis has showed that the natural interest of younger pupils in programming is decreasing over the years and in the most productive period of its study is minimized. It is revealed that senior school pupils are characterized by low level of interest in the study of programming; lack of motivation; the presence of psychological blocks on their own abilities in the context of programming; law level of computer science understanding. To overcome these problems, we conducted the second stage of the experiment, which was based on a change in the approach to programing learning, which involved pupils of non-specialized classes of senior school (experimental group). During the study of programming, special attention was paid to the motivational and psychological component, as well as the use of game technologies and teamwork of pupils. The results of the pedagogical experiment on studying the effectiveness of teaching programming for pupils of nonspecialized classes are presented. Improvement of the results provided the use of social and cognitive motives; application of verbal and non-verbal, external and internal means; communicative attacks; stimulation and psychological setting; game techniques, independent work and reflection, teamwork. The positive effect of the implemented methods is shown by the results verified by the methods of mathematical statistics in the experimental and control groups of pupils.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.179-189
• /
• 1994

A two-phase neural network finds exact feasible solutions for a constrained optimization programming problem. The time-varying programming neural network is a modified steepest-gradient algorithm which solves time-varying optimization problems. In this paper, we propose a time-varying two-phase optimization neural network which incorporates the merits of the two-phase neural network and the time-varying neural network. The proposed algorithm is applied to system identification and function approximation using a multi-layer perceptron. Particularly training of a multi-layer perceptrion is regarded as a time-varying optimization problem. Our algorithm can also be applied to the case where the weights are constrained. Simulation results prove the proposed algorithm is efficient for solving various optimization problems.

• Journal of Korea Multimedia Society
• /
• v.11 no.6
• /
• pp.807-815
• /
• 2008

A simple efficient method of spotting and recognizing hand gestures in video is presented using a network of hidden Markov models and dynamic programming search algorithm. The description starts from designing a set of isolated trajectory models which are stochastic and robust enough to characterize highly variable patterns like human motion, handwriting, and speech. Those models are interconnected to form a single big network termed a spotting network or a spotter that models a continuous stream of gestures and non-gestures as well. The inference over the model is based on dynamic programming. The proposed model is highly efficient and can readily be extended to a variety of recurrent pattern recognition tasks. The test result without any engineering has shown the potential for practical application. At the end of the paper we add some related experimental result that has been obtained using a different model - dynamic Bayesian network - which is also a type of stochastic model.