Pub Date : 2015-12-07DOI: 10.1007/978-3-319-26979-5_19
Yong Chen, Hai Jin, Han Jiang, Dechao Xu, Ran Zheng, Haocheng Liu
{"title":"GPU-based Static State Security Analysis in Power Systems","authors":"Yong Chen, Hai Jin, Han Jiang, Dechao Xu, Ran Zheng, Haocheng Liu","doi":"10.1007/978-3-319-26979-5_19","DOIUrl":"https://doi.org/10.1007/978-3-319-26979-5_19","url":null,"abstract":"","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122437092","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}
As the population of books and other materials increases explosively, an effective plan for material acquisitions becomes an emergent and significant need for most modern academic libraries. However, there are few researches on this topic in the past decades. We thereby propose a formal model for material acquisitions that resembles the practical situations of academic libraries. In the proposed model, we consider several features for each material (including the preference, price and its categories) as well as the budget for each category. The goal is to select materials to achieve a maximum total preference under the constraint that the acquisition for each category of materials is controlled by a predefined budget. With the computational complexity of the studied problem, we seek to produce approximate solution in a reasonable time. Three meta-heuristics, namely simulated annealing, genetic algorithm and tabu search, are developed to cope with this problem. Computational results reveal that tabu search is the most elegant approach among the three for the material acquisitions problem.
{"title":"Material Acquisitions in Academic Libraries","authors":"Tsu-Feng Ho, S. Shyu, Yi-Ling Wu","doi":"10.1109/APSCC.2008.85","DOIUrl":"https://doi.org/10.1109/APSCC.2008.85","url":null,"abstract":"As the population of books and other materials increases explosively, an effective plan for material acquisitions becomes an emergent and significant need for most modern academic libraries. However, there are few researches on this topic in the past decades. We thereby propose a formal model for material acquisitions that resembles the practical situations of academic libraries. In the proposed model, we consider several features for each material (including the preference, price and its categories) as well as the budget for each category. The goal is to select materials to achieve a maximum total preference under the constraint that the acquisition for each category of materials is controlled by a predefined budget. With the computational complexity of the studied problem, we seek to produce approximate solution in a reasonable time. Three meta-heuristics, namely simulated annealing, genetic algorithm and tabu search, are developed to cope with this problem. Computational results reveal that tabu search is the most elegant approach among the three for the material acquisitions problem.","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122108717","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}
Considering that personalization recommendation systems based on association rules suffer from some limitations that a lot of time is spent on matching current user session with all discovered patterns in patterns database, authors propose a new approach to build personalization recommendation system based on access sequential patterns discovered form usage data and highly compressed into a tree structure. During personalization recommendation stage we just need to intercept nearest access subsequence from current user session to match some sub paths of the tree. The speed of pattern matching is improved enormously, which satisfies the need of real-time recommendation better. The results of experiments show the proposed methodology can achieve better recommendation effectiveness.
{"title":"An Effective Technique for Personalization Recommendation Based on Access Sequential Patterns","authors":"Xiaoqiu Tan, Min Yao, Miaojun Xu","doi":"10.1109/APSCC.2006.27","DOIUrl":"https://doi.org/10.1109/APSCC.2006.27","url":null,"abstract":"Considering that personalization recommendation systems based on association rules suffer from some limitations that a lot of time is spent on matching current user session with all discovered patterns in patterns database, authors propose a new approach to build personalization recommendation system based on access sequential patterns discovered form usage data and highly compressed into a tree structure. During personalization recommendation stage we just need to intercept nearest access subsequence from current user session to match some sub paths of the tree. The speed of pattern matching is improved enormously, which satisfies the need of real-time recommendation better. The results of experiments show the proposed methodology can achieve better recommendation effectiveness.","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122082752","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}
Traditional financial surveillance system usually discriminates suspicious transaction by comparing every transaction against its corresponding account history. This process always results in high false positive rate because it is regardless of the existence of economic cycle and business fluctuation. We conceived a new analyzing prototype by comparing an account time series transaction data against its peer group. It has deeply considered the influence of normal fluctuation widely existing in real life and could efficiently reduce the number of false positives with a better understanding of customers behavior pattern. A new method empirical mode decomposition (EMD) developed initially for natural and engineering sciences has now been applied to financial time series data. This method has shown its superiorities in analyzing nonlinear and nonstationary stochastic engineering time series over traditional discrete Fourier decomposition (DFD) and wavelet decomposition methods. Firstly the complex financial time series is decomposed into some local detail parts and one global tendency part which represent different time scales like daily, monthly, seasonal or annual. Then a linear segment approximation method based on hierarchical piecewise linear representation (LPR) is used to fulfil the quick matching of the major tendency parts between two time series. The results from experiments on real life bank data (foreign exchange transaction data sets) exhibit that the EMD can become a vital technique for the analysis of financial suspicious transaction detection
{"title":"Suspicious Financial Transaction Detection Based on Empirical Mode Decomposition Method","authors":"Tianqing Zhu","doi":"10.1109/APSCC.2006.95","DOIUrl":"https://doi.org/10.1109/APSCC.2006.95","url":null,"abstract":"Traditional financial surveillance system usually discriminates suspicious transaction by comparing every transaction against its corresponding account history. This process always results in high false positive rate because it is regardless of the existence of economic cycle and business fluctuation. We conceived a new analyzing prototype by comparing an account time series transaction data against its peer group. It has deeply considered the influence of normal fluctuation widely existing in real life and could efficiently reduce the number of false positives with a better understanding of customers behavior pattern. A new method empirical mode decomposition (EMD) developed initially for natural and engineering sciences has now been applied to financial time series data. This method has shown its superiorities in analyzing nonlinear and nonstationary stochastic engineering time series over traditional discrete Fourier decomposition (DFD) and wavelet decomposition methods. Firstly the complex financial time series is decomposed into some local detail parts and one global tendency part which represent different time scales like daily, monthly, seasonal or annual. Then a linear segment approximation method based on hierarchical piecewise linear representation (LPR) is used to fulfil the quick matching of the major tendency parts between two time series. The results from experiments on real life bank data (foreign exchange transaction data sets) exhibit that the EMD can become a vital technique for the analysis of financial suspicious transaction detection","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123968269","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}
Outlier detection is a key element for intelligent financial surveillance systems which intend to identify fraud and money laundering by discovering unusual customer behaviour pattern. The detection procedures generally fall into two categories: comparing every transaction against its account history andficrther more, comparing against a peer group to determine if the behavior is unusual. The later approach shows particular merits in efficiently extracting suspicious transaction and reducing false positive rate. Peer group analysis concept is largely dependent on a cross-datasets outlier detection model. In this paper, we propose a new cross outlier detection model based on distance definition incorporated with the financial transaction data features. An approximation algorithm accompanied with the model is provided to optimize the computation of the deviation from tested data point to the reference dataset. An experiment based on real bank data blended with synthetic outlier cases shows promising results of our model in reducing false positive rate while enhancing the discriminative rate remarkably.
{"title":"An Outlier Detection Model Based on Cross Datasets Comparison for Financial Surveillance","authors":"Tianqing Zhu","doi":"10.1109/APSCC.2006.33","DOIUrl":"https://doi.org/10.1109/APSCC.2006.33","url":null,"abstract":"Outlier detection is a key element for intelligent financial surveillance systems which intend to identify fraud and money laundering by discovering unusual customer behaviour pattern. The detection procedures generally fall into two categories: comparing every transaction against its account history andficrther more, comparing against a peer group to determine if the behavior is unusual. The later approach shows particular merits in efficiently extracting suspicious transaction and reducing false positive rate. Peer group analysis concept is largely dependent on a cross-datasets outlier detection model. In this paper, we propose a new cross outlier detection model based on distance definition incorporated with the financial transaction data features. An approximation algorithm accompanied with the model is provided to optimize the computation of the deviation from tested data point to the reference dataset. An experiment based on real bank data blended with synthetic outlier cases shows promising results of our model in reducing false positive rate while enhancing the discriminative rate remarkably.","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122981666","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}
Automatic composition of Web services has drawn a great deal of attention recently. Current Web service (WS) composition algorithms are not only logical presented in a rough way, but also existed inefficient or limited applied scope problem. In this paper a data structure called WS chain table, which describes the dependent relations among Web services, is proposed, and an efficient algorithm for WS composition is developed based on the data structure. The time complexity of the new algorithm is O(max(log m,n)), improved the known O(n times log m) one, where n is the number of WSs and m denotes the number of output parameters of WSs. Experiments are carried out in order to compare the performance of the algorithms with different data structure
Web服务的自动组合最近引起了极大的关注。当前的Web服务组合算法不仅逻辑表述粗糙，而且存在效率低下或适用范围有限的问题。本文提出了一种描述Web服务之间依赖关系的Web服务链表数据结构，并基于该数据结构开发了一种高效的Web服务组合算法。新算法的时间复杂度为O(max(log m,n))，改进了已知的O(n * log m) 1，其中n为WSs的个数，m为WSs输出参数的个数。通过实验比较了不同数据结构下算法的性能
{"title":"An Efficient Algorithm for Web Services Composition with a Chain Data Structure","authors":"Li Lian, Jun Ma, Zhumin Chen, Ling Song","doi":"10.1109/APSCC.2006.28","DOIUrl":"https://doi.org/10.1109/APSCC.2006.28","url":null,"abstract":"Automatic composition of Web services has drawn a great deal of attention recently. Current Web service (WS) composition algorithms are not only logical presented in a rough way, but also existed inefficient or limited applied scope problem. In this paper a data structure called WS chain table, which describes the dependent relations among Web services, is proposed, and an efficient algorithm for WS composition is developed based on the data structure. The time complexity of the new algorithm is O(max(log m,n)), improved the known O(n times log m) one, where n is the number of WSs and m denotes the number of output parameters of WSs. Experiments are carried out in order to compare the performance of the algorithms with different data structure","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129265463","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}
In Manufacturing Grid, a lot of applications and resources in manufacturing enterprises are encapsulated as web services and a cooperative work environment is provided. Applying web service composition and workflow technologies, services are integrated into a composite service to represent a cooperative business process. Therefore the enterprise cooperation can be implemented by executing and monitoring the composite service. According to the characteristics of Manufacturing, this paper presents a composite service modeling solution based on BPEL4WS and discusses how this solution support BPEL4WS during the whole modeling process. The solution includes dynamic service discovery and service selection to support a flexible binding with the partners? services. This paper also describes how to execute and monitor the composite service.
{"title":"A BPEL4WS-based Composite Service Modeling Solution in Manufacturing Grid","authors":"L. Duan, Shijun Liu, Changhe Tu, Xiangxu Meng","doi":"10.1109/APSCC.2006.5","DOIUrl":"https://doi.org/10.1109/APSCC.2006.5","url":null,"abstract":"In Manufacturing Grid, a lot of applications and resources in manufacturing enterprises are encapsulated as web services and a cooperative work environment is provided. Applying web service composition and workflow technologies, services are integrated into a composite service to represent a cooperative business process. Therefore the enterprise cooperation can be implemented by executing and monitoring the composite service. According to the characteristics of Manufacturing, this paper presents a composite service modeling solution based on BPEL4WS and discusses how this solution support BPEL4WS during the whole modeling process. The solution includes dynamic service discovery and service selection to support a flexible binding with the partners? services. This paper also describes how to execute and monitor the composite service.","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"44 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113968565","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}
Particle Swarm Optimization (PSO) algorithm and Fuzzy Neural Network (FNN) system has been widely used to solve complex decision making problems in practice. However, both of them more or less suffer from the slow convergence and occasionally involve in a local optimal solution. To overcome these drawbacks of PSO and FNN, in this study a modified particle swarm optimization algorithm (MPSO) is developed and then combined with neural network to optimize the network weight training process. Furthermore, the new MPSO-FNN model has been applied to financial risk early warning problem, and the results indicate that the predictive accuracies obtained from MPSO-FNN are much higher than the ones obtained from original FNN system. To make this clearer, an illustrative example is also demonstrated in this study. It seems that the proposed new comprehensive evolution algorithm may be an efficient forecasting system in financial time series analysis.
{"title":"A Modified Particle Swarm Algorithm Combined with Fuzzy Neural Network with Application to Financial Risk Early Warning","authors":"F. Huang, Rong-jun Li, Liu Liu, Ruiyou Li","doi":"10.1109/APSCC.2006.12","DOIUrl":"https://doi.org/10.1109/APSCC.2006.12","url":null,"abstract":"Particle Swarm Optimization (PSO) algorithm and Fuzzy Neural Network (FNN) system has been widely used to solve complex decision making problems in practice. However, both of them more or less suffer from the slow convergence and occasionally involve in a local optimal solution. To overcome these drawbacks of PSO and FNN, in this study a modified particle swarm optimization algorithm (MPSO) is developed and then combined with neural network to optimize the network weight training process. Furthermore, the new MPSO-FNN model has been applied to financial risk early warning problem, and the results indicate that the predictive accuracies obtained from MPSO-FNN are much higher than the ones obtained from original FNN system. To make this clearer, an illustrative example is also demonstrated in this study. It seems that the proposed new comprehensive evolution algorithm may be an efficient forecasting system in financial time series analysis.","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121176721","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}
On the basis of analyzing the shortcomings of the traditional performance evaluation, the evaluation-index system of enterprises performance based on supply chain management was built. In order to be able to evaluate objectively and scientifically enterprises performance, entropy appraisal model was set up, which was an objective empower approach. Then it was utilized to evaluate the performance of five listed electronic enterprises according to the evaluation results. Finally, stronger guidance was given in conclusions.
{"title":"Entropy Evaluation Model of Enterprises Performance Based on Supply Chain Management Theory","authors":"Jun Xu, Qing-An Zeng","doi":"10.1109/APSCC.2006.50","DOIUrl":"https://doi.org/10.1109/APSCC.2006.50","url":null,"abstract":"On the basis of analyzing the shortcomings of the traditional performance evaluation, the evaluation-index system of enterprises performance based on supply chain management was built. In order to be able to evaluate objectively and scientifically enterprises performance, entropy appraisal model was set up, which was an objective empower approach. Then it was utilized to evaluate the performance of five listed electronic enterprises according to the evaluation results. Finally, stronger guidance was given in conclusions.","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128718492","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}
According to the principle of balanced score card method (BSC), this paper constructs the evaluating index system of the supply chain on four aspects, financial value, business process, client service and study-innovation. On the basis of illustrating the DEA and the AHP methods, this paper combines them in progress and constructs the DEA/AHP model for evaluating the supply chain performance. The principle of DEA/AHP model is to use DEA method to calculate the relative efficiency rate of the decision-making units (DMU), with which construct the judging matrices of AHP, and then get the characteristic vector of judging matrices and rank the DMUs at last. This model overcomes the limitations that DEA can't rank all the DMUs and AHP is highly subjective, so it can evaluate the supply chain performance more scientific and more reasonable
{"title":"Research on Supply Chain Performance Evaluation Based on DEA/AHP Model","authors":"Jing-yuan Guo, Jia Liu, L. Qiu","doi":"10.1109/APSCC.2006.88","DOIUrl":"https://doi.org/10.1109/APSCC.2006.88","url":null,"abstract":"According to the principle of balanced score card method (BSC), this paper constructs the evaluating index system of the supply chain on four aspects, financial value, business process, client service and study-innovation. On the basis of illustrating the DEA and the AHP methods, this paper combines them in progress and constructs the DEA/AHP model for evaluating the supply chain performance. The principle of DEA/AHP model is to use DEA method to calculate the relative efficiency rate of the decision-making units (DMU), with which construct the judging matrices of AHP, and then get the characteristic vector of judging matrices and rank the DMUs at last. This model overcomes the limitations that DEA can't rank all the DMUs and AHP is highly subjective, so it can evaluate the supply chain performance more scientific and more reasonable","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121980028","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：