• International Journal of Computer Science & Network Security
• /
• v.23 no.8
• /
• pp.40-48
• /
• 2023

Speech Emotions recognition has become the active research theme in speech processing and in applications based on human-machine interaction. In this work, our system is a two-stage approach, namely feature extraction and classification engine. Firstly, two sets of feature are investigated which are: the first one is extracting only 13 Mel-frequency Cepstral Coefficient (MFCC) from emotional speech samples and the second one is applying features fusions between the three features: Zero Crossing Rate (ZCR), Teager Energy Operator (TEO), and Harmonic to Noise Rate (HNR) and MFCC features. Secondly, we use two types of classification techniques which are: the Support Vector Machines (SVM) and the k-Nearest Neighbor (k-NN) to show the performance between them. Besides that, we investigate the importance of the recent advances in machine learning including the deep kernel learning. A large set of experiments are conducted on Surrey Audio-Visual Expressed Emotion (SAVEE) dataset for seven emotions. The results of our experiments showed given good accuracy compared with the previous studies.

• Knowledge Management Research
• /
• v.14 no.1
• /
• pp.73-94
• /
• 2013

Customer's purchase state consists of purchase inertia and variety-seeking. As the growing brand familiarity triggers the increase of brand attractiveness, customers purchase state will be of inertia. However the excessively growing brand familiarity ignites the decrease of brand attractiveness. Followingly the purchase state will be tend to plunge into the variety-seeking state. The main topic of this study is to validate the asymmetric formation of customer's purchase states between inertia and variety-seeking. In order to follow up the main topic, this article introduces a model to freely describe the velocity of value changes depending upon the purchase states. This model will help overcome the limitation of the past studies having been based on the symmetric value changes. Based on this approach marketer will be able to decide the timing of sales promotions. This research utilized local telecommunication carrier's database of smartphone application purchase/download records. This database was collected from two years (2009 and 2010) span, the time when the smartphones started commodifying in Korea whilst most of the past studies had used purchase data of maturity stage products. From this approach utilizing the introduction stage data in the product life cycle, the probability of brand choice depending upon the purchase state on the early-stage can be probed. Moreover, this study tries to expand the research methodology from the other areas of research by knowledge sharing. Here this study introduces the methodology of section-aggregated multinomial logit to simultaneously estimate the parameters that were included in the plural multinomial logit functions while the plural functions were inter-connected. This adoption of section-aggregated multinomial logit model procedures from the computerized statistics areas is expected to nourish the marketing research for more precise analysis and estimation of effects of marketing activities.

• The Journal of Society for e-Business Studies
• /
• v.4 no.2
• /
• pp.1-22
• /
• 1999

In this paper, we review and classify shopping information services for electronic commerce in Korea. Shopping information services for electronic commerce can be divided into shopping mall information service and product information service. Shopping mall information service simply shows and suggests information on the shopping malls that it has in its data store. But product information service provides information about the items of the shopping malls the service has and therefore gives more powerful and convenient interfaces to users. Cutting-edge product information services can perform online comparison shopping facility, which searches and compares the items what the users want on the reasonable basis of economical criteria, such as price. Books, CDs, and Personal Data Assistant(PDA)s are the products of which the specification is clear enough to be described on the Web. And the comparison of the products by the information service is performed on the basis of "price" of the product item. The approach to design and implement product information service can be divided into two categories. The one is an application of data warehousing mechanism, which stores the product information on the regular basis of time and provide it when the users query over the Web-database gateway. The other approach is a shopping agent mechanism, which stores information on "how to shop" and the shopping agent collects the information of product items just after users query about the product and provide the information in real time or notify them by alerting service. Thirty nine shopping information services are compared and classified in this paper and they are extracted from "Naver" and "Yahoo! Korea". The final result shows that most services are just a simple shopping mall information service in growing stage, product information services with data warehousing are lack in product ontology in middle stage, and that product information services with shopping agent are in early stage.

• Journal of Gastric Cancer
• /
• v.12 no.1
• /
• pp.36-42
• /
• 2012

Purpose: The aim of this study was to evaluate the surgical outcomes of abdominal total gastrectomy, without mediastinal lymph node dissection for type II and III gastroesophageal junction (GEJ) cancers. Materials and Methods: We retrospectively reviewed surgical outcomes in 67 consecutive patients with type II and III GEJ cancers that were treated by the surgical resection between 2004 and 2008. Results: Thirty (45%) patients had type II and 37 (55%) had type III tumor. Among the 65 (97%) patients with curative surgery, 21 (31%) patients underwent the extended total gastrectomy with trans-hiatal distal esophageal resection, and in 44 (66%) patients, abdominal total gastrectomy alone was done. Palliative gastrectomy was performed in two patients due to the accompanying peritoneal metastasis. The postoperative morbidity and mortality rates were 21.4% and 1.5%, respectively. After a median follow up of 36 months, the overall 3-years was 68%, without any differences between the Siewert types or the operative approaches (transhiatal approach vs. abdominal approach alone). On the univariate analysis, the T stage, N stage and R0 resection were found to be associated with the survival, and multivariate analysis revealed that the N stage was a poor independent prognostic factor for survival. Conclusions: Type II and III GEJ cancers may successfully be treated with the abdominal total gastrectomy, without mediastinal lymph node dissection in the Korean population.

• International Journal of Contents
• /
• v.7 no.1
• /
• pp.14-22
• /
• 2011

Temporal Sign Language Recognition (TSLR) from hand motion is an active area of gesture recognition research in facilitating efficient communication with deaf people. TSLR systems consist of two stages: a motion sensing step which extracts useful features from signers' motion and a classification process which classifies these features as a performed sign. This work focuses on two of the research problems, namely unknown time varying signal of sign languages in feature extraction stage and computing complexity and time consumption in classification stage due to a very large sign sequences database. In this paper, we propose a combination of Dynamic Time Warping (DTW) and application of the Single hidden Layer Feedforward Neural networks (SLFNs) trained by Extreme Learning Machine (ELM) to cope the limitations. DTW has several advantages over other approaches in that it can align the length of the time series data to a same prior size, while ELM is a useful technique for classifying these warped features. Our experiment demonstrates the efficiency of the proposed method with the recognition accuracy up to 98.67%. The proposed approach can be generalized to more detailed measurements so as to recognize hand gestures, body motion and facial expression.

• Journal of Chest Surgery
• /
• v.17 no.4
• /
• pp.620-624
• /
• 1984

The optimal surgical management of the coarctation of the aorta associated with ventricular septal defect is still debated. Sixteen patients with the coarctation of the aorta and VSD were operated upon between November, 1980 and September 1984 at Seoul National University Hospital. They were 11 males and 5 females. All presented between 5 months and 11.5 years of age [mean= 5.5 years]. Presenting symptoms were congestive heart failure in 11 [69%], cyanosis on crying in 3 [19%], and frequent upper respiratory infection in 2 [13%]. In all cases two-stage operation was applied except one in which one stage procedure was taken. Resection and end-to-end anastomosis was used in 3, Dacron graft in 5, Gortex graft in 1, and left subclavian flap angioplasty in 4. Remaining two were missed on the operating table before correction of the coarctation of the aorta. Overall operative death in repair of the coarctation of the aorta were 3[20%]. Among the 12 survivors after repair of the coarctation of the aorta, 4 required patch closure of VSD, 2 required primary closure, 2 showed spontaneous closure [17%], one [8%] showed decrease in its size, 3 were under observation. It might be safe to approach the coarctation of aorta plus VSD with initial repair of the coarctation of the aorta without banding of main pulmonary artery and later management of VSD as usual manner in simple VSD.

• Environmental Engineering Research
• /
• v.21 no.4
• /
• pp.420-426
• /
• 2016

Climate change imposes a huge treat on the sustainability of our environment. One of the major reasons for the increasing impacts of climate change is the emission of greenhouse gases. Therefore, cooperative greenhouse gas emission reduction schemes with a general consensus are needed in order to reduce the impacts of climate change. Due to the strong link between greenhouse gas emission and economic development there is disagreement among countries on the designing and implementation of emission reduction plans. In this paper the authors proposed a two-stage concession game to analyze emission reduction plans and determine a balanced emission range that improves the utilities of the bargaining parties. Furthermore the game was applied to a hypothetical example. Our results from the case study indicated that even though the utilities of the bargaining parties is highly affected by emission reductions, after making concessions their utilities can be improved given their emission reductions are within in a certain desirable range. The authors hope that this article provides insights which could be useful for understanding emission reduction plans and their consequences on the negotiating parties.

• The Korean Journal of Applied Statistics
• /
• v.24 no.5
• /
• pp.847-859
• /
• 2011

cDNA microarray-based comparative genomic hybridization(CGH) data includes low-intensity spots and thus a statistical strategy is needed to detect subtle differences between different cancer classes. In this study, genes displaying a high frequency of alteration in one of the different classes were selected among the pre-selected genes that show relatively large variations between genes compared to total variations. Utilizing copy-number changes of the selected genes, this study suggests a statistical approach to predict patients' classes with increased performance by pre-classifying patients with similar genetic alteration scores. Two-stage logistic regression model(TLRM) was suggested to pre-classify homogeneous patients and predict patients' classes for cancer prediction; a decision tree(DT) was combined with logistic regression on the set of informative genes. TLRM was constructed in cDNA microarray-based CGH data from the Cancer Metastasis Research Center(CMRC) at Yonsei University; it predicted the patients' clinical diagnoses with perfect matches (except for one patient among the high-risk and low-risk classified patients where the performance of predictions is critical due to the high sensitivity and specificity requirements for clinical treatments. Accuracy validated by leave-one-out cross-validation(LOOCV) was 83.3% while other classification methods of CART and DT performed as comparisons showed worse performances than TLRM.

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

A minimum-time trajectory planning for two robot arms with designated paths and coordination is proposed. The problem considered in this paper is a subproblem of hierarchically decomposed trajectory planning approach for multiple robots : i) path planning, ii) coordination planning, iii) velocity planning. In coordination planning stage, coordination space, a specific form of configuration space, is constructed to determine collision region and collision-free region, and a collision-free coordination curve (CFCC) passing collision-free region is selected. In velocity planning stage, normal dynamic equations of the robots, described by joint angles, velocities and accelerations, are converted into simpler forms which are described by traveling distance along collision-free coordination curve. By utilizing maximum allowable torques and joint velocity limits, admissible range of velocity and acceleration along CFCC is derived, and a minimum-time velocity planning is calculated in phase plane. Also the planning algorithm itself is converted to simple numerical iterative calculation form based on the concept of neural optimization network, which gives a feasible approximate solution to this planning problem. To show the usefulness of proposed method, an example of trajectory planning for 2 SCARA type robots in common workspace is illustrated.

• Proceedings of the KOR-KST Conference
• /
• 2000.02a
• /
• pp.25-47
• /
• 2000

In route guidance systems fastest-path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this study is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e. Pareto optimal) paths for real-time vehicle routing which reflect the drivers' preferences and route choice behaviors. We propose two pruning algorithms that reduce the search area based on a context-dependent linear utility function and thus reduce the computation time. The basic notion of the proposed approach is that ⅰ) enumerating all nondominated paths is computationally too expensive, ⅱ) obtaining a stable mathematical representation of the drivers' utility function is theoretically difficult and impractical, and ⅲ) obtaining optimal path given a nonlinear utility function is a NP-hard problem. Consequently, a heuristic two-stage strategy which identifies multiple routes and then select the near-optimal path may be effective and practical. As the first stage, we utilize the relaxation based pruning technique based on an entropy model to recognize and discard most of the nondominated paths that do not reflect the drivers' preference and/or the context-dependency of the preference. In addition, to make sure that paths identified are dissimilar in terms of links used, the number of shared links between routes is limited. We test the proposed algorithms in a large real-life traffic network and show that the algorithms reduce CPU time significantly compared with conventional multi-criteria shortest path algorithms while the attributes of the routes identified reflect drivers' preferences and generic route choice behaviors well.