Compute最新文献

筛选
英文 中文
CRETAL: A Personalized Learning Environment in Conventional Setup CRETAL:传统设置下的个性化学习环境
Compute Pub Date : 2017-11-16 DOI: 10.1145/3140107.3140130
G. M. Shivanagowda, R. Goudar, U. Kulkarni
{"title":"CRETAL: A Personalized Learning Environment in Conventional Setup","authors":"G. M. Shivanagowda, R. Goudar, U. Kulkarni","doi":"10.1145/3140107.3140130","DOIUrl":"https://doi.org/10.1145/3140107.3140130","url":null,"abstract":"The increased variety of learning resources, like e-books with modern collaborative tools, video lectures of different teachers across the world, lively discussion boards etc. have substantially affected learning styles of students. Having accepted such forms of learning materials, conventional academic setups are in desperate need to make learning activities efficient, effective and meaningful. In this paper a diverse resources hosting system CRETAL (Compiler of Resources in Engineering &Technology to Aid Learning) with rich set of unique annotation tools are described to address the challenges of the modern students to query, access, extract, connect, process and share the important concepts from the different form of the learning materials created and adapted by the teacher. In addition to the system description, we also present the usability study along with the impact on students learning and teacher's decision when CRETAL was adapted in few undergraduate course using Educational Data mining and learning analytics.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"43 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120927944","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
3D Ear Based Human Recognition Using Gauss Map Clustering 基于高斯地图聚类的三维人耳识别
Compute Pub Date : 2017-11-16 DOI: 10.1145/3140107.3140112
I. I. Ganapathi, S. Prakash
{"title":"3D Ear Based Human Recognition Using Gauss Map Clustering","authors":"I. I. Ganapathi, S. Prakash","doi":"10.1145/3140107.3140112","DOIUrl":"https://doi.org/10.1145/3140107.3140112","url":null,"abstract":"This paper addresses the problem of human recognition using 3D ear biometrics. Existing feature extraction and description techniques in the literature for 3D shape recognition works well with the different class of shapes, however, not for profoundly comparable objects like human 3D ears. This work proposes an effective method utilizing Gauss mapping for feature keypoints detection and shape context to describe the detected keypoints. The proposed technique is as follows. A triangle for every point p is computed using two other points of the k-nearest neighbors within a sphere of radius r. A normal is computed for the obtained triangle and is mapped to a unit sphere. This mapping of normals is done for every conceivable triangle of point p. It is observed that mapped normals form a different number of clusters depending upon the type of surface point p belongs to. A point is considered as a keypoint if its projected normals form more than two clusters. Further, we project all the detected keypoints onto a plane and use them in the computation of feature descriptor vectors. Descriptor vector of a keypoint is computed by keeping it at the center and defining its shape context considering all other keypoints as its neighbors. To match a probe ear image with a gallery image for recognition, we compute correspondence for all the feature keypoints of the probe image to the feature keypoints of the gallery image. Final matching is performed by aligning the gallery image with the probe image and considering the registration error as the matching score. The experimental analysis conducted on University of Notre Dame (UND)-Collection J2 has achieved a verification accuracy of 98.20% with an equal error rate (EER) of 1.84%.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134178568","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}
引用次数: 4
Breast Tissue Density Classification in Mammograms Based on Supervised Machine Learning Technique 基于监督机器学习技术的乳腺组织密度分类
Compute Pub Date : 2017-11-16 DOI: 10.1145/3140107.3140131
K. Kashyap, M. Bajpai, P. Khanna
{"title":"Breast Tissue Density Classification in Mammograms Based on Supervised Machine Learning Technique","authors":"K. Kashyap, M. Bajpai, P. Khanna","doi":"10.1145/3140107.3140131","DOIUrl":"https://doi.org/10.1145/3140107.3140131","url":null,"abstract":"Breast tissue density is one of the symptoms for breast cancer detection. Fully automatic breast tissue density classification is presented in this work. Present work consists of four steps which include breast region extraction and enhancement of mammograms, segmentation, feature extraction, and breast tissue density classification. Enhancement of mammogram is done by applying fractional order differential based filter. Segmentation of breast tissue segmentation has been done by using clustering based fast fuzzy c-means technique. Further, texture based local binary pattern (LBP) and dominant rotated local binary pattern (DRLBP) features have been computed from the extracted breast tissues to characterize its texture property. Support vector machine with linear kernel functions are used to classify the breast tissue density. Proposed algorithm is validated on the publicly available 322 mammograms of Mini-Mammographic Image Analysis Society (MIAS).","PeriodicalId":435920,"journal":{"name":"Compute","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114120023","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
Neural Machine Translation of Indian Languages 印度语言的神经机器翻译
Compute Pub Date : 2017-11-16 DOI: 10.1145/3140107.3140111
Karthik Revanuru, Kaushik Turlapaty, Shrisha Rao
{"title":"Neural Machine Translation of Indian Languages","authors":"Karthik Revanuru, Kaushik Turlapaty, Shrisha Rao","doi":"10.1145/3140107.3140111","DOIUrl":"https://doi.org/10.1145/3140107.3140111","url":null,"abstract":"Neural Machine Translation (NMT) is a new technique for machine translation that has led to remarkable improvements compared to rule-based and statistical machine translation (SMT) techniques, by overcoming many of the weaknesses in the conventional techniques. We study and apply NMT techniques to create a system with multiple models which we then apply for six Indian language pairs. We compare the performances of our NMT models with our system using automatic evaluation metrics such as UNK Count, METEOR, F-Measure, and BLEU. We find that NMT techniques are very effective for machine translations of Indian language pairs. We then demonstrate that we can achieve good accuracy even using a shallow network; on comparing the performance of Google Translate on our test dataset, our best model outperformed Google Translate by a margin of 17 BLEU points on Urdu-Hindi, 29 BLEU points on Punjabi-Hindi, and 30 BLEU points on Gujarati-Hindi translations.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130886436","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}
引用次数: 46
Webcam Based Eye Gaze Tracking Using a Landmark Detector 基于网络摄像头的眼球注视跟踪,使用地标检测器
Compute Pub Date : 2017-11-16 DOI: 10.1145/3140107.3140117
Atul Sahay, P. Biswas
{"title":"Webcam Based Eye Gaze Tracking Using a Landmark Detector","authors":"Atul Sahay, P. Biswas","doi":"10.1145/3140107.3140117","DOIUrl":"https://doi.org/10.1145/3140107.3140117","url":null,"abstract":"This paper proposes a real-time algorithm to detect users' gaze point in a video sequence from a standard web camera. We have shown that landmarks constructed for both eyes can reliably estimate the eyelid opening, which in turn can be used to tell where the user is staring at that particular moment. Further, the knowledge of the eye opening can be combined with the iris displacement from the reference point to predict the user's gaze point. We have reported a user study involving 8 users and we can track one of nine positions on screen within a radius of 11° of visual angle.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126389338","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}
引用次数: 4
Fingerprint Shell Construction with Prominent Minutiae Points 指纹壳结构与突出的细节点
Compute Pub Date : 2017-11-16 DOI: 10.1145/3140107.3140113
Syed Sadaf Ali, S. Prakash
{"title":"Fingerprint Shell Construction with Prominent Minutiae Points","authors":"Syed Sadaf Ali, S. Prakash","doi":"10.1145/3140107.3140113","DOIUrl":"https://doi.org/10.1145/3140107.3140113","url":null,"abstract":"Fingerprint based authentication is one of the most extensively used authentication technique. Biometric systems relying on fingerprint usually directly uses minutiae points information of a fingerprint and store it as a user template. There are many recent works which show that original fingerprint of a user can be generated from the data of minutiae points. In case of traditional authentication systems based on password there is a liberty to change the password, however biometric data of a user cannot be changed as it is permanently associated with the human body. If any information related to biometric features of a user is stolen or compromised, then in that case we cannot change the compromised information. Therefore, it is essential to make sure that the biometric data is secure. Our motive is to generate a biometric template that will fulfill the necessities of performance, security, revocability and diversity. Moujahdi et al. proposed a technique called Fingerprint shell as a secure representation of fingerprint data using a user key. In this technique, a spiral curve is generated as a secured user template by using the distances between singular point and minutiae points. In this paper, we have proposed a technique in which we have included the quality of minutiae points for the construction of spiral curve. We have used a pair of unique user keys and utilized the information provided by minutiae points to generate a non-invertible user template. In case of compromising of user template by adversary, user has the liberty to generate new template by using different user keys, the new template and the compromised one are non-linkable. We tested our technique on FVC2002 DB1, FVC2002 DB2 and IIT Kanpur fingerprint databases using FVC protocol. Experimental results obtained are encouraging and demonstrate the viability of our technique.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132505317","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
Prediction Intervals via Support Vector-quantile Regression Random Forest Hybrid 基于支持向量-分位数回归的随机森林混合预测区间
Compute Pub Date : 2017-11-16 DOI: 10.1145/3140107.3140122
V. Ravi, Vadali Tejasviram, Anurag Sharma, R. R. Khansama
{"title":"Prediction Intervals via Support Vector-quantile Regression Random Forest Hybrid","authors":"V. Ravi, Vadali Tejasviram, Anurag Sharma, R. R. Khansama","doi":"10.1145/3140107.3140122","DOIUrl":"https://doi.org/10.1145/3140107.3140122","url":null,"abstract":"This paper presents a new method of determining prediction intervals via the hybrid of support vector machine and quantile regression random forest introduced elsewhere. Its effectiveness is tested on 5 benchmark regression problems. Fromthe experiments, we infer that the difference in performance of the prediction intervals from the proposed method and those from quantile regression and quantile regression random forest is statistically significant as shown by the Wilcoxon test at 5% level of significance. This is an important achievement of the paper.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126450495","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
Incorporating Formal Methods and Measures Obtained through Analysis, Simulation Testing for Dependable Self-Adaptive Software in Avionics Systems 结合分析得到的形式化方法和措施,对航空电子系统中可靠自适应软件进行仿真试验
Compute Pub Date : 2017-11-16 DOI: 10.1145/3140107.3140128
Rajanikanth N. Kashi, Meenakshi D'Souza, Koyalkar Raman Kishore
{"title":"Incorporating Formal Methods and Measures Obtained through Analysis, Simulation Testing for Dependable Self-Adaptive Software in Avionics Systems","authors":"Rajanikanth N. Kashi, Meenakshi D'Souza, Koyalkar Raman Kishore","doi":"10.1145/3140107.3140128","DOIUrl":"https://doi.org/10.1145/3140107.3140128","url":null,"abstract":"An Area 1rich with challenges is that of self-adaptive avionics software, with considerable thrust in both the American and European airspace modernization programs. Verifying functional requirements for such a system, ultimately leading to certification poses a unique set of problems, since these systems are required to be dependable. Also inherent is the subject of eliciting measures of adaptability which help evaluate the system in the context of non-functional requirements qualified by self-properties. We illustrate our approach for such a verification and evaluation exercise by proposing a combination of formal methods verification techniques and simulation based testing. The test bed is a representative self-adaptive software of a small UAS (Unmanned Aircraft System) avionics modeled as a multiagent BDI (Belief Desire Intention) system with evolutionary and reactive behaviours, illustrating important aspects of verification.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132659059","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
LDA Based Feature Selection for Document Clustering 基于LDA的文档聚类特征选择
Compute Pub Date : 2017-11-16 DOI: 10.1145/3140107.3140129
B. S. Kumar, V. Ravi
{"title":"LDA Based Feature Selection for Document Clustering","authors":"B. S. Kumar, V. Ravi","doi":"10.1145/3140107.3140129","DOIUrl":"https://doi.org/10.1145/3140107.3140129","url":null,"abstract":"In this paper, we propose a novel model for text document clustering. Usually, Text documents consist of a vast number of features. We selected important features through four methods term variance, document frequency, Latent Dirichlet Allocation, and Significance methods. We demonstrated the effectiveness of proposed model on 20NG and WebKB datasets which are publicly available. We evaluated the model with F-Score value. Results indicate that LDA performed best in capturing the discriminate features.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116630988","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}
引用次数: 3
Optimal Algorithms for Min-Closed, Max-Closed and Arc Consistency over Connected Row Convex Constraints 连通行凸约束上最小闭、最大闭和弧一致性的最优算法
Compute Pub Date : 2017-11-16 DOI: 10.1145/3140107.3140110
Shubhadip Mitra, P. Dutta, Arnab Bhattacharya
{"title":"Optimal Algorithms for Min-Closed, Max-Closed and Arc Consistency over Connected Row Convex Constraints","authors":"Shubhadip Mitra, P. Dutta, Arnab Bhattacharya","doi":"10.1145/3140107.3140110","DOIUrl":"https://doi.org/10.1145/3140107.3140110","url":null,"abstract":"A key research interest in the area of Constraint Satisfaction Problems (CSP) is to identify tractable classes of constraints and develop efficient algorithms for solving them. In this paper, we propose an optimal algorithm for solving r-ary min-closed and max-closed constraints. Assuming r = O(1), our algorithm has an optimal running time of O(ct) where c and t are the number of constraints and the maximum size of any constraint, respectively. This significantly improves the existing pairwise consistency based algorithm that takes O(c2t2) time. Moreover, for (binary) connected row convex (CRC) constraints, we design an optimal algorithm for arc consistency that runs in O(cd) time where d is the largest size of any domain. This again improves upon the existing O(cd2) algorithms. This, in turn, leads to a faster algorithm for solving CRC constraints. We also show how our solutions can be applied to determine problems in large distributed IT systems. The experimental evaluation shows that the proposed algorithms are several orders of magnitudes faster than the state-of-the-art algorithms.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129023397","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
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学术官方微信
小红书