{"title":"Cascading classifier application for topology prediction of TMB proteins","authors":"H. Kazemian, Cedric Maxime Grimaldi","doi":"10.1109/SSCI.2018.8628845","DOIUrl":"https://doi.org/10.1109/SSCI.2018.8628845","url":null,"abstract":"This paper is concerned with the use of a cascading classifier for trans-membrane beta-barrel topology prediction analysis. Most of novel drug design requires the use of membrane proteins. Trans-membrane proteins have key roles such as active transport across the membrane and signal transduction among other functions. Given their key roles, understanding their structures mechanisms and regulation at the level of molecules with the use of computational modeling is essential. In the field of bioinformatics, many years have been spent on the trans-membrane protein structure prediction focusing on the alpha-helix membrane proteins. Technological developments have been increasingly utilized in order to understand in more details membrane protein function and structure. Various methodologies have been developed for the prediction of TMB (trans-membrane beta-barrel) proteins topology however the use of cascading classifier has not been fully explored. This research presents a novel approach for TMB topology prediction. The MATLAB computer simulation results show that the proposed methodology predicts trans-membrane topologies with high accuracy for randomly selected proteins.","PeriodicalId":235735,"journal":{"name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"319 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133959974","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}
Fareed Qararyah, Yousef-Awwad Daraghmi, E. Daraghmi, S. Rajora, Chin-Teng Lin, M. Prasad
{"title":"A Time Efficient Model for Region of Interest Extraction in Real Time Traffic Signs Recognition System","authors":"Fareed Qararyah, Yousef-Awwad Daraghmi, E. Daraghmi, S. Rajora, Chin-Teng Lin, M. Prasad","doi":"10.1109/SSCI.2018.8628874","DOIUrl":"https://doi.org/10.1109/SSCI.2018.8628874","url":null,"abstract":"Computation intelligence plays a major role in developing intelligent vehicles, which contains a Traffic Sign Recognition (TSR) system for increasing vehicle safety. Traffic sign recognition systems consist of an initial phase called Traffic Sign Detection (TSD), where images and colors are segmented and fed to the recognition phase. The most challenging process in TSR systems in terms of time consumption is the detection phase. The previous studies proposed different models for traffic sign detection, however, the computation time of these models still requires improvement for enabling real time systems. Therefore, this paper focuses on the computational time and proposes a novel time efficient color segmentation model based on logistic regression. This paper uses RGB color space as the domain to extract the features of our hypothesis; this has boosted the speed of the proposed model, since no color conversion is needed. The trained segmentation classifier is tested on 1000 traffic sign images taken in different lighting conditions. The experimental results show that the proposed model segmented 974 of these images correctly and in a time less than one-fifth of the time needed by any other robust segmentation methods.","PeriodicalId":235735,"journal":{"name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123940730","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":"Structured Prediction Networks through Latent Cost Learning","authors":"R. Milidiú, R. Rocha","doi":"10.1109/SSCI.2018.8628625","DOIUrl":"https://doi.org/10.1109/SSCI.2018.8628625","url":null,"abstract":"Structured prediction provides a flexible modeling framework to deal with several relevant problems. Sequences, Trees, Disjoint Intervals and Matching are some useful examples of the type of structures we would like to predict. An elegant learning scheme for this prediction setting is the Structured Perceptron algorithm, which is sure to converge under some linear separability conditions. The framework integrates a very simple Structured layer on top of a latent costs network. Our key contribution is a novel loss function that incorporates structural information and simplifies learning. The effectiveness of this framework is illustrated with sequence prediction problems. We explore LSTM neural network architectures to model the latent costs layer, since our experiments concern NLP tasks. We perform basic experiments with Chunking in English. The SPN predictor outperforms its CRF equivalent. Our initial findings strongly indicate that SPN is a versatile framework with a powerful learning strategy.","PeriodicalId":235735,"journal":{"name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124030314","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":"Combinations in predictive analytics by using machine learning","authors":"Emrah Gulay, O. Duru","doi":"10.1109/SSCI.2018.8628755","DOIUrl":"https://doi.org/10.1109/SSCI.2018.8628755","url":null,"abstract":"This paper investigates the predictive accuracy of various forecast combinations by using machine learning techniques and proposes a model selection and hyperparameter optimization process for achieving better accuracy in given set of examples from the energy market. Various econometric models are estimated prior to the combination process by utilizing autoregressive integrated moving average (ARIMA), Holt-Winter’s exponential smoothing and other leading univariate forecasting models. Neural networks and support vector machine are employed to find the most accurate combinations of those models. Validation sets are used for finding the most accurate (post- sample) combinations with certain hyperparameter configurations. Models and combinations are compared in the test set based three accuracy metrics. Neural network combinations with inputs generated from Autoregressive- Distributed Lag model (ARDL) empirical mode decomposition (instinct mode functions) performed significantly better than single models and other combinations in majority of given data sample.","PeriodicalId":235735,"journal":{"name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127699686","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 Two-Factor Authentication Scheme based on Negative Databases","authors":"Ran Liu, Xiang Wang, Can Wang","doi":"10.1109/SSCI.2018.8628732","DOIUrl":"https://doi.org/10.1109/SSCI.2018.8628732","url":null,"abstract":"In some scenes such as smart mobile terminal, low energy consumption and high efficiency are highly important in information security. So two-factor authentication scheme based on classical encryption algorithms are not suitable in some scenes. Negative database NDB), inspired by the artificial immune system, is significant with wide applications in information security and privacy protection for the high efficiency. Password authentication schemes based on NDBs can be used in mobile internet, sensor network and smart card because of the high efficiency of generating NDBs. This paper proposes a two-factor authentication scheme based on NDBs, the security of the scheme depends on the NP-Completeness of reversing an NDBto obtain the original database (DB). The efficiency of this proposed scheme is similar to the present one-time password authentication scheme based on NDBs. The efficiency and the security of this proposed scheme is analyzed as well.","PeriodicalId":235735,"journal":{"name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121291094","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":"Discussing Different Clustering Methods for the Aggregation of Demand Response and Distributed Generation","authors":"C. Silva, P. Faria, Z. Vale","doi":"10.1109/SSCI.2018.8628781","DOIUrl":"https://doi.org/10.1109/SSCI.2018.8628781","url":null,"abstract":"With the introduction of the Smart Grid context in the current network, it will be necessary to improve business models to include the use of distributed generation and demand response programs regarding the remuneration of participants as a form of incentive. Throughout this article a methodology is presented which will aggregate generation units and consumers participating in DR programs. A comparison of clustering methods will be carried out in order to understand which one of them will be the most appropriate for the scenario studied. After grouping all the resources, the remuneration of the groups are made considering the maximum rate in each group. The hierarchical clustering proved to be the most appropriate because it grouped the resources so that the total cost for the aggregator was the minimum.","PeriodicalId":235735,"journal":{"name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128632957","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":"Prediction based Policy setting by finding significance of Attributes from the Ontological Framework in Agricultural domain","authors":"V. S. Pruthvi, Rohit Naik, B. Kumar","doi":"10.1109/SSCI.2018.8628708","DOIUrl":"https://doi.org/10.1109/SSCI.2018.8628708","url":null,"abstract":"In this paper, a methodology has been proposed to tackle the problem of identifying and processing the information conveyed by a huge number of research papers and policy documents, specifically in Agricultural domain. The methodology used in this work includes a series of natural language processing techniques. Pre-processing techniques such as normalizing text to lowercase, stop word removal, tokenization are performed, followed by sentiment analysis for which an algorithm based on the ontological framework has been written. This algorithm works on same concept as the page rank algorithm. Word clouds have been used for analysis. A histogram representing the frequency of occurrence of words in each column is made to identify which domain is being emphasized on by the document.","PeriodicalId":235735,"journal":{"name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116828614","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":"Cooperative Coevolutionary Approximation in HOG-based Human Detection Embedded System","authors":"Michal Wiglasz, L. Sekanina","doi":"10.1109/SSCI.2018.8628910","DOIUrl":"https://doi.org/10.1109/SSCI.2018.8628910","url":null,"abstract":"The histogram of oriented gradients (HOG) feature extraction is a computer vision method widely used in embedded systems for detection of objects such as pedestrians. We used cooperative coevolutionary Cartesian genetic programming (CGP) to exploit the error resilience in the HOG algorithm. We evolved new approximate implementations of the arctan and square root functions, which are typically employed to compute the gradient orientations and magnitudes. When the best evolved approximations are integrated into the software implementation of the HOG algorithm, not only the execution time, but also the classification accuracy was improved in comparison with approximations evolved separately using CGP and also compared to the state-of-the art approximate implementations. As the evolved code does not contain any loops and branches, it is suitable for the follow-up low-power hardware implementation.","PeriodicalId":235735,"journal":{"name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115474405","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}
Vasilios Tsalavoutis, Constantinos Vrionis, A. Tolis, Dimitrios Plataniotis
{"title":"A Differential Evolution Approach for the Reliability Constrained Unit Commitment Problem","authors":"Vasilios Tsalavoutis, Constantinos Vrionis, A. Tolis, Dimitrios Plataniotis","doi":"10.1109/SSCI.2018.8628693","DOIUrl":"https://doi.org/10.1109/SSCI.2018.8628693","url":null,"abstract":"In this paper, an efficient approach is proposed to optimize the Unit Commitment Problem (UCP) considering the unreliability of the generating units and the load forecast uncertainty. Reliability indices such as the Loss of Load Probability (LOLP) and the Expected Energy Not Served (EENS) are included in the formulation of the UCP to implicitly assess the required spinning reserve of the system. The method is based on the Differential Evolution (DE) algorithm combined with a hereby proposed series of problem specific repair mechanisms, which enhance the algorithm's performance. The approach is tested on the IEEE Reliability Test System (IEEE RTS), which comprises 26 thermal units. The impact of the units' unreliability and of the load forecast uncertainty on the required reserve and on the total operation cost is evaluated. A benchmarking against previously proposed algorithms reveals that the proposed method provides consistently solutions of lower cost in competitive time. Moreover, the algorithm is applied on systems of larger size, demonstrating an efficient and robust performance.","PeriodicalId":235735,"journal":{"name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"270 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114477122","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 Linguistically Interpretable ELANFIS for Classification Problems","authors":"C. Pramod, G. Pillai","doi":"10.1109/SSCI.2018.8628689","DOIUrl":"https://doi.org/10.1109/SSCI.2018.8628689","url":null,"abstract":"In this paper, a clustering based extreme learning adaptive neuro-fuzzy inference system (CELANFIS) is proposed to improve the interpretability of the neuro-fuzzy model. Sub-clustering of input-output data is done to obtain the cluster centers which are used to obtain the membership function parameters of the CELANFIS, such that it satisfies a novel distinguishability constraint, for improving the interpretability of the network. The consequent parameters are obtained using the Moore-Penrose pseudo inverse thus resulting in faster training. Benchmark real world classification problems are used to evaluate the performance of the proposed network. Performance comparison of the proposed network with the Least Square Support Vector Machine (LS-SVM) and ELANFIS shows a satisfactory tradeoff between model accuracy and interpretability.","PeriodicalId":235735,"journal":{"name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114562043","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}