{"title":"Efficient Query Answering for Fuzzy Linguistic Logic Programming","authors":"V. Le","doi":"10.1109/rivf.2012.6169836","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169836","url":null,"abstract":"In fuzzy linguistic logic programming, there are two approaches to compute answers to queries w.r.t. a logic program: (i) by bottom-up iterating the immediate consequence operator TP; or (ii) by using the procedural semantics. The former is not goal-oriented and exhaustive. The latter is goal-oriented, but may lead to an infinite loop and recomputes subgoals in rule bodies. This paper presents an efficient tabulation proof procedure, which can overcome these problems, for fuzzy linguistic logic programming, shows its termination, and proves its soundness.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121803228","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}
Trung-Nghia Le, Quoc-Minh Bui, Vinh-Tiep Nguyen, M. Tran, A. Duong
{"title":"Applying Virtual Reality for In-Door Jogging","authors":"Trung-Nghia Le, Quoc-Minh Bui, Vinh-Tiep Nguyen, M. Tran, A. Duong","doi":"10.1109/rivf.2012.6169874","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169874","url":null,"abstract":"We propose an \"In-place Virtual Tour\" system that generates the smart virtual environment adapting to a user's activities when jogging. Our proposed system automatically detects the main region of frames captured from a regular camera, analyses the difference in foreground in the main region of consecutive frames to estimate the user's intensity level, then renders virtual scene with appropriate speed. The system does not require any special devices as existing interactive fitness games. Experimental results demonstrate the effectiveness and the realtime manner of the proposed system. Our proposed method can also be applied to develop various exciting interactive games to stimulate excitement for users when doing in-door fitness exercises or to create virtual environment for museums where visitors just stay in place to explore scenes in museums.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129409762","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":"Parallel Generation of Permutations by Inversion Vectors","authors":"H. Thanh","doi":"10.1109/rivf.2012.6169840","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169840","url":null,"abstract":"Permutations of a set are used in many practical problems. There are some algorithms for generating permutations of a set, e.g. a reverse alphabetical order algorithm, an algorithm based on adjacent transpositions, an algorithm determining permutations from their reductions... But these algorithms are rather long and difficult to parallelize. In this paper we point out that the set of all permutations of a set is isomorphic to the set of their inversion vectors. Thus, we construct a new algorithm determining permutations from their inversion vectors. The algorithm is simpler and shorter than existing ones. Furthermore, this algorithm is easy to parallelize. We parallelize the proposed algorithm by one of two methods. The first one is tasks dividing: 1) finding an inversion vector, and 2) determining a permutation from the just found inversion vector. Two these tasks are performed in parallel with equal computing amounts. The second parallelizing method is based on splitting the sequence of all desirable permutations into subsequences and then concurrently generating the subsequences.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131577421","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":"The Relationship of Contact Angle and Input Shaping Scheme in Automotive Wiper System","authors":"M. A. Salim, A. Noordin, F. Munir, N. Nuri","doi":"10.1109/rivf.2012.6169855","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169855","url":null,"abstract":"This study presents the modeling of two dimensional mathematical model of wiper system using Newtonian Law. Two dimensional mathematical models in x- and y-axis is found in differential equation form. The dynamics behavior of wiper system has a good response which instantaneously agreed which input or a disturbance happen during the operation of the system. Besides, in this study also investigated the effect of contact angle response in the flexible wiper assembly for forward and vice versa direction. The control scheme known as input shaping was applied to suppress the reversal noises and vibrations level in system. At the end of this study, the unwanted noise and vibration is reduced more than 25 percent compare with baseline result.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"110 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114087008","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}
V. Huynh, Jean-Daniel Zucker, H. Huynh, A. Drogoul
{"title":"Spatial Estimator of Brown Plant Hopper Density from Light Traps Data","authors":"V. Huynh, Jean-Daniel Zucker, H. Huynh, A. Drogoul","doi":"10.1109/RIVF.2012.6169850","DOIUrl":"https://doi.org/10.1109/RIVF.2012.6169850","url":null,"abstract":"This paper aims to define an optimal interpolation technique to estimate the density of brown plant hopper (BPH) in Dongthap Province among the Mekong delta in Vietnam. The technique is chosen by assessment between the two methods: Inverse Distance Weight and Ordinary Kriging. First, sample data of light-traps are analyzed by the two mentioned methods running on R packages. Second, the results are visualized on the multi-agent system (GAMA) combined with the geographic information system (GIS). As a result, managers can easily survey the density of BPH populations on rice fields to control the damage of BPH more effectively and bring in higher yield for farmers.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134363505","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":"Mining Association Rules Restricted on Constraint","authors":"Anh N. Tran, Tin C. Truong, H. Le, Hai V. Duong","doi":"10.1109/rivf.2012.6169825","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169825","url":null,"abstract":"The aim of this paper is to solve the problem of mining association rule restricted on a given constraint itemset which often changes. At the time of building the system, on given database, we mine first the lattice of closed itemsets. Based on that lattice, whenever the constraint or the minimum support changes, the lattice of all restricted frequent closed itemsets is obtained. The set of all association rules restricted on constraint partitions into disjoint equivalence classes. Each class is represented by a pair of two nested frequent closed itemsets. Then, we just mine independently each rule class. Users can select the rule class that they are interested in. Spending only a little of time, we can mine and figure out the basic rules of that class. They are useful for users because their left-handed sides are minimal and their right-handed sides are maximal. When necessary, the set of all remaining consequence ones together with their confidences can be quickly generated from the basic ones. This consequence set also splits into the different subsets according to different generating operators. Hence, our approach is very efficient and close to user! The theoretical affirmations and experimental results prove that.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"35 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125721718","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}
L. Raymond, Sylvestre Uwizeyemungu, F. Bergeron, Stephane Gauvin
{"title":"E-Learning Adoption and Assimilation in SMEs: A Research Framework","authors":"L. Raymond, Sylvestre Uwizeyemungu, F. Bergeron, Stephane Gauvin","doi":"10.1109/rivf.2012.6169820","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169820","url":null,"abstract":"SMEs exhibit specific behaviors with regard to adopting and assimilating information technologies such as e-learning. Very little is known however as to the environmental, organizational and technological factors that condition or determine the adoption and assimilation of e-learning by SMEs. Given that further research is needed in this regard, we seek to orient this research by proposing a research framework. After reviewing the literature on e-learning adoption and assimilation in the context of SMEs, potential determinant and moderating factors are identified and integrated within a conceptual framework. This framework is then applied to generate a set of research propositions on e-learning in SMEs.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121968276","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":"Dynamic Time-Linkage Problems - The Challenges","authors":"Trung-Thanh Nguyen, Zaili Yang, S. Bonsall","doi":"10.1109/rivf.2012.6169823","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169823","url":null,"abstract":"Dynamic time-linkage optimisation problems (DTPs) are special dynamic optimisation problems (DOPs) where the current solutions chosen by the solver can influence how the problems might change in the future. Although DTPs are very common in real-world applications, they have received very little attention from the fleld of evolutionary and meta-heuristic optimisation. Due to this lack of research there are still many characteristics that we do not fully know about DTPs. For example, is there any characteristics of DTPs that we do not know; with these characteristics are DTPs still solvable; and what is the appropriate strategy to solve them. In this paper these issues will be partially addressed. First, we will identify a new and challenging class of DTPs where it might not be possible to solve the problems using traditional methods. Second, an approach to solve this class of problems under certain circumstances will be suggested and experiments to verify the hypothesis will be carried out. Two test problems will be proposed to simulate the property of this new class of DTPs, and discussions of real-world applications will be introduced.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127135087","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}
Dong Do Duc, Tri-Thanh Le, T. Vu, Huy Q. Dinh, H. X. Huan
{"title":"GA_SVM: A Genetic Algorithm for Improving Gene Regulatory Activity Prediction","authors":"Dong Do Duc, Tri-Thanh Le, T. Vu, Huy Q. Dinh, H. X. Huan","doi":"10.1109/rivf.2012.6169861","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169861","url":null,"abstract":"Gene regulatory activity prediction problem is one of the important steps to understand the significant factors for gene regulation in biology. The advents of recent sequencing technologies allow us to deal with this task efficiently. Amongst these, Support Vector Machine (SVM) has been applied successfully up to more than 80% accuracy in the case of predicting gene regulatory activity in Drosophila embryonic development. In this paper, we introduce a metaheuristic based on genetic algorithm (GA) to select the best parameters for regulatory prediction from transcriptional factor binding profiles. Our approach helps to improve more than 10% accuracy compared to the traditional grid search. The improvements are also significantly supported by biological experimental data. Thus, the proposed method helps boosting not only the prediction performance but also the potentially biological insights.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122407116","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":"Advanced High-Adaptive Image Coding for Frame Memory Reduction in LCD Overdrive","authors":"T. Nguyen, Hoang-Lan Thi Nguyen","doi":"10.1109/rivf.2012.6169866","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169866","url":null,"abstract":"In this paper, Advanced High-Adaptive Image Coding (AHAIC) is proposed to increase compression performance for Frame Memory Reduction in LCD Overdrive. The AHAIC contains a new technique to improve the quality of decompressed images. It is a Content-based Bit Distribution Technique (CBBDT) which improves the image quality while preserving fixed word length compression feature. Experimental results show that, compared with other coding methods used in the same type of application, AHAIC has outperforming feature.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131488253","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}