The-Nhan Ho, N. Marilleau, L. Philippe, H. Nguyen, Jean-Daniel Zucker
{"title":"A grid-based multistage algorithm for parameter simulation-optimization of complex system","authors":"The-Nhan Ho, N. Marilleau, L. Philippe, H. Nguyen, Jean-Daniel Zucker","doi":"10.1109/RIVF.2013.6719897","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719897","url":null,"abstract":"Evolutionary algorithms (EA) are recently used to explore the parameter space of complex system simulations as the methodology sees models as black boxes. The first advantage is that these algorithms become independent from what kind of simulation has to be explored. The task is finding the parameter settings to optimize a given objective function. This optimization process evaluates the performance of possible parameter sets and converges towards the best alternatives. The evaluation needs to launch hundreds of thousands of simulation runs. This procedure copes with the combinatorial explosion of computation time and requires considerable computational resources. Furthermore, the original algorithms cannot guarantee the exploration in the search space uniformly and equally because the search is probabilistic. This work elaborates a multistage optimization process in a grid-enabled modeling and simulation platform. We propose a hybrid integration of various continuous optimization algorithms and optimize them for running with different Distributed Resource Management (DRM) systems. The performance of algorithm is compared to original algorithm in the optimization of Ants model.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114150297","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":"Improved residual data coding for high efficiency video coding lossless extension","authors":"Jung-Ah Choi, Yo-Sung Ho","doi":"10.1109/RIVF.2013.6719859","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719859","url":null,"abstract":"This paper describes an extension of the new high efficiency video coding (HEVC) standard for supporting lossless video coding. Since HEVC is originally designed for lossy video compression, it cannot provide outstanding performances in lossless video coding. In this paper, we propose new residual data coding methods based on the statistical characteristics of lossless intra coding. The proposed method consists of improved level coding and the binarization table selection with the weighted sum of previously encoded level values. Experimental results show that the proposed method achieves approximately 2.41% bit saving and reaches up to 5.34% bit saving, compared to HEVC lossless intra coding.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125172881","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 model-view/controller approach to support visualization and online data analysis of Agent-based simulations","authors":"A. Grignard, A. Drogoul, Jean-Daniel Zucker","doi":"10.1109/RIVF.2013.6719899","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719899","url":null,"abstract":"Agent-based Modeling is playing a key role in an increasing number of approaches addressing modeling complex systems. Historically, such models were focused on describing the system modelled dynamics but not the interaction or visualization of the model itself. The new requirements for high-level realistic visualization and online analysis tools of ABM simulations raise key issues that are yet unsolved: how to visualize interaction between entities and more generally abstracting the key information from the system dynamics. Instead of ad-hoc existing approaches that require reification in the model, we propose an approach dedicated to visualize and discover emerging dynamics from the model. In this approach, the execution of the simulation and its representation is separated and building a visualization is like building a visualization model on top of the reference model. The techniques presented here have been implemented in an Agent-based simulation platform, Gama, and illustrate the new perspective on visualization in Agent-based Modeling.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130263802","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 novel combination of negative and positive selection in Artificial Immune Systems","authors":"Van Truong Nguyen, N. X. Hoai, C. Luong","doi":"10.1109/RIVF.2013.6719857","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719857","url":null,"abstract":"Artificial Immune System (AIS) is a multidisciplinary research area that combines the principles of immunology and computation. Negative Selection Algorithms (NSA) is one of the most popular models of AIS mainly designed for one-class learning problems such as anomaly detection [1]. Positive Selection Algorithms (PSA) is the twin brother of NSA with similar performance for AIS [2]. Both NSAs and PSAs comprise of two phases: generating a set D of detectors from a given set S of selves (detector generation phase); and then detecting if a given cell (new data instance) is self or non-self using the generated detector set (detection phase). In this paper, we propose a novel approach to combining NSAs and PSAs that employ binary representation and r-chunk matching rule. The new algorithm achieves smaller detector storage complexity and potentially better detection time in comparison with single NSAs or PSAs.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116333391","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 hybrid method for detecting outdated information in Wikipedia infoboxes","authors":"Thong Tran, T. Cao","doi":"10.1109/RIVF.2013.6719874","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719874","url":null,"abstract":"Wikipedia has grown fast and become a major information resource for users as well as for many knowledge bases derived from it. However it is still edited manually while the world is changing rapidly. In this paper, we propose a method to detect outdated attribute values in Wikipedia infoboxes by using facts extracted from the general Web. Our proposed method extracts new information by combining pattern-based approach with entity-search-based approach to deal with the diversity of natural language presentation forms of facts on the Web. Our experimental results show that the achieved accuracies of the proposed method are 70% and 82% respectively on the chief-executive-officer attribute and the number-of-employees attribute in company infoboxes. It significantly improves the accuracy of the single pattern-based or entity-search-based method. The results also reveal the striking truth about the outdated status of Wikipedia.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130938903","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":"Using coreference and surrounding contexts for entity linking","authors":"H. M. Huynh, Trong T. Nguyen, T. Cao","doi":"10.1109/RIVF.2013.6719856","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719856","url":null,"abstract":"Ambiguity in meanings of words or phrases in a document is considered one of the most primary barriers in natural language processing. In this work, we address the task of identifying and linking mentions of entities into correct referents described in a given knowledge base. To deal with it, we propose a supervised learning method for ranking candidate entities in combination with exploiting a heuristic and coreference relations among mentions in a document. Furthermore, another advantage of our method is its simplicity and effectiveness with using much fewer features than other systems. The results from evaluation on TAC-KBP 2012 datasets show that our combination is efficient and this method has a comparable performance to the state-of-the-art ones.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130179859","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":"Predicting preferred topics of authors based on co-authorship network","authors":"H. N. Le, P. D. Khoa, P. Do","doi":"10.1109/RIVF.2013.6719869","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719869","url":null,"abstract":"This paper focuses a common question in Social Network Analysis - evaluating how much a person prefers or non-prefers a specific issue. To realize this problem, we use the ILPnet2 database and model it as a co-authorship network in which the graph's nodes represent the authors and the links between two nodes means the two corresponding authors have some common papers. And what we have to do is predicting the preferred topics of authors in this network. Based on the original algorithm in [8], we propose a general algorithm with some basic assumptions and definitions and apply it to solve our problem. Finally, we use the ROC Analysis and Regression Estimation model to evaluate the Degree of Accuracy of the algorithm.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116264577","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":"Analysis of effectiveness of communication overheads in the parallel computing system using the closed product form queueing network","authors":"N. M. Quy, Ho Khanh Lam, H. Thang","doi":"10.1109/RIVF.2013.6719881","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719881","url":null,"abstract":"Assessment, computation and establishment of methods for decreasing communication overheads in parallel computing systems using multi-processor architectures are important problems. In the current research, the communication overhead was assessed using a new method that was executed based on components such as: effectiveness of the interconnecting network architecture, delay of nodes, initial communication time and transferring time of one data. The effectiveness of the communication overhead in the parallel computing system was also analyzed using the closed product form queueing network.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122662456","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}
Van-Minh Le, Y. Chevaleyre, Jean-Daniel Zucker, Hô Tuòng Vinh
{"title":"Speeding up the evaluation of casualties in multi-agent simulations with Linear Programming application to optimization of sign placement for tsunami evacuation","authors":"Van-Minh Le, Y. Chevaleyre, Jean-Daniel Zucker, Hô Tuòng Vinh","doi":"10.1109/RIVF.2013.6719896","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719896","url":null,"abstract":"Nowadays, tsunami is becoming one of the most dangerous natural disaster for coastal regions. Along with the early warning system, evacuation is one of the first mitigation procedures to consider. The evacuation simulation then received a lot of studies in recent years in the domain of computer science. In fact, there are always the part of evacuees (e.g. the tourist) who lack information of the evacuation map, which motivates us to study the problem of optimizing of guidance sign placement for tsunami evacuation. In this paper, we first propose the approach of Linear Programming that speeds up the Evaluation of Casualties in Agent-based Simulation in order to overcome the problem of computational speed of agent-based simulation. Then, we present an approach for optimizing the sign placement by using genetic algorithm with the fitness evaluated by the agent-based simulation.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122797213","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":"Interconnection networks with efficient custom routing, exploiting small-world effect","authors":"Nhat T. X. Le, V. Nguyen","doi":"10.1109/RIVF.2013.6719864","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719864","url":null,"abstract":"We design a new interconnection network topology and a custom routing algorithm, which targets solving new challenging issues posed by recent advanced studies in the areas of massively parallel computing and large-scale data centers. We follow the design principles of Distributed Shortcut Networks (DSN) [1], which construct non-random topologies with the creation of long-range Shortcuts inspired by observations in small-world networks. As a result, our new DSN-α networks performs significantly better than the basic DSN in term of communication latency while provide an surprisingly load balance which helps the network become robust against burst of traffic demand while topology-agnostic deadlock-free routing (e.g. the up*/down*) suffers a lot.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132081049","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}