• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.657-666
• /
• 2008

The intersection collision avoidance service among various telematics application services is regarded as one of the most critical services with regard to safety. In such safety applications, real-time, correct transmission of service is required. In this paper, we study on efficient infrastructure architecture for intersection collision avoidance using a cooperative mechanism between vehicles and wireless infrastructure. In particular, we propose an infrastructure, called CISN (Cooperative Infrastructure associated with Sensor Networks), in which proper numbers of sensor nodes are deployed on each road, surrounding the intersection. In the proposed architecture, overall service performance is influenced by various parameters consisting of the infrastructure, such as the number of deployed sensor nodes, radio range and broadcast interval of base station, and so on. In order to test the feasibility of the CISN model in advance, and to evaluate the correctness and real-time transmission ability, an intersection sensor deployment simulator is developed. Through various simulations on several environments, we identify optimal points of some critical parameters to build the most desirable CISN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1091-1110
• /
• 2016

Hybrid deployment under current cloud data centers is a combination of online and offline services, which improves the utilization of the cluster resources. However, the performance of the cluster is often affected by the online services in the hybrid deployment environment. To improve the response time of online service (e.g. search engine), an effective scheduling algorithm based on Storm is proposed. At the component level, the algorithm dispatches the component with more influence to the optimal performance node. Inside the component, a reasonable resource allocation strategy is used. By searching the compressed index first and then filtering the complete index, the execution speed of the component is improved with similar accuracy. Experiments show that our algorithm can guarantee search accuracy of 95.94%, while increasing the response speed by 68.03%.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.490-493
• /
• 2004

The purpose of this study is to construct technology product concept a deployment model on seeds type R&D projects. For this purpose, we have peformed the following studies : First, technology opportunities and market opportunities through ${\ulcorner}$perception analysis${\lrcorner}$ are captured by perceptional structure of technology experts and customers on the existing technologies and products. Second, the optimal technology product concept deployed by ${\ulcorner}$SAT(System Alternatives Tree)${\lrcorner}$ has been constructed by the ${\ulcorner}$PWBS(Project work Breakdown structure)${\lrcorner}$.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.12 no.4
• /
• pp.158-168
• /
• 2009

As nation and society progresses, urban ground facilities and their management system get more complicated and the cost and effort to control the system efficiently grows exponentially. This study suggests to the deployment method of a sensor node by Wireless Sensor Network for controling the Urban Ground Facilities of National Facilities. First, we achieve the management facilities and method using the first analysis and then make the coverage of sensing and then set up the Sensor Node in Urban Ground Facilities. Second, we propose the solution way of repetition by the second analysis. And, we embody the GIS program by Digital Map and this method, we improve the reality by overlapping an aerial photo. Also we make an experience on the sensor node allocation using making program. we can remove the repetition sensor node about 50%, and we can confirm that the sensor nodes are evenly distributed on the road.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.2
• /
• pp.79-90
• /
• 2012

In digital virtual manufacturing simulation, Digital Human widely used to optimal workplace design, enhancing worker safety in the workplace, and improving product quality. However, the case of ergonomics simulation solutions to support digital human modeling, Optimal DHM (Digital Human Model) data needed to develop and perform DHM will collect information related to the production process. So simulation developer has burden of collecting information. In this study, to overcome the limitations of existing solutions, we proposed the ADAGIO(Automated Digital humAn model development for General assembly usIng Ontology) framework. The ADAGIO framework was developed for DHM ontology to support optimal deployment of digital virtual environment and in order to ensure consistency of simulation components that are required for simulation modeling was made of a library.

• Journal of the Korea Safety Management & Science
• /
• v.8 no.5
• /
• pp.167-180
• /
• 2006

This study expands limitation of OASIS(Optimal Allocation of Spares for Initial Supports) program, which calculates CSP(Concurrent Spare Part), not only availability but also cost, and developed the program enabling run in WINDOW OS. By considering multi-step repair and logistics support system, repairing capability at the time of deployment, and procurement period, this model is the first local model reflecting circumstances of the armed forces of the Republic of Korea. Furthermore, the programmed model was selected as the military standard software and has being essentially used for CSP calculation.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.88-94
• /
• 2006

In wireless cellular networks, previous researches on admission control policies and resource allocation algorithm considered the QoS (Quality of Service) in terms of CDP (Call Dropping Probability) and CBP (Call Blocking Probability). However, since the QoS was considered only within a predetermined cell capacity, the results indicated a serious overload problem of systems not guaranteeing both CDP and CBP constraints, especially in the hotspot cell. That is why a close interrelationship between CDP, CBP and cell capacity exists. Thus, it is indispensable to consider optimal cell capacity guaranteeing multiple QoS (CDP and CBP) at the time of initial cell planning for networks deployment. In this paper, we will suggest a distributed determination scheme of optimal cell capacity guaranteeing both CDP and CBP from a long-term perspective for initial cell planning. The cell-provisioning scheme is performed by using both the two-dimensional continuous-time Markov chain and an iterative method called the Gauss-Seidel method. Finally, numerical and simulation results will demonstrate that our scheme successfully determines an optimal cell capacity guaranteeing both CDP and CBP constraints for initial cell planning.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1641-1646
• /
• 2006

This paper deals with a physical access network design problem arising from the deployment of fiber-to-the-home passive optical networks (FTTH-PON). The problem seeks to find an optimal location and capacity assignment of splitters in the network such that the total cost of fiber and splitter is minimized, while satisfying all the demand. We propose tabu search approach for finding a good feasible solution.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.2
• /
• pp.152-163
• /
• 2022

In this paper, we present a method to enable an unmanned aerial vehicle to drop the sonobuoy, an essential element of anti-submarine warfare, in an optimal deployment. To this end, an environment simulating the distribution of sound detection performance was configured through the Unity game engine, and the environment directly configured using Unity ML-Agents and the reinforcement learning algorithm written in Python from the outside communicated with each other and learned. In particular, reinforcement learning is introduced to prevent the accumulation of wrong actions and affect learning, and to secure the maximum detection area for the sonobuoy while the vehicle flies to the target point in the shortest time. The optimal placement of the sonobuoy was achieved by applying the Deep Deterministic Policy Gradient (DDPG) algorithm. As a result of the learning, the agent flew through the sea area and passed only the points to achieve the optimal placement among the 70 target candidates. This means that an autonomous aerial vehicle that deploys a sonobuoy in the shortest time and maximum detection area, which is the requirement for optimal placement, has been implemented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3474-3497
• /
• 2016

Network Function Virtualization (NFV) and Software Defined Networking (SDN) are recently considered as very promising drivers of the evolution of existing middlebox services, which play intrinsic and fundamental roles in today's networks. To address the virtual service deployment issues that caused by introducing NFV or SDN to networks, this paper proposes an optimal solution by combining quantum genetic algorithm with cooperative game theory. Specifically, we first state the concrete content of the service deployment problem and describe the system framework based on the architecture of SDN. Second, for the service location placement sub-problem, an integer linear programming model is built, which aims at minimizing the network transport delay by selecting suitable service locations, and then a heuristic solution is designed based on the improved quantum genetic algorithm. Third, for the service amount placement sub-problem, we apply the rigorous cooperative game-theoretic approach to build the mathematical model, and implement a distributed algorithm corresponding to Nash bargaining solution. Finally, experimental results show that our proposed method can calculate automatically the optimized placement locations, which reduces 30% of the average traffic delay compared to that of the random placement scheme. Meanwhile, the service amount placement approach can achieve the performance that the average metric values of satisfaction degree and fairness index reach above 90%. And evaluation results demonstrate that our proposed mechanism has a comprehensive advantage for network application.