2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future最新文献_第3页

Efficient Query Answering for Fuzzy Linguistic Logic Programming 模糊语言逻辑规划的高效查询应答

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169836

V. Le

引用次数: 1

Applying Virtual Reality for In-Door Jogging 虚拟现实在室内慢跑中的应用

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169874

Trung-Nghia Le, Quoc-Minh Bui, Vinh-Tiep Nguyen, M. Tran, A. Duong

引用次数: 4

Parallel Generation of Permutations by Inversion Vectors 用反转向量并行生成排列

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169840

H. Thanh

引用次数: 4

The Relationship of Contact Angle and Input Shaping Scheme in Automotive Wiper System 汽车雨刷系统接触角与输入成形方案的关系

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169855

M. A. Salim, A. Noordin, F. Munir, N. Nuri

引用次数: 1

Spatial Estimator of Brown Plant Hopper Density from Light Traps Data 基于光阱数据的褐斗密度空间估计

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/RIVF.2012.6169850

V. Huynh, Jean-Daniel Zucker, H. Huynh, A. Drogoul

引用次数: 6

Mining Association Rules Restricted on Constraint 基于约束约束的关联规则挖掘

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169825

Anh N. Tran, Tin C. Truong, H. Le, Hai V. Duong

{"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}

引用次数: 7

E-Learning Adoption and Assimilation in SMEs: A Research Framework 中小企业电子学习的采用与同化:一个研究框架

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169820

L. Raymond, Sylvestre Uwizeyemungu, F. Bergeron, Stephane Gauvin

引用次数: 4

Dynamic Time-Linkage Problems - The Challenges 动态时间-联动问题-挑战

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169823

Trung-Thanh Nguyen, Zaili Yang, S. Bonsall

{"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}

引用次数: 15

GA_SVM: A Genetic Algorithm for Improving Gene Regulatory Activity Prediction GA_SVM:一种改进基因调控活性预测的遗传算法

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169861

Dong Do Duc, Tri-Thanh Le, T. Vu, Huy Q. Dinh, H. X. Huan

引用次数: 1

Advanced High-Adaptive Image Coding for Frame Memory Reduction in LCD Overdrive 先进的高自适应图像编码在LCD超速中减少帧内存

2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future Pub Date : 2012-03-15 DOI: 10.1109/rivf.2012.6169866

T. Nguyen, Hoang-Lan Thi Nguyen

引用次数: 0