• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.53-63
• /
• 2022

In the paper, we propose a TSCH-based scheduling scheme for IEEE 802.15.4e, which is able to perform the scheduling of its own network by avoiding collision from interference network cluster (INC). Firstly, we model a bipartite graph structure for presenting the slot-frame (channel-slot assignment) of TSCH. Then, based on the bipartite graph edge weight, we utilize the Hungarian assignment algorithm to implement a scheduling scheme. We have employed two features (maximization and minimization) of the Hungarian-based assignment algorithm, which can perform the assignment in terms of minimizing the throughput of INC and maximizing the throughput of own network. Further, in this work, we called the scheme "dual-stage Hungarian-based assignment algorithm". Furthermore, we also propose deep learning (DL) based deep neural network (DNN)scheme, where the data were generated by the dual-stage Hungarian-based assignment algorithm. The performance of the DNN scheme is evaluated by simulations. The simulation results prove that the proposed DNN scheme providessimilar performance to the dual-stage Hungarian-based assignment algorithm while providing a low execution time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.189-199
• /
• 1994

This paper considers the covering network design problem (CNDP). In the CNDP, an undirected graph is given where nodes correspond to potential facility sites and arcs to potential links connecting facilities. The objective of the CNDP is to identify the least cost connected subgraph whose nodes cover the given demand points. The problem difines a demand point to be covered if some node in the selected graph is present within an appropriate distance from the demand point. We present an integer programming formulation for the problem and develop a dual-based solution procedure. The computational results for randomly generated test problems are also shown.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.57 no.3
• /
• pp.260-264
• /
• 2008

In this paper, a dual mode baseband analog channel selection filter is described which is designed for the Bluetooth and WCDMA wireless communications. Using the presented current-mode integrator, a dual mode channel selection filter is designed. To verify the current-mode integrator circuit, Hspice simulation using 1.8V Hynix $0.18{\mu}m$ standard CMOS technology was performed and achieved $50.0{\sim}4.3dB$ gain, $2.29{\sim}10.3MHz$ unity gain frequency. The described third-order dual mode analog channel selection filter is composed of the current-mode integrator, and used SFG(Signal Flow Graph) method. The simulated results show 0.51, 2.40MHz cutoff frequency which is suitable for the Bluetooth and WCDMA baseband block each.

• Annual Conference on Human and Language Technology
• /
• 2019.10a
• /
• pp.25-29
• /
• 2019

딥러닝을 이용한 한국어 의존 파싱은 전이 기반 방식과 그래프 기반 방식으로 나뉘어 연구되어 왔다. 전이 기반 방식은 입력 버퍼와 스택으로부터 자질을 추출하여 모델을 통해 액션을 결정하고 액션에 따라 파스트리를 생성해 나가는 상향식(Botton-Up)의 지역적 모델이고 그래프 기반 방식은 문장 내의 모든 단어에 대해 지배소, 의존소가 될 수 있는 점수를 딥러닝 모델을 통해 점수화하여 트리를 생성하는 전역적 모델이다. 본 논문에서는 Dual Decomposition을 이용하여 하이브리드 방식으로 전이 기반 파서와 그래프 기반 파서를 결합하는 방법을 제안하고 BERT 언어 모델을 반영하여 세종 데이터 셋에서 UAS 94.47%, LAS 92.58% 그리고 SPMRL '14 데이터 셋에서 UAS 94.74%, UAS 94.20%의 성능을 보여 기존 그래프 기반 파서의 성능을 더욱 개선하였다.

• Annual Conference on Human and Language Technology
• /
• 2019.10a
• /
• pp.537-539
• /
• 2019

구문 분석은 문장의 구조를 분석하는 자연어처리 분야로 그래프 기반 방법과 전이 기반 방법으로 나뉘어 연구되어 왔다. 본 논문에서는 그래프 기반 방식에서 높은 성능을 보이고 있는 Deep Biaffine 어텐션 모델에 별도의 High-Order 정보 추출 없이 Graph Neural Network(GNNs)을 이용하여 High-Order 정보를 학습할 수 있도록 확장한 Deep Biaffine 어텐션 GNNs을 적용하여 한국어 세종 구문 분석 셋에서 UAS : 94.44%, LAS : 92.55%의 성능을 달성하였으며 Dual Decomposition을 통해 전이 기반 한국어 구문 분석 모델과 결합하여 추가적인 성능 향상을 보였다.

• Journal of the Korean Mathematical Society
• /
• v.61 no.1
• /
• pp.133-147
• /
• 2024

Let G = (V, E) be a connected finite graph. We study the existence of solutions for the following generalized Chern-Simons equation on G $${\Delta}u={\lambda}e^u(e^u-1)^5+4{\pi}\sum_{s=1}^{N}\delta_{ps}$$, where λ > 0, δ_ps is the Dirac mass at the vertex p_s, and p₁, p₂, . . . , p_N are arbitrarily chosen distinct vertices on the graph. We show that there exists a critical value $\hat{\lambda}$ such that when λ > $\hat{\lambda}$, the generalized Chern-Simons equation has at least two solutions, when λ = $\hat{\lambda}$, the generalized Chern-Simons equation has a solution, and when λ < $\hat{\lambda}$, the generalized Chern-Simons equation has no solution.

• Proceeding of EDISON Challenge
• /
• 2016.03a
• /
• pp.344-346
• /
• 2016

본 논문에서는 3-stream model에 기반한 Dopant diffusion simulator를 사용하여 실리콘 기판 내부의 As이온의 확산을 시뮬레이션한 결과와 Dual-Pearson Analytic model에 기반하여 Ion implantation을 1-D doping simulation한 결과를 토대로 여러 공정 설계에서 diffusion simulator의 사용가능함을 확인하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1327-1331
• /
• 1990

A new dual loop controller using color LCD bar graphs with LED back lights has been developed. An optional memory card is used to load or save the controller configuration, which may be a preprogrammed standard package or a user-programmed configuration, in addition to the built-in functions ready for user selection. The bar-graph display is selectable for single-loop or dual-loop use. A high grade of self-tuning functions using a modeling technique is built-in as standard. The controller can accommodate optional plug-in modules for thermocouples, communication, etc. All the options are fully field upgradable.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.9 no.6
• /
• pp.788-794
• /
• 1985

A study on the number density in a dual beam LDV is carried out with moving particles of various irregular arrangements. Ratious of the particle diameter to the particle to the fringe Spacing are D/.delta. = 0.3, 0.5, 1.0 and 1.5. In the case of the small number of moving particles(N<10), the visibility is influenced much by the difference of the phase of particles for one side fringe and the change in visibility is shown remarkable. In the case of the larger number of particles, the decreasing rate for visibility on the graph is smooth because the effect of the phase difference of particles is decreased by more unitorm distribution of particles over fringes. And the formula of the number density on the basis of probability is fairly compared with experimental values.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.977-986
• /
• 2015

Let G be a graph on the vertex set $V(G)=\{x_1,{\cdots},x_n\}$ with the edge set E(G), and let $R=K[x_1,{\cdots},x_n]$ be the polynomial ring over a field K. Two monomial ideals are associated to G, the edge ideal I(G) generated by all monomials $x_i,x_j$ with $\{x_i,x_j\}{\in}E(G)$, and the vertex cover ideal $I_G$ generated by monomials ${\prod}_{x_i{\in}C}{^{x_i}}$ for all minimal vertex covers C of G. A minimal vertex cover of G is a subset $C{\subset}V(G)$ such that each edge has at least one vertex in C and no proper subset of C has the same property. Indeed, the vertex cover ideal of G is the Alexander dual of the edge ideal of G. In this paper, for an unmixed bipartite graph G we consider the lattice of vertex covers $L_G$ and we explicitly describe the minimal free resolution of the ideal associated to $L_G$ which is exactly the vertex cover ideal of G. Then we compute depth, projective dimension, regularity and extremal Betti numbers of R/I(G) in terms of the associated lattice.