发布求助
文献互助 智能选刊 最新文献

2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI)最新文献

筛选
英文 中文
Malicious behavior in online social network 在线社交网络中的恶意行为
2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI) Pub Date : 2015-12-01 DOI: 10.1109/WCI.2015.7495530
S. Saquib, R. Ali
{"title":"Malicious behavior in online social network","authors":"S. Saquib, R. Ali","doi":"10.1109/WCI.2015.7495530","DOIUrl":"https://doi.org/10.1109/WCI.2015.7495530","url":null,"abstract":"Nowadays, Online Social Networks (OSNs) are very popular and have become an integral part of our life. People are dependent on Online Social Networks for various purposes. The activities of most of the users are normal, but a few of the users exhibit unusual and suspicious behavior. We term this suspicious and unusual behavior as malicious behavior. Malicious behavior in Online Social Networks includes a wide range of unethical activities and actions performed by individuals or communities to manipulate thought process of OSN users to fulfill their vested interest. Such malicious behavior needs to be checked and its effects should be minimized. To minimize effects of such malicious activities, we require proper detection and containment strategy. Such strategy will protect millions of users across the OSNs from misinformation and security threats. In this paper, we discuss the different studies performed in the area of malicious behavior analysis and propose a framework for detection of malicious behavior in OSNs.","PeriodicalId":424669,"journal":{"name":"2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115603008","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
Allocation of Phasor Measurement Unit using A-star method in connected power network 并网相量测量单元的a星法分配
2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI) Pub Date : 2015-12-01 DOI: 10.1109/WCI.2015.7495498
R. Babu, B. Bhattacharyya
{"title":"Allocation of Phasor Measurement Unit using A-star method in connected power network","authors":"R. Babu, B. Bhattacharyya","doi":"10.1109/WCI.2015.7495498","DOIUrl":"https://doi.org/10.1109/WCI.2015.7495498","url":null,"abstract":"This paper explores an A-star based approach for optimal Phasor Measurement Unit (PMU) placement (OPP) which is beneficial for achieving full observability of the connected power network under usual operating environments. The main aim of the proposed approach is to lessen the number of PMU at the connected power network buses, which in turn reduce the setup cost of the PMU. The proposed approach is tested on conventional IEEE 14-bus, 30-bus, New England 39-bus, 57-bus, Indian Utility 62-bus, and 118-bus system. The results obtained with the proposed approach have been compared with the existing methods. It is observed that the proposed approach is able to achieve the full observability of the connected power network with minimum number of PMU.","PeriodicalId":424669,"journal":{"name":"2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123235596","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}
引用次数: 8
Comparative analysis of classification techniques for motor imagery based BCI 基于运动意象的脑机接口分类技术比较分析
2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI) Pub Date : 2015-12-01 DOI: 10.1109/WCI.2015.7495507
Kashyap Jois, Rijul Garg, V. Singh, A. Darji
{"title":"Comparative analysis of classification techniques for motor imagery based BCI","authors":"Kashyap Jois, Rijul Garg, V. Singh, A. Darji","doi":"10.1109/WCI.2015.7495507","DOIUrl":"https://doi.org/10.1109/WCI.2015.7495507","url":null,"abstract":"The main principle behind EEG-based brain computer interfaces (BCI) is the recording and accurate classification of EEG signals during imagination of different types of motor movements. The changes in the neural activity effected by motor imagery are a lot similar to those induced by actual movement. Common features, e.g., band power values, present in the single EEG trials are extracted by suitable methods for classification using SVM, neural networks or ensemble classifiers. The classifiers yield different efficiencies and are compared to find the optimal technique for same number of features. The neural net techniques proved to be the most efficient.","PeriodicalId":424669,"journal":{"name":"2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121461892","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
Fault-tolerant routing over all shortest node-disjoint paths in hypercube networks 超立方体网络中所有最短节点不相交路径上的容错路由
2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI) Pub Date : 2015-12-01 DOI: 10.1109/WCI.2015.7495533
L. S. Umrao, Ravi Shankar Singh
{"title":"Fault-tolerant routing over all shortest node-disjoint paths in hypercube networks","authors":"L. S. Umrao, Ravi Shankar Singh","doi":"10.1109/WCI.2015.7495533","DOIUrl":"https://doi.org/10.1109/WCI.2015.7495533","url":null,"abstract":"Data transmission is the critical issue when dealing with parallel processing systems. As the number of processors increases day by day inside the supercomputers, faults are very common to occur. Therefore, generating node-disjoint paths is the guarantee to sending data from source process to destination process successfully, since single faulty process can affect maximum one path. Beyond selecting right and efficient interconnection topology, routing is also a major issue to propagate the data in a efficient way. Given paper gives an optimal fault-tolerant routing algorithm for faulty hypercube topology which provides n disjoint paths from source process s to n destination processes in n-dimensional hypercube in O(n2) time with optimal path lengths at most n + f + 1. Then simulation results showed that the proposed algorithm reduce the average path length by about 10% in comparison of Bossard's algorithm in 8-dimensional hypercube.","PeriodicalId":424669,"journal":{"name":"2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115027158","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}
引用次数: 1
Visualization of network data for effective semantic analysis 可视化网络数据，进行有效的语义分析
2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI) Pub Date : 2015-12-01 DOI: 10.1109/WCI.2015.7495503
V. Krishna, N. Suri, K. R. P. Kumar, S. Rakshit
{"title":"Visualization of network data for effective semantic analysis","authors":"V. Krishna, N. Suri, K. R. P. Kumar, S. Rakshit","doi":"10.1109/WCI.2015.7495503","DOIUrl":"https://doi.org/10.1109/WCI.2015.7495503","url":null,"abstract":"Visual data analysis has been emerging as an attractive technique in addressing the challenges of the current computing research. It relies upon the human ability in grasping the intrinsic characteristics of the data through visual exploration. This human visual perception combined with the domain specific data semantics can lead to effective extraction of knowledge that is of immense use in real life. However, visualization of network data poses some serious issues as it has to deal with the inherent links between various network entities in addition to rendering the entities themselves in a semantically appealing manner. Addressing these issues, this paper proposes a methodology of employing graph-based representation of network data for extracting useful semantic graph patterns from the data. Our method defines various visual features that are used in rendering an interactive visual display of the network data for carrying out semantic analysis. An implementation of the proposed method is achieved by extending the Java Universal Network/Graph (JUNG) library. The efficacy of the proposed method is demonstrated through an experimental study using some benchmark network data sets.","PeriodicalId":424669,"journal":{"name":"2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117303317","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}
引用次数: 1
A review on advances in deep learning 深度学习研究进展综述
2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI) Pub Date : 2015-12-01 DOI: 10.1109/WCI.2015.7495514
Soniya, Sandeep Paul, Lotika Singh
{"title":"A review on advances in deep learning","authors":"Soniya, Sandeep Paul, Lotika Singh","doi":"10.1109/WCI.2015.7495514","DOIUrl":"https://doi.org/10.1109/WCI.2015.7495514","url":null,"abstract":"Over the years conventional neural networks has shown state-of-art performance on many problems. However, their performance on recognition system is still not widely accepted in the machine learning community because these networks are unable to handle selectivity-invariance dilemma and also suffer from the problem of vanishing gradients. Some of these issues have been addressed by deep learning. Deep learning approaches attempt to disentangle intricate aspects of input by creating multiple levels of representation. These approaches have shown astonishing results in problem domains like recognition system, natural language processing, medical sciences, and in many other fields. The paper presents an overview of different deep learning approaches in a nutshell and also highlights some limitations which are restricting performance of deep neural networks in order to handle more realistic problems.","PeriodicalId":424669,"journal":{"name":"2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126933610","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}
引用次数: 54
Comparison and analysis of solving travelling salesman problem using GA, ACO and hybrid of ACO with GA and CS 用遗传算法、蚁群算法及蚁群算法与遗传算法和蚁群算法混合求解旅行商问题的比较与分析
2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI) Pub Date : 2015-12-01 DOI: 10.1109/WCI.2015.7495512
A. Q. Ansari, Ibraheem, Sapna Katiyar
{"title":"Comparison and analysis of solving travelling salesman problem using GA, ACO and hybrid of ACO with GA and CS","authors":"A. Q. Ansari, Ibraheem, Sapna Katiyar","doi":"10.1109/WCI.2015.7495512","DOIUrl":"https://doi.org/10.1109/WCI.2015.7495512","url":null,"abstract":"The Travelling Salesman Problem (TSP) is a very popular combinatorial optimization problem of real world. The objective is to find out a shortest possible path travelled by a salesman while visited every city once and returned to the origin city. TSP is one of the NP hard problems and several attempts have been done to solve it by traditional methods. Computational methods give better solution for TSP as most of them are based on repetitive learning. In the proposed paper four optimization techniques are presented such as ant colony optimization (ACO), genetic algorithm (GA), hybrid technique of ant colony optimization (ACO) and genetic algorithm (GA) and hybrid technique of ant colony optimization (ACO) and cuckoo search (CS) algorithm is proposed and implemented for travelling salesman problem. The result shows that shortest efficient tour is obtained by new hybrid algorithm.","PeriodicalId":424669,"journal":{"name":"2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126313259","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
Machine-part cell formation for maximum grouping efficacy based on genetic algorithm 基于遗传算法的最大分组效率的机器部件细胞形成
2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI) Pub Date : 2015-12-01 DOI: 10.1109/WCI.2015.7495521
Manash Hazarika, D. Laha
{"title":"Machine-part cell formation for maximum grouping efficacy based on genetic algorithm","authors":"Manash Hazarika, D. Laha","doi":"10.1109/WCI.2015.7495521","DOIUrl":"https://doi.org/10.1109/WCI.2015.7495521","url":null,"abstract":"Cellular manufacturing system (CMS) makes use of application of group technology. The objective of cell formation problems (CFP) in CMS is to identify part families and machine cells in order to minimize the intercellular movement and to maximize the machine utilization within a cell. Previous study in CFP generally focused on maximizing grouping efficacy (GC) by minimizing exceptional elements as well as void elements. In this paper, a genetic algorithm heuristic is presented. Computational experiments were carried out with 20 benchmark problem sets. Computational results show that the proposed heuristic has shown to produce solutions in terms of GC that are either better than or competitive with the existing algorithms.","PeriodicalId":424669,"journal":{"name":"2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132557747","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}
引用次数: 9
An efficient low dynamic range image compression using improved block based EZW 一个有效的低动态范围图像压缩使用改进的块基于EZW
2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI) Pub Date : 2015-12-01 DOI: 10.1109/WCI.2015.7495505
Ch. Naveen, V. Satpute, A. Keskar
{"title":"An efficient low dynamic range image compression using improved block based EZW","authors":"Ch. Naveen, V. Satpute, A. Keskar","doi":"10.1109/WCI.2015.7495505","DOIUrl":"https://doi.org/10.1109/WCI.2015.7495505","url":null,"abstract":"This papers deals with an efficient image compression technique for images having low dynamic range. The images with low dynamic range generally have low intensity variations. By considering this fundamental characteristic into account we can go for image compression at higher ratio with small modifications to the existing block based EZW algorithm. To achieve the improvement in compression ratio, block-wise Embedded Zero Wavelet (EZW) is applied on the images by forcing all the blocks in the image to take the same number of dominant and sub-ordinate passes. The number of passes applied on each block of the image will be equal to the lowest number of passes taken by one of the blocks in image. This downside the number of passes applied on the image which reduces the number of bits used for encoding the image which successively increase the compression ratio. The proposed algorithm is analyzed with respect to the normal block-wise EZW by mathematical parameters as well as with visual quality. The mathematical parameters chosen for comparison are Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity (SSIM) index. The algorithm is tested from low resolution to UHD resolution images.","PeriodicalId":424669,"journal":{"name":"2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134000785","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}
引用次数: 9
Stabilization at upright equilibrium position of rotary inverted pendulum using particle swarms with constrained optimization 基于约束优化粒子群的旋转倒立摆垂直平衡位置镇定
2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI) Pub Date : 2015-12-01 DOI: 10.1109/WCI.2015.7495542
G. N. Kumar, J. S. Rao, K. Srikanth
{"title":"Stabilization at upright equilibrium position of rotary inverted pendulum using particle swarms with constrained optimization","authors":"G. N. Kumar, J. S. Rao, K. Srikanth","doi":"10.1109/WCI.2015.7495542","DOIUrl":"https://doi.org/10.1109/WCI.2015.7495542","url":null,"abstract":"Actuators and Manipulators either robotic or mechatronic require controllers which are very accurate and fast. The rotary inverted pendulum has been an under actuated system classified as a potential model in the category of advanced research problems. In this paper, a method is proposed for stabilization of a rotary inverted pendulum using full state feedback controller based modified particle swarm optimization with constraints on settling time, peak time and peak overshoot. The method paves way to advanced signal processing techniques for design and control of complex dynamic systems.","PeriodicalId":424669,"journal":{"name":"2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI)","volume":"33 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115950722","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}
引用次数: 1
下一页 尾页
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学术官方微信
小红书