• The Korean journal of internal medicine
• /
• v.39 no.2
• /
• pp.238-247
• /
• 2024

Background/Aims: Small rectal neuroendocrine tumors (NETs) can be treated with modified endoscopic mucosal resection (EMR). However, an optimal EMR method remains to be established. We aimed to assess the non-inferiority of Tip-in EMR versus precut EMR (EMR-P) for treating rectal NETs. Methods: This prospective, multicenter, randomized controlled trial enrolled patients with rectal NETs of < 10 mm in diameter. The patients were randomly assigned to EMR-P and Tip-in EMR groups in a 1:1 ratio. Primary outcome was margin-negative (R0) resection rate between the two methods, with a noninferiority margin of 10%. Results: Seventy-five NETs in 73 patients, including 64 eligible lesions (32 lesions in each, EMR-P and Tip-in EMR groups), were evaluated. In a modified intention-to-treat analysis, R0 resection rates of the EMR-P and Tip-in EMR groups were 96.9% and 90.6%, respectively, which did not demonstrate non-inferiority (risk difference, -6.3 [95% confidence interval: -18.0 to 5.5]). Resection time in the EMR-P group was longer than that in the Tip-in EMR group (p < 0.001). One case of intraprocedural bleeding was reported in each group. Conclusions: We did not demonstrate the non-inferiority of Tip-in EMR compared to EMR-P for treating small rectal NETs. However, the R0 resection rates for both techniques were high enough for clinical application.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.28 no.2
• /
• pp.194-201
• /
• 1995

In order to make clear the resistance of bag nets, the resistance R of bag nets with wall area S designed in pyramid shape was measured in a circulating water tank with control of flow velocity v and the coefficient k in $R=kSv^2$ was investigated. The coefficient k showed no change In the nets designed in regular pyramid shape when their mouths were attached alternately to the circular and square frames, because their shape in water became a circular cone in the circular frame and equal to the cone with the exception of the vicinity of frame in the square one. On the other hand, a net designed in right pyramid shape and then attached to a rectangular frame showed an elliptic cone with the exception of the vicinity of frame in water, but produced no significant difference in value of k in comparison with that making a circular cone in water. In the nets making a circular cone in water, k was higher in nets with larger d/l, ratio of diameter d to length I of bars, and decreased as the ratio S/S_m$ of S to the area $S_m$ of net mouth was increased or as the attack angle 9 of net to the water flow was decreased. But the value of ks15m was almost constant in the region of S/S_m=1-4$ or $\theta=15-90^{\circ}$ and in creased linearly in S/S_m>4 or in $\theta<15^{\circ}$ However, these variation of k could be summarized by the equation obtained in the previous paper. That is, the coefficient $k(kg\;\cdot\;sec^2/m^4)$ of bag nets was expressed as $$k=160R_e\;^{-01}(\frac{S_n}{S_m})^{1.2}\;(\frac{S_m}{S})^{1.6}$$ for the condition of $R_e<100$ and $$k=100(\frac{S_n}{S_m})^{1.2}\;(\frac{S_m}{S})^{1.6}$$ for $R_e\geq100$, where $S_n$ is their total area projected to the plane perpendicular to the water flow and $R_e$ the Reynolds' number on which the representative size was taken by the value of $\lambda$ defined as $$\lambda={\frac{\pi d^2}{21\;sin\;2\varphi}$$ where If is the angle between two adjacent bars, d the diameter of bars, and 21 the mesh size. Conclusively, it is clarified that the coefficient k obtained in the previous paper agrees with the experimental results for bag nets.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.5
• /
• pp.572-579
• /
• 1988

In this paper, a system of automatic placement and routing for gate array layout design is proposed. In the placement stage, the circuit is partitioned and using the concept of min-cut slicing, and each partitioned module is placed, so that the routing density over the entire chip be uniformized and the total wiring length be minimized. In the global routing stage, the concept of the probabilistic routing density is introduced to unify the wiring congestions in each channel. In the detailed routing stage, the multi-terminal nets are partitioned into the two-terminal nets. The ordered channel graph is proposed which implies the vertical and the horizontal constranint graphs simultaneously. And using the ordered channel graph, the proposed routing algorithm assigns the signal nets to the tracks. Also the proposed placement and routing algorithms are implimented on IBM/PC-AT to construct PC-level gate array layout system.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.202-214
• /
• 1994

A functional reduction method of Petri nets is proposed. The method is based on interpretation of relations and transitions with functions which map one series of a relation a another. In particular, we propose CF-join which combines two transitions to new one after reduction of the common places, CE-join which superpose two transitions to one after superposition of the common places, and EQ-join which reduces the common places, after the Petri nets were explained be a relational scheme. A reduced net can be obtained without changing the properties such as liveness and boundness.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.19 no.3
• /
• pp.28-36
• /
• 1982

Petri nets have been used for medeling a wide variety of systems from computer to social systems. This paper disusses Petri nets in the context of mathematical representation and its associated bag theory. The method of modeling systems such as event-condition, computer progranm computer operation and PERT chart is discribed and their Petri net representation are presented. Finally Petri net representation of tunnel diode oscillator circuit and the analysis of the circuit using Petri net are discussed with the program and results.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1564-1569
• /
• 1991

In this paper we describe Flexible Manufacturing Systems (FMS) using Petri nets, since Petri nets provide a powerful tool for modeling dynamical behavior of discrete concurrent processes. We deal with off-Line and on-Line rule-based scheduling of FMS. The role of the rule-base is to generate appropriate priority rule for resolving conflicts, that is, for selecting one of enabled transitions to be fired in a conflict set of the Petri nets. This corresponds to select a part type to be processed in the FMS. Towards developing more Intelligent Manufacturing Systems (IMS) we propose a conceptual framework of a futuristic intelligent scheduling system.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.7
• /
• pp.30-41
• /
• 1992

As a general model of rule-based systems, we propose a model for a fuzzy production system having chaining rules and an inference engine associated with the model. The concept of so-called 'fuzzy petri nets' is used to model the fuzzy production system and the inference engine is designed to be capable of handling inexact knowledge. The fuzzy logic is adopted to represent vagueness in the rules and the certainty factor is used to express uncertainty of each rules given by a human expert. Parallel, inference schemes are devised by transforming Fuzzy Petri nets to matrix formula. Futher, the inference engine mechanism under the Mamdani's implication method can be desceribed by a simple algebraic formula, which makes real time inference possible.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.10
• /
• pp.49-56
• /
• 1992

A new global routing algorithm which dynamically adjusts its cost parameters depending on the given routing poroblem to find a near optimum solution has been developed. The proposed algorithm efficiently performs global routing on general area in which all the pin positions are given. This algorithm is composed of two phases`In the first phase, it routes each net by searching a minimum cost path while ignoring the channel capacity. In the second iterative phase, it rips up nets which pass the channel at which the horizontal or vertical routing density exceeds the capacity and then it reroutes them using a modified set of cost parameters. Applying the above phases, paths for nets are found such that routing density doesn't exceed the capacity in each channel and that nets are routed with minimum cost. Experimental results for several benchmark examples including difficult-4, difficult-8, difficult-16, Primary1 and Primary2 show that our method generates better results than other published ones.

• 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 Institute of Control, Robotics and Systems
• /
• v.7 no.6
• /
• pp.540-549
• /
• 2001

An implementation method for chip-mounter simulator is proposed to improve the productivity and utility of electronic assembly lines. The simulator emulates the assembly sequence graphically to verify the chip mounter program in offline. It also presents functions of time estimation and productivity analysis considering the error probability. To increase the flexibility of simulator, stochastic petri nets are applied to modeling of the assembly sequence. The sequence model is then implemented as extendable classes by an object oriented language. The simulator is applied to a commercial chip mounter to verify the usefulness of the method proposed.