2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)最新文献

筛选
英文 中文
Simple recurrent network in real time astrocyte 星形胶质细胞实时简单循环网络
Bassam Abdul-Rahman Abed, A. R. Ismail, Normaziah Abdul Aziz
{"title":"Simple recurrent network in real time astrocyte","authors":"Bassam Abdul-Rahman Abed, A. R. Ismail, Normaziah Abdul Aziz","doi":"10.1109/INISTA.2015.7276765","DOIUrl":"https://doi.org/10.1109/INISTA.2015.7276765","url":null,"abstract":"In this paper we propose simple recurrent network (SRN) and mathematical paradigm to model real time interaction of astrocyte in simplified spiking neural network (SRM0). Both Elman neural network and Jordan neural network are used in the proposed network. Elman neural network is connected to the synapse and Jordan neural network is connected to the postsynaptic neuron in tripartite synapse, the simulation results showed that whenever astrocytes were activating in a time window, more spikes will be fired for excitatory neurons. This is biologically justified since astrocytes induce excitability with variations in Ca2+ concentrations.","PeriodicalId":136707,"journal":{"name":"2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126079120","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
Automated highway lane changes of long vehicle combinations: A specific comparison between driver model based control and non-linear model predictive control 公路长车辆组合自动变道:基于驾驶员模型的控制与非线性模型预测控制的具体比较
Peter Nilsson, L. Laine, N. V. Duijkeren, B. Jacobson
{"title":"Automated highway lane changes of long vehicle combinations: A specific comparison between driver model based control and non-linear model predictive control","authors":"Peter Nilsson, L. Laine, N. V. Duijkeren, B. Jacobson","doi":"10.1109/INISTA.2015.7276790","DOIUrl":"https://doi.org/10.1109/INISTA.2015.7276790","url":null,"abstract":"This paper compares the vehicle dynamics performances of two approaches for automated lane change manoeuvres of a long vehicle combination in simulated highway driving. One of the two approaches is a non-linear model predictive controller (NMPC), and the other is based on driver model control (DMC) theory. Both approaches utilize traffic situation predictions that include motion variable constraints and actuation requests for steering, propulsion and braking. The two automated driving approaches are compared in a simulation environment including a high-fidelity vehicle plant model and models of surrounding vehicles. Simulations show that both approaches can generate feasible lane change manoeuvres at the constant speeds of 44 and 78 km/h. In addition, lane changes were successfully conducted in combination with retardation due to leading vehicle braking from 80 to 50 km/h with a varying retardation range of 0.1-0.7 g. In general, the non-linear model predictive control shows a shorter lane change duration and lower values of the used absolute magnitude of the longitudinal and lateral accelerations. However, the specific objective function used in the NMPC leads to an unnecessary variation of longitudinal vehicle speed compared to the driver model control approach.","PeriodicalId":136707,"journal":{"name":"2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125520124","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
CannySR: Using smart routing of edge drawing to convert Canny binary edge maps to edge segments canysr:使用边缘绘制的智能路由将Canny二进制边缘映射转换为边缘段
C. Akinlar, Edward Chome
{"title":"CannySR: Using smart routing of edge drawing to convert Canny binary edge maps to edge segments","authors":"C. Akinlar, Edward Chome","doi":"10.1109/INISTA.2015.7276784","DOIUrl":"https://doi.org/10.1109/INISTA.2015.7276784","url":null,"abstract":"Canny Edge Detector is the most widely used operator for edge detection. The problem with Canny is that it outputs a binary edge map, where an edge pixel (edgel) is marked (e.g., its value in the edge map is 255) and a non-edge pixel is unmarked (e.g., its value in the edge map is 0). A typical binary edge map is of low quality, consisting of gaps, notch-like structures, ragged and multi-pixel wide edgels. To clean up Canny's binary edge maps, fill up one pixel-wide gaps between the edgels, and to return the map as a set of edge segments, each of which is a one-pixel wide, contiguous chain of pixels, we employ the Smart Routing (SR) algorithm from our recently proposed Edge Segment Detection Algorithm, the Edge Drawing (ED). The proposed algorithm, called Canny Smart Routing (CannySR), runs Canny to obtain a binary edge map, and uses the Canny edgels as anchors for SR to convert them to edge segments. The produced edge segments can then be used in many applications such as line, arc, circle, ellipse, corner detection and other similar higher level object detection applications. We qualitatively evaluate the effectiveness of the proposed algorithm on some sample images and conclude that CannySR visibly improves the modal quality of Canny's binary edge maps although ED seems to produce the best results.","PeriodicalId":136707,"journal":{"name":"2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125823333","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}
引用次数: 24
A novel classifier based on meaning for text classification 一种基于语义的文本分类器
M. Ganiz, Melike Tutkan, S. Akyokuş
{"title":"A novel classifier based on meaning for text classification","authors":"M. Ganiz, Melike Tutkan, S. Akyokuş","doi":"10.1109/INISTA.2015.7276788","DOIUrl":"https://doi.org/10.1109/INISTA.2015.7276788","url":null,"abstract":"Text classification is one of the key methods used in text mining. Generally, traditional classification algorithms from machine learning field are used in text classification. These algorithms are primarily designed for structured data. In this paper, we propose a new classifier for textual data, called Supervised Meaning Classifier (SMC). The new SMC classifier uses meaning measure, which is based on Helmholtz principle from Gestalt Theory. In SMC, meaningfulness of terms in the context of classes are calculated and used for classification of a document. Experiment results show that new SMC classifier outperforms traditional classifiers of Multinomial Naïve Bayes (MNB) and Support Vector Machine (SVM) especially when the training data limited.","PeriodicalId":136707,"journal":{"name":"2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127968702","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
Tag SNP selection using similarity associations between SNPs 使用SNP之间的相似性关联进行标签SNP选择
Uhan Ilhan, G. Tezel, Cengiz Özcan
{"title":"Tag SNP selection using similarity associations between SNPs","authors":"Uhan Ilhan, G. Tezel, Cengiz Özcan","doi":"10.1109/INISTA.2015.7276793","DOIUrl":"https://doi.org/10.1109/INISTA.2015.7276793","url":null,"abstract":"Genetic changes that may be associated with complex diseases are tried to be determined by means of many genome-wide association studies. Single Nucleotide Polymorphisms (SNPs) are used primarily in these studies since they comprise a large part of these genetic changes. Statistical importance of the genome-wide association study is directly related to the number of individuals and SNPs. However, it is still very costly and time-consuming to genotype all SNPs inside the candidate area for many individuals in very large-scale association studies. For this reason, with a small error, it is necessary to select an appropriate subset of all SNPs that will represent the rest of SNPs. These selected SNPs are called tag SNPs or haplotype tag SNPs (tag SNPs or htSNPs). It is essential in tag SNP selection to determine minimum tag SNP set with very good prediction accuracy. In this study, while Clonal Selection Algorithm (CLONALG) was used as tag SNP selection method, a new method named CLONSim, in which similarity association between SNPs was used as the prediction method for the rest of SNPs was proposed. The proposed method was compared with BPSO (Binary Particle Swarm Optimization) and CLONTagger methods with parameter optimization using datasets of different sizes. Experiment results showed that the proposed method could identify tag SNPs significantly faster.","PeriodicalId":136707,"journal":{"name":"2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129658020","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
Prediction for the solid waste composition by use of different curve fitting models: A case study 利用不同曲线拟合模型预测固体废物成分:一个案例研究
Kemal Özkan, Ş. Işık, A. Ozkan, M. Banar
{"title":"Prediction for the solid waste composition by use of different curve fitting models: A case study","authors":"Kemal Özkan, Ş. Işık, A. Ozkan, M. Banar","doi":"10.1109/INISTA.2015.7276744","DOIUrl":"https://doi.org/10.1109/INISTA.2015.7276744","url":null,"abstract":"This study presents a methodology for the prediction of solid waste composition in the urban area based on a set of limited samples. The methodology was applied by a case study for Eskişehir city in Turkey. For this purpose, Municipal Solid Waste (MSW) samples were collected for one year according to socioeconomic structure of districts. MSW samples were separated mainly into five groups of: paper-cardboard, metals, glass, plastics and food wastes as manually. The 75% of the values for each group were used as train data sets and the remains were used as test sets considering to income levels and population. It was used different curve fitting models for training of data and obtained different equations (power, exponential and polynomial) from the models. These equations were used for prediction of test sets and real values and test results were compared. Prediction accuracies were determined and interpreted according to different goodness of measurement values. It was seen that the effect of income level and population on waste composition from the degree of accuracy of this model is very important.","PeriodicalId":136707,"journal":{"name":"2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124054050","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
Temporal planning in terms of a fuzzy integral logic (FLI) versus temporal planning in PDDL 基于模糊积分逻辑的时间规划与基于PDDL的时间规划
K. Jobczyk, A. Ligeza
{"title":"Temporal planning in terms of a fuzzy integral logic (FLI) versus temporal planning in PDDL","authors":"K. Jobczyk, A. Ligeza","doi":"10.1109/INISTA.2015.7276776","DOIUrl":"https://doi.org/10.1109/INISTA.2015.7276776","url":null,"abstract":"This paper presents a comparative analysis of expressive power of PDDL and its known extensions versus a language of a Fuzzy Logic for Integrals (as a far extension of Łukasiewicz logic) with respect to some components of temporal planning. This comparative perspective is determined not only by the problem of the representation of planning objects, actions and preferences, but also by some ability of both languages to express the plan construction.","PeriodicalId":136707,"journal":{"name":"2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121926939","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
Ubiquitous community driven traffic analysis 无处不在的社区驱动的流量分析
Fábio Silva, António D. Costa, P. Novais, Cesar Analide
{"title":"Ubiquitous community driven traffic analysis","authors":"Fábio Silva, António D. Costa, P. Novais, Cesar Analide","doi":"10.1109/INISTA.2015.7276792","DOIUrl":"https://doi.org/10.1109/INISTA.2015.7276792","url":null,"abstract":"The availability data sources is increasing thanks to the rise of interconnected devices with sensory capabilities. Their use, has also become predominant in tasks that are not directly related with the devices' primary function or for which they may not even be designed for. Taking in consideration the act of driving, this research shows how through a composition of theories and services with these connected devices, it is possible to monitor and profile drivers performance and the generate community knowledge that can be used for the creation of user notification and warning systems. Thanks to the composition of theories from ubiquitous sensorization, machine learning, and communications it possible to design a general platform based on ubiquitous devices that generate information and models about each user behaviour individually and in communities around specific locations. This helps the improvement of not only performance but also security. Sensorization of large communities of users enrolled in driving activities can generate useful knowledge to the community. This article explores ubiquitous sensorization over the PHESS Driving platform to create reliable information that can be shared between users based on communication opportunity and location.","PeriodicalId":136707,"journal":{"name":"2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132424787","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
Determining MUAP activity corridor in scanning EMG recordings 在扫描肌电记录中确定MUAP活动走廊
N. T. Artug, I. Goker, B. Bolat, M. Baslo, O. Osman
{"title":"Determining MUAP activity corridor in scanning EMG recordings","authors":"N. T. Artug, I. Goker, B. Bolat, M. Baslo, O. Osman","doi":"10.1109/INISTA.2015.7276766","DOIUrl":"https://doi.org/10.1109/INISTA.2015.7276766","url":null,"abstract":"In scanning EMG recordings there are more than one motor unit activity which is recorded by concentric needle electrode. Especially for determining features of a motor unit action potential (MUAP) such as phase duration and number of peaks easily, first the other motor unit activities must be discarded. In this study a new method is proposed to determine the activity corridor that related with the motor unit to be examined in scanning EMG recordings. This method is comprised of wavelet transform based noise reduction and autocorrelation function based location detection. Number of 34 scanning EMG recordings was tested by using this method and the activity corridors were determined correctly.","PeriodicalId":136707,"journal":{"name":"2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128757916","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
New gradient features for off-line handwritten signature verification 新的梯度功能离线手写签名验证
Yasmine Serdouk, H. Nemmour, Y. Chibani
{"title":"New gradient features for off-line handwritten signature verification","authors":"Yasmine Serdouk, H. Nemmour, Y. Chibani","doi":"10.1109/INISTA.2015.7276751","DOIUrl":"https://doi.org/10.1109/INISTA.2015.7276751","url":null,"abstract":"This work focuses on automatic off-line handwritten signature verification where a new gradient feature is proposed for signature characterization. This feature namely, Gradient Local Binary Patterns (GLBP) takes advantage from textural information, to improve the gradient description within images. The verification step is performed in a writer-dependent framework using SVM classifier. Experimental analysis is conducted on CEDAR and GPDS-300 datasets. The results obtained in terms of average error rate highlight the high performance of the proposed feature, which significantly overcomes several state of the art results.","PeriodicalId":136707,"journal":{"name":"2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123914449","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
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学术官方微信