• Title/Summary/Keyword: i-vector

Search Result 1,075, Processing Time 0.027 seconds

Overexpression of TMP21 Could Induce not only Downregulation of TrkA/ERK Phosphorylation but also Upregulation of p75NTR/RhoA Expression on NGF Receptor Signaling Pathway (γ-Secretase 활성억제단백질인 TMP21의 과발현이 신경세포주에서 NGF 수용체 신호전달과정에 미치는 영향)

  • Choi, Sun-Il;Jee, Seung-Wan;Her, Youn-Kyung;Kim, Ji-Eun;Nam, So-Hee;Hwang, In-Sik;Lee, Hye-Ryun;Goo, Jun-Seo;Lee, Young-Ju;Lee, Eon-Pil;Choi, Hae-Wook;Kim, Hong-Sung;Lee, Jae-Ho;Jung, Young-Jin;Lee, Su-Hae;Shim, Sun-Bo;Hwang, Dae-Youn
    • Journal of Life Science
    • /
    • v.21 no.8
    • /
    • pp.1134-1141
    • /
    • 2011
  • Transmembrane protein 21 (TMP21) is a member of the p24 cargo protein family and has been shown to modulate ${\alpha}$-secretase-mediated A${\beta}$ production which was specifically observed in the brains of subjects with Alzheimer's disease (AD). In order to investigate whether TMP21 could affect nerve growth factor (NGF) receptor signaling pathway, the alteration of NGF receptors and their downstream proteins were detected in TMP21 over-expressed cells. CMV/hTMP21 vector used in this study was successfully expressed into TMP21 proteins in B35 cells after lipofectamin transfection. Expressed TMP21 proteins induced the down-regulation of ${\gamma}$-secretase complex components including Presenlin-1 (PS-1), PS-2, Nicastrin (NST), Pen-2 and APH-1. Also, the expression level of NGF receptor $p75^{NTR}$ and RhoA were significantly higher in CMV/hTMP21 transfectants than vehicle transfectants, while their levels returned to vehicle levels after NGF treatment. However, the phosphorylation of NGF receptor TrkA was dramtically decreased in NGF No-treated CMV/hTMP21 transfectants compared with vehicle transfectants, and increased in NGF treated CMV/hTMP21 transfectants. In TrkA downstream signaling pathway, the phosphorylation level of ERK was also decreased in CMV/hTMP21 transfectants, while the phosphorylation of Akt was increased in the same transfectants. Furthermore, NGF treatment induced the increase of phosphorylation level of Akt and ERK in CMV/hTMP21 transfectants. Therefore, these results suggested that over-expression of TMP21may simultaneously induce the up-regulation of $p75^{NTR}$/RhoA expression and the down-regulation of TrkA/ERK phosphorylation through the inhibition of ${\gamma}$-secretase activity.

The Analysis of Predictive Factors for the Identification of Patients Who Could Benefit from Respiratory-Gated Radiotherapy in Non-Small Cell Lung Cancer (비소세포성 폐암에서 호흡동기방사선치료 적용 환자군의 선택을 위한 예측인자들의 분석)

  • Jang, Seong-Soon;Park, Ji-Chan
    • Radiation Oncology Journal
    • /
    • v.27 no.4
    • /
    • pp.228-239
    • /
    • 2009
  • Purpose: 4DCT scans performed for radiotherapy were retrospectively analyzed to assess the possible benefits of respiratory gating in non-small cell lung cancer (NSCLC) and established the predictive factors for identifying patients who could benefit from this approach. Materials and Methods: Three treatment planning was performed for 15 patients with stage I~III NSCLC using different planning target volumes (PTVs) as follows: 1) PTVroutine, derived from the addition of conventional uniform margins to gross tumor volume (GTV) of a single bin, 2) PTVall phases (patient-specific PTV), derived from the composite GTV of all 6 bins of the 4DCT, and 3) PTVgating, derived from the composite GTV of 3 consecutive bins at end-exhalation. Results: The reductions in PTV were 43.2% and 9.5%, respectively, for the PTVall phases vs. PTVroutine and PTVgating vs. PTVall phases. Compared to PTVroutine, the use of PTVall phases and PTVgating reduced the mean lung dose (MLD) by 18.1% and 21.6%, and $V_{20}$ by 18.2% and 22.0%, respectively. Significant correlations were seen between certain predictive factors selected from the tumor mobility and volume analysis, such as the 3D mobility vector, the reduction in 3D mobility and PTV with gating, and the ratio of GTV overlap between 2 extreme bins and additional reductions in both MLD and $V_{20}$ with gating. Conclusion: The additional benefits with gating compared to the use of patient-specific PTV were modest; however, there were distinct correlations and differences according to the predictive factors. Therefore, these predictive factors might be useful for identifying patients who could benefit from respiratory-gated radiotherapy.

Robust Eye Localization using Multi-Scale Gabor Feature Vectors (다중 해상도 가버 특징 벡터를 이용한 강인한 눈 검출)

  • Kim, Sang-Hoon;Jung, Sou-Hwan;Cho, Seong-Won;Chung, Sun-Tae
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.1
    • /
    • pp.25-36
    • /
    • 2008
  • Eye localization means localization of the center of the pupils, and is necessary for face recognition and related applications. Most of eye localization methods reported so far still need to be improved about robustness as well as precision for successful applications. In this paper, we propose a robust eye localization method using multi-scale Gabor feature vectors without big computational burden. The eye localization method using Gabor feature vectors is already employed in fuck as EBGM, but the method employed in EBGM is known not to be robust with respect to initial values, illumination, and pose, and may need extensive search range for achieving the required performance, which may cause big computational burden. The proposed method utilizes multi-scale approach. The proposed method first tries to localize eyes in the lower resolution face image by utilizing Gabor Jet similarity between Gabor feature vector at an estimated initial eye coordinates and the Gabor feature vectors in the eye model of the corresponding scale. Then the method localizes eyes in the next scale resolution face image in the same way but with initial eye points estimated from the eye coordinates localized in the lower resolution images. After repeating this process in the same way recursively, the proposed method funally localizes eyes in the original resolution face image. Also, the proposed method provides an effective illumination normalization to make the proposed multi-scale approach more robust to illumination, and additionally applies the illumination normalization technique in the preprocessing stage of the multi-scale approach so that the proposed method enhances the eye detection success rate. Experiment results verify that the proposed eye localization method improves the precision rate without causing big computational overhead compared to other eye localization methods reported in the previous researches and is robust to the variation of post: and illumination.

Incorporating Social Relationship discovered from User's Behavior into Collaborative Filtering (사용자 행동 기반의 사회적 관계를 결합한 사용자 협업적 여과 방법)

  • Thay, Setha;Ha, Inay;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.2
    • /
    • pp.1-20
    • /
    • 2013
  • Nowadays, social network is a huge communication platform for providing people to connect with one another and to bring users together to share common interests, experiences, and their daily activities. Users spend hours per day in maintaining personal information and interacting with other people via posting, commenting, messaging, games, social events, and applications. Due to the growth of user's distributed information in social network, there is a great potential to utilize the social data to enhance the quality of recommender system. There are some researches focusing on social network analysis that investigate how social network can be used in recommendation domain. Among these researches, we are interested in taking advantages of the interaction between a user and others in social network that can be determined and known as social relationship. Furthermore, mostly user's decisions before purchasing some products depend on suggestion of people who have either the same preferences or closer relationship. For this reason, we believe that user's relationship in social network can provide an effective way to increase the quality in prediction user's interests of recommender system. Therefore, social relationship between users encountered from social network is a common factor to improve the way of predicting user's preferences in the conventional approach. Recommender system is dramatically increasing in popularity and currently being used by many e-commerce sites such as Amazon.com, Last.fm, eBay.com, etc. Collaborative filtering (CF) method is one of the essential and powerful techniques in recommender system for suggesting the appropriate items to user by learning user's preferences. CF method focuses on user data and generates automatic prediction about user's interests by gathering information from users who share similar background and preferences. Specifically, the intension of CF method is to find users who have similar preferences and to suggest target user items that were mostly preferred by those nearest neighbor users. There are two basic units that need to be considered by CF method, the user and the item. Each user needs to provide his rating value on items i.e. movies, products, books, etc to indicate their interests on those items. In addition, CF uses the user-rating matrix to find a group of users who have similar rating with target user. Then, it predicts unknown rating value for items that target user has not rated. Currently, CF has been successfully implemented in both information filtering and e-commerce applications. However, it remains some important challenges such as cold start, data sparsity, and scalability reflected on quality and accuracy of prediction. In order to overcome these challenges, many researchers have proposed various kinds of CF method such as hybrid CF, trust-based CF, social network-based CF, etc. In the purpose of improving the recommendation performance and prediction accuracy of standard CF, in this paper we propose a method which integrates traditional CF technique with social relationship between users discovered from user's behavior in social network i.e. Facebook. We identify user's relationship from behavior of user such as posts and comments interacted with friends in Facebook. We believe that social relationship implicitly inferred from user's behavior can be likely applied to compensate the limitation of conventional approach. Therefore, we extract posts and comments of each user by using Facebook Graph API and calculate feature score among each term to obtain feature vector for computing similarity of user. Then, we combine the result with similarity value computed using traditional CF technique. Finally, our system provides a list of recommended items according to neighbor users who have the biggest total similarity value to the target user. In order to verify and evaluate our proposed method we have performed an experiment on data collected from our Movies Rating System. Prediction accuracy evaluation is conducted to demonstrate how much our algorithm gives the correctness of recommendation to user in terms of MAE. Then, the evaluation of performance is made to show the effectiveness of our method in terms of precision, recall, and F1-measure. Evaluation on coverage is also included in our experiment to see the ability of generating recommendation. The experimental results show that our proposed method outperform and more accurate in suggesting items to users with better performance. The effectiveness of user's behavior in social network particularly shows the significant improvement by up to 6% on recommendation accuracy. Moreover, experiment of recommendation performance shows that incorporating social relationship observed from user's behavior into CF is beneficial and useful to generate recommendation with 7% improvement of performance compared with benchmark methods. Finally, we confirm that interaction between users in social network is able to enhance the accuracy and give better recommendation in conventional approach.

A Time Series Graph based Convolutional Neural Network Model for Effective Input Variable Pattern Learning : Application to the Prediction of Stock Market (효과적인 입력변수 패턴 학습을 위한 시계열 그래프 기반 합성곱 신경망 모형: 주식시장 예측에의 응용)

  • Lee, Mo-Se;Ahn, Hyunchul
    • Journal of Intelligence and Information Systems
    • /
    • v.24 no.1
    • /
    • pp.167-181
    • /
    • 2018
  • Over the past decade, deep learning has been in spotlight among various machine learning algorithms. In particular, CNN(Convolutional Neural Network), which is known as the effective solution for recognizing and classifying images or voices, has been popularly applied to classification and prediction problems. In this study, we investigate the way to apply CNN in business problem solving. Specifically, this study propose to apply CNN to stock market prediction, one of the most challenging tasks in the machine learning research. As mentioned, CNN has strength in interpreting images. Thus, the model proposed in this study adopts CNN as the binary classifier that predicts stock market direction (upward or downward) by using time series graphs as its inputs. That is, our proposal is to build a machine learning algorithm that mimics an experts called 'technical analysts' who examine the graph of past price movement, and predict future financial price movements. Our proposed model named 'CNN-FG(Convolutional Neural Network using Fluctuation Graph)' consists of five steps. In the first step, it divides the dataset into the intervals of 5 days. And then, it creates time series graphs for the divided dataset in step 2. The size of the image in which the graph is drawn is $40(pixels){\times}40(pixels)$, and the graph of each independent variable was drawn using different colors. In step 3, the model converts the images into the matrices. Each image is converted into the combination of three matrices in order to express the value of the color using R(red), G(green), and B(blue) scale. In the next step, it splits the dataset of the graph images into training and validation datasets. We used 80% of the total dataset as the training dataset, and the remaining 20% as the validation dataset. And then, CNN classifiers are trained using the images of training dataset in the final step. Regarding the parameters of CNN-FG, we adopted two convolution filters ($5{\times}5{\times}6$ and $5{\times}5{\times}9$) in the convolution layer. In the pooling layer, $2{\times}2$ max pooling filter was used. The numbers of the nodes in two hidden layers were set to, respectively, 900 and 32, and the number of the nodes in the output layer was set to 2(one is for the prediction of upward trend, and the other one is for downward trend). Activation functions for the convolution layer and the hidden layer were set to ReLU(Rectified Linear Unit), and one for the output layer set to Softmax function. To validate our model - CNN-FG, we applied it to the prediction of KOSPI200 for 2,026 days in eight years (from 2009 to 2016). To match the proportions of the two groups in the independent variable (i.e. tomorrow's stock market movement), we selected 1,950 samples by applying random sampling. Finally, we built the training dataset using 80% of the total dataset (1,560 samples), and the validation dataset using 20% (390 samples). The dependent variables of the experimental dataset included twelve technical indicators popularly been used in the previous studies. They include Stochastic %K, Stochastic %D, Momentum, ROC(rate of change), LW %R(Larry William's %R), A/D oscillator(accumulation/distribution oscillator), OSCP(price oscillator), CCI(commodity channel index), and so on. To confirm the superiority of CNN-FG, we compared its prediction accuracy with the ones of other classification models. Experimental results showed that CNN-FG outperforms LOGIT(logistic regression), ANN(artificial neural network), and SVM(support vector machine) with the statistical significance. These empirical results imply that converting time series business data into graphs and building CNN-based classification models using these graphs can be effective from the perspective of prediction accuracy. Thus, this paper sheds a light on how to apply deep learning techniques to the domain of business problem solving.