• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1992년도 봄 학술발표회 논문집
• /
• pp.7-12
• /
• 1992

The variable node plate bending element, ie, the element with one or two additional mid-side nodes is used in the analysis of mat foundation to generate the nearly ideal grid model in which more nodes are defined near the column location. The plate bending element used in this study is the one based on Mindlin/Reissner plate theory with substitute shear strain field and the nodal stresses of that element are obtained by the local smoothing technique. The interaction of the soil material with the mat foundation is modeled with Winkler springs connected to the nodal points in the mat model. The vertical stiffness of the soil material are represented in terms of a modulus of subgrade reaction and are computed in the same way as to the computation of consistent nodal force of uniform surface loading. Several mesh schemes were proposed and tested to find the most suitable scheme for mat foundation analysis.

• 한국통신학회논문지
• /
• 제34권10C호
• /
• pp.937-945
• /
• 2009

본 논문에서는 변수노드의 차수가 3인 정칙 LDPC 부호의 absorbing 집합(AS)에 대한 여러 가지 성질을 알아본다. Girth가 인 경우, 가장 작은 absorbing 집합은 AS임을 보였고, 인 경우 이 AS가 가장 작은 fully absorbing 집합임을 증명하였다. 또한 (3,5) Tanner LDPC 부호에서 오류 마루의 주원인으로 꼽히는 몇몇 absorbing 집합의 critical number를 유도하였다.

• ETRI Journal
• /
• 제36권4호
• /
• pp.591-598
• /
• 2014

This paper proposes a new min-sum algorithm for low-density parity-check decoding. In this paper, we first define the negative and positive effects of the received signal-to-noise ratio (SNR) in the min-sum decoding algorithm. To improve the performance of error correction by considering the negative and positive effects of the received SNR, the proposed algorithm applies adaptive scaling factors not only to extrinsic information but also to a received log-likelihood ratio. We also propose a combined variable and check node architecture to realize the proposed algorithm with low complexity. The simulation results show that the proposed algorithm achieves up to 0.4 dB coding gain with low complexity compared to existing min-sum-based algorithms.

• 응용통계연구
• /
• 제18권3호
• /
• pp.661-671
• /
• 2005

본 연구는 반복분할(recursive partitioning)에 의한 군집화 방법을 개발하고 활용 예를 보인다. 노드 분리 기준으로는 Overall R-Square를 채택하였고 실용적인 노드 분리 결정 방법을 제안하였다. 이 방법은 연속형 자료에 대하여 나무 형태의 해석하기 쉬운 단순한 규칙을 제공하면서 동시에 변수선택기능을 제공한다. 환용 예로서 Fisher의 붓꽃데이터와 Telecom 사례에 적용해 보았다. K-평균 군집화와 다른 몇 가지 사항이 관측되었다.

• Journal of information and communication convergence engineering
• /
• 제9권6호
• /
• pp.625-628
• /
• 2011

Dynamic sensor network(DSN) technology which is based on swarming flight type air node offers analyzed and acquired information on target data gathered by air nodes in rotation flight or 3 dimension array flight. Efficient operation of dynamic sensor network based on air node is possible when problems of processing time, data transmission reliability, power consumption and intermittent connectivity are solved. Delay tolerant network (DTN) can be a desirable alternative to solve those problems. DTN using store-and-forward message switching technology is a solution to intermittent network connectivity, long and variable delay time, asymmetric data rates, and high error rates. However, all processes are performed at the bundle layer, so high power consumption, long processing time, and repeated reliability technique occur. DSN based on swarming flight type air node need to adopt store-and-forward message switching technique of DTN, the cancelation scheme of repeated reliability technique, fast processing time with simplified layer composition.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.629-630
• /
• 2008

MANET is depended on the property as like variable energy, high degree of mobility, location environments of nodes etc. So, in this paper, we propose an algorithm techniques which is TICC (Time Interval Clustering Control) based on energy value in property of each node for solving cluster problem. It provides improving cluster energy efficiency how can being node manage to order each node's energy level. TICC is clustering method. It has shown that Node's energy efficiency and life time are improved in MANET.

• 정보처리학회논문지A
• /
• 제8A권2호
• /
• pp.117-124
• /
• 2001

At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the $320{\times}320$ matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제13권1호
• /
• pp.8-14
• /
• 2013

A low density parity check (LDPC) decoder provides a most powerful error control capability for mobile communication devices and storage systems, due to its performance being close to Shannon's limit. In this paper, we introduce an efficient overlapped LDPC decoding algorithm using a upper dual-diagonal parity check matrix structure. By means of this algorithm, the LDPC decoder can concurrently execute parts of the check node update and variable node update in the sum-product algorithm. In this way, we can reduce the number of clock cycles per iteration as well as reduce the total latency. The proposed decoding structure offers a very simple control and is very flexible in terms of the variable bit length and variable code rate. The experiment results show that the proposed decoder can complete the decoding of codewords within 70% of the number of clock cycles required for a conventional non-overlapped decoder. The proposed design also reduces the power consumption by 33% when compared to the non-overlapped design.

• 한국정보통신학회논문지
• /
• 제5권2호
• /
• pp.257-262
• /
• 2001

본 논문에서는 WDM 기반의 Local Network에서 가변길이 메시지를 수용하기 위한 스케줄링 프로토콜을 제안하였다. 제안된 프로토콜은 제어채널을 예약슬롯과 제어슬롯으로 나누어 제어 패킷의 충돌로 인한 액세스 지연시간을 최소화하였다. 즉, 전송할 메시지가 있는 노드는 빈 제어슬롯이 있으면 제어패킷을 제어슬롯에 전송하고 메시지를 전송한다. 그리고 메시지의 전송이 완료될 때까지 주기적으로 제어패킷을 전송하여 가변길이의 메시지를 전송할 수 있도록 하였다. 또한 빈 제어슬롯이 없는 경우에는 예약슬롯을 이용하여 가장 가까운 시간에 메시지를 전송하기 위한 데이터 슬롯을 미리 예약하여 제어패킷의 충돌로 인한 재전송 횟수를 감소시켰다. 제안된 알고리즘은 기존 프로토콜의 문제점을 해결하였으며 성능향상과 액세스지연시간의 감소 효과를 보였다.

• Wind and Structures
• /
• 제1권1호
• /
• pp.111-125
• /
• 1998

This paper deals with the development of variable-node element and its application to the adaptive h-version mesh refinement-recovery for the incompressible viscous flow analysis. The element which has variable mid-side nodes can be used in generating the transition zone between the refined and unrefined element and efficiently used for the construction of a refined mesh without generating distorted elements. A modified Guassian quadrature is needed to evaluate the element matrices due to the discontinuity of derivatives of the shape functions used for the element. The penalty function method which can reduce the number of the independent variables is adopted for the purpose of computational efficiency and the selective reduced integration is carried out for the convection and pressure terms to preserve the stability of solution. For the economical analysis of transient problems in which the locations to be refined are changed in accordance with the dynamic distribution of velocity gradient, not only the mesh refinement but also the mesh recovery is needed. The numerical examples show that the optimal mesh for the finite element analysis of a wind around the structures can be obtained automatically by the proposed scheme.