{"title":"Estimation of Central Blood Pressure Using Radial Pulse Waveform","authors":"Ran Wei, J. Im, S. Park","doi":"10.1109/ISITC.2007.46","DOIUrl":"https://doi.org/10.1109/ISITC.2007.46","url":null,"abstract":"Arterial stiffness is an important determinant of cardiovascular risk and, consequently, it is necessary to develop a system which measures the central aortic blood pressure noninvasively. Recently, the aortic augmentation index (AIx), which can be calculated from the estimated aortic waveform based on the radial pressure waveform, has been used as a quantitative index of systemic arterial stiffness. The pressure waveform at various body sites is a composite of the forward and reflected waves and, therefore, the relationship between the aortic pressure and peripheral pressure is not fixed. Consequently, it is necessary to establish an algorithm for obtaining the central aortic pressure waveforms from the radial pressure waveforms. Transfer functions were established using a ICf order ARX model by setting the radial pulse as the input and the aortic pulse as the output, and their stability was verified through residual analysis. The objective of this study was to compare the central blood pressure values estimated from the radial pressure waveform using the ARX model with the central pressure waveforms acquired invasively from patients undergoing angioplasty using a RADI pressure wire. Fifty subjects (35 males and 15 females) participated in the study. The central aortic pressure waveforms obtained using the RADI pressure wire system and the radial arterial pulse waves obtained using a pressure sensor were acquired simultaneously. The results show that there was a linear relationship between the systolic pressure measured by the RADI pressure wire and that estimated using the ARX transfer function (r = 0.848). Also, the pulse pressures measured by the RADI pressure wire were linearly related to those estimated using the ARX transfer function (r = 0.893).","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129852627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Efficient Migration Scheme for Mobile Agents in Ubiquitous Environments","authors":"Seungsang Sun, Hyun-Su Jang, Youn-Woo Kim, Y. Eom","doi":"10.1109/ISITC.2007.20","DOIUrl":"https://doi.org/10.1109/ISITC.2007.20","url":null,"abstract":"Along with the development of lots of mobile agent platforms, the various researches on migration schemes for mobile agents have been suggested. The agents play a key role to manage a huge amount of tasks instead of human being in ubiquitous computing environments. During their operations, agents may cause excessive overhead of network traffic because the size of agent code continuously becomes bigger than before as the increasing complexity of its functionalities. In addition, there is one additional possibility that frequent visits by a lot of agents make target platforms be the bottleneck of communication. To solve these problems, we suggest a new approach. The proposed scheme is to cache the codes of mobile agents which bases on frequent visiting of platforms in ubiquitous environments. To show superiority of our scheme, we compare the proposed method with the existing methods through various simulations.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132565263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Improved VoIP Design for the Advertisement Service","authors":"Se-young Jang, Seung-Sun Yoo, Hoon-Sung Kwak","doi":"10.1109/ISITC.2007.57","DOIUrl":"https://doi.org/10.1109/ISITC.2007.57","url":null,"abstract":"VoIP (Voice over IP), so called Internet phone, provides several unique advantages, for instance, inexpensive long distance call service than the existing wire telephone network and various multimedia services from Internet network added to voice call service. The paper is intended to describe the results of the VoIP system designed and realized by using SIP, which was suggested to create, modify and end multimedia sessions. The VoIP system was developed as an Ads-receiving VoIP terminal, which may receive and save multimedia advertisement and the advertisement service model was suggested. The VoIP phone may save the advertisements received from a PUSH server of common carriers in its internal storage while it saves only the information necessary for a user and delivers it promptly at any time. Regarding the performance of the Ads-receiving VoIP phone, its processing time per kernel instruction, which is the time elapsed to form a packet and transmit it, was 18 ms. As a result of running the software, the receiver only accounted for 4 ms of the software processing time and connecting and disconnecting an outbound call took 93 ms, suggesting the result of 10 ~ 12 calls processed per second.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134114995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"New Range and k-NN Query Processing Algorithms Using Materialization Technique on Spatial Network","authors":"Jung-Ho Um, N. K. Chowdhury, Jae-Woo Chang","doi":"10.1109/ISITC.2007.69","DOIUrl":"https://doi.org/10.1109/ISITC.2007.69","url":null,"abstract":"In this paper, we propose new query processing algorithms for typical spatial queries in SNDB, such as range search and k nearest neighbors (k-NN) search. Our two query processing algorithms can reduce the computation time of network distance between a pair of nodes and the number of disk I/Os required for accessing nodes by using a materialization-based technique with the shortest network distances of all the nodes in the spatial network. Thus, our query processing algorithms improve the existing efficient k-NN (INE) and range search (RNE) algorithms proposed by [1]. It is shown that our range query processing algorithm achieves about up to one of magnitude better performance than the RNE and our k- NN query processing algorithm achieves about up to 150% performance improvements over INE.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"61 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133579846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Effects of Time and Frequency Resolution on Nonnegative Matrix Factorization","authors":"S. Sophea, S. Phon-Amnuaisuk","doi":"10.1109/ISITC.2007.43","DOIUrl":"https://doi.org/10.1109/ISITC.2007.43","url":null,"abstract":"In this paper, we present the comparison of note events extraction using nonnegative matrix factorization (NMF) with input from a classic Fourier transform (FT) and with input from an improved time resolution FT. In order to improve time resolution, FT sample window length must be increased. As the window length increases, the time resolution is sacrificed for a better frequency resolution. Hence, good time and frequency resolutions are required in our polyphonic music transcription task. Here, we first apply zero-padding algorithm to classic FT to help maintain the time and frequency resolution. Then, we apply the hanning window. Finally we use NMF to decompose the note events. The experiment shows that NMF performs the decomposition of multivariate nonnegative data matrix well after applying the improved time resolution FT.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116223257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Korean Manual Alphabet (KMA) Recognition System Using USB Camera","authors":"Young-Joon Oh, Kwang-Hyun Park, Z. Bien","doi":"10.1109/ISITC.2007.64","DOIUrl":"https://doi.org/10.1109/ISITC.2007.64","url":null,"abstract":"Sign language is complex visual-spatial language most used in deaf society, and is a representative example of hand gesture with linguistic structure. Korean manual alphabet is a manual alphabet that augments the vowel and consonant of Korean sign language. This paper presents a system which recognizes the Korean manual alphabet (KMA) using a USB camera and translates into a normal Korean character. The system captures images from a camera and extracts skin color regions from an image, and finds a hand region. The system detects a hand without particular cloth in a complex background. We use 14 KMA hand shape as template images, and the system compares hand shape with template images using a correlation coefficient method.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123498046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Collaborative Software Tool for the Evaluation of MRI Brain Segmentation Methods","authors":"V. Barra, A. Lundervold","doi":"10.1109/ISITC.2007.5","DOIUrl":"https://doi.org/10.1109/ISITC.2007.5","url":null,"abstract":"The paper presents two Web services (AuroraWeb and AuroraWiki) for collaborative work on brain tissue segmentation and software tools related to MRI recordings. The Web services allow members to share data and results by uploading and downloading, compare methods through a comprehensive segmentation evaluation framework, and provide overview and documentation of segmentation algorithms and their parameters. Presently the Web services are applied to both simulated brain images (where a \"ground truth\" is available), and dual volume 3D brain images from a larger interdisciplinary study of cognitive aging. Commonly used brain segmenters that are tested include SPM2/SPM5, FSL and FreeSurfer, in addition to locally developed methods. New uploaded methods could either be as C/C+ + source code, where a user template is provided, or as executables. We believe this technology can improve quality and dissemination of tools for quantitative MRI of the brain.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126433384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Research on LXI Bus Based on Wireless Technology","authors":"Q. Honglei, Q. Changquan, Xin Lingfei","doi":"10.1109/ISITC.2007.77","DOIUrl":"https://doi.org/10.1109/ISITC.2007.77","url":null,"abstract":"In the past few years, with the development of short range communication, wireless network in the office had advanced quickly. Meantime, in the T&M(test and measurement) industry, distributed architecture becomes more and more popular, this paper tries to illustrate the idea to combine the LXI(LAN extensions for instrumentation) bus technology for instrumentation with the wireless network, and presents a Wireless LXI architecture which includes the synchronization and trigger mechanism for the first time. Finally performance of such an architecture in terms of achievable transmission rate and multiple-access capability based on WLAN and ultra-wideband (UWB) communication technology are estimated for the T&M application.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130772248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Study on Antecedent Decision Rules for Natural Language Requirements Document in Korean","authors":"K. Park, Moon-kun Lee, Dongun An, Yong-Seok Lee","doi":"10.1109/ISITC.2007.18","DOIUrl":"https://doi.org/10.1109/ISITC.2007.18","url":null,"abstract":"In the characteristically requirements document (RD), the pronoun is scarcely used in RD in general. But if we would like to get the higher accuracy in analysis of RD automatically, antecedent decision of pronoun is very important for elicitation of formal requirements (i.e. component, action, statement and parameters etc.) automatically from natural language requirements document (NLRD) via natural language processing (NLP). In this paper, we propose the antecedent decision rule (ADR) to decide antecedent of pronoun from NLRD in Korean via NLP. Pronoun can be classified in personal pronoun and demonstrative pronoun. In the RD, a personal pronoun is almost not occurred so we are focused on antecedent decision for a demonstrative pronoun. The purpose of this paper is to describe the ADR that is used in postprocessing to reduce a burden of morphological analysis and parsing, so our approach can describe additional rules because every rule are applied in the postprocessing. We carried out an experiment with five brief NLRD added pronoun in.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125283589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jia Keat Lee, S. Phon-Amnuaisuk, Huat Chin Chew, C. Ho
{"title":"Manufacturing Test Data Analysis-On Comparing Different Classification Algorithms","authors":"Jia Keat Lee, S. Phon-Amnuaisuk, Huat Chin Chew, C. Ho","doi":"10.1109/ISITC.2007.65","DOIUrl":"https://doi.org/10.1109/ISITC.2007.65","url":null,"abstract":"Due to the circuit complexity and the number of parameters involved, test relationship of a Test Program (TP) might not be fully discovered. Traditionally, TP setup are defined based on the domain expertise and gathered experience of an engineer. Such judgment is time consuming and could be inefficient especially when new products and technologies are rapidly developed for the competing market. If the complexity of a TP increases, the undetected interrelationship among tests in a TP will also increase. In this paper, inferences are performed to a huge and complex TP using different classification algorithms, with the primary goal to discover potential test relationships in a fast and efficient way. The mining output can be used as a reference and basis for test engineers to improve TP setup or to reprogram test machine to replace current exhaustive test policy.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121469110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}