Mehrad Ghorbani Moghaddam, E. F. Ersi, Abedin Vahedian
{"title":"Froth Flotation Classification of Antimony Based on Histogram of Bubbles Perimeters","authors":"Mehrad Ghorbani Moghaddam, E. F. Ersi, Abedin Vahedian","doi":"10.1109/ICCKE.2018.8566387","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566387","url":null,"abstract":"The process of flotation is one of the most complex industrial processes for purifying minerals, and the control of flotation process is one of the most challenging issues in the mineral processing industry. This paper describes a method based on machine vision system to classify different grades of Antimony during the floatation process. It is proved that the size of bubbles provides valuable information about froth flotation process. The proposed machine vision system, after collecting froth flotation images of Antimony, segments each image bubbles with Extended-Maxima transform method and creates a descriptor based on bubbles perimeters. Based on different grades of Antimony, images are divided in to four classes. To classify Antimony froth images, the created descriptors are assigned to a classifier like support vector machine. The proposed method is used in an Antimony flotation cell, and results shows that it is able to classify froth images based on Antimony's concentrate grade with acceptable accuracy. The experimental results indicate that this method can classify froth flotation images better than some common methods like GLCM and CCM.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126959998","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}
{"title":"A Scalable Method for One-Mode Projection of Bipartite Networks Based on Hadoop Platform","authors":"Mahsa Asadi, Nasser Ghadiri, M. Nikbakht","doi":"10.1109/ICCKE.2018.8566259","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566259","url":null,"abstract":"People look for models and methods to organize, classify, compress and filter the information due to the difficulty in maintenance and using immense sources of information. The bipartite graphs are particularly useful among the variety of presenting methods such as recommender systems. Most of the bipartite networks tend to cluster one side of graph behavior to recognize communications and interactions between members of that side and discover similar members. The one-mode projection technique is widely used for this purpose. However, parts of the primary information of the original bipartite graph is missed under the projection. So we need to exploit a method for determining the weights that yield projected edges in a way that minimizes information loss. While such methods exist, the majority of investigated databases in the field of bipartite network projection are huge, consequently, executing a projection procedure takes lots of times. In this paper, we propose a scalable method based on resource allocation for bipartite network projection. It provides a high performance while preserving precision through transferring the needed operations on a distributed platform like Hadoop. Moreover, as a case study, we evaluate the performance of the presented scalable algorithm in the field of social network which results in short projection operation time in comparison to the undistributed mode. Also, we compared our proposed method with a collaborative filtering method, a well-known algorithm in the recommendation field and as a result, our method had higher overall execution speed. With using the largest dataset of our experiments, the Orkut dataset, the proposed method has higher speed than the scalable CF by 33 %. Then, we evaluate the scalability of the introduced method by a scalability metric namely Speedup, which showed good scalability.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"112 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126149861","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}
{"title":"Data Driven Identification of Factors Affecting the Job Satisfaction of Programmers","authors":"S. Teimouri, Hossein Amirkhani","doi":"10.1109/ICCKE.2018.8566327","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566327","url":null,"abstract":"In this paper, the factors affecting the programmers' job satisfaction are investigated. We use the recent questionnaire by the StackOverflow team containing 153 questions with more than 50,000 samples from 213 different countries. After some preprocessing, a dataset containing 40,377 samples with 77 factors is prepared. The importance of different factors on job satisfaction are investigated using five different methods including random forest, linear regression, light GBM, correlation analysis, and a hand-designed variance based technique. Finally, different ordered lists obtained by these methods are aggregated using the Borda count algorithm. The results show that factors like career satisfaction, job seeking status, developer type, hours per week to find a new job, and salary are among the most influential factors on programmers' job satisfaction.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124444667","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}
{"title":"Persian Plagirisim Detection Using CNN s","authors":"S. Lazemi, H. Ebrahimpour-Komleh, N. Noroozi","doi":"10.1109/ICCKE.2018.8566340","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566340","url":null,"abstract":"The abundant and growing amount of scientific-research works and the ease of access to them has caused some abusive exploits from jobber people and illicit use of them in scientific and academic environments. “Plagiarism” refers to the use of scientific-research works by others without reference to them correctly. Due to the rapid growth of Persian electronic resources, this paper considers the plagiarism detection in Persian texts. Plagiarism detection consists of two distinct steps: Candidate Retrieval and Text Alignment. The focus of our proposed method is on both steps. In the first step, using a Convolutional Neural Network (CNN), a vector representation is created in document-level and then, the candidate documents are retrieved using the k-means clustering algorithm. In order to align text, the features are extracted at the sentence-level using a CNN. Finally, using the classification algorithms, the copied sentences are detected. Experiments were performed on the prepared corpus in the AAI competition and the prepared corpus in the PAN2015 competition. The achieved precision and recall are 0.843 and 0.806 for the first corpus and 0.833 and 0.826 for the second one respectively.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131543870","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}
{"title":"Designing a Light-Weighted Multi-Class and Novel Multiple Logical Fuzzy Controller to Manage Intelligent Urban Traffic","authors":"K. Saedi, Amir Hossein Mohajcrzadeh","doi":"10.1109/ICCKE.2018.8566565","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566565","url":null,"abstract":"Intelligent urban traffic management is one the essential needs of metropolises. Several fundamental requirement must be considered in intelligent traffic management systems including waiting time in queue, congestion control, travel time reduction, prioritizing emergency vehicles and decrease in air pollutions. Achieving these goals with maximal coverage is one of the significant challenges in traffic management systems. Regarding broad and dynamic nature of traffic conditions, related studies lacks designing a comprehensive intelligent traffic management protocol with low computational complexity and cost. Therefore, an exclusive and severe attempt should be made so as to resolve these issues and challenges. This paper aims at addressing an intelligent low cost protocol with low computational cost for traffic management. A hierarchical multilayer fuzzy system is utilized, so as to compute green period and to prioritize different traffic signal phase which results in great decrease of rules in related database as well as computational complexity.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132229000","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}
Nasim Alikhani, V. Moghtadaiee, A. M. Sazdar, S. Ghorashi
{"title":"A Privacy Preserving Method for Crowdsourcing in Indoor Fingerprinting Localization","authors":"Nasim Alikhani, V. Moghtadaiee, A. M. Sazdar, S. Ghorashi","doi":"10.1109/ICCKE.2018.8566402","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566402","url":null,"abstract":"Localization services have gained popularity in recent years to facilitate the daily lives of users. With increasing people desire to use Location Based Services (LBSs), the privacy of users has become critical. Most of these services thus use an anonymizer between Location Service Provider (LSP) and the user to protect the user's identity from LSP. One of the localization techniques in indoor environments is Wi-Fi based location fingerprinting which uses received signal strengths (RSSs) at different locations. In this paper, we propose a method to preserve the privacy of users from anonymizer. Hilbert curve and double encryption technique are used. The simulation results indicate that by using the proposed privacy preserving method, the level of privacy preserving is increased.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123495075","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}
{"title":"A Novel Approach for Automation of Smart Homes, Based on Internet of Things, Using Fuzzy Ontology","authors":"Milad Lesani, M. Naderan, S. E. Alavi","doi":"10.1109/ICCKE.2018.8566677","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566677","url":null,"abstract":"The number of intelligent devices that are able to connect to the Internet and create networks to communicate with each other is increasing every day. These devices and networks are called Internet of Things (IoT). These networks usually contain wireless sensors. In addition to heterogeneity of these devices, formats of their data, measurement methods, data management and interoperability are the main challenges of these networks. On the other hand, semantic technology and ontology can address some of these challenges, and provide capabilities such as management, queries, and combining sensors and observed data. The current ontology structure is not capable of working with fuzzy or implicit information that are found in numerous application domains. In this paper, a fuzzy ontology for semantic sensor networks is proposed to automate smart homes based on Semantic Sensor Networks (SSN), which has the following phases: first, using the WordNet ontology, the location and type of objects is identified. Then, using a graphical interface, information other than location and type of object are delivered, if necessary. Next, the object and its synonyms are saved in a list, and it is added to the list known objects set. In the next phase, the relation of the object with other groups is assessed based on the similarity measure using the fuzzy ontology, and finally, this is done according to three measures of temperature humidity and light and for the dependency function of each measure. The performance and accuracy of the system is compared to two existing works, and it is shown that the proposed method outperforms them in terms of the consumed water, gas and electricity.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117245188","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}
{"title":"Effective Realization of Ternary Logic Circuits by Adapted Map Minimization Method","authors":"Elham Darvish, R. F. Mirzaee","doi":"10.1109/ICCKE.2018.8566541","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566541","url":null,"abstract":"This paper is dedicated to the circuit realization and synthesis of two-variable ternary functions. The new method makes amendments to some existing techniques, and puts them together for the systematic design of arbitrary ternary functions. An adapted ternary map method and a transistor mapping table are suggested. Some examples are provided to compare the new synthesis approach with the previous techniques. They show how effective the proposed method is.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124348251","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}
Arghavan Mohammad Hassani, Morteza Rezaalipour, M. Dehyadegari
{"title":"A Novel Ultra Low Power Accuracy Configurable Adder at Transistor Level","authors":"Arghavan Mohammad Hassani, Morteza Rezaalipour, M. Dehyadegari","doi":"10.1109/ICCKE.2018.8566643","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566643","url":null,"abstract":"Low power consumption, nowadays, has emerged to be an indispensable factor as there is a growing demand for designing efficient computation-intensive systems and integrating more transistors on chips. With a trade-off between area, delay, power consumption, and accuracy, approximate computing has become a promising solution to address the power efficiency problem for error-tolerant applications such as digital signal processing. Adders are imperative arithmetic components in the applications above. As adder participates in the critical path of most systems, reducing the power consumption of them can contribute to the total system power efficiency. To achieve high flexibility and less fault occurrence when using approximate computation, reconfigurable addition can be beneficial by providing different modes of approximate and accurate operations in multi-bit adder circuits. In this paper, we propose a 16-transistor accurate full adder design based on a 10-transistor full adder for which the threshold loss problem, has been reduced to increase the output voltage swing. This 16-transistor full adder is our baseline for the further proposed configurable bimodal design, which functions as a Lower-part-OR (LOA) Adder in the approximate mode. Having been optimized at transistor level, this configurable bimodal full adder, in the approximate mode, consumes 53% lower power than LOA adder. Moreover, in the accurate mode, the power consumption is reduced by 12% compared to its baseline 16-transistor accurate design.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115922115","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}
Seyedeh Somayyeh Mousavi, Mohammad Hemmati, M. Charmi, Maryam Moghadam, M. Firouzmand, Yadollah Ghorbani
{"title":"Cuff-Less Blood Pressure Estimation Using Only the ECG Signal in Frequency Domain","authors":"Seyedeh Somayyeh Mousavi, Mohammad Hemmati, M. Charmi, Maryam Moghadam, M. Firouzmand, Yadollah Ghorbani","doi":"10.1109/ICCKE.2018.8566583","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566583","url":null,"abstract":"The relationship between the heart's electrical and mechanical activities is expressed by Mechano-Electric Coupling (MEC) term, and blood pressure (BP) is the output of these activities. Electrocardiogram (ECG) is a representation of heart's electrical activity. Previous studies show that there is a nonlinear relationship between the ECG signal and BP values. This paper presents a new algorithm for estimating BP using only the ECG signal and without any cuff. A new feature vector extraction method in the frequency domain, called the frequency whole-based method, is proposed. According to the British Hypertension Society (BHS) standards, the proposed algorithm achieves grade B for the Diastolic Blood Pressure (DBP) and grade C for Mean Atrial Blood Pressure (MAP) estimations on MIMIC II dataset.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124212812","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}