http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Jang, Hwanseok,Kim, Jongseong,Shin, Jennifer H.,Fredberg, Jeffrey J.,Park, Chan Young,Park, Yongdoo GENERAL AND APPLIED CHEMISTRY JOURNALS 2019 LAB ON A CHIP Vol.19 No.9
<P>Collective cellular migration plays a central role in development, regeneration, and metastasis. In these processes, mechanical interactions between cells are fundamental but measurement of these interactions is often hampered by technical limitations. To overcome some of these limitations, here we describe a system that integrates microfluidics with traction microscopy (TM). Using this system we can measure simultaneously, and in real time, migration speeds, tractions, and intercellular tension throughout an island of confluent Madin-Darby canine kidney (MDCK) cells. The cell island is exposed to hepatocyte growth factor (HGF) at a controlled gradient of concentrations; HGF is known to elicit epithelial-to-mesenchymal transition (EMT) and cell scattering. As expected, the rate of expansion of the cell island was dependent on the concentration of HGF. Higher concentrations of HGF reduced intercellular tensions, as expected during EMT. A novel finding, however, is that the effects of HGF concentration and its gradient were seen within an island. This integrated experimental system thus provides an integrated tool to better understand cellular forces during collective cellular migration under chemical gradients.</P>
Continuum-based modeling of collective cell migration
전형민,Hwanseok Jang,Joong Jae Kim,Yongdoo Park,심은보 대한기계학회 2021 JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY Vol.35 No.9
In this paper, we present a computationally efficient cellular mathematical model that accounts for the boundary collective behavior of a cell group by hepatocyte growth factor. The large cell group is modeled using continuum-based finite elements with incompressible hyperelastic materials for the nonlinear elastic behaviors. The total Lagrangian formulation is used enabling for large deformations, and the explicit time integration scheme without the Newton-Raphson iterative solution required for a time step is adopted to model the dynamics of the collective cell migration. With the explicit time integration and low order finite elements under the total Lagrangian framework, the proposed model is much computationally efficient for modeling the dynamic mechanical behavior of a cell colony. Detailed comparison to the experimental data shows that the proposed mathematical model provides a quantitatively accurate description of the collective cell motion in three different concentrations of hepatocyte growth factor.
An efficient algorithm for the reconstruction of punctured convolutional codes
Chung, Habong,Jang, Hwanseok,Seong, Jinwoo SpringerOpen 2017 Eurasip Journal on Wireless Communications and Net Vol.2017 No.-
<P>Puncturing is one of the methods of increasing the code rate, and the original code before puncturing is called the mother code. Any (N,K) convolutional code is obtainable by puncturing some (n,1) mother codes. The objective of a blind recognition of a channel code is to obtain its generator from the intercepted noisy bit stream. The process of the blind recognition of punctured convolutional codes consists of two parts: the reconstruction of the PGM of the (N,K) punctured convolutional code and the searching process of the mother code and its puncturing pattern. The process of finding the mother code is important for designing the optimum channel decoder. In this paper, a new searching algorithm with the computational complexity of O(K-4) polynomial operations is proposed, compared to the existing searching algorithm by M. Cluzeau which requires O(K-6) polynomial operations.</P>
변수노드의 차수가 3인 정칙 LDPC 부호의 Absorbing 집합에 관하여
이기준(Kijun Lee),정하봉(Habong Chung),장환석(Hwanseok Jang) 한국통신학회 2009 韓國通信學會論文誌 Vol.34 No.10C
본 논문에서는 변수노드의 차수가 3인 정칙 LDPC 부호의 absorbing 집합(AS)에 대한 여러 가지 성질을 알아본다. Girth가 인 경우, 가장 작은 absorbing 집합은 AS임을 보였고, 인 경우 이 AS가 가장 작은 fully absorbing 집합임을 증명하였다. 또한 (3,5) Tanner LDPC 부호에서 오류 마루의 주원인으로 꼽히는 몇몇 absorbing 집합의 critical number를 유도하였다. In this paper, we investigate into the existence and various properties of absorbing sets in regular LDPC codes with variable node degree three. Also, we figure out the critical number of some absorbing sets that are believed to be the major cause of error floor in (3,5) Tanner LDPC codes.
송정환(Junghwan Song),강연정(Yeonjung Kang),장환석(Hwanseok Jang) 한국정보보호학회 2008 정보보호학회논문지 Vol.18 No.4
인터넷 상에서 개인 식별을 가능하게 함으로써 개인의 안녕과 이해관계에 영향을 미치는 정보로서 각종 ID와 개인정보를 포함하도록 인터넷 ID를 정의한다면, 이를 안전하게 이용할 수 있도록 보호하고 관리하는 인터넷 ID 관리(Internet Identity Management) 기술이 필요하다는 것은 자명한 일이다. 현재의 인터넷 ID 관리 기술은 서비스의 수가 많아질수록 기억하고 관리해야 하는 ID와 인증정보의 수가 늘어나고, 심지어는 자신이 어떤 서비스에 어떤 ID와 인증정보를 등록하였는지 기억하지 못하는 경우도 발생하게 된다. 이런 이유로 유사하거나 동일한 ID와 인증정보의 사용, 개인정보의 수정의 어려움 등 여러 가지 문제점들이 발생하게 되었고, ID 관리와 관련된 개인정보 침해 사고도 빈번해졌다. 본 논문에서는 현재의 인터넷 환경에서 ID 관리 문제점을 해결하기 위한 대안으로서 인터넷 ID 관리 서비스 모델을 제시한다. The incredible progress of information and communication technology has allowed various information and communication services to emerge in the Web environment. Such a service is initiated when the user provides his/her personal information to the service provider and is then given an identifier and authentication data. A series of the processes is inconvenient as it requires authentication by the service provider each time that the user requests the service. Furthermore, as the user subscribes to more services, the volume of ID and authentication information increases. This compels the users to use an ID that is easy to remember or to register the same ID over and over, increasing the risk of ID hacking. It is clear that such threats will become more serious as our lives become more dependent upon the Internet and as the Internet service environment advances. With the introduction of different services, the need to efficiently manage ID has been raised. In this paper, a Internet Identity Management Service that enables the control of the flow of the user's personal information, which is used and stored for the Internet service, is proposed from the user's perspective.