发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Checking and Correcting the Source Code of Web Pages for Accessibility 可访问性网页源代码的检查与修正
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.6169872
Thi-Huong-Giang Vu, Tuan-Dat Trinh, Van-Hung Phan
{"title":"Checking and Correcting the Source Code of Web Pages for Accessibility","authors":"Thi-Huong-Giang Vu, Tuan-Dat Trinh, Van-Hung Phan","doi":"10.1109/rivf.2012.6169872","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169872","url":null,"abstract":"This paper aims to propose and experiment a framework for checking and correcting websites for accessibility. Existing tools usually check the WCAG-conformance of HTML client pages (that contain the static elements to be displayed through a browser to end users at a moment). Consequently, web developers have to do tedious works of identifying which parts of server source pages (i.e. server-side source codes that generate HTML client pages) cause non-conformant client elements. Unlike these tools, our framework allows directly reporting and suggesting solutions for the elements in the server source pages. The proposed method composes of four steps. First, the HTML client page and the server source page are parsed. Second, the elements of HTML client page that are non-conformant with the WCAG success criteria are identified and reported. Third, a mapping between the HTML client page and the server source page is established. Fourth, fixes to the server source page are suggested; this implies automatic modification of the code of server source page. Therefore, this framework can be applied to create new accessible websites, or to improve the accessibility of existing websites.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"74 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":"121846548","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}
引用次数: 12
A Polynomial-Time Algorithm for Reachability Problem of a Subclass of Petri Net and Chip Firing Games Petri网子类可达性问题的多项式时间算法及芯片发射博弈
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.6169852
Le Manh Ha, Van Trung Pham, T. H. Phan
{"title":"A Polynomial-Time Algorithm for Reachability Problem of a Subclass of Petri Net and Chip Firing Games","authors":"Le Manh Ha, Van Trung Pham, T. H. Phan","doi":"10.1109/rivf.2012.6169852","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169852","url":null,"abstract":"Reachability is a fundamental problem in the study of many dynamical systems; especially, the complexity of this problem for Petri nets has been open for many years. In this paper, we investigate to the reachability of state machine - a special class of Petri nets, in which every transition has exactly one input place and one output place by giving a correspondence between this problem and flow networks problem. We first study the bijection between state machine of n places and Conflicting Chip Firing Game (CCFG) on a graph of n vertices. Then we use Push-Relabel algorithm on flow networks to solve the reachability problem of CCFG with complexity O(n3), which implies a corresponding algorithm for state machines.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"30 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":"125072153","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}
引用次数: 2
Hybridization of Genetic Algorithm and Branch-and-Price Framework for Solving the One Dimensional Cutting Stock Problem with Multiple Stock Sizes 遗传算法与分支价格框架的杂交求解多库存尺寸一维下料问题
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.6169859
Phan Thi Hoai Phuong
{"title":"Hybridization of Genetic Algorithm and Branch-and-Price Framework for Solving the One Dimensional Cutting Stock Problem with Multiple Stock Sizes","authors":"Phan Thi Hoai Phuong","doi":"10.1109/rivf.2012.6169859","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169859","url":null,"abstract":"In this paper, we are concerned with a natural extension of the standard cutting stock problem, in which there are multiple stock sizes available instead of a single one. Based on decomposing problem of this type into the standard cutting stock ones, a new model called OneDCSP_M is proposed and its solution algorithm is developed. The quality of the algorithm is evaluated by comparing its results with the ones obtained by Belov and Scheithauer.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"93 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":"124554068","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}
引用次数: 1
Virtual View Synthesis Using Temporal Hole Filling with Bilateral Coefficients 基于双侧系数的时间孔填充虚拟视图合成
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.6169867
Jae-Il Jung, Yo-Sung Ho
{"title":"Virtual View Synthesis Using Temporal Hole Filling with Bilateral Coefficients","authors":"Jae-Il Jung, Yo-Sung Ho","doi":"10.1109/rivf.2012.6169867","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169867","url":null,"abstract":"A depth image-based virtual view synthesis always induces a hole problem, and the holes degrade viewing quality of the synthesized image. In this paper, we propose a temporal hole filling algorithm referring to neighboring frames in the temporal domain. In order to find corresponding textures for a current hole, we synthesize both color and depth videos by the 3D warping technique, and linearly interpolate the holes in the depth video. With the interpolated depth values, we search the corresponding color textures from the neighboring key frames and fill them. The experimental results show that the proposed algorithm can find appropriate textures in the temporal domain and fill the hole regions even in complex scenes.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"35 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":"126618963","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}
引用次数: 10
An Efficient FPGA Implementation of the Advanced Encryption Standard Algorithm 高级加密标准算法的高效FPGA实现
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.6169845
Trang Hoang, Van Loi Nguyen
{"title":"An Efficient FPGA Implementation of the Advanced Encryption Standard Algorithm","authors":"Trang Hoang, Van Loi Nguyen","doi":"10.1109/rivf.2012.6169845","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169845","url":null,"abstract":"A proposed FPGA-based implementation of the Advanced Encryption Standard (AES) algorithm is presented in this paper. This implementation is compared with other works to show the efficiency. The design uses an iterative looping approach with block and key size of 128 bits, lookup table implementation of S-box. This gives low complexity architecture and easily achieves low latency as well as high throughput. Simulation results, performance results are presented and compared with previous reported designs.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"10 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":"126888561","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}
引用次数: 69
A Grammatically Structured Noun Phrase Extractor for Vietnamese 越南语语法结构名词短语提取器
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.6169837
Hoai-Duc Tuan-Nguyen, Bao-Quoc Ho, Trung Bui, M. Hoang
{"title":"A Grammatically Structured Noun Phrase Extractor for Vietnamese","authors":"Hoai-Duc Tuan-Nguyen, Bao-Quoc Ho, Trung Bui, M. Hoang","doi":"10.1109/rivf.2012.6169837","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169837","url":null,"abstract":"Noun phrase (NP) extraction is a vital part of any Natural Language Processing (NLP) system. However, it would be much better if the system can also parse the grammar structure of the extracted NPs. Grammatically structured NP (GSNP) is helpful in many research fields (Conceptual Indexing, Syntactic variant generating, Nested NP identifying, etc). This paper introduces a system that extracts NPs from Vietnamese Documents and parses each NP into a tree representing its grammar structure. These trees, in one hand, can be saved as XML documents, and in the other hand, can be loaded from these XML documents by some particular Java classes.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"PP 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":"126363150","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}
引用次数: 0
Fall Detection Based on Movement and Smart Phone Technology 基于运动和智能手机技术的跌倒检测
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.6169847
Q. Vo, Gueesang Lee, Deokjai Choi
{"title":"Fall Detection Based on Movement and Smart Phone Technology","authors":"Q. Vo, Gueesang Lee, Deokjai Choi","doi":"10.1109/rivf.2012.6169847","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169847","url":null,"abstract":"Nowadays, recognizing human activities is an important subject; it is exploited widely and applied to many fields in real-life, especially health care or context aware application. Research achievements are mainly focused on activities of daily living which are useful for suggesting advises to health care applications. Falling event is one of the biggest risks to the health and well being of the elderly especially in independent living because falling accidents may be caused from heart attack. Recognizing this activity still remains in difficult research area. Many systems which equip wearable sensors have been proposed but they are not useful if users forget to wear the clothes or lack ability to adapt themselves to mobile systems without specific wearable sensors. In this paper, we develop novel method based on analyzing the change of acceleration, orientation when the fall occurs. In this study, we recruit five volunteers in our experiment including various fall categories. The results are effective for recognizing fall activity. Our system is implemented on Google Android smart phone which already plugged accelerometer and orientation sensors. The popular phone is used to get data from accelerometer and results show the feasibility of our method and contribute significantly to fall detection in Health care.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"9 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":"124424828","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}
引用次数: 61
Time Series Clustering Based on I-k-Means and Multi-Resolution PLA Transform 基于i- k均值和多分辨率PLA变换的时间序列聚类
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.6169835
Vuong Ba Thinh, D. T. Anh
{"title":"Time Series Clustering Based on I-k-Means and Multi-Resolution PLA Transform","authors":"Vuong Ba Thinh, D. T. Anh","doi":"10.1109/rivf.2012.6169835","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169835","url":null,"abstract":"In this paper, we introduce an approach using I-k-Means algorithm combined with kd-tree for clustering of time series data transformed by the multiresolution dimensionality reduction method, MPLA. Taking advantage of the multiresolution property of MPLA representation, we can use an anytime clustering algorithm such as the I-k-Means, a popular partitioning clustering algorithm for time series. Our approach also uses kd-tree to resolve the dilemma associated with the choices of initial centroids and significantly improve the execution time and clustering quality. Our experiments show that our approach performs better than k-means and classical I-k-Means in terms of clustering quality and running time.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"164 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":"127423371","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}
引用次数: 1
An Enhanced Scheme for Privacy-Preserving Association Rules Mining on Horizontally Distributed Databases 一种增强的水平分布式数据库隐私保护关联规则挖掘方案
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.6169821
Xuan Canh Nguyen, H. Le, T. A. Cao
{"title":"An Enhanced Scheme for Privacy-Preserving Association Rules Mining on Horizontally Distributed Databases","authors":"Xuan Canh Nguyen, H. Le, T. A. Cao","doi":"10.1109/rivf.2012.6169821","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169821","url":null,"abstract":"In this paper, we propose an Enhanced M.Hussein et al.'s Scheme (EMHS) for privacy-preserving association rules mining on horizontally distributed databases. EMHS is based on the M.Hussein et al.'s Scheme (MHS) proposed in 2008 and improves privacy and performance when increasing the number of sites. EMHS uses two servers, Initiator and Combiner, combined with MFI approach to generate candidate set and homomorphic Paillier cryptosystem to compute global supports. Experimental results show that the performance of EMHS is better than MHS in specific databases when increasing the number of sites. A second scheme is also proposed for the other databases.","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":"126472951","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}
引用次数: 29
An Efficient Incremental Mining Approach Based on IT-Tree 基于it树的高效增量挖掘方法
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.6169826
Thien-Phuong Le, T. Hong, Bay Vo, H. Le
{"title":"An Efficient Incremental Mining Approach Based on IT-Tree","authors":"Thien-Phuong Le, T. Hong, Bay Vo, H. Le","doi":"10.1109/rivf.2012.6169826","DOIUrl":"https://doi.org/10.1109/rivf.2012.6169826","url":null,"abstract":"The itemset-tidset-tree (IT-tree) is an efficient data structure for association-rule mining. Zaki et al. designed a mining algorithm based on the IT-tree structure, which traversed an IT-tree in a depth-first order, generated itemsets by using the concept of equivalence classes, and computed the support values of itemsets fast by tidset intersection. It, however, needed to process all transactions in a batch way. In this paper, we propose a Pre-FUIT algorithm (Fast-Update algorithm based on the IT-tree structure and the concept of PRE-large itemsets algorithm), which does not only update the IT-tree when new transactions are inserted, but also mine all frequent itemsets easily. Experimental results show the good performance of the proposed algorithm.","PeriodicalId":115212,"journal":{"name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","volume":"198 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":"116729498","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}
引用次数: 20
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信