{"title":"Software Keyphrase Extraction with Domain-Specific Features","authors":"Oscar Karnalim","doi":"10.1109/ACOMP.2016.016","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.016","url":null,"abstract":"Despite the fact that keyphrase is widely used as a brief summary to represent documents, most keyphrase extraction is only focused on arbitrary text. However, many document types have specific behavior which require particular pre-processing in order to extract keyphrases. In software domain, keyphrases can only be extracted by utilizing reverse-engineering approach and applying several conversion rules. This paper proposes a mechanism to extract software keyphrases with domain-specific features. For our case study, our proposed method is applied to Java Archive, a distributional form of Java binaries. Besides pre-processing and conversion rules, our method also utilizes the combination of supervised and unsupervised keyphrase extraction approach to exploit the benefits of both approaches. Furthermore, in order to extract keyphrase pattern more accurately, software-related features are also incorporated besides standard keyphrase extraction features. These features are software structure, software-related natural language text, and software term association. Based on overall evaluation, our proposed method yields moderate R-precision. Thus, our approach is quite considerable to be applied for extracting software keyphrase.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132445520","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}
T. Phan, V. Nguyen, M. J. Hossain, A. To, H. T. Tran
{"title":"An Unified Iterative Algorithm for Load Flow Analysis of Power System Including Wind Farms","authors":"T. Phan, V. Nguyen, M. J. Hossain, A. To, H. T. Tran","doi":"10.1109/ACOMP.2016.024","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.024","url":null,"abstract":"This paper presents a new power flow (PF) technique for distribution system including wind farms (WFs) with asynchronous generators (AGs) represented by RXv bus model using an unified iterative algorithm. With RXv bus model, AGs are supposed as RX load buses with their equivalent impedances and v is wind speed. In addition, it is assumed that wind speed is a known variable which combined with the AGs' impedance to become the RXv model. The paper proposes a highly efficient and accurate method which combines the slip variables corresponding to the AGs with the nodal voltage magnitudes and angles of the network in a single frame-of-reference for a unified iterative solution. The method retains Newton Raphson (NR) quadratic convergence characteristics. By considering characteristics of AGs, the RXv bus model is more suitable. To validate the proposed model, the modified IEEE 30-bus system with two connected WFs is used to represent wind generators in power flow analysis. Calculated results of load flow analysis program show that the proposed model and the unified calculating method are feasible and accurate.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124735966","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 Bitwise-Based Indexing to Web Service Composition and Verification","authors":"Huỳnh Tấn Khải, B. H. Thắng, Q. T. Tho","doi":"10.1109/ACOMP.2016.017","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.017","url":null,"abstract":"Nowadays, advent of web service is considered as a technology bringing a revolution operations of online B2B (Business to Business) and B2C (Business to Customer) applications. However, the user requirement for web services is diverse and complex. In most cases, a simple web service cannot meet the user requirement. Therefore, the composition of web services (or Web Service Composition - WSC) is set out as an indispensable. When the number of web services in repository increase, the computational cost of composition problem also increases significantly. The performance of composition process depends on the way we organize web services in the repository. Indexing is a technique of data mining field which can help us organize the web services and retrieve them optimally. In this paper, we proposed a bitwise-based indexing mechanism for fast location of suitable web services. This approach is implemented and proved its effectiveness over the real datasets with thousands of web services. As a result, significant improvement of performance has been made, especially as compared to other existing works in the same field.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126806564","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":"Routing Optimization Model in Multihop Wireless Access Networks for Disaster Recovery","authors":"C. Phung, Q. Minh, M. Toulouse","doi":"10.1109/ACOMP.2016.028","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.028","url":null,"abstract":"On-the-fly establishment of multihop wireless access networks (OEMAN) is a new wireless communication approach to quickly establish temporary Internet connectivity in a disaster region. OEMAN creates virtual access points on mobile devices of disaster victims to reach still-alive access points of the Internet so that rescuers can be informed about their status and position. The simple routing strategy in OEMAN is based on a tree like topology raising some traffic load balancing issues at nodes closed to the root. In this paper, we propose a linear program for overload-aware routing. Moreover, we consider wireless interference and integrate it into our routing optimization model. Our evaluations implemented in Matlab show that the overload-aware routing improves load balancing among available virtual access points in OEMAN. By avoiding nodes with heavy load in the network, our solution improves network throughput compared to overload-unaware routing.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123489965","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":"Image Super-Resolution Using Image Registration and Neural Network Based Interpolation","authors":"Nguyen The Man, Truong Quang Vinh","doi":"10.1109/ACOMP.2016.032","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.032","url":null,"abstract":"This paper presents a new algorithm for image super resolution using image registration and neural network. Our method breaks out the limit of registration-based methods which uses the bicubic interpolation to estimate the missing pixel values. Since bicubic method cannot interpolate these pixels exactly, we need more low-resolution frames at input to increase the super-resolution performance. Our algorithm uses a multi-layer perceptron to get better interpolation. This solution leads to higher quality at high-resolution output image without increasing the input number. Experimental results show that our method improves the performance of image super resolution.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"60 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114017871","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}
Huu Vu Lam Cao, T. Phan, Q. Minh, Thanh Luan Hong, M. S. Q. Truong
{"title":"Processing All k-Nearest Neighbor Query on Large Multidimensional Data","authors":"Huu Vu Lam Cao, T. Phan, Q. Minh, Thanh Luan Hong, M. S. Q. Truong","doi":"10.1109/ACOMP.2016.012","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.012","url":null,"abstract":"All k nearest neighbor (AkNN) query processing is a data processing problem which is important in many fields such as computer architecture, searching user information by coordinates, and city planning. Nowadays amount of data tends to grow in size and becomes huge. It is a major challenge that we need to face. Therefore, many traditional methods are no longer effective when dealing with the problem. Meanwhile, the method that processes distributed and parallel AkNN problem on MapReduce model and uses equal-cell-dividing technique is effective on multidimensional large dataset. However, when data is not equally distributed, the method becomes inefficient and even cannot be implemented. In this paper, we improve this method by applying a new cell-dividing technique. Instead of dividing the target space into cells which have the same size, we aim to divide it to cells in which the number of points are balanced, and there is not a cell that contains a large number of points. We also conduct experiments and compare the results produced by the old method and our method. Experimental results show that our method is more efficient and more stable.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115970663","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":"Solving the User-Role Reachability Problem in ARBAC with Role Hierarchy","authors":"A. Truong, Dai Hai Ton That","doi":"10.1109/ACOMP.2016.011","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.011","url":null,"abstract":"Access Control is becoming increasingly important for today's ubiquitous systems since it provides mechanism to prevent sensitive resources in the systems against unauthorized users. In access control models, the administration of access control policies is an important task that raises a crucial analysis problem: if a set of administrators can give a user an unauthorized access permission. We consider the analysis problem in the context of the Administrative Role-Based Access Control (ARBAC), the most widespread administrative model. One of the main assumptions of current analysis techniques is that the role hierarchy is constant and thus can be abstracted away that results in the bad scalability of analysis techniques. In this paper, we introduce three reductions to enable an available analysis technique, namely ASASPXL, to handle the user-role reachability problem with the presence of role hierarchy. An extensive experimentation reports the superiority of our reductions in comparison with the approach used in the literature.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122169404","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}
Tin Quang Bui, L. Pham, H. M. Nguyen, V. Nguyen, T. Le, Trang Hoang
{"title":"An Effective Architecture of Memory Built-In Self-Test for Wide Range of SRAM","authors":"Tin Quang Bui, L. Pham, H. M. Nguyen, V. Nguyen, T. Le, Trang Hoang","doi":"10.1109/ACOMP.2016.026","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.026","url":null,"abstract":"Together with highly increasing integration on one chip currently, usage of memories, mainly Static Random Access Memory (SRAM), applied to wide range of functions is inevitable. However, memory faults are greatly concerned due to purpose of achieving high yield. As a result, a memory built-in self-test (MBIST) has become essential in any system obviously. As regards MBIST, while increasing criteria associating with area, frequency as well as various test algorithms has posed, current approaches have not adapted both such silicon requirements and ability of covering errors with complex algorithms yet. In this work, an effective architecture of MBIST for SRAM type with different configurations is proposed for not only ensuring high ability of detecting memory faults supported by the most popular algorithms namely MARCH C-and TLAPNPSF but also satisfy strict silicon criteria. Indeed, achieving great performance based on necessary experiments on 130nm technology with Application Specific Integrated Circuit (ASIC) design flow has confirmed strong competition to current designs.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126105667","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":"On Business Process Redesign and Configuration: Leveraging Data Mining Classification & Outliers and Artifact-Centric Process Modeling","authors":"Thai-Minh Truong, Lam-Son Lê","doi":"10.1109/ACOMP.2016.018","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.018","url":null,"abstract":"In today's e-business, data increasingly capture many behavioral aspects of our daily life, e.g. operational patterns in production lines, human shopping habit, medical treatment, supply-chain management. We formally define the behavior of tasks (of the business process in question) in connection with conceptually described business artifacts that are manipulated by the tasks. We relate this representation to data mining and nonfunctional requirements to better define the context for process redesign (i.e, design-time changes) and process configuration (i.e, run-time changes). Furthermore, we propose algorithms for business-process redesign and configuration based on the above context. Our research is positioned in the field of business process flexibility – a term coined by van der Aalst [1] in his thorough literature survey on business processes. We validate our framework using real-life data provided by our industrial partners.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128485740","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}
T. Phan, V. Nguyen, M. J. Hossain, A. To, H. T. Tran, T. N. Phan
{"title":"Transient Responses of the Doubly-Fed Induction Generator Wind Turbine under Grid Fault Conditions","authors":"T. Phan, V. Nguyen, M. J. Hossain, A. To, H. T. Tran, T. N. Phan","doi":"10.1109/ACOMP.2016.023","DOIUrl":"https://doi.org/10.1109/ACOMP.2016.023","url":null,"abstract":"Doubly-fed induction generator (DFIG) wind turbine (WT) is an integrated part of distributed generation system. The use of DFIG in wind farms is growing rapidly because of its advantages in decoupled active and reactive power control. However, one of the main disadvantages of DFIG is that it is very sensitive to grid faults. To analysis dynamic behaviors of DFIG during grid faults, a model including wind wheel, wind speed, drive train, generator, and converters has been proposed. This paper examines the use of distribution static compensator (D-STATCOM) as a dynamic voltage restorer at the point of common coupling (PCC) to improve the grid fault ride-through (FRT) capability and thereby protecting system stability during disturbances. The simulation results illustrate the transient responses of DFIG when a sudden short circuit at PCC is introduced. Besides, the paper also shows detailed comparisons of the transient behaviors between DFIG and conventional induction generator wind turbine under grid fault conditions.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"4 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117012220","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}