2016 International Conference on Informatics and Computing (ICIC)最新文献

筛选
英文 中文
Bull sperm motility measurement using improved matching-based algorithm and ellipse detection 基于改进匹配算法和椭圆检测的公牛精子活力测量
2016 International Conference on Informatics and Computing (ICIC) Pub Date : 1900-01-01 DOI: 10.1109/IAC.2016.7905689
Priyanto Hidayatullah, Iwan Awaludin, Akbar, E. Sukmawati, Dwi Utami, M. Nuriyadi
{"title":"Bull sperm motility measurement using improved matching-based algorithm and ellipse detection","authors":"Priyanto Hidayatullah, Iwan Awaludin, Akbar, E. Sukmawati, Dwi Utami, M. Nuriyadi","doi":"10.1109/IAC.2016.7905689","DOIUrl":"https://doi.org/10.1109/IAC.2016.7905689","url":null,"abstract":"Based on Indonesian standard in measuring bull sperm quality, motility is the most important parameter. Sperm motility can be measured manually by medical veterinarian or using Computer Aided Sperm Analysis (CASA) system. Measuring bull sperm motility manually is the most popular method nevertheless it is often subjective and high variability. CASA gives consistent results, hence it is an expensive system. Therefore an alternative method is required. In this paper, we proposed a method to measure bull sperm motility using improved matching-based algorithm and ellipse detection. The image samples were taken using multimedia microscope. Compared with the manual assessment by medical veterinarians, the proposed method gives the smallest average margin of 2.3% on 60 fps videos and the largest of 3.5% in the videos with 30 fps frame rate which surpassed the previous method results.","PeriodicalId":404904,"journal":{"name":"2016 International Conference on Informatics and Computing (ICIC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127509362","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
A soft set approach for fast clustering attribute selection 一种快速聚类属性选择的软集方法
2016 International Conference on Informatics and Computing (ICIC) Pub Date : 1900-01-01 DOI: 10.1109/IAC.2016.7905681
D. Hartama, I. R. Yanto, M. Zarlis
{"title":"A soft set approach for fast clustering attribute selection","authors":"D. Hartama, I. R. Yanto, M. Zarlis","doi":"10.1109/IAC.2016.7905681","DOIUrl":"https://doi.org/10.1109/IAC.2016.7905681","url":null,"abstract":"Attribute-based data clustering has been proven as one of the efficient methods in data clustering. Set theory approaches for data clustering exist to handle attribute-based data clustering. The MDDS, a soft set based technique has proven its applicability in data clustering. However, in reviewing MDDS, where its calculations are based on comparing all constructed multi-soft sets, it still suffers from high computational time. This research presents a modification of the MDDS by generating an alternative technique to reduce its computational complexity. To provide alternative solutions from MDDS algorithm, we derive a new algorithm that can lesser response time. It is using theory of soft set by selecting and excluding the set having no effect domination on other sets. The experiments are implemented in MATLAB software thought to UCI benchmark datasets. The computation experiment illustrate that the time response can be speed up to 67.56 % by proposed algorithm compared with MDDS.","PeriodicalId":404904,"journal":{"name":"2016 International Conference on Informatics and Computing (ICIC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132479269","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
A proposed combination of photogrammetry, Augmented Reality and Virtual Reality Headset for heritage visualisation 建议结合摄影测量、增强现实和虚拟现实耳机进行遗产可视化
2016 International Conference on Informatics and Computing (ICIC) Pub Date : 1900-01-01 DOI: 10.1109/IAC.2016.7905687
Edson Yahuda Putra, A. Wahyudi, Charlie Dumingan
{"title":"A proposed combination of photogrammetry, Augmented Reality and Virtual Reality Headset for heritage visualisation","authors":"Edson Yahuda Putra, A. Wahyudi, Charlie Dumingan","doi":"10.1109/IAC.2016.7905687","DOIUrl":"https://doi.org/10.1109/IAC.2016.7905687","url":null,"abstract":"Along with the development, Augmented Reality technology has been implemented in various areas. Augmented Reality has also been widely applied to preserve the historical heritage. This paper discusses our research that combines some of the latest technology. This study was initiated on the reconstruction of the 3D scanning using photogrammetry techniques, incorporation of multimedia elements, and 3D models displayed using Augmented Reality by using Virtual Reality Headset devices to maximize the experience of the user. This paper describes the methods and techniques used in collecting the data and providing innovation in the visualization of cultural heritage. The result is the system can provide new experiences for users and a good 3D visualisation.","PeriodicalId":404904,"journal":{"name":"2016 International Conference on Informatics and Computing (ICIC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133008280","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}
引用次数: 23
Detecting most central actors of an unknown network using friendship paradox 利用友谊悖论检测未知网络的大多数核心角色
2016 International Conference on Informatics and Computing (ICIC) Pub Date : 1900-01-01 DOI: 10.1109/IAC.2016.7905742
S. M. Alam, N. Islam, M. S. Hosain
{"title":"Detecting most central actors of an unknown network using friendship paradox","authors":"S. M. Alam, N. Islam, M. S. Hosain","doi":"10.1109/IAC.2016.7905742","DOIUrl":"https://doi.org/10.1109/IAC.2016.7905742","url":null,"abstract":"Most central people have more influence on business communication, knowledge diffusion, viral marketing and some other fields over other persons in a social network. Networks for which digital information is available such as email communication, phone call etc., one can easily find central actors using social network analysis tools. But for networks where no such information is available, for example farmers in a remote village, secret networks of a criminal organization etc., finding central actors is challenging. We call such network as unknown network. In this research, we have propose a method based on the idea of friendship paradox (FP) to find the most prominent actors from an unknown network. Extensive simulation results demonstrate that our method finds the most centrals by exploring only a small population of an unknown social network with a high accuracy.","PeriodicalId":404904,"journal":{"name":"2016 International Conference on Informatics and Computing (ICIC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133442650","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
The design and preliminary implementation of low-cost brain-computer interface for enable moving of rolling robot 低成本滚动机器人移动脑机接口的设计与初步实现
2016 International Conference on Informatics and Computing (ICIC) Pub Date : 1900-01-01 DOI: 10.1109/IAC.2016.7905730
S. Hadi, A. Sholahuddin, Lanny Rahmawati
{"title":"The design and preliminary implementation of low-cost brain-computer interface for enable moving of rolling robot","authors":"S. Hadi, A. Sholahuddin, Lanny Rahmawati","doi":"10.1109/IAC.2016.7905730","DOIUrl":"https://doi.org/10.1109/IAC.2016.7905730","url":null,"abstract":"We introduce the design and preliminary implementation of low-cost brain-computer interface (BCI) to enable movement of a rolling robot. This system will accept and execute basic commands that are generated from three brain condition normal, relax, or happy. The brain condition is determined by brainwaves known as alpha, beta, and gamma waves. The brainwaves are detected using Mindflex, connected with Arduino Uno, and sent data transmission to computer via USB connection. Algorithm is developed using Matlab to analyze the data and send three simple commands to a rolling robot through Wi-Fi connection. We conducted experiment for fifty times using 100 data for training and 50 data for testing, and obtained 62% of accuracy. This result shows that brainwave commands can be processed successfully for forward, turn left, and turn right movements. We have concluded that the system can be developed further to assist disabilities performing motions using their minds.","PeriodicalId":404904,"journal":{"name":"2016 International Conference on Informatics and Computing (ICIC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133811825","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
Ontology Alignment using combined similarity method and matching method 结合相似度法和匹配法的本体对齐
2016 International Conference on Informatics and Computing (ICIC) Pub Date : 1900-01-01 DOI: 10.1109/IAC.2016.7905722
Didih Rizki Chandranegara, R. Sarno
{"title":"Ontology Alignment using combined similarity method and matching method","authors":"Didih Rizki Chandranegara, R. Sarno","doi":"10.1109/IAC.2016.7905722","DOIUrl":"https://doi.org/10.1109/IAC.2016.7905722","url":null,"abstract":"Ontology Alignment or Ontology Matching is used to identify entities contained in two ontologies or more, that have similar or matching. Ontology Alignment can determine a relationship between two ontologies or more. There has been several tools that can be used for Ontology Alignment. Ontology Alignment is widely use in finding similar entities in bibliography created by Bibtex and IFLA (International Federation of Library Associations and Institutions). Bibliography is writing in detail about the identity of an article such as books and journals. It is very important to know the differences and similarities between Bibliography format. It aims when changing one format Bibliography to another format should not change the overall. In this research, we combine several similarity methods and Brute Force String matching method to produce a better Ontology Alignment result. The results showed that the proposed method outperform the previous method. And the results of Ontology Alignment showed that between Ontology BibTex and IFLA has a relationship. This is evidenced by several entities of both Ontology are matching.","PeriodicalId":404904,"journal":{"name":"2016 International Conference on Informatics and Computing (ICIC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117041098","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 framework of training ANFIS using Chicken Swarm Optimization for solving classification problems 基于鸡群算法的ANFIS分类训练框架
2016 International Conference on Informatics and Computing (ICIC) Pub Date : 1900-01-01 DOI: 10.1109/IAC.2016.7905759
Roslina, M. Zarlis, I. R. Yanto, D. Hartama
{"title":"A framework of training ANFIS using Chicken Swarm Optimization for solving classification problems","authors":"Roslina, M. Zarlis, I. R. Yanto, D. Hartama","doi":"10.1109/IAC.2016.7905759","DOIUrl":"https://doi.org/10.1109/IAC.2016.7905759","url":null,"abstract":"The result of training parameters described Adaptive Neuro-Fuzzy Inference System (ANFIS) performance. The speed and reliability of training effect depend on the training mechanism. There have been many methods used to train the parameters of ANFIS as using GD, metaheuristic techniques, and LSE. But there are still many methods developed to achieve efficiently. One of the proposed algorithm to improve the performance of ANFIS is Chicken swarm optimization (CSO) algorithm. The experimental results of training ANFIS network for classification problems show that ANFIS-CSO algorithm achieved better accuracy.","PeriodicalId":404904,"journal":{"name":"2016 International Conference on Informatics and Computing (ICIC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114545224","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
Current state of personal data protection in electronic voting: Demand on Legislature's Bill 电子投票中个人资料保护的现状:对立法机关条例草案的要求
2016 International Conference on Informatics and Computing (ICIC) Pub Date : 1900-01-01 DOI: 10.1109/IAC.2016.7905721
M. Lubis, M. Kartiwi, Sonny Zulhuda
{"title":"Current state of personal data protection in electronic voting: Demand on Legislature's Bill","authors":"M. Lubis, M. Kartiwi, Sonny Zulhuda","doi":"10.1109/IAC.2016.7905721","DOIUrl":"https://doi.org/10.1109/IAC.2016.7905721","url":null,"abstract":"The strongest benefit has been offered for the implementation of electronic voting related to cost and time reduction. Therefore, recent publicity concerning the reliability, security and privacy issue of various e-voting systems has increased public scrutiny of the machines themselves as well as the election process as a whole. In the greater scale, it could reduce public confidence to entrust the adoption of e-voting system to augment participation rate, to improve the quality of voting and to aid the political right effectively and efficiently. This paper aims to provide general analysis of typical legal issues and its demand for personal data protection based on demographic data such as gender, age, occupation, electoral participation, education, earnings and legal literacy. By understanding the perception of voters in viewing current electoral regulation are essential to provide some insights and suggestion for better improvement, either through drafting or enforcing legislation. This study investigates the tendency of people in demanding the legislative to cater electronic voting.","PeriodicalId":404904,"journal":{"name":"2016 International Conference on Informatics and Computing (ICIC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126910790","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
Recurrent neural network with Extended Kalman Filter for prediction of the number of tourist arrival in Lombok 基于扩展卡尔曼滤波的递归神经网络预测龙目岛旅游人数
2016 International Conference on Informatics and Computing (ICIC) Pub Date : 1900-01-01 DOI: 10.1109/IAC.2016.7905712
A. Rizal, S. Hartati
{"title":"Recurrent neural network with Extended Kalman Filter for prediction of the number of tourist arrival in Lombok","authors":"A. Rizal, S. Hartati","doi":"10.1109/IAC.2016.7905712","DOIUrl":"https://doi.org/10.1109/IAC.2016.7905712","url":null,"abstract":"Tourism has become a major sector for economic development on Lombok. Tourist expenditure in Lombok give a good implications on public revenue. Tourist expenditures are not only distributed to the tourism sector, but also to other sectors. Prediction of tourists visit is very important as an information and planning for the future. Prediction is one of very important element in decision, because the effectiveness of the decision generally depends on several factors in present and past. This research tries to predict tourist arrival by examining time-series data on tourist arrival in Lombok by using Recurrent Neural Network with a training algorithm Extended Kalman Filter. Based on the accuracy of prediction in the data testing, this method are good for predicting time series data. The best result of the prediction in the data testing showed MSE value is 0.052232 with the accuracy of the prediction is 86.059 %.","PeriodicalId":404904,"journal":{"name":"2016 International Conference on Informatics and Computing (ICIC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127043688","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}
引用次数: 11
Knowledge management readiness of research agencies: A case of BATAN Indonesia 研究机构的知识管理准备:以BATAN Indonesia为例
2016 International Conference on Informatics and Computing (ICIC) Pub Date : 1900-01-01 DOI: 10.1109/IAC.2016.7905693
A. Hedar, D. I. Sensuse, P. Sandhyaduhita
{"title":"Knowledge management readiness of research agencies: A case of BATAN Indonesia","authors":"A. Hedar, D. I. Sensuse, P. Sandhyaduhita","doi":"10.1109/IAC.2016.7905693","DOIUrl":"https://doi.org/10.1109/IAC.2016.7905693","url":null,"abstract":"Research institutions typically rely heavily on the ability and performance of researchers who may works within various disciplines. As the current researchers are aging and will retire at some point in time, the institutions must have prepared their junior researchers to continue the research work. Previous literatures have proposed and defined the concept of Knowledge Management (KM) in order to meet the goal. However, the implementation of KM in an organization is not easy. The initial step is to take measurements of the degree of readiness of the organization to implement a detailed and comprehensive KM. Thus, this study is to assess KM readiness level of BATAN, a research institution in Indonesia. The KM readiness framework was validated by 3 experts, weighted by 8 experts using the Analytical Hierarchical Process (AHP) and processed using 151 respondent data. The analysis showed that KM readiness in BATAN has reached level 4 (receptive) which means BATAN is ready to implement KM.","PeriodicalId":404904,"journal":{"name":"2016 International Conference on Informatics and Computing (ICIC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121943148","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
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学术官方微信