2016 Eighth International Conference on Information and Knowledge Technology (IKT)最新文献

筛选
英文 中文
Optimizing the correction of MCQ test answer sheets using digital image processing 利用数字图像处理优化MCQ测试答题卡的校正
A. M. Tavana, Mahdi Abbasi, Ali Yousefi
{"title":"Optimizing the correction of MCQ test answer sheets using digital image processing","authors":"A. M. Tavana, Mahdi Abbasi, Ali Yousefi","doi":"10.1109/IKT.2016.7777754","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777754","url":null,"abstract":"Today, multiple choice tests due to their benefits have become one of the most common methods to evaluate student's learning. In order to correct their answer sheets by the machines, very expensive equipment is necessary. Despite high correction accuracy of this method, because of some limitations, it's not suitable for public use such as schools. To overcome these limitations, attempts have been made to provide alternative correction system, but the main challenge in the machinery correction method and proposed alternative correction systems is that if the tester marks the option on the answer sheet incompletely, it will not be corrected properly. This recognition error affects on the correction accuracy. This article proposes an optimized correction method for correcting multiple choice test answer sheets using mathematical morphology, thresholding and neighborhood that with the increase of the recognition rate for incompletely marked options will improve overall correction accuracy.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125507187","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}
引用次数: 5
Induction of decision trees by looking to data sequentially and using error correction rule 通过顺序查找数据并使用纠错规则归纳决策树
N. Bathaeian, Muharram Mansoorizadeh
{"title":"Induction of decision trees by looking to data sequentially and using error correction rule","authors":"N. Bathaeian, Muharram Mansoorizadeh","doi":"10.1109/IKT.2016.7777780","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777780","url":null,"abstract":"Decision trees are common algorithms in machine learning. Traditionally, these algorithms make trees recursively and at each step, they inspect data to induce the part of the tree. However decision trees are famous for their instability and high variance in error. In this paper a solution which adds error correction rule to a traditional decision tree algorithm is examined. In fact an algorithm which we call it, ECD3 is introduced. Algorithm of ECD3 inspects data sequentially in an iterative manner and updates tree only when it finds an erroneous observation. This method was first proposed by Dr. Utgoff but not implemented. In this paper, the method is developed and several experiments are performed to evaluate the method. We found that in most cases, performance of ECD3 is comparable to its predecessors. However ECD3 has some benefits over them. First, sizes of its trees are significantly smaller. Second, on average, variance of error in ECD3 is lower. Furthermore, ECD3 automatically chooses part of data for induction of the tree and sets aside others. This capability can be exploited for prototype selection in various learning algorithms. To explain these observations, we use inductive bias and margin definitions in our theories. We introduce a new definition of margin in ordinary decision trees based on shape, size and splitting criteria in trees. We show that how ECD3 expands the margins and enhances precision over test data.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127454047","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
Toward an approach to deploy adaptation mechanisms in service-based applications 在基于服务的应用程序中部署适应机制的方法
Leila Baradaran Heravi, F. S. Aliee, Kavan Sedighiani
{"title":"Toward an approach to deploy adaptation mechanisms in service-based applications","authors":"Leila Baradaran Heravi, F. S. Aliee, Kavan Sedighiani","doi":"10.1109/IKT.2016.7777772","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777772","url":null,"abstract":"Service-based applications need to support adaptation for encountering complexity and dynamicity of their executive environment and context. Some of important concerns for supporting adaptation in service-based applications are related to implementation level (low level) of adaptation. At implementation level of adaptation, there are two open important problems. First, it is necessary to realize adaptation mechanisms by their strategies, tactics and techniques. Second, these mechanisms must be integrated into running process via a holistic method. Consequently in this paper, a comprehensive adaptation mechanisms' schema offered which presents a universal set of adaptation tactics for realizing adaptation strategies and also, a suitable approach proposed that deploys these strategies and tactics. In this approach, reconfiguration of process is optimized or achieved at run-time based on specific environment and available services. In order to assess proposed approach, the case study of urban crisis management is implemented. In this case study, a subset of adaptation mechanisms is deployed regarding proposed approach. The results of the evaluation show that adaptation mechanisms have been deployed successfully. Also, quality attributes of adaptive process are adjusted to encounter unexpected events. In addition, strategies' overhead is computed.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121321082","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
QoS-aware provider selection in e-services supply chain 电子服务供应链中质量感知的供应商选择
Hoda Ghavamipoor, S. Golpayegani
{"title":"QoS-aware provider selection in e-services supply chain","authors":"Hoda Ghavamipoor, S. Golpayegani","doi":"10.1109/IKT.2016.7777748","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777748","url":null,"abstract":"With the advent of service-oriented architecture and cloud services, provider selection in e-service outsourcing is a very important research topic and decision problem. This paper proposes a multi-objective programming model for basic service provider selection in e-service supply chain which optimized e-service outsourcing cost and e-service quality simultaneously. We then use a sample e-commerce supply chain as an example to show the applicability and necessity of the suggested model.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114449667","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
Assessment of grayscale image in terms of texture quality using reference image 基于参考图像的灰度图像纹理质量评估
Hamid Reza Aghamiri, H. Ghassemian
{"title":"Assessment of grayscale image in terms of texture quality using reference image","authors":"Hamid Reza Aghamiri, H. Ghassemian","doi":"10.1109/IKT.2016.7777756","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777756","url":null,"abstract":"Texture is one of the most important image's features, which has an important role in some image-processing applications such as segmentation and classification. The main problem is to obtain how much textures are reminded from reference image in the distorted image. To solve this problem image quality, assessment (IQA) plays main role and compares the amount of difference of texture between both images. This paper proposed a novel method to assess fully reference (FR) texture quality assessment, which is more sensible and sensitive to pixel arrangements. The grayscale images used for our experiments are BRODATZ imagery. The experimental results show superiority of proposed method compared to some popular texture assessment methods.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128968554","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
Consistency checking of clinical practice guidelines with MITDL 临床实践指南与MITDL的一致性检查
Morteza Yousef Sanati, W. MacCaull, T. Maibaum, Mohammad Mahdi Majzoobi
{"title":"Consistency checking of clinical practice guidelines with MITDL","authors":"Morteza Yousef Sanati, W. MacCaull, T. Maibaum, Mohammad Mahdi Majzoobi","doi":"10.1109/IKT.2016.7777755","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777755","url":null,"abstract":"Since a Clinical Practice Guideline describes the diagnosis and treatment process of a disease, designers of such guidelines should ensure their logical consistency. A formal approach for modeling them provides a basis for some useful reasoning (e.g., satisfiability checking). In this paper, we describe a metric interval-based temporal description logic, which is suitable for modeling the dynamic aspect of a domain and the the medical ontologies. We also propose a tableau-based algorithm for checking the satisfiability of such guidelines, to assure their logical consistency. We explain the process of encoding a real-life guideline, the “Treatment of Tuberculosis”, and present a situation where designers can use our logic and associated satisfiability algorithm to detect an inconsistency in the guideline for patients with Cirrhosis disease.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129148570","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
Video steganography algorithm based on motion vector of moving object 基于运动物体运动矢量的视频隐写算法
Kasra Rezagholipour, M. Eshghi
{"title":"Video steganography algorithm based on motion vector of moving object","authors":"Kasra Rezagholipour, M. Eshghi","doi":"10.1109/IKT.2016.7777764","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777764","url":null,"abstract":"Video steganography is a knowledge that provides a secure connection by hiding the secret message in the video sequins. In this paper, we propose a new video steganography algorithm based on object motion which the secret information is embedded in motion vectors of moving objects. Therefore by using the mean shift algorithm the existed objects in each frame are detected. Based on motion estimation algorithm in B and P frames, motion vectors of each object with quarter pixel accuracy are extracted. To ensure that the selected motion vectors are belong to the object and also have a desire balance between capacity and video quality, a threshold value is defined. So the motion vectors whose value are greater than the threshold value are selected. The secret message is embedded in one-quarter both horizontal and vertical component of each selected motion vector. The result shows that the proposed algorithm can embed a large amount data in motion object and achieved a good video quality.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116293779","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
An adaptive algorithm for managing gradient topology in peer-to-peer networks 点对点网络中梯度拓扑管理的自适应算法
Sara Fathipour Deiman, A. Saghiri, M. Meybodi
{"title":"An adaptive algorithm for managing gradient topology in peer-to-peer networks","authors":"Sara Fathipour Deiman, A. Saghiri, M. Meybodi","doi":"10.1109/IKT.2016.7777792","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777792","url":null,"abstract":"Super-peer network is a type of peer-to-peer networks. In a super-peer network, a super-peer is a peer that has more ability than other peers have and is responsible for some of the tasks of network management. Since different peers vary in terms of capability, selecting a super-peer is a challenge problem. Gradient topology is a type of super-peer networks. Because of dynamicity of peers, adaptive methods are important for managing gradient topology. A problem of the existing management algorithms of gradient topology is that they are not sensitive to joining and leaving the peers. This problem becomes more challenging when a malicious peer frequently joins and leaves the network. The proposed algorithm being sensitive to removal of super peers, using learning automata, selects the new super-peers in an adaptive manner. According to the simulation results, the proposed algorithm can compete with the existing algorithms.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126651327","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
A priority based method for congestion control in Wireless Multimedia Sensor Networks 基于优先级的无线多媒体传感器网络拥塞控制方法
P. Sabbagh, Mohammad Alaei, F. Yazdanpanah
{"title":"A priority based method for congestion control in Wireless Multimedia Sensor Networks","authors":"P. Sabbagh, Mohammad Alaei, F. Yazdanpanah","doi":"10.1109/IKT.2016.7777763","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777763","url":null,"abstract":"Wireless Multimedia Sensor Networks (WMSNS) are composed of a number of sensors which usually the most important data generated by them are video data. According to massive amounts of data, congestion control is essential for quality preservation of the video data. Quality of video data depends on low latency and high reliability. In this paper, an approach for congestion control is proposed. In the proposed scheme, the network area is divided into zones, and a mobile local sink is utilized in each zone which will lead to the network minimum latency. Also, to raise the quality of video data, the proposed method considers different levels of the buffer queue for each data type (video, sound, and scalar). Moreover, to improve the video data quality at each mobile sink, a unique identifier for each event is considered. The mobile sink in each zone, receives the event packets in the separate queue of the related identifier. Simulation results shows that the proposed method results in saving of more amount of energy and thus increasing the network lifetime, while the packet loss reaches to zero.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128138469","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
Congestion aware routing metric for opportunistic routing in wireless ad-hoc networks 无线自组织网络中机会路由的拥塞感知路由度量
A. Parsa, N. Moghim
{"title":"Congestion aware routing metric for opportunistic routing in wireless ad-hoc networks","authors":"A. Parsa, N. Moghim","doi":"10.1109/IKT.2016.7777758","DOIUrl":"https://doi.org/10.1109/IKT.2016.7777758","url":null,"abstract":"Opportunistic Routing is a new routing paradigm in wireless ad-hoc networks. In this paradigm, the packets are routed with no fixed and predetermined next hop in the network. Broadcast nature of wireless medium is used in opportunistic routing and the next hop will be selected of the receivers of a packet. A problem that has still remained in opportunistic routing is congestion occurrence along the shortest paths. This is due to unsuitable next hop selection through the utilized routing metric. Queue length consideration in the routing metric is necessary but not sufficient to avoid network congestion. Therefore, a routing metric is proposed in this paper that considers the transmission rate of the nodes in addition to their backlog queue. Simulation results show that the proposed metric has better performance compared to the metric that only considers the queue length in the next hop selection procedure.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115534244","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
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学术文献互助群
群 号:481959085
Book学术官方微信