• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3412-3432
• /
• 2019

Recent advances in radio frequency (RF) power transfer provide a promising technology to power sensor nodes. Adoption of mobile chargers to replenish the nodes' energy has recently attracted a lot of attention and the mobility assisted energy replenishment provides predictable and sustained power service. In this paper, we study the joint optimization of mobile charging and data gathering in sensor networks. A wireless multi-functional vehicle (WMV) is employed and periodically moves along specified trajectories, charge the sensors and gather the sensed data via one-hop communication. The objective of this paper is to maximize the uplink throughput by optimally allocating the time for the downlink wireless energy transfer by the WMV and the uplink transmissions of different sensors. We consider two scenarios where the WMV moves in a straight line and around a circle. By time discretization, the optimization problem is formulated as a 0-1 programming problem. We obtain the upper and lower bounds of the problem by converting the original 0-1 programming problem into a linear programming problem and then obtain the optimal solution by using branch and bound algorithm. We further prove that the network throughput is independent of the WMV's velocity under certain conditions. Performance of our proposed algorithm is evaluated through extensive simulations. The results validate the correctness of our proposed theorems and demonstrate that our algorithm outperforms two baseline algorithms in achieved throughput under different settings.

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• Journal of KIISE:Software and Applications
• /
• v.29 no.5
• /
• pp.326-335
• /
• 2002

Recently there have been a number of researches to provide code mobility to lazy functional language (LFL) programs by translating LFL programs to Java programs. These approaches are basically baled on architectural similarities between abstract machines of LFLs and Java. The abstract machines of LFLs and Java programming language, Spineless Tagless G-Machine(STGM) and Java Virtual Machine(JVM) respectively, share important common features such as built- in garbage collector and stack machine architecture. Thus, we can provide code mobility to LFLs by translating LFLs to Java utilizing these common features. In this paper, we propose a new translation scheme which fully utilizes architectural common features between STGM and JVM. By redefining STGM as an eval-apply evaluation model, we have defined a new translation scheme which utilizes Java Virtual Machine Stack for function evaluation and totally eliminates stack simulation which causes array manipulation overhead in Java. Benchmark program translated to Java programs by our translation scheme run faster on JDK 1.3 than those translated by the previous schemes.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.567-572
• /
• 2008

It is necessary to study about the scheme to accept IP traffic effectively in OTN, according to expect that IP traffic data will be increase constantly. In this paper, we studied the encapsulation method of IP traffic through GFP in OTN transmission network. Therefore we knew the IP/GFP/OTN method is more efficient than existing methods from structure, overhead rates and possibility of grow, and showed the functional block of high level about this method. Also we showed the implementation scheme of this method by processing the functional simulation to make use of VHDL programming.

• Journal of the Korean Society for Railway
• /
• v.3 no.3
• /
• pp.147-153
• /
• 2000

The train control and monitoring system (TCMS) is an on board computer system in railway vehicles performing the control, supervisory and diagnostic functions of the complete train system. This system replaces a lot of hard-wired relays and minimizes the necessary vehicle wiring thus increasing the reliability of the train. It is also one of more important equipment on vehicle to implement much higher safety and reliability train system. We studied a software design technique of TCMS using a CASE tool that is a kind of safety critical software engineering tool (SCADE). This tool has mainly four functions such as the graphical editor, the document maker, tile automatically code generator, and the test simulator. The several functions of TCMS are implemented in this software easily programmed using a functional block diagram and a graphic programming language. We applied to automatically generated TCMS modules on the SCADE each functional block for the Standard type EMU in Korea. We performed the combination test using TCMS simulator and the running test in Seoul subway 7 Line. We proved that this technique is more useful for the software design of TCMS in urban transit

• Journal of Microbiology and Biotechnology
• /
• v.22 no.5
• /
• pp.600-606
• /
• 2012

Studies into the cell death program termed apoptosis have resulted in new information regarding how cells control and execute their own demise, including insights into the mechanism by which death-preventing factors can inhibit Bax-induced caspase activation. We investigated high temperature stress-induced cell death in Brassica rapa. Using a yeast functional screening from a Brassica rapa cDNA library, the BH5-127 EST clone encoding an apoptotic suppressor peptide was identified. However, a phylogenic tree showed that BH5-127 clusters within a clade containing SUMO-1 (Small Ubiquitin-like Modifier-1). BH5-127 was confirmed similar to have function to SUMO-1 as Fas suppression. Expression of BH5-127 showed that substantial suppression of cell death survived on SD-galactose-$Leu^-$-$Ura^-$ medium. The results suggest that BrSE ($\underline{B}$rassica rapa $\underline{S}$entrin $\underline{E}$ST, BH5-127) is one of the important regulatory proteins in programming cell death, especially in the seedling stage of Chinese cabbage.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.155-162
• /
• 2016

In recent years, hoping the interaction of individuals and rather than software development process and tools, and customers want software that works first, rather than a comprehensive document, in cooperation with the customer, rather than the developer negotiate a contract, to each other stick to the plan I think even more so than the value that corresponds to the change. In view of this, software development is given the autonomy and motivation to project team rather than process-oriented and have a passion and vision and human relations oriented management approach is required. In recent years, increasing the productivity benefits of agile development processes, improved quality, efficiency and customer satisfaction as is demonstrated in the methodology selected to promote the project, attention was given to the experts. Contemporary demands with regard to the methodology chosen to meet your needs, in this paper in the organization, and to solve the problems of product-based Cross functional team proposed methodology Feature Team model, this model is an organizational Cross functional team and the team is not the outcome (product) basis, were examined for the model that points to progress the development across multiple product as a functional unit, value-plan through the driven agile technique-based model and proposed a difference. And the domain analysis, required extraction by conventional JAD (joint application development) meeting the targets for the object-oriented modeling, in modeling and organize, review, aware in advance and the UML Structure and Behavior Diagrams and proposed to proceed with the project.

• Journal of Korean Society of Forest Science
• /
• v.98 no.3
• /
• pp.247-254
• /
• 2009

In this study, linear programming was applied to a case study in Gwangreung Experimental Forest of Korea Forest Research Institute investigating the effect of the desired future conditions on forest management. Considering the social, economic and ecological demands of people from the forest, the forest functions were classified into four including natural conservation, timber production, water yield and scenic conservation. The forest land areas were divided into four-types of forest functional zones and forest management prescriptions including the desired future conditions by the forest function type were established. The Model II linear programming was used in optimizing the forest management planning. The model includes management policies, as the constraints, for non-declining yield, allowable cutting area, allowable % age class distribution and allowable % species allocation as well as the land and other accounting regimes. Maximization of timber production was used the objective function. Based on the Model II formulations, the effects of the desired future conditions by the forest function type on forest management planning were investigated in terms of timber production, net present value and stand structures over time.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1109-1116
• /
• 2015

In this paper, we propose a query processing approach that uses the Spark functional programming and distributed memory system to solve the computational overhead of SPARQL. In the semantic web, RDF ontology data is produced at large scale, and the main challenge for the semantic web is to query and manipulate such a large ontology with a high throughput. The most existing studies on SPARQL have focused on deploying the Hadoop MapReduce framework, and although approaches based on Hadoop MapReduce have shown promising results, they achieve a low level of throughput due to the underlying distributed file processes. Therefore, in order to speed up the query processes, we suggest query- processing methods that are based on memory caching in distributed memory system. Our approach is also integrated with a clause unification method for propagating between the clauses that exploits Spark join, map and filter methods along with caching. In our experiments, we have achieved a high level of performance relative to other approaches. In particular, our performance was nearly similar to that of Sempala, which has been considered to be the fastest query processing system.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2486-2491
• /
• 2003

This paper presents a method to segment object ID marks on poor quality images under uncontrolled lighting conditions of FA inspection process. The method is based on multiple templates and normalized gray-level correlation (NGC) method. We propose a multiple template method, called as ATM (Active Template Model) which uses combinational relation of multiple templates from model templates to match and segment several characters of the inspection images. Conventional Snakes algorithm provides a good methodology to model the functional of ATM. To increase the computation speed to segment the ID mark regions, we introduce the Dynamic Programming based algorithm. Experimental results using images from real FA environment are presented.