2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)最新文献

筛选
英文 中文
An Intelligent Hybrid Hemodynamic Data Monitoring for Post-Cardiac Surgical Patients 用于心脏手术后患者的智能混合血流动力学数据监测
A. A. Rahman, A. K. Rabiah, M. S. Nasir, S. A. Lilly, M. D. Zamrin, O. Joanna
{"title":"An Intelligent Hybrid Hemodynamic Data Monitoring for Post-Cardiac Surgical Patients","authors":"A. A. Rahman, A. K. Rabiah, M. S. Nasir, S. A. Lilly, M. D. Zamrin, O. Joanna","doi":"10.1109/ACSAT.2012.83","DOIUrl":"https://doi.org/10.1109/ACSAT.2012.83","url":null,"abstract":"Cardiothoracic Intensive Care Units (CICU) patients require vigilant watchful and very strict monitoring of their conditions in real time. Accurate observation is required through bedside monitoring devices which generates massive amounts of data. Such a countless of data which reflect the cardiovascular system and its physiological components pose a lot of difficulties, challenges and is time consuming to the clinicians and health care professionals who are required to interpret and analyze such an overload of information which could cause errors in patient care which could prove fatal. Patients admitted to CICU are characterized by periods of hemodynamic instability and management of these patients requires prompt and accurate therapeutic diagnosis in order to avoid serious complications. This paper describes the design and implementation of an Intelligent Hybrid Hemodynamic Data Monitoring (IHHDM) to overcome such difficulties and to help medical experts in making appropriate decisions. The system has the capability to perform the functions which are normally associated with human intelligence in providing accurate diagnosis and to determine the suitable therapy and specific dosages of drugs administered to the patients. This will increase the quality and the efficiency of the working environment in the CICU, reduce medical errors which may result in suboptimal patient care, and enhance the usefulness of medical sciences.","PeriodicalId":224257,"journal":{"name":"2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114178431","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}
引用次数: 0
Hybrid and Multilevel Segmentation Technique for Medical Images 医学图像的混合多级分割技术
S. Hamed, A. Aboaba, O. Khalifa, A. Abdalla
{"title":"Hybrid and Multilevel Segmentation Technique for Medical Images","authors":"S. Hamed, A. Aboaba, O. Khalifa, A. Abdalla","doi":"10.1109/ACSAT.2012.73","DOIUrl":"https://doi.org/10.1109/ACSAT.2012.73","url":null,"abstract":"In this paper, we present a novel, fast, hybrid and bi-level segmentation technique uniquely developed for segmentation of medical images. Medical images are generally characterized by multiple regions, and weak edges. When regions in medical images are viewed as made up of homogeneous group of intensities, it becomes more difficult to analyze because quite often different organs or anatomical structures may have similar gray level or intensity representation. The complexity of medical imagery is well catered for in this technique by starting-out with multiple thresholding, applying similarity segmentation method, and resolving boundary problem with template matching technique, and then a region of interest (ROI) segmentation that involves finding the edges of the object of interest (OOI) at final stage. This technique can also be adapted to segmentation of non-medical images. A job is run using MATLAB and simple Grid computing as suitable environment.","PeriodicalId":224257,"journal":{"name":"2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126766306","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}
引用次数: 5
A General Framework for Greedy Routing in Mobile Ad-hoc Networks 移动Ad-hoc网络贪心路由的通用框架
M. Al-shugran, O. Ghazali, Suhaidi Hassan
{"title":"A General Framework for Greedy Routing in Mobile Ad-hoc Networks","authors":"M. Al-shugran, O. Ghazali, Suhaidi Hassan","doi":"10.1109/ACSAT.2012.18","DOIUrl":"https://doi.org/10.1109/ACSAT.2012.18","url":null,"abstract":"This paper introduces the notion of a reliable and efficient greedy routing provisioning (RGRS) in mobile ad hoc networks. The proposed RGRS constructed of two mechanisms in the context of improving and enhancing greedy routing. These mechanisms are Dynamic Beaconing Update Mechanism (DBUM), and Dynamic and Reactive Reliability Estimation with Selective Metrics (DRESM). The building structure of DRESM is based on the notion of multi-criteria next relay node selection using fuzzy weighted logic multi-objectives. To efficiently track node's status, DRESM is supported with a dynamic and effective updating DBUM scheme. In this work, and to show the performance of the proposed RGRS detailed experiments in simulated environments are executed. The simulation results show that RGRS is quite reliable and efficient and superior to the traditional greedy forwarding strategy (GFS). Moreover, the results reveal that RGRS can be used as a standalone routing protocol without the aid of any recovery mode. RGRS outperforms GFS in terms of the packet delivery ratio. Moreover, RGRS achieves high level of accuracy in terms of nodes' information and can find routs between communicating nodes whose cost is close to the optimum.","PeriodicalId":224257,"journal":{"name":"2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126706503","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}
引用次数: 0
Fault-Tolerant Routing Based on Directed Safety Levels in a Hyper-Star Graph 基于有向安全级别的超星图容错路由
Y. Nishiyama, Y. Hirai, K. Kaneko
{"title":"Fault-Tolerant Routing Based on Directed Safety Levels in a Hyper-Star Graph","authors":"Y. Nishiyama, Y. Hirai, K. Kaneko","doi":"10.1109/ACSAT.2012.76","DOIUrl":"https://doi.org/10.1109/ACSAT.2012.76","url":null,"abstract":"A hyper-star graph HS(2n, n) is promising as a generic topology for interconnection networks of parallel processing systems because it has merits of a hypercube and a star graph. This paper proposes an algorithm that constructs a fault-free path between a pair of non-faulty nodes in HS(2n, n) with faulty nodes. In addition, we conduct a computer experiment to show its effectiveness.","PeriodicalId":224257,"journal":{"name":"2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114625151","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}
引用次数: 2
Fuzzy Logic Based MPPT for PV Array under Partially Shaded Conditions 部分荫蔽条件下基于模糊逻辑的光伏阵列最大功率跟踪
C. S. Chin, Y. K. Chin, B. Chua, A. Kiring, K. Teo
{"title":"Fuzzy Logic Based MPPT for PV Array under Partially Shaded Conditions","authors":"C. S. Chin, Y. K. Chin, B. Chua, A. Kiring, K. Teo","doi":"10.1109/ACSAT.2012.46","DOIUrl":"https://doi.org/10.1109/ACSAT.2012.46","url":null,"abstract":"This paper presents the fuzzy logic based maximum power point tracking for the optimization of the solar photovoltaic (PV) array under partially shaded conditions. The PV system is modelled in MATLAB/SIMULINK where the PV array is formed by five PV modules connected in series. The PV characteristic of PV module and PV array under uniform solar irradiance are nonlinear but there are one maximum power point (MPP) can be identified. Nevertheless, the PV characteristic becomes more complex with multiple MPP when the PV array under partially shaded conditions (PSC). In this paper, maximum power point tracking (MPPT) approach based on perturb and observe algorithm has been investigated. Fuzzy logic is adopted into the conventional MPPT to enhance the overall performance of the PV system. The performances of MPPT and FMPPT are investigated particularly on the transient response and the steady state response when the PV array is exposed under different partially shaded conditions. The simulation results show that FMPPT has better performance where it can facilitate the PV array to reach the MPP faster and provide more stable output power.","PeriodicalId":224257,"journal":{"name":"2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)","volume":"59 13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114739738","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}
引用次数: 24
Performance Comparison of Position-Based Routing Protocols in the Context of Solving Greedy Failure 基于位置的路由协议在解决贪婪故障方面的性能比较
M. Al-shugran, O. Ghazali, Suhaidi Hassan
{"title":"Performance Comparison of Position-Based Routing Protocols in the Context of Solving Greedy Failure","authors":"M. Al-shugran, O. Ghazali, Suhaidi Hassan","doi":"10.1109/ACSAT.2012.20","DOIUrl":"https://doi.org/10.1109/ACSAT.2012.20","url":null,"abstract":"In Mobile Ad-hoc Networks (MANETs), greedy forwarding strategy (GFS) seems to be the method of choice for position-based routing protocols. During the last decade GFS has become the subject of research. However, with greedy routing there is no guarantee that a node could always find a suitable next-relay hop to forward its packet. Of such situation, forwarded packets might be ends at a concave (Hole) node that result in the forwarded packet to be dropped. This \"Hole\" node might be out of battery power, full congested or does not have neighbor(s) in the direction of ultimate destination, etc. Accordingly, this Hole is considered as vital section of the whole network which results that the whole MANET fails. Considering the problem of greedy failure at the network holes, several works have been proposed in the state. In this paper, we present these works in new classification with two categories. Moreover, an investigation of the proposed routing protocols corresponding to each category is conducted. Thus, besides the new classification, this paper presents an overview and a qualitative comparison of the existing position based routing protocols that tried to solve greedy failure. The noble goal of this classification and investigation is to conclude the most important features to be considered in rebuilding GFS to make it as standalone position based routing protocol. As future research efforts. Hopefully that GFS with the new features becomes more reliable and efficient that satisfies most MANET's applications.","PeriodicalId":224257,"journal":{"name":"2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114805456","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}
引用次数: 1
Automatic Guitar Music Transcription 自动吉他音乐转录
L. Alcabasa, N. Marcos
{"title":"Automatic Guitar Music Transcription","authors":"L. Alcabasa, N. Marcos","doi":"10.1109/ACSAT.2012.78","DOIUrl":"https://doi.org/10.1109/ACSAT.2012.78","url":null,"abstract":"This paper presents a system that helps in automatically generating guitar tablatures and musical scores based on musical audio data. Information gathered from the audio consists of pitch, onsets and durations, chords, and beat and tempo. Major issues that were encountered during the research were harmonics for pitch detection, thresholding for onset detection, chord distinction, similar chord structures for chord labeling, and the subjective quality of tempo. Results were generally acceptable, performed on a data set that contains 22 files with varying elements. 70% accuracy was gathered from pitch detection, 60% accuracy from onset detection, 86% accuracy for chord distinction, 85% accuracy for chord labeling, and 81% accuracy for beat and tempo.","PeriodicalId":224257,"journal":{"name":"2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)","volume":"244 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129766104","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}
引用次数: 6
Manpower Model for Human Resource Planning Management 人力资源规划管理中的人力模型
S. S. Halim, A. Zeki
{"title":"Manpower Model for Human Resource Planning Management","authors":"S. S. Halim, A. Zeki","doi":"10.1109/ACSAT.2012.28","DOIUrl":"https://doi.org/10.1109/ACSAT.2012.28","url":null,"abstract":"Human resource planning has traditionally been used by organizations to ensure that the right person is in the right job at the right time. The increasing of environmental instability, demographic shifts, changes in technology, and heightened international competition are changing the need for and the nature of human resource planning in leading organizations. Therefore, it is required to have a appropriate tool to assist management in order to present overview and visibility of manpower numbers by deciding the effect of variables on the optimal level of manpower force. This tool shall be the one-stop information gateway for users to achieve.","PeriodicalId":224257,"journal":{"name":"2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129838251","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}
引用次数: 1
Comparative Study on Content-Based Image Retrieval (CBIR) 基于内容的图像检索(CBIR)比较研究
Sumaira Muhammad Hayat Khan, Ayyaz Hussain, I. Alshaikhli
{"title":"Comparative Study on Content-Based Image Retrieval (CBIR)","authors":"Sumaira Muhammad Hayat Khan, Ayyaz Hussain, I. Alshaikhli","doi":"10.1109/ACSAT.2012.40","DOIUrl":"https://doi.org/10.1109/ACSAT.2012.40","url":null,"abstract":"The process of retrieving desired images from a large collection is widely used in applications of computer vision. In order to improve the retrieval performance an efficient and accurate system is required. Retrieving images based on the content i.e. color, texture, shape etc is called content based image retrieval (CBIR). The content is actually the feature of an image and is extracted through a meaningful way to construct a feature vector. Images having the least distance between their feature vectors are most similar. This paper gives comparison of three different approaches of CBIR based on image features and similarity measures taken for finding the similarity between two images. Results have shown that selecting an important image feature and calculating that through a meaningful way is of great importance in image retrieval. All the important features must be considered while constructing a feature vector and a proper similarity measure should be used for calculating the distance between two feature vectors. These parameters play very crucial role in deciding the overall performance of the any CBIR system. Some future direction were identified and under our future work.","PeriodicalId":224257,"journal":{"name":"2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122767248","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}
引用次数: 34
Automated Extraction of Lexicon Applied both to Chinese and Japanese Corpora 汉语和日语语料库词汇的自动提取
Shujing Ke, S. Shiu, B. Goertzel, G. Yu, X. Shi, Changle Zhou
{"title":"Automated Extraction of Lexicon Applied both to Chinese and Japanese Corpora","authors":"Shujing Ke, S. Shiu, B. Goertzel, G. Yu, X. Shi, Changle Zhou","doi":"10.1109/ACSAT.2012.15","DOIUrl":"https://doi.org/10.1109/ACSAT.2012.15","url":null,"abstract":"A novel statistical approach is described, enabling the automated extraction of large word lists from unsegmented corpora without reliance on existing dictionaries. The main contribution of this approach includes the following two points: First, it's very generic and has been successfully applied separately to both Chinese and Japanese, Second, it doesn't take any use of punctuation information, so compared to most of the existing methods, it doesn't need to pre-process the corpora to remove the punctuations or to pre-segment the corpora by punctuations. Our experiment results in the extraction of 14,087 Chinese words and 15,553 Japanese words. Precision achieved is over 80% for two-character Chinese words, over 90% for one-character Japanese words and over 70% for two-character Japanese words. And we've also successfully extracted most of single-character words including common functional characters, such in, and, or, 's, also, a family name in Chinese, hiragana such as \" ?,\"\" ?,\"\" ?\" in Japanese, and punctuations such as \",\", \"\", \"?\".","PeriodicalId":224257,"journal":{"name":"2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127994150","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书