K. Chimwayi, Noorie Haris, Ronnie D. Caytiles, N. Iyengar
{"title":"Enriching Medicare Severity-Diagnosis Related Group (MS-DRG) Payments for better Service to inpatients using ANFIS","authors":"K. Chimwayi, Noorie Haris, Ronnie D. Caytiles, N. Iyengar","doi":"10.14257/IJHIT.2017.10.8.02","DOIUrl":"https://doi.org/10.14257/IJHIT.2017.10.8.02","url":null,"abstract":"Variations in the cost for the same diagnosis among different hospital providers is a great concern to the public at large. With huge amounts of data being availed every second, utilising the data for the benefit of the society is commendable. In this research a neuro-fuzzy approach is proposed for Medicare payments data. Machine learning clustering algorithms on neuro-fuzzy results are compared to understand the variations in price for same treatment and diagnosis among different healthcare providers. Cluster analysis has been applied in various domains to help reveal hidden structures. Cluster analysis has not been well exploited in healthcare claims datasets, the reason being that healthcare expenditure data is highly skewed which make analysis complicated. The Inpatient charges is a large dataset that has 163065 and 12 attributes describing amounts paid by Centers for Medicare and Medicaid Services (CMS) to different healthcare providers using different Diagnostic Related Group (DRGs).","PeriodicalId":170772,"journal":{"name":"International Journal of Hybrid Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134622201","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 the Ergonomic Adaptability of Electric Racing Vehicle","authors":"Zhang Dongjian, Mao Qihua, T. Chao","doi":"10.14257/ijhit.2017.10.8.01","DOIUrl":"https://doi.org/10.14257/ijhit.2017.10.8.01","url":null,"abstract":"This study shows that the electric racing vehicle (ERV) is still not well enough adapted for human beings, especially in the part of seat, steering wheel, visibility and accessible range. When designing ERV ergonomically, the virtual reality (VR) technique is as important as the real experience. Moreover, exacting contemporary economic and ecological requirements also mean that the cost and the energy consumption of the production cycle must be modified and reduced to a minimum. The present authors offer a new method of optimization of the ergonomic adaptability for ERV where the interiors and visibility are evaluated by designers and engineers, with interrelated functional links using UGS human builder module. This study uses anthropometric reference data for drivers from all previous racing drivers of the SUES. The objective was, taking into account the ERV interior height and width limitations, to accommodate the largest range of anthropometric dimensions by using the fifth-percentile woman, which was accomplished using a new method for model accommodation optimization. Furthermore, comfort, convenience, visibility and accessibility must be assured. Meanwhile, the robustness analysis also is applied to test the comfort of the ERV. After the robustness analysis of the new frame, the driver has enough comfort, convenience, visibility and accessible range of hands. By applying the suggested method and the data of new frame acquired, an optimum space for drivers was obtained. The space for the angle between the eyespot and the rear mirror is 12 deg relative to the vertical, and the horizontal angle is 29 deg, which meets the requirements of the basic visibility.","PeriodicalId":170772,"journal":{"name":"International Journal of Hybrid Information Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126542842","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":"Cast Shadow Resistant Ground Plane Detection in Single Image","authors":"Xiaoyan Xu, Xiaoming Liu, Chang-jia Liu, Yuan Ling","doi":"10.14257/IJHIT.2017.10.8.09","DOIUrl":"https://doi.org/10.14257/IJHIT.2017.10.8.09","url":null,"abstract":"Ground plane detection is useful for vision navigation to robots and autonomous vehicles. Cast shadow on the ground plane is a challenging issue that may cause the detection fail. In this paper, we present a cast shadow resistant ground plane detection approach from a single color image. We first derive an initial ground plane using geometric layout method. We then apply shadow invariant transform on the roughly detected shadow edges to get a gray-scale intrinsic image. The final shadow resistant ground plane result is obtained by employing region growth on the initial seed region in the shadow-free intrinsic image. The approach proposed here does not need priori assumption such as calibration or landmark. Experimental results show the method works for different scenes.","PeriodicalId":170772,"journal":{"name":"International Journal of Hybrid Information Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124569152","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}
Yunfei Su, Mengjun Li, Chaojing Tang, Rongjun Shen
{"title":"APT Detection with Concolic Execution","authors":"Yunfei Su, Mengjun Li, Chaojing Tang, Rongjun Shen","doi":"10.14257/IJHIT.2017.10.7.01","DOIUrl":"https://doi.org/10.14257/IJHIT.2017.10.7.01","url":null,"abstract":"Advanced persistent threat (APT) is sophisticated cyber-attack and has attracted lots of attention of security researchers in cybersecurity. Traditional defense measures based on signature matching such as antivirus products and IDS/IPS are insufficient to detect APT. Concolic(a portmanteau of CONCrete and SymbOLIC) execution is a hybrid software verification technique that performs symbolic execution which could be used for APT detection. In this paper, we proposed a framework of APT detection which includes network traffic redirection module, user agent, reconstruction module, dynamic analysis module and response module. With the help of concolic execution in dynamic analysis module, the framework could effectively and accurately detect APT attacks compared with current defense systems. We provide a detailed example to illustrate how the framework works against APT attacks especially passive attacks.","PeriodicalId":170772,"journal":{"name":"International Journal of Hybrid Information Technology","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115074539","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. A. Jatoi, N. Kamel, S. Musavi, M. S. Shaikh, C. Kumar
{"title":"Low Resolution Brain Source Localization Using EEG Signals","authors":"M. A. Jatoi, N. Kamel, S. Musavi, M. S. Shaikh, C. Kumar","doi":"10.14257/IJHIT.2017.10.7.04","DOIUrl":"https://doi.org/10.14257/IJHIT.2017.10.7.04","url":null,"abstract":"Each mental or physical task gives rise to generate electromagnetic activity in the brain. These electrical signals are analyzed by using various neuroimaging techniques which include electroencephalography (EEG), magnetoencephalogy (MEG), positron emission tomography (PET) and functional magnetic resonance imaging (fMRI). However, when the brain sources which are responsible for such electrical activity are localized, then it’s called brain source localization or source estimation. This information is utilized to comprehend brain’s physiological, pathological, mental, functional abnormalities. Also, the information is used to diagnose cognitive behaviour of the brain. Various methodologies based upon EEG signals are adopted to localize the active sources such as minimum norm estimation (MNE), low resolution brain electromagnetic tomography (LORETA), standardized LORETA, exact LORETA, multiple signal classification (MUSIC), focal underdetermined system solution (FOCUSS) etc. This research discusses localizing ability of low resolution techniques (LORETA and sLORETA) for various head models (finite difference model and concentric model). The simulations are carried out by using NETSTATION software. The results are compared in terms of activations for same EEG data with the same stimulus provided to subjects. However, it is observed that the combination of finite difference method (FDM) with sLORETA produced best results in terms of source intensity level (nA). Hence, the combination of inverse method sLORETA with FDM produces better source localization.","PeriodicalId":170772,"journal":{"name":"International Journal of Hybrid Information Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127407093","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":"Binomial Heap Sorting – A New Sorting Algorithm","authors":"A. Tayal, Kuldeep Tanwar, Gaurav Dubey","doi":"10.14257/ijhit.2017.10.7.03","DOIUrl":"https://doi.org/10.14257/ijhit.2017.10.7.03","url":null,"abstract":"In computer science, one of the fundamental issue is to arrange the elements in some logical order. Various algorithms have been developed over the years to handle this process of ordering the elements (sorting) having their own running time, efficiency and simplicity. Sorting problem has attracted a great deal of research because efficient sorting is important to optimize the use of other algorithms. This report presents a new sorting algorithm, using the data structure Binomial Heap, called Binomial Heap sort algorithm which will give an innovative sorting scheme through which we can arrange the given elements in some specific order either in increasing order or in decreasing order. Binomial Heap sort results in minimum complexity over Binary Heap sort as far as frequency of inbuilt operations is concerned. In this report, we consider all the cases whether the input elements given in an array are in descending order, ascending order or randomly distributed. Through this paper, we are proposing a new sorting algorithm called Binomial Heap sort. Its time complexity is ). lg ( n n O","PeriodicalId":170772,"journal":{"name":"International Journal of Hybrid Information Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125470173","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 Tile Data Cache Replacement Policy Based on Hierarchical Relationship and Correlation Degree","authors":"Xing Chen, Feixiang Chen, Jiaxing Liu","doi":"10.14257/ijhit.2017.10.7.02","DOIUrl":"https://doi.org/10.14257/ijhit.2017.10.7.02","url":null,"abstract":"To solve the problems that server and network pressure is too large and tile response time is too long in tile spatial data transmission, a data cache preplacement method named Value Evaluation of Associated Tiles was put forward in this paper. This method combined the tiles of hierarchy and the correlation between adjacent tiles, and the value of tiles was defined. On the basis of this method, the tile value and cache space were abstracted as 0/1 knapsack problem, and solved by ant colony algorithm. Experimental results showed that this method was significantly improved in tile hit rate and byte hit rate, especially in the small cache capacity, the cache hit rate was significantly higher than other algorithms.","PeriodicalId":170772,"journal":{"name":"International Journal of Hybrid Information Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130492580","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}
Sheng-Ping Zhu, Xiangguang Meng, Feixiang Chen, Xuan Tian
{"title":"Personalized Semantic Query Expansion Based on Dynamic User Query Profile and Spreading Activation Model","authors":"Sheng-Ping Zhu, Xiangguang Meng, Feixiang Chen, Xuan Tian","doi":"10.14257/ijhit.2017.10.6.04","DOIUrl":"https://doi.org/10.14257/ijhit.2017.10.6.04","url":null,"abstract":"Semantic query expansion is a widely used method to resolve the query problems of synonym and polysemy in the information retrieval field. However, it does not make users more satisfied with the search results because too much noise unfit to users’ needs is introduced in the process. In this paper a new framework combining personalization with semantic query expansion is proposed to overcome the noise problem brought by semantic query expansion. In the proposed framework, firstly, instead of using traditional hierarchical expansion strategy, the spreading activation model (SAM) is used for enhancing the selection of expansion terms to reduce the noise. Secondly, to get more accurate expansion terms for individual search, dynamic user query profile is built to capture individual variable query needs and is integrated into the semantic expansion process. The proposed expansion process is described by four steps: building dynamic user query profile, concepts mapping, personalized semantic query expansion and determining the final expansion terms. Four groups of experiments were designed to verify the validity of the proposed method. The experiment results show that the proposed method outperforms both traditional hierarchical expansion and keyword-based query, which manifests that building dynamic user query profile is important for depicting user query needs in semantic query expansion and it is more rational to improve query expansion based on spreading activation model. Moreover, personalized semantic query expansion based on dynamic user query profile and spreading activation model can reduce noise of semantic query expansion and improve the search effectiveness. Keyword: semantic query expansion, personalized information retrieval, dynamic user query profile, spreading activation model","PeriodicalId":170772,"journal":{"name":"International Journal of Hybrid Information Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115370774","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 Method of Initial Population Generation of Intelligent Optimization Algorithms for Constrained Global Optimization","authors":"Jiquan Wang, O. Ersoy, Xinxin Chen, Fulin Wang","doi":"10.14257/IJHIT.2017.10.6.05","DOIUrl":"https://doi.org/10.14257/IJHIT.2017.10.6.05","url":null,"abstract":"When the constraint conditions and variables are very many in a global optimization application, it is a challenging task to generate initial population to be used in an evolutionary optimization algorithm to solve the constrained global optimization problem. In this paper, a method of rapidly generating an initial population is proposed. The key to this method is to use the genetic algorithm to generate a first initial interior point. First, by using the interior point method, the problem of the first initial interior point of generating the initial population is converted in to solving an unconstrained optimization problem, which is next solved by using the genetic algorithm to generate the first initial interior point. Secondly, the remaining individuals of the initial population are randomly generated. In this process, the feasibility of each randomly generated member is first checked. If it is feasible, then the next member is checked. If this member is infeasible, then it is moved closer to the first interior point until it becomes feasible. When all the members of the population are feasible, the initial population is ready to be used with the intelligent optimization algorithm. The experimental results with three test functions show that the proposed method can quickly generate the initial population.","PeriodicalId":170772,"journal":{"name":"International Journal of Hybrid Information Technology","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123402598","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 Variance Multi-period Portfolio Model with Fixed Ratio Based on Ternary Interval Numbers","authors":"Liu Ximei, Wang Changfeng, Lv Yuan","doi":"10.14257/IJHIT.2017.10.6.01","DOIUrl":"https://doi.org/10.14257/IJHIT.2017.10.6.01","url":null,"abstract":"In portfolio problem, the expected return, risk etc. cannot be predicted precisely. The investor generally makes his portfolio decision according to his experience. So, deterministic portfolio selection is not a good choice for the investor. Portfolio selection of oil/ gas projects is a fundamental subject of capital budgeting in the energy sector. Interval number is widely used to model the problem in uncertain environments in most of the recent works. In this paper, we combine forecasting and decision-making, and utilize the concept of the ternary interval numbers to build a variance multi-period portfolio optimization model with fixed ratio. In addition, we also give three weak optimal solutions of the proposed model. Finally, these approaches are tested on a set of project data from CNOOC(China National Offshore Oil Corporation).","PeriodicalId":170772,"journal":{"name":"International Journal of Hybrid Information Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132774008","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}