• Journal of Digital Convergence
• /
• v.14 no.6
• /
• pp.253-261
• /
• 2016

As many people use internet through the various programs of PC and mobile devices, the possibility of private data leak is increasing. A program should be used after checking security of information flow. Security analysis of information flow is a method that analyzes security of information flow in program. If the information flow is secure, there is no leakage of personal information. If the information flow not secure, there may be a leakage of personal information. This paper proposes a method of analyzing information flow that facilitates SAT solver. The method translates a program that includes variables where security level is set into propositional formula representing control and information flow. The satisfiability of the formula translated is determined by using SAT solver. The security of program is represented through the result. Counter-example is generated if the program is not secure.

• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.101-113
• /
• 2001

Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.

• Knowledge Management Research
• /
• v.11 no.1
• /
• pp.129-146
• /
• 2010

As knowledge has become the most important means of production for a company to survive in a "knowledge-based society", knowledge management has become the key issue in the corporate sector. Despite its growing significance, there are limited numbers of research that describe how companies actually develop, share and practice their knowledge. From this perspective, this study used a qualitative approach to explore on the actual process of knowledge management implementation. In-depth interviews with eleven senior managers, who were working at S global corporation, were conducted. The results show that there are differences between how the participants perceive and how they actually perform in managing knowledge. While the participants tend to conceptualize knowledge management as building a technical system, their performance has shown that knowledge has been developed and shared through active interaction among the members in the company. The factors that impede knowledge management were caused by the individualized job assignment and inapplicable exercises that result in obscuring information flow and utilizing inadequate and low quality of knowledge. The findings of this study imply that knowledge management is not a matter of formality but a paradigm that assures for the flow and share of knowledge.

• Journal of Korean Society of Transportation
• /
• v.36 no.2
• /
• pp.155-168
• /
• 2018

In this study, we studied the directional pattern of entering the intersection from the intersection upstream link prior to predicting short future (such as 5 or 10 minutes) intersection direction traffic volume on the interrupted flow, and examined the possibility of traffic volume prediction using traffic assignment model. The analysis method of this study is to investigate the similarity of patterns by performing cluster analysis with the ratio of traffic volume by intersection direction divided by 2 hours using taxi DTG (Digital Tachograph) data (1 week). Also, for linking with the result of the traffic assignment model, this study compares the impact area of 5 minutes or 10 minutes from the center of the intersection with the analysis result of taxi DTG data. To do this, we have developed an algorithm to set the impact area of intersection, using the taxi DTG data and traffic assignment model. As a result of the analysis, the intersection entry pattern of the taxi is grouped into 12, and the Cubic Clustering Criterion indicating the confidence level of clustering is 6.92. As a result of correlation analysis with the impact area of the traffic assignment model, the correlation coefficient for the impact area of 5 minutes was analyzed as 0.86, and significant results were obtained. However, it was analyzed that the correlation coefficient is slightly lowered to 0.69 in the impact area of 10 minutes from the center of the intersection, but this was due to insufficient accuracy of O/D (Origin/Destination) travel and network data. In future, if accuracy of traffic network and accuracy of O/D traffic by time are improved, it is expected that it will be able to utilize traffic volume data calculated from traffic assignment model when controlling traffic signals at intersections.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.1
• /
• pp.85-101
• /
• 1995

Automated Guided Vehicles(AGVs) are widely used in computer integrated manufacturing(CIM) systems for material handling purposes. Although automated guided vehicles provide higher levels of flexibility and computer integrability, the installations are limited in number and one of the critical reasons lies in the complexity involved in the operation. The main objective of this research is to alleviate this problem by proposing efficient integrated operational control methods for AGV-based CIM systems. Particularly, this research is concerned with the mixed problem of dispatching automated guided vehicles and scheduling machines operation. The proposed dynamic heuristic algorithm uses various priority schemes and relevant information concerning the load of the system, the status of queues, and the position of AGVs in the scheduling process. The scheduling decision process is hierarchical in the sense that different decision criteria are applied sequentially to identify the most appropriate part to be served. This algorithm consists of two sections, the section of part selection by AGVs for the next service whenever an AGV completes the current assignment, and the section of part selection by machines for next service whenever a machine completes the current operation. The proposed algorithm has been compared with other scheduling schemes using the performance measure of mean flow-time and mean tardiness. Simulation results indicate that the proposed algorithm can reduce the mean flow-time and mean tardiness significantly.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.801-803
• /
• 2005

Fundamentally, success of the competitive electricity market is dependent on efficient market design. However, since electricity incorporates various physical constraints as other commodities, the resource assignment (i.e., dispatch scheduling) is also one of requisites for the successful operation of electricity market. Therefore, efficient dispatch scheduling is an important issue to succeed in the deregulated electricity market and the efficiency of this electricity market may be considerably increased by systematic studies on dispatch scheduling algorithm and corresponding constraints, especially system security. Moreover, contrary to traditional vertically-integrated electric power industry condition, since various decision-makings in deregulated electricity market are directly connected with market participants' benefits, only rational dispatch scheduling algorithm can convince these participants. Therefore, it can provide a basis of grievance prevention. In this paper, we propose an algorithm for security constrained dispatch scheduling with respect to load curtailment. Proposed algorithm decomposes the dispatch problem into a master problem corresponding to basecase optimal power flow (OPF) and several subproblems corresponding a series of contingencies using two-stage optimization technique.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.17-29
• /
• 1999

This paper presents a high level synthesis method targeting low power consumption for data-dominated CMOS circuits (e.g., DSP). The high level synthesis is divided into three basic tasks: scheduling, resource and register allocation. For lower power scheduling, we increase the possibility of reusing an input operand of functional units. For a scheduled data flow graph, a compatibility graph for register and resource allocation is formed, and then a special weighted network is then constructed from the compatibility graph and the minimum cost flow algorithm is performed on the network to obtain the minimum power consumption data path assignment. The formulated problem is then solved optimally in polynomial time. This method reduces both the switching activity and the capacitance in synthesized data path. Experimental results show 15% power reduction in benchmark circuits.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.123-125
• /
• 2006

This paper discusses the method of vision based sensor fusion system for biped robot walking. Most researches on biped walking robot have mostly focused on walking algorithm itself. However, developing vision systems for biped walking robot is an important and urgent issue since biped walking robots are ultimately developed not only for researches but to be utilized in real life. In the research, systems for environment recognition and tole-operation have been developed for task assignment and execution of biped robot as well as for human robot interaction (HRI) system. For carrying out certain tasks, an object tracking system using modified optical flow algorithm and obstacle recognition system using enhanced template matching and hierarchical support vector machine algorithm by wireless vision camera are implemented with sensor fusion system using other sensors installed in a biped walking robot. Also systems for robot manipulating and communication with user have been developed for robot.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5149-5173
• /
• 2016

Cooperative forwarding has shown a substantial network performance improvement compared to traditional routing in multi-hop wireless network. To further enhance the system throughput, especially in the presence of highly congested multiple cross traffic flows, a promising way is to incorporate the multi-radio multi-channel (MRMC) capability into cooperative forwarding. However, it requires to jointly address multiple issues. These include radio-channel assignment, routing metric computation, candidate relay set selection, candidate relay prioritization, data broadcasting over multi-radio multi-channel, and best relay selection using a coordination scheme. In this paper, we propose a simple and efficient cluster-based cooperative data forwarding (CCDF) which jointly addresses all these issues. We study the performance impact when the same candidate relay set is being used for multiple cross traffic flows in the network. The network simulation shows that the CCDF with MRMC not only retains the advantage of receiver diversity in cooperative forwarding but also minimizes the interference, which therefore further enhances the system throughput for the network with multiple cross traffic flows.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.197-206
• /
• 2008

The CTOC framework was implemented to efficiently perform analysis and optimization of the Java bytecode that is often being used lately. In order to analyze and optimize the bytecode from the CTOC, the eCFG was first generated. Due to the bytecode characteristics of difficult analysis, the existing bytecode was expanded to be suitable for control flow analysis, and the control flow graph was drawn. We called eCFG(extended Control Flow Graph). Furthermore, the eCFG was converted into the SSA Form for a static analysis. Many loops were found in the conversion program. The previous CTOC performed conversion directly into the SSA Form without processing the loops. However, processing the loops prior to the SSA Form conversion allows more efficient generation of the SSA Form. This paper examines the process of finding the loops prior to converting the eCFG into the SSA Form in order to efficiently process the loops, and exhibits the procedures for generating the loop tree.