{"title":"Efficient Security-Aware Virtual Memory Management","authors":"Rahmatollah Amirsoufi, M. Taghiloo, Armin Ahmadi","doi":"10.1109/SoCPaR.2009.50","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.50","url":null,"abstract":"Virtual memory was developed to automate the movement of program code and data between main memory and secondary storage to give the appearance of a single. This technique greatly simplified the programmer’s job, particularly when program code and data exceeded the main memory’s size. In modern operating system, secure file system can protect confidential data from unauthorized access. However, once an authorized process has accessed data from a cryptographic file system, the data can appear as plaintext in the unprotected virtual memory backing store, even after system shutdown. This paper proposes new approach for adding multilevel security capability to virtual memory management. It uses partial swap encryption based on process’s security policy. Volatile encryption keys are chosen randomly, and remain valid only for short time periods. Performance comparison shows the total overhead of proposed method.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"2009 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129254437","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 Review of Recent Alignment-Free Clustering Algorithms in Expressed Sequence Tag","authors":"K. Ng, S. Phon-Amnuaisuk, C. Ho","doi":"10.1109/SOCPAR.2009.18","DOIUrl":"https://doi.org/10.1109/SOCPAR.2009.18","url":null,"abstract":"Expressed sequence tags (ESTs) are short single pass sequence reads derived from cDNA libraries, they have been used for gene discovery, detection of splice variants, expression of genes and also transciptome analysis. Clustering of ESTs is a vital step before they can be processed further. Currently there are many EST clustering algorithms available. Basically they can be generalized into two broad approaches, i.e. alignment-based and alignment-free. The former approach is reliable but inefficient in terms of running time, while the latter approach is gaining popularity and currently under rapid development due to its faster speed and acceptable result. In this paper, we propose a taxonomy for sequence comparison algorithms and another taxonomy for EST clustering algorithms. In addition, we also highlight the peculiarities of recently introduced alignment-free EST clustering algorithms by focusing on their features, distance measures, advantages and disadvantages.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128060736","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":"Data Collecting Strategies for the Improvement of Healthcare Service: Analyzing Dispensing Errors in a Hospital Pharmacy","authors":"Yoshiko Habuchi, T. Takenouchi, Y. Motomura","doi":"10.1109/SoCPaR.2009.107","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.107","url":null,"abstract":"In this report, we first describe the importance of both a quality management system and a risk factor monitoring system for healthcare service. This report also discusses a case study that monitored dispensing errors in a hospital pharmacy. The authors used audit records and then interlinked error data with both location and prescription data to investigate the circumstances and potential causes of these errors. The results suggest that the frequency of prescription of certain drugs is a key factor in these types of errors. Understanding the effects of this high volume of prescriptions in the hospital pharmacy could help prevent errors and increase productivity. This report showed that an effective monitoring system could create concrete improvements and enhance utilization of information.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131315346","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}
Yuki Tsujimoto, Yasuhiro Hitotsuyanagi, Y. Nojima, H. Ishibuchi
{"title":"Effects of Including Single-Objective Optimal Solutions in an Initial Population on Evolutionary Multiobjective Optimization","authors":"Yuki Tsujimoto, Yasuhiro Hitotsuyanagi, Y. Nojima, H. Ishibuchi","doi":"10.1109/SoCPaR.2009.76","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.76","url":null,"abstract":"In some multi-objective optimization problems, the search for the optimal solution of each individual objective is much easier than multi-objective optimization. In such a case, it looks a nice idea to search for the single-objective optimal solutions before the execution of multiobjective evolutionary algorithms (MOEAs). In this paper, we examine the effects of including the single-objective optimal solutions in an initial population of MOEAs on their multi-objective search behavior through computational experiments. We use single-machine scheduling problems with two objectives: to minimize the total flow time and the maximum tardiness. The optimal schedules for these two objectives can be easily obtained by sorting the given jobs in ascending order of their processing times and due dates, respectively. Experimental results demonstrate that the inclusion of the optimal solution for each objective (i.e., the inclusion of the two optimal solutions) clearly improves the search ability of NSGA-II. An interesting observation is that its performance is degraded by the inclusion of only the optimal solution for the total flow time.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121632584","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":"Sensitivity Analysis of Bayesian Networks and Its Application for Service Engineering","authors":"H. Chan","doi":"10.1109/SoCPaR.2009.110","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.110","url":null,"abstract":"This paper summarizes the research on sensitivity analysis of Bayesian networks, and also discusses its application for the recently developed field of service engineering, where sensitivity analysis can play an important role in the modeling of large-scale data.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"618 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120979753","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}
M. Abdullah, Wan Sazli Nasaruddin Saifudin, B. Hussin, A. A. Azlianor, S. M. Suhaizan, K. Massila
{"title":"Optimization of LRT Route for Mobile Web Application Engine","authors":"M. Abdullah, Wan Sazli Nasaruddin Saifudin, B. Hussin, A. A. Azlianor, S. M. Suhaizan, K. Massila","doi":"10.1109/SoCPaR.2009.126","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.126","url":null,"abstract":"Integrated Light Rail Transit (LRT) System in the capital of Malaysia connects some key districts to historical places, interesting places, business areas and shopping malls are concentrated. The train services are running independently but have interchanges to integrate from one different LRT lines. This may leads the traveler facing difficulty when they are choosing incorrect destination station especially on different LRT lines which contribute to time consuming and high costing. In previous research we already implement the mobile web application architecture where the destination-oriented routes need to be dynamically generated by determining the nearest station according to the specific places. In this paper, we proposed the used of Dijkstra’s Algorithms to provide more effective and intelligent shortest path system to provide the solution for traveler to reach the desired destination.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"239 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121244219","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":"3D Volumetric CT Liver Segmentation Using Hybrid Segmentation Techniques","authors":"W. Yussof, H. Burkhardt","doi":"10.1109/SoCPaR.2009.85","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.85","url":null,"abstract":"The first step for computer-aided diagnosis for liver of CT scans is the identification of liver region. To deal with multislice CT scans, automatic liver segmentation is required. In this paper, we propose a liver segmentation algorithm using hybrid techniques by combining morphological-based, region-based and histogram-based techniques to segment volumetric CT data. A morphological-based technique is used to find the initial liver tissue from the first slice which is set as a starting slice and region-based is used for further processing for the rest slices, which incorporates seed point generation from Euclidean distance transform (EDT) image on the previous slice for region growing on the current slice. In order to remove neighboring abdominal organs of the liver which connect to the liver organ, the histogram-based technique is used by finding the left and right histogram tail threshold (HTT) and we repeat the use of morphology filtering and large contour detecting for liver smoothing.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126111154","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":"DTM - Extracting Data Records from Search Engine Results Page Using Tree Matching Algorithm","authors":"Jer Lang Hong, Eu-Gene Siew, S. Egerton","doi":"10.1109/SoCPaR.2009.40","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.40","url":null,"abstract":"In this paper, we develop a non-visual automatic wrapper for extracting data records from search engine results page. The novel techniques for our wrapper are (1) filtering rules to detect and filter out irrelevant data records, (2) a tree matching algorithm using frequency measures to increase the speed of data extraction (3) an algorithm to calculate the number and size of the components of data records to detect the correct data region. Results show that our wrapper is as robust and in many cases outperforms the state of the art wrappers such as ViNT and DEPTA. This wrapper could have significant speed advantages when processing large volumes of web sites data, which could be helpful in meta search engine development.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129063301","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":"Facial Features Classification Using the Temporal Correlation Matrix Memory (TCMML)","authors":"Nimish Shah","doi":"10.1109/SoCPaR.2009.79","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.79","url":null,"abstract":"This paper examines the motivation and concepts of dynamic encoders (for binary neural networks) introduced by Shah in the author's RASC 2004 and 2006 conference papers [1,2]. Further to this, the paper extends the claims made by Shah et al. in their IJCNN2007 conference paper [3] about dynamic encoders and offers a different understanding to using dynamic encoders. In addition the paper also derives the Improved Correlation Matrix Memory (CMML) (first introduced by Shah et al.) via practical considerations (as opposed to a theoretical concept), supplies a theorem that provides the missing justification over the use of the improved adjective, before finally enhancing the CMML into the `Improved' Temporal Correlation Matrix Memory (TCMML) together with a brief discussion on an application for recognising facial features.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133756051","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 Application of SMS Technology for Customer Service Centre","authors":"Ariff Idris, A. Basari, Nur Hanisah Zubir","doi":"10.1109/SoCPaR.2009.124","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.124","url":null,"abstract":"SMS technology is designed originally as a communication tool between a service provider and its users. However in the last few years this technology has allowed users to communicate among them. The vast growth of mobile technology is also one of the elements that help in utilizing this technology. Users are able to get very fast information anywhere. In order to utilize this technology, CeS-LAP is developed to improve the current services provided by Lembaga Air Perak (LAP). This system is aimed at providing better complaint system, customer information system and expectantly an alternative way for customer to check their unpaid bill.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"26 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133588144","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}