• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1996.10a
• /
• pp.133-137
• /
• 1996

This paper presents a new approach to the design of neural control system using digital signal processors in order to improve the precision and robustness. Robotic manipulators have bevome increasingly important in the field of flexible automation. High speed and high-precision trajectory tracking arre indispensable capabilities for their versatile application. the need to meet demanding control requirement in increasingly complex dynamical control systems under sygnificant uncertainties leads toward design of implementing real time neural control to provide an enhanced motion control for robotic manipulators. In this control scheme the ntworks intrduced are neural nets with dynamic neurouns whose dynamics are distributed over all the network nodes. The nets are trained by the distributed dynamic are distributed over all the network nodes. The nets are trained by the distributed dynamic back propagation algorithm. The proposed neural network control scheme is simple in structure fast in computation and suitable for implementation of real-time control, Performance of the neural controller is illustrated by simulation and experimental results for a SCAEA robot.

• Journal of Information Processing Systems
• /
• v.19 no.1
• /
• pp.130-138
• /
• 2023

The traffic flow in an urban area is affected by the date, weather, and regional traffic flow. The existing methods are weak to model the dynamic road network features, which results in inadequate long-term prediction performance. To solve the problems regarding insufficient capacity for dynamic modeling of road network structures and insufficient mining of dynamic spatio-temporal features. In this study, we propose a novel traffic flow prediction framework called shared spatio-temporal attention convolution optimization network (SSTACON). The shared spatio-temporal attention convolution layer shares a spatio-temporal attention structure, that is designed to extract dynamic spatio-temporal features from historical traffic conditions. Subsequently, the graph optimization module is used to model the dynamic road network structure. The experimental evaluation conducted on two datasets shows that the proposed method outperforms state-of-the-art methods at all time intervals.

• Journal of Korean Society of Transportation
• /
• v.20 no.1
• /
• pp.101-110
• /
• 2002

This study first explains general features of traffic assignment models and network loading methods, and investigates the relationship between them. Then it introduces a dynamic network loading method, which accounts far time variable additionally. First of all, this study suggests that it is important to consider some requirements for the dynamic network loading, such as causality, FIFO(First-In-First-Out) discipline, the flow propagation, and the flow conservation. The details of dynamic network loafing methods are explained in the form of algorithm, and numerical examples are shown in the test network by adopting deterministic queuing model for a link Performance function.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.691-693
• /
• 2004

Mobile Ad hoc network은 stationary infrastructure의 도움 없이 이동 노드들이 필요 시 multi-hop wireless links network 형태를 구성하여 통신이 이루어지게 하는 network이다. 따라서 효율적인 라우팅 프로토콜의 개발이 중요한 issue인데 최근에는 routing overhead가 적은 on-demand 프로토콜이 주목을 받고 있다. On-demand 프로토콜은 새로운 route을 구성하기 위해서 query packet을 broadcasting하게 되는데, 특히 노드들의 mobility가 많은 mobile ad hoc network(MANET)의 경우에는 더욱더 자주 발생하게 되는데, blind broadcasting은 neighbor 노드들 간의 radio transmission region overlap에 의해 redundancy, contention, collision 같은 broadcast storm 문제를 발생시키게 된다. 본 논문은 on-demand 프로토콜의 broadcast storm 문제를 해결하기 위해 Neighbor Topology을 고려 한 Dynamic Adaptation Query flooding scheme을 제시한다. 또한 Dynamic Adaptive Query flooding scheme은 broadcast storm 문제 해결뿐만 아니라 network의 congestion을 감소시켜 data packet의 성능 향상에도 기여 할 것이다.

• 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.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.2
• /
• pp.485-500
• /
• 2018

As the size of the system and network environment grows and the network structure and the system configuration change frequently, network administrators have difficulty managing the status manually and identifying real-time changes. In this paper, we suggest a system that scans dynamic network information in real time, scores vulnerability of network devices, generates all potential attack paths, and visualizes them using attack graph. We implemented the proposed algorithm based attack graph; and we demonstrated that it can be applicable in MTD concept based defense system by simulating on dynamic virtual network environment with SDN.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.17 no.5
• /
• pp.17-30
• /
• 2022

It has been verified in several studies that dynamic capabilities has a very important effect on the competitive advantage of technology startups. And the network has an important influence on this dynamic capability. This is even more important for start-ups that lack the resources and knowledge. Networks that directly and significantly affect dynamic capabilities have been studied mainly the value chain internal. However, network activities of start-ups are conducted not only with the value chain internal networks but also with the value chain external networks. Therefore, it is necessary to study the effect of the value chain internal and external network activity of start-ups on the dynamic capabilities, but prior studies are lacked. In this study, We make a model that encompass the value chain internal and external network for technology startups, and a study was conducted to demonstrate the effect on dynamic capabilities and competitive advantage. As a result of the study, value chain internal network activity directly and significantly affected dynamic capabilities, and value chain external network activity did not directly significantly affect dynamic capacity. And dynamic capabilities had a significant effect on competitive advantage. As confirmed through additional research, value chain external network activity affects value chain internal network activity, and through this, dynamic capabilities are strengthened, and positively affect competitive advantage.. The intensity of value chain external network activity was not significant to dynamic capabilities and the diversity of value chain external network activity had a significant effect on the competitive advantage by double mediating the value chain internal network activity and dynamic capability. Through this study, it is confirmed that the value chain internal networks is important in order for startups to strengthen their dynamic capabilities and increase their competitive advantage, and that both strong and diversified the value chain internal networks positively affects competitive advantage by enhancing dynamic capabilities.

• Proceedings of the KAIS Fall Conference
• /
• 2007.05a
• /
• pp.150-153
• /
• 2007

The intent of this paper is to describe a neural network structure called multi dynamic neural network(MDNN), and examine how it can be used in developing a learning scheme for computing robot inverse kinematic transformations. The architecture and learning algorithm of the proposed dynamic neural network structure, the MDNN, are described. Computer simulations are demonstrate the effectiveness of the proposed learning using the MDNN.

• Communications for Statistical Applications and Methods
• /
• v.10 no.3
• /
• pp.795-804
• /
• 2003

In this article, a tomography for the estimation of the origin-destination(OD) traffic intensities in dynamic routing network is considered. Vardi(1996)'s approach based on fixed route is not directly applicable to dynamic routing protocols, which arises from the fact that we cannot access the route at every observation time. While it uses link-wise traffics as the observations, the proposed method considers the triple of ingress/outgress/relayed traffics data at each node so that we can transform the problem into a routing-independent tomography. An EM algorithm for implementation and some simulated experiments are provided.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.77-86
• /
• 2002

Ford and Fulkerson have shown that a stationary maximal dynamic flow can be obtained by solving a transhipment problem associated with the static network and thereby finding the maximal temporally repeated dynamic flow. This flow is known to be an optical dynamic flow. This paper presents an algorithm for second best temporal1y repeated flows. A numerical example is presented.