• Archives of Plastic Surgery
• /
• 제32권2호
• /
• pp.143-148
• /
• 2005

Chemotactic migration of bone forming cell, osteoblast, is an important event during bone formation, bone remodeling, and fracture healing. Migration of cells is mediated by adhesion receptors, such as integrins, that link the cell to extracellular matrix ligands, type I collagen, fibronectin, laminin and depend on interaction between integrin and extracellular ligand. Our study was designed to investigate the effect of extracellular matrix like fibronectin, laminin, type I collagen on migration of osteoblast. Migration distance and speed of MC3T3-E1 cell on extracellular matrix-coated glass were measured for 24 hours using 0.01% type I collagen, 0.01% fibronectin, 100 microliter/ml laminin. The migration distance and speed of MC3T3-E1 cell was compared using a video-microscopy system. To determine migration speed, cells were viewed with a 4 phase- contrast lens and video recorded. Images were captured using a color CCD camera and saved in 8-bit full-color mode. The migration distance on 0.01% type I collagen or 0.01% fibronectin was longer than that on $100{\mu}l/ml$ laminin-coated glass. The migration speed on fibronectin-coated glass was 68 micrometer/hour which was fastest. The migration speed on type I collagen-coated glass was similar with that on fibronectin-coated glass. The latter two migration speeds were faster than that on no-coated glass. On the other hand, the average migration speed on laminin-coated glass was 37micrometer/hour and not different from that of control group. In conclusion, the extracelluar matrix ligands such as type I collagen and fibronectin seem to play an important role in cell migration. The type I collagen or fibronectin coated scaffold is more effective for migration of osteoblast in tissue engineering process.

• 유통과학연구
• /
• 제14권1호
• /
• pp.67-74
• /
• 2016

Purpose - In this paper, the degree of similarity and dissimilarity between pairs of 50 major cities in China can be shown on the basis of three evaluation variables(internet businessman index, internet shopping index and e-commerce development index). Dissimilarity distance matrix is used to analyze both similarity and dissimilarity between each fifty city in China by calculating dissimilarity as distance. Higher value signifies higher degree of dissimilarity between two cities. Cluster analysis is exploited to classify 50 cities into a number of different groups such that similar cities are placed in the same group. In addition, multidimensional scaling(MDS) technique can obtain visual representation for exploring the pattern of proximities among 50 major cities in China based on three development performance attributes. Research design, data, and methodology - This research is performed by the 2013 report provided with AliResearch in China(1/1/2013~11/30/2013) and utilized multivariate methods such as dissimilarity distance matrix, cluster analysis and MDS by using CLUSTER, KMEANS, PROXIMITIES and ALSCAL procedures in SPSS 21.0. Results - This research applies two types of cluster analysis and MDS on three development performances based on the 2013 report of Aliresearch. As a result, it is confirmed that grouping is possible by categorizing the types into four clusters which share similar characteristics. MDS is exploited to carry out positioning of both grouped locations of cluster and 50 major cities belonging to each cluster. Since all the values corresponding to Shenzhen, Guangzhou and Hangzhou(which belong to cluster 1 among 50 major cities) are very large, these cities are superior to other cities in all three evaluation attributes. Twelve cities(Beijing, ShangHai, Jinghua, ZhuHai, XiaMen, SuZhou, NanJing, DongWan, ZhangShan, JiaXing, NingBo and FoShan), which belong to cluster 3, are inferior to those of cluster 1 in terms of all three attributes, but they can be expected to be the next e-commerce revolution. The rest of major cities, in particular, which belong to cluster 4 are relatively inferior in all three attributes, so that this automatically evokes creative innovation, which leads to e-commerce development as a whole in China. In terms of internet businessman index, on the other hand, Tainan, Taizhong, and Gaoxiong(which belong to cluster 2) are situated superior to others. However, these three cities are inferior to others in an internet shopping index sense. The rest of major cities, in particular, which belong to cluster 4 are relatively inferior in all three evaluation attributes, so that this automatically evokes innovation and entrepreneurship, which leads to e-commerce development as a whole in China. Conclusions - This study suggests the implications to help e-governmental officers and companies make strategies in both Korea and China. This is expected to give some useful information in understanding the recent situation of e-commerce in China, by looking over development performances of 50 major cities. Therefore, we should develop marketing, branding and communication relevant to online Chinese consumers. One of these efforts will be incentives like loyalty points and coupons that can encourage consumers and building in-house logistics networks.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

• ETRI Journal
• /
• 제39권3호
• /
• pp.336-344
• /
• 2017

In this paper, we propose a convenient microwave orbital angular momentum (OAM) mode generation and multiplexing method operating in the 18 GHz frequency band, based on a $2{\times}2$ uniform circular array and a $4{\times}4$ Butler matrix. The three OAM modes -1, 0, and +1 were generated and verified using spatial S-parameter measurements; the measured back-to-back mode isolation was greater than 17 dB in the full 17 GHz to 19 GHz range. However, the radiated OAM beam centers were slightly dislocated and varied with both frequency and the mode index, because of the non-ideal characteristics of the Butler matrix. This resulted in mode isolation degradation and transmission distance limitations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.5073-5086
• /
• 2015

The rock fracture detection by image analysis is significant for fracture measurement and assessment engineering. The paper proposes a novel image segmentation algorithm for the centerline tracing of a rock fracture based on Hessian Matrix at Multi-scales and Steger algorithm. A traditional fracture detection method, which does edge detection first, then makes image binarization, and finally performs noise removal and fracture gap linking, is difficult for images of rough rock surfaces. To overcome the problem, the new algorithm extracts the centerlines directly from a gray level image. It includes three steps: (1) Hessian Matrix and Frangi filter are adopted to enhance the curvilinear structures, then after image binarization, the spurious-fractures and noise are removed by synthesizing the area, circularity and rectangularity; (2) On the binary image, Steger algorithm is used to detect fracture centerline points, then the centerline points or segments are linked according to the gap distance and the angle differences; and (3) Based on the above centerline detection roughly, the centerline points are searched in the original image in a local window along the direction perpendicular to the normal of the centerline, then these points are linked. A number of rock fracture images have been tested, and the testing results show that compared to other traditional algorithms, the proposed algorithm can extract rock fracture centerlines accurately.

• 한국정밀공학회지
• /
• 제14권8호
• /
• pp.137-145
• /
• 1997

A two-dimensional program for the analysis of bimaterial inclusion has been developed using the bound- ary element method. In order to study the effects of circular inclusion on the stress field of the crack tip, numerical analysis was performed for the straight crack of finite length around the symmetric circular inclusion whose modulus of elasticity was different from that of the matrix material. In the case of inclusion whose stiffness was smaller than that of the matrix material, the stress intensity factor was found to increase as the crack enamated. The stress intensity factor was uninfluenced from the radial change in inclusion and remained constant for the stiffness equivalent to the matrix materials, where as it decreased for the inclusion with larger stiffness. For the vareation in the distance of the inclusion, a small increase in the stress intensity factor was observed for the case with small or equal stiffness compared with the matrix materials. The inclusion with larger stiffness showed a gradual decrease in the strss intensity factor as the crack emanated.

• Journal of the Optical Society of Korea
• /
• 제6권3호
• /
• pp.121-127
• /
• 2002

The operating principal of a ring laser gyroscope depends on the phase difference for the counter-propagating waves within a closed path. The reflecting mirrors mounted on the monoblock form the traveling waves. The manufacturing accuracy of the monoblock influences the traveling path of ray, the sensitivity of laser resonator for misalignments, and diffraction losses. A 3 $\times$ 3 ray transfer matrix was derived for optical components with centering and squaring errors in a ring resonator. The matrix can be utilized to predict the optical ray paths on the basis of the manufacturing errors of the monoblock as well as the misalignment of mirrors. Then the distance and orientation (o. slope) at the arbitrary plane inside the resonator along the ideal optical path can be calculated from the chain multiplication of the ray transfer matrix for each optical component in one round trip. We also show that the counter-propagating rays In a ring resonator with errors does not coincide in each round trip, which results in gain difference between two beams, and how these errors can be adjusted through the alignment procedure. Finally this 3 $\times$ 3 ray matrix formalism can be used to calculate the beam size and its displacement from the optical axis and the deviation at the diaphragm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권2호
• /
• pp.522-539
• /
• 2021

In order to solve the problems of the existing audio fingerprint method when extracting audio fingerprints from long speech segments, such as too large fingerprint dimension, poor robustness, and low retrieval accuracy and efficiency, a robust audio fingerprint retrieval method based on feature dimension reduction and feature combination is proposed. Firstly, the Mel-frequency cepstral coefficient (MFCC) and linear prediction cepstrum coefficient (LPCC) of the original speech are extracted respectively, and the MFCC feature matrix and LPCC feature matrix are combined. Secondly, the feature dimension reduction method based on information entropy is used for column dimension reduction, and the feature matrix after dimension reduction is used for row dimension reduction based on energy feature dimension reduction method. Finally, the audio fingerprint is constructed by using the feature combination matrix after dimension reduction. When speech's user retrieval, the normalized Hamming distance algorithm is used for matching retrieval. Experiment results show that the proposed method has smaller audio fingerprint dimension and better robustness for long speech segments, and has higher retrieval efficiency while maintaining a higher recall rate and precision rate.

• 한국병원경영학회지
• /
• 제23권2호
• /
• pp.28-41
• /
• 2018

Purpose: This study purposed to analyze the spatial accessibility of mental health institutions in Ganwon-Do using Geographic Information System and to suggest policy implications. Methodology: Network analysis was applied to assess the spatial accessibility of mental health institutions in Gangwon-Do. To perform the network analysis, network data set was built using administrative district map, road network, address of mental health institutions in Gangwon-Do. After building network data set, Two network analysis methods, 1) Service area analysis, 2) Origin Destination cost matrix were applied. Service area analysis calculated accessive areas that were within specified time. And using Origin Destination cost matrix, travel time and road travel distance were calculated between centroids of Eup, Myeon, Dong and the nearest mental health institutions. Result: After the service area analysis, it is estimated that 19.63% of the total areas in Gangwon-Do takes more than 60 minutes to get to clinic institutions. For hospital institutions, 23.08% of the total areas takes more than 60 minutes to get there. And 59.96% of Gangwon-do takes more than 30 minutes to get to general hospitals. The result of Origin-Destination cost matrix showed that most Eup Myeon Dong in Gangwon-Do was connected to the institutions in Wonju-si, Chuncheon-si, Gangneung-si. And it showed that there were large regional variation in time and distance to reach the institutions. Implication: Results showed that there were regional variations of spatial accessibility to the mental health institutions in Gangwon-Do. To solve this problem, Several policy interventions could be applied such as mental health resources allocation plan, telemedicine, providing more closely coordinated services between mental health institutions and community mental health centers to enhance the accessibility.

• 한국정보통신학회논문지
• /
• 제23권6호
• /
• pp.682-689
• /
• 2019

부분 기반 영상 표현(part-based image representation)에서는 영상의 부분적인 모습을 기저 벡터로 표현하고 기저 벡터의 선형 조합으로 영상을 분해하며, 이 때 기저 벡터의 계수가 곧 물체의 부분적인 특징을 의미하게 된다. 본 논문에는 부분 기반 영상 표현 기법인 비음수 행렬 분해(non-negative matrix factorization, NMF)를 이용하여 얼굴 영상을 표현하고 신경망 기법을 적용하여 가려진 얼굴을 인식하는 얼굴 인식을 제안한다. 표준 비음수 행렬 분해, 투영 경사 비음수 행렬 분해, 직교 비음수 행렬 분해를 이용하여 얼굴 영상을 표현하였고, 각 기법의 성능을 비교하였다. 인식기로는 학습벡터양자화 신경망을 사용하였으며, 인식기에서의 거리 척도로는 유클리디언 거리를 사용하였다. 실험 결과, 전통적인 얼굴 인식 방법에 비하여 제안한 기법이 가려진 얼굴 인식에 보다 강인함을 보인다.