• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.39 no.1
• /
• pp.50-55
• /
• 2003

In order to study on the improvement of gill nets and trap nets fishing for the management of fisheries resource in the coastal area of Yellow Sea, we have investigated the general present condition of those fishing, and the actual fishing operation of gill nets for croaker and trap nets for rock shell which is called the the other trap nets, and then measured the body length of croaker and blue shell caught by their fishing vessels. The results are as follows ; 1. The total number of permission for coastal fishing are 12,944 cases, but the number of operation for coastal fishing are 7,558 cases in the coastal area of Yellow Sea. Among the total number of permission, the gill nets fishing are 5,154 cases with 39.8% but even so the number of operation are 3,724 cases, the trap nets fishing are 1,025 cases with 7.6% but even so the number of operation are 662 cases. On the fishing ratio, the gill nets and trap nets fishing are comparatively higher than the other fishing with 72.3% and 64.6%, respectively. 2. The main fishing period of gill nets for croaker is from the middle of July to early of September, and the main fishing grounds are sandymud bottom of 15-50m in depth around the islands of southern parts of western coastal area, and the fishing operation carry out 1∼2 times per day in flood tide and nets hauling conduct in 1∼2 hours after drifting with current. 3. The distribution range of body length of 139 croakers, which are caught in the gill nets, are 43.0∼120.0㎝ and the mode is 85.0㎝. 4. The main fishing period of trap nets for rock shell which is called the other trap nets is all the year round except the catching period of blue crab from early of September to the middle of October, and the main fishing ground are the sandymud bottom of 10∼20m in depth, and nets hauling conduct in next day after nets casting. 5. The distribution range of maximum carapace of 5,372 rock shells are 4.5∼8.5㎝ and the mode is 7.5㎝.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.1
• /
• pp.109-117
• /
• 2010

In this paper, we define the concept of a c-net and study the convergence of c-nets. Also we show that a c-net in a topological space X has a convergent sub-c-net if and only if X is a $Lindel{\ddot{o}}f$ space, if every $G_{\delta}$ set is open in X.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.131-138
• /
• 1994

Petri Nets are a graphical and mathematical modeling and promising tool for describing and studying that are characterized as being concurrent, asychronous, dynamic, distributed and parrallel. The purpose of this paper is to analyze FMS Throughout-Rate by development of Petri Nets So, it applied to FMS composed of 7 machines and 4 different job types. The result of this paper shows the advantage of using Petri Nets.

• Journal of the Korea Society for Simulation
• /
• v.11 no.2
• /
• pp.67-75
• /
• 2002

This paper proposes a parallel simulation algorithm for bounded Petri nets in a single processor, which exploits the SIMD(Single Instruction Multiple Data)-type parallelism. The proposed algorithm is based on a data packing scheme which packs multiple bytes data in a single register, thereby being manipulated simultaneously. The parallelism can reduce simulation time of bounded Petri nets in a single processor environment. The effectiveness of the algorithm is demonstrated by presenting speed-up of simulation time for two bounded Petri nets.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.3
• /
• pp.36-41
• /
• 2005

페트리 네트(Petri Nets)는 이산 사건 시스템을 모델링할 수 있는 그래픽하고, 수학적인 도구이다. 본 연구는 유연제조 시스템을 확률적인 페트리 네트(Stochastic Petri Nets)중의 하나인 임베디드 마코프 체인(Embeded Markov Chain)에 도입하고, 임베디드 마코프 체인의 방법 중에 하나인 일반화된 확률적 페트리 네트(Generalized Stochastic Perti Nets)에 적용시켰다. 그리고 결과치의 정확성을 알아내기 위하여, 페트리 네트 시뮬레이션과 아레나를 사용하여 실행하였다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1338-1341
• /
• 1993

We present here two Petri nets formalisms that can deal with uncertainty by the use of necessity-valued logic. The first and basic model, called necessity-valued Petri nets (NPN), can at the same time deal with uncertainty on markings are on transitions. The second model, called necessity-valued Petri nets (TNPN), is an extension of both NPN and timed Petri nets.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.53 no.1
• /
• pp.1-11
• /
• 2017

Fishing pots are one of the important fishing gears in our coastal and offshore fisheries. In terms of a sustainable use of marine resources, there are concerns about the ghost fishing by lost pots. It is reported that 10 to 70% of the pots are abandoned or lost annually. This study is to compare the catching efficiency of drum type whelk pots that are made of biodegradable nets to those made of the ordinary nets, in the eastern coast of Korea. Five types of drum pots were used with combination of biodegradable nets and ordinary (PA, PE) nets applied to the main and funnel parts of the pots: pots with biodegradable nets (Bio+Bio); pots with PE net (PE+PE); pots with body and funnel made of biodegradable nets and PE nets respectively (Bio+PE); pots with body and funnel made of PE nets and PA nets respectively (PE+PA); pots with body and funnel made of PE nets and biodegradable net respectively (PE+Bio). Field experiments were conducted from June $18^{th}$, 2015 to August $7^{th}$, 2015 using a commercial fishing vessel in the Uljin waters on the eastern coast of Korea. Two fleets of pots with one hundred in each, 20 pots of each type, were casted for 8 to 15 days to analyze their catching efficiency. The catch of target species, whelks, was 202,563.0 g with catch rate of 38.7% of the total catch, while the bycatch was 320,709.7 g with the rate of 61.3% of the total catch. The catch of whelks was the highest in the Bio+PE pots (46,020.3 g), followed by the Bio+Bio pots (42,027.5 g), the PE+Bio pots (41,849.9 g) and the lowest being PE+PE pots (38,054.2 g). Compared to the conventional pots, the pots with biodegradable nets on the body or entrance part had slightly higher catch rate for both the target species and the bycatch. The PE+PE had the lowest catch rate. There is no significant difference in catch between the pots with biodegradable nets and the ordinary nets for the target species such as Buccinum opisthoplectum, Neptunea eulimata, Buccinum striatissimum. Consequently, using biodegradable nets for the conventional whelk pots can reduce ghost fishing by lost gears while keeping the performance of the pots.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.2
• /
• pp.162-171
• /
• 2017

Unmanned military vehicles (UMVs) are most commonly characterized as dealing with dull, dirty, and dangerous tasks with automation. Although most of the UMVs are designed to a high degree of autonomy, the human operator will still intervene in the robot's operation, and teleoperate them to achieve his or her mission. Thus, operator capacity, together with robot autonomy and user interface, is one of the most important design factors in the research and development of the UMVs. Further, communication may affect the operator task performance. In this paper, we analyze the operator performance and the communication effects on the operator performance by using the extended Petri nets, called OTSim nets. The OTSim nets was designed by the authors, being extended using pure Petri nets.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.10
• /
• pp.119-131
• /
• 1994

In this paper, we first propose a new FPGA routing method in which seversal netw are routed concurrently by applying the readitional maze routing method. We then introduce CMRF (concurrent maze Router for FPGA) which can be used for the routing of FpGAs of symmetrical array type by applying our new routing method. Given a set of nets, the proposed routing method performas the maze propagation and backtracing independently for each net and determines the routing paths concurrently by competition among nets. In CMRF, using this routing method, q nets are selected from the nets to be routed and they are routed concurrently, where q is the user given parameter determined by considering the computing environment. This process is repeated until either all the nets are routed or the remaining unrouted nets fail to their maze propagations. The routing of these nets are completed using the rip-up and rerouting technique. We apply our routing method to ten randomly generated test examples in order to check its routing performance. The results show taht as we increase the value of q, the routing completion rate increases for all the examples. Note that when q=1, our method is similar to the conventinal maze routing method. We also compare CMRF with the CGE method which has been proposed by Brown et.al. For the five benchmark examples, CMRF complete the routing with less wire segments in each connection block than the wire segments needed in the CGE method of 100% routing.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.132.3-132
• /
• 2001

In this paper, we focus on the analysis of the scheduling problem in FMS after slicing off some sub-nets using the transitive matrix. This class of Time Petri nets is obtained by merging subnets based on the machine's operations. We can divide original system into some subnets based on machine's operations using Time Petri nets slice and analyze the feasibility time in each schedules. In this paper, we show the usefulness of transitive matrix to slice off some subnets from the original net, and explain on an example.