VNU Journal of Science: Computer Science and Communication Engineering最新文献

{"title":"A Hybrid Method Based on Genetic Algorithm and Ant Colony System for Traffic Routing Optimization","authors":"Thi-Hau Nguyen, Trung-Tuan Do, Duc-Nhan Nguyen, Dang-Nhac Lu, Ha-Nam Nguyen","doi":"10.25073/2588-1086/VNUCSCE.236","DOIUrl":"https://doi.org/10.25073/2588-1086/VNUCSCE.236","url":null,"abstract":"TThis paper presents a hybrid method that combines the genetic algorithm (GA) and the ant colony system algorithm (ACS), namely GACS, to solve the traffic routing problem. In the proposed framework, we use the genetic algorithm to optimize the ACS parameters in order to attain the best trips and travelling time through several novel functions to help ants to update the global and local pheromones. The GACS framework is implemented using the VANETsim package and the real city maps from the open street map project. The experimental results show that our framework achieves a considerably higher performance than A-Star and the classical ACS algorithms in terms of the length of the global best path and the time for trips. Moreover, the GACS framework is also efficient in solving the congestion problem by online monitoring the conditions of traffic light systems. \u0000KeywordsTraffic routing; Ant colony system; Genetic algorithm; VANET simulator. \u0000References \u0000[1] M. Dorigo, Ant colony optimization, Scholarpedia 2(3) (2007) 1461. https://doi.org/10/4249/scholarpedia.1461.[2] M.V. Dorigo, Maniezzo, A. Colorni, Ant system: Optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) 26(1) (1996) 29-41.[3] M. Dorigo, L.M. Gambardella, Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Transactions on evolutionary computation 1(1) (1997) 53-66.[4] M. Dorigo, T. St¨utzle, Ant Colony Optimization. MIT Press, Cambridge, MA, 2004.[5] D. Favaretto, E. Moretti, P. Pellegrini, On the explorative behavior of MAX-MIN Ant. System, In: St¨utzle T, Birattari M, Hoos HH (eds) Engineering Stochastic Local Search Algorithms, Designing, Implementing and Analyzing Effective Heuristics. SLS 2009, LNCS, Springer, Heidelberg, Germany 5752 (2009) 115-119.[6] F. Lobo, C.F. Lima, Z. Michalewicz (eds), Parameter Setting in Evolutionary Algorithms, Springer, Berlin, Germany, 2007.[7] T. Stützle, Manuel López-Ibáñez, Paola Pellegrini, Michael Maur, Marco Montes de Oca, Mauro Birattari, Marco Dorigo, Parameter adaptation in ant colony optimization in Autonomous search, Springer, 2011, pp. 191-215.[8] Z. Cai, H. Huang, Ant colony optimization algorithm based on adaptive weight and volatility parameters in Intelligent Information Technology Application, 2008. IITA'08, Second International Symposium IEEE, 2008.[9] J. Liu, Shenghua Xu, Fuhao Zhang, Liang Wang, A hybrid genetic-ant colony optimization algorithm for the optimal path selection, Intelligent Automation & Soft Computing, 2016, pp. 1-8.[10] D.Gaertner K.L. Clark, On Optimal Parameters for Ant Colony Optimization Algorithms, In IC-AI, 2005.[11] X.Wei, Parameters Analysis for Basic Ant Colony Optimization Algorithm in TSP, Reason 7(4) (2014) 159-170.[12] J.H. Holland, Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control and artificial intelligence, U Michigan Press, 1975.[13] K.D.E","PeriodicalId":416488,"journal":{"name":"VNU Journal of Science: Computer Science and Communication Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121838472","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":"New Feature Selection Method for Multi-channel EEG Epileptic Spike Detection System","authors":"N. Dao, Thanh Trung LE, V. Nguyen, N. Linh-Trung, Ha Vu Le","doi":"10.25073/2588-1086/vnucsce.230","DOIUrl":"https://doi.org/10.25073/2588-1086/vnucsce.230","url":null,"abstract":"Epilepsy is one of the most common and severe brain disorders. Electroencephalogram (EEG) is widely used in epilepsy diagnosis and treatment, with it the epileptic spikes can be observed. Tensor decomposition-based feature extraction has been proposed to facilitate automatic detection of EEG epileptic spikes. However, tensor decomposition may still result in a large number of features which are considered negligible in determining expected output performance. We proposed a new feature selection method that combines the Fisher score and p-value feature selection methods to rank the features by using the longest common sequences (LCS) to separate epileptic and non-epileptic spikes. The proposed method significantly outperformed several state-of-the-art feature selection methods.","PeriodicalId":416488,"journal":{"name":"VNU Journal of Science: Computer Science and Communication Engineering","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115440788","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 Survey of High-Efficiency Context-Addaptive Binary Arithmetic Coding Hardware Implementations in High-Efficiency Video Coding Standard","authors":"Dinh-Lam Tran, V. Pham, Hung K. Nguyen, Xuan-Tu Tran","doi":"10.25073/2588-1086/vnucsce.233","DOIUrl":"https://doi.org/10.25073/2588-1086/vnucsce.233","url":null,"abstract":"High-Efficiency Video Coding (HEVC), also known as H.265 and MPEG-H Part 2, is the newest video coding standard developed to address the increasing demand for higher resolutions and frame rates. In comparison to its predecessor H.264/AVC, HEVC achieved almost double of compression performance that is capable to process high quality video sequences (UHD 4K, 8K; high frame rates) in a wide range of applications. Context-Adaptive Baniray Arithmetic Coding (CABAC) is the only entropy coding method in HEVC, whose principal algorithm is inherited from its predecessor. However, several aspects of the method that exploits it in HEVC are different, thus HEVC CABAC supports better coding efficiency. Effectively, pipeline and parallelism in CABAC hardware architectures are prospective methods in the implementation of high performance CABAC designs. However, high data dependence and serial nature of bin-to-bin processing in CABAC algorithm pose many challenges for hardware designers. This paper provides an overview of CABAC hardware implementations for HEVC targeting high quality, low power video applications, addresses challenges of exploiting it in different application scenarios and then recommends several predictive research trends in the future.","PeriodicalId":416488,"journal":{"name":"VNU Journal of Science: Computer Science and Communication Engineering","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132055335","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":"Adaptive Large Neighborhood Search Enhances Global Network Alignment","authors":"Vu Thi Ngoc Anh, Nguyen Trong Dong, Nguyen Vũ Hoàng Vuong, Dang Thanh Hai, Do Duc Dong","doi":"10.25073/2588-1086/VNUCSCE.228","DOIUrl":"https://doi.org/10.25073/2588-1086/VNUCSCE.228","url":null,"abstract":"Aligning protein-protein interaction networks from different species is a useful mechanism for figuring out orthologous proteins, predicting/verifying protein unknown functions or constructing evolutionary relationships. The network alignment problem is proved to be NP-hard, requiring exponential-time algorithms, which is not feasible for the fast growth of biological data. In this paper, we present a novel protein-protein interaction global network alignment algorithm, which is enhanced with an extended large neighborhood search heuristics. Evaluated on benchmark datasets of yeast, fly, human and worm, the proposed algorithm outperforms state-of-the-art. Furthermore, the complexity of ours is polynomial, thus being scalable to large biological networks in practice. \u0000Keywords \u0000Heuristic, Protein-protein interaction networks, network alignment, neighborhood search \u0000References \u0000[1] R.L. Finley, R. Brent, Interaction mating reveals binary and ternary connections between drosophila cell cycle regulators. Proc. Natl Acad. Sci. USA. 91 (1994) 12980-12984.[2] R. Aebersold, M. Mann, Mass spectrometry-based proteomics, Nature. 422 (2003) 198-207.[3] C.S. Goh, F.R. Cohen, Co-evolutionary analysis reveals insights into protein-protein interactions, J. Mol. Biol. 324 (2002) 177-192.[4] J.D. Han et al, Evidence for dynamically organized modularity in the yeast proteinprotein interaction network, Nature. 430 (2004) 88-93.[5] G.D. Bader, C.W. Hogue, Analyzing yeast protein-protein interaction data obtained from different sources, Nat. Biotechnol. 20 (2002) 991-997.[6] H.B. Hunter et al, Evolutionary rate in the protein interaction network, Science. 296 (2002) 750-752.[7] J. Dutkowski, J. Tiuryn,J, Identification of functional modules from conserved ancestral protein-protein interactions, Bioinformatics. 23 (2007) i149-i158.[8] B.P. Kelley et al, Conserved pathways within bacteria and yeast as revealed by global protein network alignment, Proc. Natl Acad. Sci. USA. 100 (2003) 11394-11399.[9] O. Kuchaiev, N. Przˇ ulj, Integrative network alignment reveals large regions of global network similarity in yeast and human, Bioinformatics. 27 (2011) 1390-1396.[10] M. Remm et al, Automatic clustering of orthologs and in-paralogs from pairwise species comparisons, J. Mol. Biol. 314 (2001) 1041-1052. [11] L. Chindelevitch et al, Local optimization for global alignment of protein interaction networks, In: Pacific Symposium on Biocomputing, Hawaii, USA, 2010, pp. 123-132.[12] E. hmet, Aladağ, Cesim Erten, SPINAL: scalable protein interaction network alignment, Bioinformatics. Volume 29(7) (2013) 917-924. https://doi.org/10.1093/bioinformatics/btt071.[13] B.P. Kelley et al, Pathblast: a tool for alignment of protein interaction networks, Nucleic Acids Res. 32 (2004) 83-88.[14] R. Sharan et al, Conserved patterns of protein interaction in multiple species, Proc. Natl Acad. Sci. USA. 102 (2005) 1974-1979.[15] M. Koyuturk et al, Pairwise alignment of protein interaction networks","PeriodicalId":416488,"journal":{"name":"VNU Journal of Science: Computer Science and Communication Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125518187","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 Adaptive and High Coding Rate Soft Error Correction Method in Network-on-Chips","authors":"K. Dang, Xuan-Tu Tran","doi":"10.25073/2588-1086/VNUCSCE.218","DOIUrl":"https://doi.org/10.25073/2588-1086/VNUCSCE.218","url":null,"abstract":"The soft error rates per single-bit due to alpha particles in sub-micron technology is expectedly reducedas the feature size is shrinking. On the other hand, the complexity and density of integrated systems are accelerating which demand ecient soft error protection mechanisms, especially for on-chip communication. Using soft error protection method has to satisfy tight requirements for the area and energy consumption, therefore a low complexity and low redundancy coding method is necessary. In this work, we propose a method to enhance Parity Product Code (PPC) and provide adaptation methods for this code. First, PPC is improved as forward error correcting using transposable retransmissions. Then, to adapt with dierent error rates, an augmented algorithm for configuring PPC is introduced. The evaluation results show that the proposed mechanism has coding rates similar to Parity check’s and outperforms the original PPC.Keywords \u0000Error Correction Code, Fault-Tolerance, Network-on-Chip. \u0000References \u0000[1] R. Baumann, Radiation-induced soft errors in advanced semiconductor technologies, IEEETransactions on Device and materials reliability. 5-3 (2005) 305–316. https://doi.org/10.1109/tdmr.2005.853449.[2] N. Seifert, B. Gill, K. Foley, P. Relangi, Multi-cell upset probabilities of 45nm high-k + metal gateSRAM devices in terrestrial and space environments, in: IEEE International Reliability Physics Symposium 2008, IEEE, AZ, USA, 2008, pp. 181–186.[3] S. Lee, I. Kim, S. Ha, C.-s. Yu, J. Noh, S. Pae, J. Park, Radiation-induced soft error rate analyses for 14 nmFinFET SRAM devices, in: 2015 IEEE International Reliability Physics Symposium (IRPS), IEEE, CA, USA, 2015, pp. 4B–1.[4] R. Hamming, Error detecting and error correcting codes, Bell Labs Tech. J. 29-2 (1950) 147–160. https://www.doi.org/10.1002/j.1538-7305.1950.tb00463.x.[5] M. Hsiao, A class of optimal minimum odd-weight-column SEC-DED codes, IBMJ. Res. Dev. 14-4 (1970) 395–401. https://www.doi.org/10.1147/rd.144.0395.[6] S. Mittal, M. Inukonda, A survey of techniques for improving error-resilience of dram, Journal ofSystems Architecture. 91-1 (2018) 11–40. https://www.doi.org/10.1016/j.sysarc.2018.09.004.[7] D. Bertozzi, et al., Error control schemes for on-chip communication links: the energy-reliabilitytradeo, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 24-6 (2005) 818–831. https://doi.org/10.1109/tcad.2005. 847907.[8] F. Chiaraluce, R. Garello, Extended Hamming product codes analytical performance evaluation for low errorrate applications, IEEE Transactions on Wireless Communications. 3-6 (2004) 2353–2361. https://doi. org/10.1109/twc.2004.837405.[9] R. Pyndiah, Near-optimum decoding of product codes: Block turbo codes, IEEE Transactions onCommunications. 46-8 (1998) 1003–1010. https://www.doi.org/10.1109/26.705396.[10] N. Magen, A. Kolodny, U. Weiser, N. Shamir, Interconnect-power dissipation in a microprocessor,in: Proceedings of the 2004 international workshop","PeriodicalId":416488,"journal":{"name":"VNU Journal of Science: Computer Science and Communication Engineering","volume":"166 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120912017","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":"Cooperative Caching in Two-Layer Hierarchical Cache-aided Systems","authors":"Van Xiem Hoang, T. H. Duong, Anh Vu Trinh, Xuan-Thang Vu","doi":"10.25073/2588-1086/VNUCSCE.222","DOIUrl":"https://doi.org/10.25073/2588-1086/VNUCSCE.222","url":null,"abstract":"Caching has received much attention as a promising technique to overcome high data rate and stringent latency requirements in the future wireless networks. The premise of caching technique is to prefetch most popular contents closer to end users in local cache of edge nodes, e.g., base station (BS). When a user requests a content that is available in the cache, it can be served directly without being sent from the core network. In this paper, we investigate the performance of hierarchical caching systems, in which both BS and end users are equipped with a storage memory. In particular, we propose a novel cooperative caching scheme that jointly optimizes the content placement at the BS’s and users’ caches. The proposed caching scheme is analytically shown to achieve a larger global caching gain than the reference in both uncoded – and coded caching strategies. Finally, numerical results are presented to demonstrate the effectiveness of our proposed caching algorithm. \u0000Keywords \u0000Hierarchical caching system, cooperative caching, caching gain, uncoded caching, coded caching \u0000 References \u0000[1] D. Liu, B. Chen, C. Yang, A.F. Molisch, Caching at the Wireless Edge: Design Aspects, Challenges, and Future Directions, IEEE Communications Magazine 54 (2016) 22-28. https://doi.org/10.1109/MCOM.2016.7565183.[2] T.X. Vu, S. Chatzinotas, B. Ottersten, Edge-Caching Wireless Networks: Performance Analysis and Optimization, IEEE Transactions on Wireless Communications 17 (2018) 2827-2839. https://doi.org/10.1109/TWC.2018.2803816.[3] M.A. Maddah-Ali, U. Niesen, Fundamental Limits of Caching, IEEE Transactions on Information Theory 60 (2014) 2856-2867. https://doi.org/10.1109/TIT.2014.2306938.[4] M.A. Maddah-Ali, U. Niesen, Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff,  IEEE/ACM Transactions on Networking 23 (2015) 1029-1040. https://doi.org/10.1109/TNET.2014.2317316.[5] U. Niesen, M.A. Maddah-Ali, Coded Caching with Nonuniform Demands, IEEE Transactions on Information Theory 63 (2017) 1146-1158. https://doi.org/10.1109/TIT.2016.2639522.[6] Q. Yu, M.A. Maddah-Ali, A.S. Avestimehr, The exact rate-memory tradeoff for caching with uncoded prefetching, IEEE Transactions on Information Theory 64 (2018) 1281-1296. https://doi.org/10.1109/TIT.2017.2785237.[7] S.P. Shariatpanahi, H. Shah-Mansouri, B.H. Khalaj, Caching gain in interference-limited wireless networks, IET Communications 9 (2015) 1269-1277. https://doi.org/10.1049/iet-com.2014.0955.[8] N. Naderializadeh, M.A. Maddah-Ali, A.S. Avestimehr, Fundamental limits of cache-aided interference management, IEEE Transactions on Information Theory 63 (2017) 3092-3107. https://doi.org/10.1109/TIT.2017.2669942.[9] J. Hachem, U. Niesen, S. Diggavi, Energy-Efficiency Gains of Caching for Interference Channels, IEEE Communications Letters 22 (2018) 1434-1437. https://doi.org/10.1109/LCOMM.2018.2822694.[10] M.A. Maddah-Ali, U. Niesen, Cache-aided interference channels, IEEE International Symposium on Infor","PeriodicalId":416488,"journal":{"name":"VNU Journal of Science: Computer Science and Communication Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116733999","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":"Learning and transferring motion style using Sparse PCA","authors":"K. Do, Nguyen Xuan Thanh, Hongchuan Yu","doi":"10.25073/2588-1086/vnucsce.206","DOIUrl":"https://doi.org/10.25073/2588-1086/vnucsce.206","url":null,"abstract":"Motion style transfer is a primary problem in computer animation, allowing us to convert the motion of an actor to that of another one. Myriads approaches have been developed to perform this task, however, the majority of them are data-driven, which require a large dataset and a time-consuming period for training a model in order to achieve good results. In contrast, we propose a novel method applied successfully for this task in a small dataset. This exploits Sparse PCA to decompose original motions into smaller components which are learned with particular constraints. The synthesized results are highly precise and smooth motions with its emotion as shown in our experiments.","PeriodicalId":416488,"journal":{"name":"VNU Journal of Science: Computer Science and Communication Engineering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114652941","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":"Simulation-based Short-term Model Predictive Control for HVAC Systems of Residential Houses","authors":"H. Nguyen, Yasuo Tan","doi":"10.25073/2588-1086/vnucsce.220","DOIUrl":"https://doi.org/10.25073/2588-1086/vnucsce.220","url":null,"abstract":"In this paper, we propose a simple model predictive control (MPC) scheme for Heating, ventilation, and air conditioning (HVAC) systems in residential houses. Our control scheme utilizes fitted thermal simulation to achieve precise prediction of room temperature and energy consumption in each prediction period. The set points of HVAC systems are selected to minimize the amount of energy consumption while maintaining room temperature within a desirable range to satisfy user comfort. Our control system is simple enough to implement in residential houses and is more efficient comparing with rule-based control methods.","PeriodicalId":416488,"journal":{"name":"VNU Journal of Science: Computer Science and Communication Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130525845","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 Locally Strongest Assumption Generation Method for Component-Based Software Verification","authors":"Hoang-Viet Tran, Pham Ngoc Hung","doi":"10.25073/2588-1086/vnucsce.209","DOIUrl":"https://doi.org/10.25073/2588-1086/vnucsce.209","url":null,"abstract":"Assume-guarantee reasoning, a well-known approach in component-based software (CBS) verification, is infact a language containment problem whose computational cost depends on the sizes of languages of the softwarecomponents under checking and the assumption to be generated. Therefore, the smaller language assumptions,the more computational cost we can reduce in software verification. Moreover, strong assumptions are moreimportant in CBS verification in the context of software evolution because they can be reused many times in theverification process. For this reason, this paper presents a method for generating locally strongest assumptions withlocally smallest languages during CBS verification. The key idea of this method is to create a variant techniquefor answering membership queries of the Teacher when responding to the Learner in the L–based assumptionlearning process. This variant technique is then integrated into an algorithm in order to generate locally strongestassumptions. These assumptions will effectively reduce the computational cost when verifying CBS, especiallyfor large–scale and evolving ones. The correctness proof, experimental results, and some discussions about theproposed method are also presented.Keywords: Assume-guarantee reasoning, Model checking, Component-based software verification, Locallystrongest assumptions, Locally smallest language assumptions.","PeriodicalId":416488,"journal":{"name":"VNU Journal of Science: Computer Science and Communication Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131385524","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":"Coreference Resolution in Vietnamese Electronic Medical Records","authors":"Hung Nguyen, T. Cao","doi":"10.25073/2588-1086/VNUCSCE.210","DOIUrl":"https://doi.org/10.25073/2588-1086/VNUCSCE.210","url":null,"abstract":"Electronic medical records (EMR) have emerged as an important source of data for research in medicine andinformation technology, as they contain much of valuable human medical knowledge in healthcare and patienttreatment. This paper tackles the problem of coreference resolution in Vietnamese EMRs. Unlike in English ones,in Vietnamese clinical texts, verbs are often used to describe disease symptoms. So we first define rules to annotateverbs as mentions and consider coreference between verbs and other noun or adjective mentions possible. Thenwe propose a support vector machine classifier on bag-of-words vector representation of mentions that takes intoaccount the special characteristics of Vietnamese language to resolve their coreference. The achieved F1 scoreon our dataset of real Vietnamese EMRs provided by a hospital in Ho Chi Minh city is 91.4%. To the best of ourknowledge, this is the first research work in coreference resolution on Vietnamese clinical texts.Keywords: Clinical text, support vector machine, bag-of-words vector, lexical similarity, unrestricted coreference","PeriodicalId":416488,"journal":{"name":"VNU Journal of Science: Computer Science and Communication Engineering","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123369649","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}