作者：
Janakiraman MoorthyRangin LahiriNeelanjan BiswasDipyaman SanyalJayanthi RanjanKrishnadas NanathPulak Ghosh(Coordinator) Director and Professor of Marketing at the Institute of Management Technology
Dubai. Earlier he was Professor of Marketing at the IIM Calcutta and IIM Lucknow. He received his PhD from IIM Ahmedabad. His recent research papers were published in the leading scholarly ournals such as Marketing Science British Food Journal Journal of Information Technology Case and Application Research Journal of Database Marketing & Customer Strategy Management. He has wide experience in the banking and investment industry. He was earlier the Global Research and Project Director of the Institute for Customer Relationship Management Atlanta USA. He was the Convener of the prestigious CAT Exam 2011. e-mail: Practice Director
leading Atos India's CRM practice while supporting Strategic Business Development for North American Market. With an experience of more than 15 years Rangin has worked extensively as a Business Consultant in Information Technology (Sales Automation Marketing & Service Management area) Customer Data Management and CRM Analytics. e-mail: Business Consultant at Atos with extensive experience in Business Analysis
Risk Management Analytics Business Development Presales Solution Ideation on Enterprise Data Management Enterprise Reference Data and Master Data Management area. e-mail: founder and CEO of dono consulting
a boutique quantitative analytics and investment research firm. He has worked for leading financial firms in New York and India including Dow Jones Blackstone Sorin Capital (VP Quantitative Modeling) and Thomson Reuters (Head of Real Estate Analytics). A CFA charter holder and Commonwealth Scholar Deep has an MS (Applied Economics) from University of Texas Dallas and an MA (Economics) from Jadavpur University e-mail: Professor in the Information Systems Group of the Institute of Management Technology
Ghaziabad. Her PhD is in the field of data mining from Jamia Millia Islamia Central University India. She has published five edited books. She is serving on the editorial b
Automatic keyphrase extraction aims to pick out a set of terms as a representation of a document without manual assignment efforts. Supervised and unsupervised graph-based ranking methods have been studied for this ta...
详细信息
In distributed storage systems, a data file is encoded and distributed to storage nodes, such that the data file can be recovered from some subsets of the nodes. Upon the failure of a storage node, we want to repair i...
详细信息
In distributed storage systems, a data file is encoded and distributed to storage nodes, such that the data file can be recovered from some subsets of the nodes. Upon the failure of a storage node, we want to repair it efficiently by contacting and downloading some encoded bits from a small number of surviving nodes. Using projective-geometric self-repairing codes (PSRC), proposed by Oggier and Datta, one can repair a failed node by contacting only two nodes. However, in their construction, the number of storage nodes in the storage system is a large number, and thus the storage efficiency is low. In this paper, we investigate how to be more flexible in the number of storage nodes. The proposed code in this paper is called general projective geometric self-repairing codes (GPSRC). GPSRC reduces high redundancy of PSRC, while retains the basic property of PSRC. We present some methods for repairing a failed node, in which the number of contacted surviving nodes is flexible. These repairing methods provide tradeoff between repair-degree and repair-bandwidth.
Regenerating code is a class of storage codes that achieve the optimal trade-off between storage capacity and repair bandwidth, which are two important performance metrics in data storage systems. However, existing co...
详细信息
ISBN:
(纸本)9781479904440
Regenerating code is a class of storage codes that achieve the optimal trade-off between storage capacity and repair bandwidth, which are two important performance metrics in data storage systems. However, existing constructions of regenerating codes rely on expensive computational operations such as finite field multiplication. The high coding and repair complexity limit their applications in large-scale practical storage systems. In this paper, we show that it is possible to achieve the full potential of regenerating codes with low computational complexity. In particular, we propose a new class of regenerating codes, called BASIC codes, that can achieve two specific points (i.e., minimum-bandwidth and minimum-storage regenerating points) on the storage and repair bandwidth trade-off curve, using only binary addition and shift operations in the coding and repair processes. Although in this paper we focus on constructing and analyzing BASIC codes for two specific exact-repair settings, our framework can be generalized to develop BASIC codes for more general exact- and functional-repair regenerating codes.
Bus Rapid Transit (BRT) is an effective way to improve urban traffic status. But, because of its complexity, it is difficult in its operation management and scheduling. In this article, based on ACP approach, Parallel...
详细信息
ISBN:
(纸本)9781467313971
Bus Rapid Transit (BRT) is an effective way to improve urban traffic status. But, because of its complexity, it is difficult in its operation management and scheduling. In this article, based on ACP approach, Parallel BRT System is constructed, which can detect real-time passenger flow at stations, traffic flow at stations and intersections and queuing length of vehicles on the road; to provide short-term passenger and traffic saturation prediction in order to timely arrange transportation management and relieve congestion; to assess, improve and optimize the emergency management of holidays, events, accidents and other emergencies; to improve the quality of real-time scheduling functions based on the measurement results detected from videos, and so on. This system has been applied in Guangzhou Zhongshan Avenue BRT, which was applied for BRT's monitoring, warning, forecasting, emergency management, real-time scheduling and other needs, to guarantee BRT's smooth, safety, efficiency and reliability.
In terms of the difficulty of vehicle tracking in complex environment of the visual surveillance system, an object tracking algorithm is proposed for the applications in practical visual surveillance systems for intel...
详细信息
In terms of the difficulty of vehicle tracking in complex environment of the visual surveillance system, an object tracking algorithm is proposed for the applications in practical visual surveillance systems for intelligent traffic. A block-based Gaussian mixture background modeling method for object detection is presented to reduce the computational complexity of moving vehicle object abstraction. An adaptive tracking algorithm fused with color features and texture features is described to better adapt the traffic scene variation. The experimental results show that the proposed algorithm can effectively deal with the complex urban traffic conditions and the tracking performance is better than the conventional particle filter method and single feature based non-adaptive object tracking method.
暂无评论