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

2012 Third International Conference on Emerging Applications of Information Technology最新文献

筛选
英文 中文
TweetSmart: Hedging in markets through Twitter TweetSmart:通过Twitter进行市场对冲
2012 Third International Conference on Emerging Applications of Information Technology Pub Date : 2012-11-01 DOI: 10.1109/EAIT.2012.6407894
T. Rao, S. Srivastava
{"title":"TweetSmart: Hedging in markets through Twitter","authors":"T. Rao, S. Srivastava","doi":"10.1109/EAIT.2012.6407894","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407894","url":null,"abstract":"Application of pattern recognition and machine learning in highly dynamic and data intensive financial markets is a popular research area amongst researchers and financial analysts. With evolving social dynamics of millions across the globe, it provides opportunity to make use of patterns in investor sentiment comprising of large scale microblog discussions to understand market movements and make an effective application in making hedging decisions. We apply sentiment analysis and machine learning principles to study causation between public collective sentiment and market movements. In this work we have used 0.6 million tweets for a period of November 2010 to June 2011, to run a practical simulation of hedging model for Dow Jones Industrial Average-DJIA Index. We have elaborated on how a simple hedging strategy like married-put can exercise use of weekly directional forecasts for DJIA to make portfolio adjustments from risky to high market conditions and vice versa. We have found the maximum of 91% SVM based binary classifier accuracy, towards direction (up and down prediction) estimations of DJIA.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132720010","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
Detection of selective forwarding attack in wireless ad hoc networks using binary search 基于二进制搜索的无线自组网选择性转发攻击检测
2012 Third International Conference on Emerging Applications of Information Technology Pub Date : 2012-11-01 DOI: 10.1109/EAIT.2012.6407978
S. Mukherjee, M. Chattopadhyay, S. Chattopadhyay, P. Bose, A. Bakshi
{"title":"Detection of selective forwarding attack in wireless ad hoc networks using binary search","authors":"S. Mukherjee, M. Chattopadhyay, S. Chattopadhyay, P. Bose, A. Bakshi","doi":"10.1109/EAIT.2012.6407978","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407978","url":null,"abstract":"Selective forwarding attack is one of the most harmful attacks in wireless networks. This paper proposes an algorithm to defend against selective forwarding attacks based on binary search technique in clustered wireless ad hoc network. In the first phase, the cluster head raises an alarm when number of packets dropped along a path is more than a threshold value. In the second phase, control packets and hello packets are exchanged along a misbehaving routing path between the wireless node and a cluster head to detect compromised node. Experimental results demonstrate that the detection efficiency of the proposed algorithm is more than 90%. The algorithm can detect multiple compromised nodes if they exist. We have also experimented to estimate the threshold value of packet drops and computed the required rate of drops of compromised nodes so that they can be detected.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128691758","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
Object-shape classification and reconstruction from tactile images using image gradient 基于图像梯度的触觉图像物体形状分类与重建
2012 Third International Conference on Emerging Applications of Information Technology Pub Date : 2012-11-01 DOI: 10.1109/EAIT.2012.6407870
G. Singh, A. Khasnobish, A. Jati, S. Bhattacharyya, A. Konar, D. Tibarewala, R. Janarthanan
{"title":"Object-shape classification and reconstruction from tactile images using image gradient","authors":"G. Singh, A. Khasnobish, A. Jati, S. Bhattacharyya, A. Konar, D. Tibarewala, R. Janarthanan","doi":"10.1109/EAIT.2012.6407870","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407870","url":null,"abstract":"A human explores the world around him through his sense to touch. Touch sensation enables us to understand shape, texture and hardness of an object/surface necessary for efficient exploration. Incorporating artificial haptic sensory systems in rehabilitative aids and in various other human computer interfaces enhances the dexterity. This paper presents a novel approach of shape reconstruction and classification from the tactile images by touching the surface of various real life objects. Here four objects (viz. a planar surface, object with one edge, a cuboid i.e. object with two edges and a cylindrical object) have been used for the shape recognition purpose. A new gradient based feature extraction technique has been used for the classification purpose. The reconstruction algorithm also uses image gradients to differentiate between a surface having continuous curvature and a surface having sharp edge. Prewitt masks are used for determining the gradients. A comparison between the performances of different classifiers has been drawn to prove the efficacy of the shape classification algorithm.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115417220","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
Mobility management protocol in dual-homed UMTS networks 双主UMTS网络中的移动性管理协议
2012 Third International Conference on Emerging Applications of Information Technology Pub Date : 2012-11-01 DOI: 10.1109/EAIT.2012.6407966
S. Sadhukhan, U. Tiwari, V. Agarwal, V. Agrawal, P. Venkateswaran
{"title":"Mobility management protocol in dual-homed UMTS networks","authors":"S. Sadhukhan, U. Tiwari, V. Agarwal, V. Agrawal, P. Venkateswaran","doi":"10.1109/EAIT.2012.6407966","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407966","url":null,"abstract":"As the subscriber numbers soar and traffic load increases in the network, operators face various challenges during post planning stages of their network. One such post planning problem relates to minimizing of total handoff cost in a cellular network. This is solved by making some Radio Network Controllers (RNCs) dual homed [4]. Conventionally UMTS networks are single homed in which one RNC is connected to one MSC/SGSN. In dual homed network one RNC can be connected to at most two MSCs/SGSNs. In this paper, we have proposed a scheme for handoff management in dual homed network. We have modified the existing protocol related to Iu-PS interface to incorporate the handoff handling in a dual homed network. It has been shown that when the RNC is dual homed, approximately four commands are not required thus saving the handoff handling cost. It is found that little changes in the existing 3GPP specified mobility management protocol in the single homed network is needed to take care of handoff management effectively under the dual homing scenario of RNC.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114908918","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
Trusted checkpointing based on ant colony optimization in MANET 基于蚁群优化的自组网可信检查点
2012 Third International Conference on Emerging Applications of Information Technology Pub Date : 2012-11-01 DOI: 10.1109/EAIT.2012.6408002
S. Biswas, P. Dey, S. Neogy
{"title":"Trusted checkpointing based on ant colony optimization in MANET","authors":"S. Biswas, P. Dey, S. Neogy","doi":"10.1109/EAIT.2012.6408002","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6408002","url":null,"abstract":"Mobile ad hoc network (MANET) is a collection of mobile nodes dynamically forming a temporary network without a centralized administration. Failure rate and security attack rate of processes running on mobile hosts in MANET is high due to its characteristics such as open network environment, dynamic topology due to random node movement, lack of centralized control, fixed infrastructure, stable storage etc. Existing secure checkpointing algorithm using cryptography to provide fault tolerance in failure and security attack prone mobile cellular network cannot be applied in MANET due to enhanced overhead. As an alternative solution, we have designed an ant colony based trust model to evaluate trust value of a mobile node in MANET. A trusted node, that will never be a malicious or selfish node, has low or negligible failure and security attack rate, high available battery power which indicates high availability in the network and high positive reference from other nodes. So checkpoint is secure in a trusted mobile node without additional overheads of cryptography. Experimental result shows that using proposed mobility and trust model based checkpointing and rollback recovery technique, maximum recovery probability of 0.93 can be achieved.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124777889","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
Two-stage skew correction of handwritten Bangla document images 手写体孟加拉文文件图像的两阶段偏斜校正
2012 Third International Conference on Emerging Applications of Information Technology Pub Date : 2012-11-01 DOI: 10.1109/EAIT.2012.6407929
Samir Malakar, B. Seraogi, R. Sarkar, N. Das, S. Basu, M. Nasipuri
{"title":"Two-stage skew correction of handwritten Bangla document images","authors":"Samir Malakar, B. Seraogi, R. Sarkar, N. Das, S. Basu, M. Nasipuri","doi":"10.1109/EAIT.2012.6407929","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407929","url":null,"abstract":"Skewness in the handwritten document images is a common scenario. Therefore, it is very much required to detect and correct the skewness before the document is presented to the document image analysis system. In this regard, the present work develops a two-stage Hough transform based approach to remove the skewness in the document images written in Bangla script. Firstly, page-level skewness is removed by rotating the skewed text lines appropriately and then skewed words in each text line, if any, are also rotated along a reference line.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124991156","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
Packet size optimization for multi hop CDMA wireless sensor networks with nearest neighbors based routing 基于最近邻路由的多跳CDMA无线传感器网络数据包大小优化
2012 Third International Conference on Emerging Applications of Information Technology Pub Date : 2012-11-01 DOI: 10.1109/EAIT.2012.6407986
U. Datta, S. Kundu
{"title":"Packet size optimization for multi hop CDMA wireless sensor networks with nearest neighbors based routing","authors":"U. Datta, S. Kundu","doi":"10.1109/EAIT.2012.6407986","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407986","url":null,"abstract":"Power conservation is one of the most important issues in wireless ad hoc and sensor networks, where nodes are likely to rely on limited battery power. In this paper we evaluate multi-hop based data transmission performance of a static CDMA wireless sensor network (WSN), where the positions of nodes are random. Data generated from the source node is received by the sink via multi hop, where an intermediate node in the route selects the nearest node within a sector angle, considered as search angle, towards the direction of the destination as the next hop. Optimization of transmitted data packet in present WSN is considered using the objective function, resource utilization, which has importance in case of delay sensitive WSN. From this frame work, the optimal packet sizes under various network parameters are estimated.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125000302","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
A novel algorithm for enumerating maximal bicliques from a symmetric matrix 从对称矩阵中枚举极大双列的一种新算法
2012 Third International Conference on Emerging Applications of Information Technology Pub Date : 2012-11-01 DOI: 10.1109/EAIT.2012.6407897
M. D. Savio, A. Sankar, R. V. Nataraj
{"title":"A novel algorithm for enumerating maximal bicliques from a symmetric matrix","authors":"M. D. Savio, A. Sankar, R. V. Nataraj","doi":"10.1109/EAIT.2012.6407897","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407897","url":null,"abstract":"We address the problem of enumerating maximal bicliques from a symmetric matrix. We propose a novel algorithm named TWINBLADE which exploits the properties of symmetric matrix, and reduces the search space to a larger extent and it generates not even a single duplicate. Our algorithm is compared with LCM-MBC algorithm, in the experiment conducted, ours take almost only half the running time of LCM-MBC for sparse and comparatively performs better for dense datasets.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131472907","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
Virtual restoration of old mural paintings using patch matching technique 利用补丁匹配技术对旧壁画进行虚拟修复
2012 Third International Conference on Emerging Applications of Information Technology Pub Date : 2012-11-01 DOI: 10.1109/EAIT.2012.6407928
B. Chanda, Dhruv Ratra, B.L.S. Mounica
{"title":"Virtual restoration of old mural paintings using patch matching technique","authors":"B. Chanda, Dhruv Ratra, B.L.S. Mounica","doi":"10.1109/EAIT.2012.6407928","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407928","url":null,"abstract":"Changes occurring in nature cause considerable deterioration of Old mural Paintings. This paper presents a virtual restoration scheme to restore the degraded versions to some extent. Our scheme is based on the assumption that there exist mural Paintings which are completely in their original form, without any degradation. The scheme then presents a technique of best patch matching from a database obtained from clean paintings, where the error patch is replaced by the best patch found. The above is done taking into account the time of execution of the whole process. Prior to patch matching, image enhancement techniques are used on the image to ensure better patch matching. Finally post processing operations are performed on the output for the final cleaned mural. This paper includes demonstration of the above mentioned algorithm on real images, which shows the validity of the proposed scheme.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131605861","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}
引用次数: 6
Reconnecting broken ridges in fingerprints 重新连接断脊的指纹
2012 Third International Conference on Emerging Applications of Information Technology Pub Date : 2012-11-01 DOI: 10.1109/EAIT.2012.6407922
S. Mitra, P. Munshi
{"title":"Reconnecting broken ridges in fingerprints","authors":"S. Mitra, P. Munshi","doi":"10.1109/EAIT.2012.6407922","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407922","url":null,"abstract":"Fingerprint is the oldest and the most widely used biometric. The performance of any Automatic Fingerprint Identification System (AFIS) highly depends on the quality of the fingerprint used. Fingerprint comprises of parallel ridges and valleys. For various reasons, ridges could be broken. Most of the fingerprint recognition algorithms are based on minutiae information. The accuracy of minutiae extraction could be affected by the presence of unwanted broken ridges. A technique for automatically detecting and reconnecting broken ridges is presented here. This technique utilizes a combination of directional information and watershed transform to identify the regions of the broken area. Results using real fingerprint data are presented and discussed.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132876849","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
首页 上一页 下一页 尾页
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学术官方微信