• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권8호
• /
• pp.2805-2826
• /
• 2021

In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 D
• /
• pp.2401-2403
• /
• 2002

Given a certain target point, the mobile robot's navigation could be mainly considered about two areas, 'how fast and accurate' and 'how safe'. Such problems regarding the velocity and stability possess close relationship with the path in which the mobile robot navigates in. Thus, the system proposed in this research paper was constructed so the mobile robot can obtain the optimum path by utilizing the information according to the environmental map, based on the Global Path Planning. Also by inducing the Local Path Planning method, it was constructed so that the robots can avoid the obstacles, which were not shown in the environmental map on-line. Particularly, by fusing the Local and Global Path Planning together, it is possible for the robots to plan similar path. At the same time, the focus was on the materialization of effective mobile robot's navigation. It was made possible by utilizing the Fuzzy Logic Control. Also, the validity of the algorithm proposed was proven through the trial experiment.

• 전자공학회논문지A
• /
• 제33A권2호
• /
• pp.173-183
• /
• 1996

In this paper, a new structure that can do fault detection and location of digial logic circuits more efficiently using current testing techniques is proposed. In the conventional method, observation point for steady state power supply current was only one, but in the proposed method more fault classes are divided for fault detection and location through the ovservation of steady state power supply current at two points. Also, it is shown that this structure can be easily applied in detection of stuck-open fault which is not easy to do testing with conventional current testing techniques. In the presented mehtod, an extra trasnistor is used, and current path is made compulsorily in the CMOS circuits in which no current path can be established in steady state, then it can be known that stuck-open tault is in the MOS transistor on the considering current path, if this path disappears due to stuck-open fault. The validity and the effectiveness is shwon, thorugh the SPICE simulation of circuits with fault and the current path search experiment using current path search program based on transistor short model wirtten in C language on SUN sparc workstation.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2011년도 춘계학술대회 논문집
• /
• pp.365-370
• /
• 2011

Structure-bone noise is an important aspect to consider during the design and development of a vehicle. Reduction of structure-bone noise of the compartment in a vehicle is an important task in automotive engineering. Many methods which analyze transfer path of noise have been used for structure-bone noise. The existing method to measure of frequency response function of transfer path has been tested by removing a source. This Paper presents an experimental analysis about Transfer Path Analysis of the vehicle interior noise according to Excitation or not. To identify these points of difference, experiment were conducted through an experimental test using simulation vehicle.

• 로봇학회논문지
• /
• 제8권1호
• /
• pp.43-50
• /
• 2013

$A^*$ algorithm is a global path generation algorithm, and typically create a path using only the distance information. Therefore along the path, a moving vehicle is usually not be considered by driving characteristics. Deceleration at the corner is one of the driving characteristics of the vehicle. In this paper, considering this characteristic, a new evaluation function based path algorithm is proposed to decrease the number of driving path corner, in order to reduce the driving cost, such as driving time, fuel consumption and so on. Also the potential field method is applied for driving of UGV, which is robust against static and dynamic obstacle environment during following the generated path of the mobile robot under. The driving time and path following test was occurred by experiments based on a pseudo UGV, mobile robot in downscaled UGV's maximum and driving speed in corner. The experiment results were confirmed that the driving time by the proposed algorithm was decreased comparing with the results from $A^*$ algorithm.

• 한국지능시스템학회논문지
• /
• 제18권2호
• /
• pp.212-215
• /
• 2008

본 논문에서 개선된 Dijkstra 알고리즘과 입자 군집 최적화를 이용한 최적 경로 계획 알고리즘을 제안한다. 최적의 경로를 구하기 위해 우선 이동 로봇 공간에서 MAKLINK를 작성하고 MAKLINK와 관련한 그래프를 얻는다. 여기서 MAKLINK는 장애물의 꼭지점을 연결하면서 볼록집합이 만들어지도록 하는 모서리의 집합을 의미한다. 얻은 그래프에서 출발점과 도착점을 포함하여 Dijkstra 알고리즘을 이용하여 최소 비용 최적 경로를 얻고 이 최적의 경로에서 개선된 Dijkstra경로를 얻는다. 마지막으로 개선된 Dijkstra경로에서 입자 군집 최적화를 적용하여 최적의 경로를 얻는다. 제안된 방법이 논문[1]에 나온 결과보다 더 좋은 성능을 갖는다는 것을 실험을 통해 입증한다.

• 한국IT서비스학회지
• /
• 제20권1호
• /
• pp.93-115
• /
• 2021

Various policy declarations and institutional experiments involving artificial intelligence are being made in most countries. Depending on how the artificial intelligence policy changes, the role of the government, the scope of the policy, and the policy means used may vary, which can lead to the success or failure of the policy. This study proposed a perspective on AI(Artificial Intelligence) in policy research, investigated the theory of path change, and derived the characteristics of path change in AI policy. Since AI policy is related to a wide range of policy areas and the policy making is at the start points, this study is based on the neo-institutional path theory about the types of institutional changes. As a result of this study, AI policy showed the characteristics of path creation, and in detail presented the conflict relationship between institutional design elements, the scalability of policy areas, policy stratification and policy mix, the top policy characteristics transcending the law, and the experiment for regulatory innovation. Since AI can also be used as a key tool for policy innovation in the future, research on the path and characteristics of AI policy will provide a new direction and approach to government policy or institutional innovation seeking digital transformation.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(5)
• /
• pp.29-32
• /
• 2002

In this paper the wheeled mobile robot is studied. The kinematic and dynamic modeling of the robot is presented via LPD(Linear Parameter Dependent) framework. A path-planning algorithm which is optimized in the sense of robot mobility and distance is presented. And by using PI controller we show that the presented algorithm and model is work very well in the computer simulation and experiment.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2000년도 춘계학술대회논문집
• /
• pp.1429-1436
• /
• 2000

Suction muffler is one of the important component of a compressor for low noise level and high efficiency. The suction muffler which has the complicated flow path gives the higher transmission loss of sound, but lower efficiency of compressor results from the superheating effect and flow loss in suction flow path. It is shown that the computational analysis of fluid dynamics are very popular methods for designing of high performance and low noise suction muffler. To reduce the thermodynamic and flow loss in suction process, the flow path of suction muffler was estimated by FVM(Finite Volume Method) and verified by experiments. And to enlarge the transmission loss of sound, the acoustic properties inside the suction muffler was analyzed by FEM(Finite Element Method) and experiments. The smart muffler which gives a good efficiency and low noise character was developed by using those methods, and the effect was evaluated in compressor by experiment.

• 반도체디스플레이기술학회지
• /
• 제9권4호
• /
• pp.45-50
• /
• 2010

This paper explores a new approach for modeling of decision-making problems that involve uncertain, time-dependent and sequence-dependent processes which can be applied to semiconductor industry. In the proposed approach, which is based on probability theory, approximate sample paths are required to be specified by probability and statistic characteristics. Completely specified sample paths are seen to be elementary and fundamental outcomes of the related experiment. The proposed approach is suitable for modeling real processes more accurately. A case study is applied to a single item production planning problem with continuous and uncertain demand and the solution obtained by the approximate path specification method shows less computational efforts and practically desirable features. The application possibility and general plan of the proposed approach in semiconductor manufacturing process is also described in the paper.