• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1811-1816
• /
• 1991

In this paper we present how the deviation bound, which is a synchronic variable, can be used for checking liveness in Petri nets. Also, the deviation bound will be applied to detect or avoid deadlock situations and to characterize concurrency against sequential behaviors in automated manufacturing systems. In the current stage, we restrict the applicable domain of these methods to the Petri net structure that can be synthesized by combining common transitions or common places or common paths of Live-and-Bounded circuits.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2017년도 하계학술대회
• /
• pp.36-39
• /
• 2017

2014 년 Ian Goodfellow 가 발표한 한편의 논문은 머신러닝 분야에 새로운 방향을 제시하였다. Generative Adversarial Networks, 일명 GAN 이라 불리는 이 논문은 이전까지 딥러닝으로 하지못했던 새로운 것을 창조해내는 작업을 하는 첫번째 딥러닝 알고리즘이다. 이전까지는 딥러닝을 통해 영상에서 객체의 종류를 판단하는 Classification 문제나, 영상에서 특정 객체를 검출하여 위치를 찾는 Object detection, 영상 내 특정 객체만 분리해내는 Image segmentation 문제를 해결하고 있었다. GAN 의 등장으로, 다양한 방면에서 GAN 을 적용하여 기존에는 하지 못했던 새로운 분야에 딥러닝을 적용한 사례들이 등장하고 있다. 본 논문에서는 GAN 의 원리 분석과 GAN 을 응용하여 여러 분야에 적용한 사례들을 살펴보고자 한다.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2005년도 BIOINFO 2005
• /
• pp.348-353
• /
• 2005

In this paper we discuss the formulation and the analysis of a signaling pathway by Petri nets. In order to explicitly and formally describe the molecular mechanisms and pathological characteristics of signaling pathways, we propose a new modeling method to construct signaling pathways on the basis of formal representation of Petri net. Our proposed extended algorithm effectively finds basic enzymic components of signaling pathways by employing T-invariants of Petri nets with considering the origination leading to an occurrence of inhibition functions than existing methods. An application of the proposed algorithm is given with the example of Interleukin-1 and Interleukin-6 signaling pathways.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1997년도 춘계학술대회 논문집
• /
• pp.125-130
• /
• 1997

In this paper, it is 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 become increasingly important in the field of flexible automation. High speed and high-precision trajectory tracking are indispensable capabilities for their versatile application. The need to meet demanding control requirement in increasingly complex dynamical control systems under significant uncertainties, leads toward design of intelligent manipulation robots. The TMS320C3x is used in implementing real time neural control to provide an enhanced motion control for robotic manipulators. In this control scheme, the networks introduced are neural nets with dynamic neurons, whose dynamics 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, andsuitable for implementation of robust control.

• 품질경영학회지
• /
• 제31권3호
• /
• pp.114-125
• /
• 2003

In this paper, we deal with the problem of modeling of agent-based robot manufacturing cell. Its role is becoming increasingly important in automated manufacturing systems. For Object Oriented & Queueing Petri Nets (OO&QPNs), an extended formalism for the combined quantitative and qualitative analysis of different systems is used for structure and performance analysis of mobile robotic cell. In the case study, the OO&QPN model of a mobile robotic cell is represented and analyzed, considering multi-class parts, non-preemptive priority and alternative routing. Finally, the comparison of performance values between Shortest Process Time (SPT) rule and First Come First Serve (FCFS) rule is suggested. In general, SPT rule is most suitable for parts that have shorter processing time than others.

• 한국경영과학회지
• /
• 제25권3호
• /
• pp.17-33
• /
• 2000

We consider the Steiner tree packing problem. For a given undirected graph G =(V, E) with positive integer capacities and non-negative weights on its edges, and a list of node sets(nets), the problem is to find a connection of nets which satisfies the edge capacity limits and minimizes the total weights. We focus on the switchbox routing problem in knock-knee model and formulate this problem as an integer programming using Steiner tree variables. The model contains exponential number of variables, but the problem can be solved using a polynomial time column generation procedure. We test the algorithm on some standard test instances and compare the performances with the results using cutting plane approach. Computational results show that our algorithm is competitive to the cutting plane algorithm presented by Grotschel et al. and can be used to solve practically sized problems.

• 전기학회논문지P
• /
• 제62권3호
• /
• pp.139-144
• /
• 2013

In Korea, where most of the sites are narrow in space and their earth resistivity is relatively high, the spaces between grounding conductors are likely to be designed narrow in order to lower ground resistance and dangerous voltage below to the permitted safety values. In addition, ground nets are in the shape of square or rectangle depending on the location and size of the facilities and ground contact area, and inner conductors are laid out in grids like the pattern of nets. Nevertheless, with the existing designs, the marginal voltage for safety gets higher as the area is extended further outside, in comparison with that of inner mesh grounding, thus causing much difficulty maintaining them equipotential, and there exist limits in the burial, grounding grid design considering the dangerous voltage of muti-layered model in the constrained sites, was studied.

• International Journal of Contents
• /
• 제6권4호
• /
• pp.30-34
• /
• 2010

Effective job scheduling scheme is a crucial part of complex heterogeneous distributed systems. Gang scheduling is a scheduling algorithm for grid systems that schedules related grid jobs to run simultaneously on servers in different local sites. In this paper, we address grid jobs (gangs) schedule modeling using Stochastic reward nets (SRNs), which is concerned for static and dynamic scheduling policies. SRN is an extension of Stochastic Petri Net (SPN) and provides compact modeling facilities for system analysis. Threshold queue is adopted to smooth the variations of performance measures. System throughput and response time are compared and analyzed by giving reward measures in SRNs.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2007년도 추계 종합학술대회 논문집
• /
• pp.197-200
• /
• 2007

동적 전력 관리는 서로 다른 전력소모를 갖는 전력상태들을 시스템 구성 요소에 할당하고 상황별로 전력상태를 관리함으로써 시스템의 전력 소모를 현저하게 줄여줄 수 있다. 전력관리의 주 기능은 구성요소의 상태천이를 언제 수행하느냐 이며 이를 위하여 추계적 프로세스에 기반한 동적 전력관리 모델을 개발한다. 동적 모델은 시스템 큐와 다양한 모델링 기능을 표현할 수 있는 페트리 네트의 확장형인 SRN(Stochastic Reward Nets)을 이용하여 개발되며 성능분석을 함께 수행한다.

• 한국통신학회논문지
• /
• 제22권11호
• /
• pp.2365-2374
• /
• 1997

This paper describes two algorithms for technology mapping of multiple output functions into interesting and pupular FPGAs(Field Programmable Gate Array) that use look-yp table memories. For improvement of technology mapping for FPGA, we use the functional decompoition method for multiple output functions. Two algorithms are proposed. The one is the Roth-Karpalgorithm extended for multiple output functions. The other is the efficient algorithm which looks for common decomposition functions through the decomposition procedure. The cost function is used to minimize the number of CLBs and nets and to improve performance of the network. Finally we compare our new algorithm with previous logic design technique. Experimental resutls show sigificant reduction in the number of CLBs and nets.