Pub Date : 2014-12-04DOI: 10.1109/ICBIM.2014.6970973
Debadrita Banerjee
The most reliable way to forecast the future is to try to understand the present and thus, accordingly we have set our prior objective as the analysis of the present scenario of the Indian Stock Market so as to understand and try to create a better future scope for investment. On this context, we have collected data on the monthly closing stock indices of sensex for six years(2007-2012) and based on these we have tried to develop an appropriate model which would help us to forecast the future unobserved values of the Indian stock market indices. This study offers an application of ARIMA model based on which we predict the future stock indices which have a strong influence on the performance of the Indian economy. The Indian Stock market is the centre of interest for many economists, investors and researchers and hence it is quite important for them to have a clear understanding of the present status of the market. To establish the model we applied the validation technique with the observed data of sensex of 2013.
{"title":"Forecasting of Indian stock market using time-series ARIMA model","authors":"Debadrita Banerjee","doi":"10.1109/ICBIM.2014.6970973","DOIUrl":"https://doi.org/10.1109/ICBIM.2014.6970973","url":null,"abstract":"The most reliable way to forecast the future is to try to understand the present and thus, accordingly we have set our prior objective as the analysis of the present scenario of the Indian Stock Market so as to understand and try to create a better future scope for investment. On this context, we have collected data on the monthly closing stock indices of sensex for six years(2007-2012) and based on these we have tried to develop an appropriate model which would help us to forecast the future unobserved values of the Indian stock market indices. This study offers an application of ARIMA model based on which we predict the future stock indices which have a strong influence on the performance of the Indian economy. The Indian Stock market is the centre of interest for many economists, investors and researchers and hence it is quite important for them to have a clear understanding of the present status of the market. To establish the model we applied the validation technique with the observed data of sensex of 2013.","PeriodicalId":6549,"journal":{"name":"2014 2nd International Conference on Business and Information Management (ICBIM)","volume":"13 1","pages":"131-135"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73998500","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}
Pub Date : 2014-12-04DOI: 10.1109/ICBIM.2014.6970932
Parag Kumar Guha Thakurta, Mrinmoy Sen, Ashutosh Kumar Singh, Anujendra
In mobile communication systems, the efficient use of available channels has been shown to improve the system capacity against limited resource. The role of a channel assignment scheme is to allocate channels to cells or mobiles in such a way that the communication facility is improved. In this context, a new approach on hybrid channel allocation scheme (HCA) for mobile networks is proposed in this paper. It includes the features of both fixed channel allocation (FCA) and dynamic channel allocation (DCA) schemes. The assigned channels through FCA are equally distributed among each of the side of a hexagonal cell under a base station (BS) for low traffic. The DCA is proposed for further improvement by introducing dynamic allocation policy. The intercellular channel allocation (ICA) phase describes call scheduling procedure. In addition, the proposed model is verified through Markov Chain representation. The characteristics of the proposed model are expressed with Markov Chain process. The proposed model achieves an improved performance in terms of reduced communication and computational overhead.
{"title":"A new hybrid channel allocation scheme for mobile networks: Markov chain representation","authors":"Parag Kumar Guha Thakurta, Mrinmoy Sen, Ashutosh Kumar Singh, Anujendra","doi":"10.1109/ICBIM.2014.6970932","DOIUrl":"https://doi.org/10.1109/ICBIM.2014.6970932","url":null,"abstract":"In mobile communication systems, the efficient use of available channels has been shown to improve the system capacity against limited resource. The role of a channel assignment scheme is to allocate channels to cells or mobiles in such a way that the communication facility is improved. In this context, a new approach on hybrid channel allocation scheme (HCA) for mobile networks is proposed in this paper. It includes the features of both fixed channel allocation (FCA) and dynamic channel allocation (DCA) schemes. The assigned channels through FCA are equally distributed among each of the side of a hexagonal cell under a base station (BS) for low traffic. The DCA is proposed for further improvement by introducing dynamic allocation policy. The intercellular channel allocation (ICA) phase describes call scheduling procedure. In addition, the proposed model is verified through Markov Chain representation. The characteristics of the proposed model are expressed with Markov Chain process. The proposed model achieves an improved performance in terms of reduced communication and computational overhead.","PeriodicalId":6549,"journal":{"name":"2014 2nd International Conference on Business and Information Management (ICBIM)","volume":"41 1","pages":"53-57"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75225666","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}
Pub Date : 2014-12-04DOI: 10.1109/ICBIM.2014.6970951
Sayantani Ghosh, N. Das
Performance management is the process of creating a work environment or setting in which people are enabled to perform to the best of their abilities. It emphasizes communication and focuses on adding value to the organization by promoting improved job performance and encouraging skill development. Performance Management involves clarifying the job duties, defining performance standards, and documenting, evaluating and discussing performance with each employee .This paper aims at studying the process of performance management and exploring factors that can make causal factors to make harm for performance management in higher educational institutions. This paper will focus on the proposed strategies for improving bad performance management in higher educational institutions. This paper also tries to focus on the reasons for performance failure.
{"title":"Cause and effects of performance management in higher educational institutions (HEI)","authors":"Sayantani Ghosh, N. Das","doi":"10.1109/ICBIM.2014.6970951","DOIUrl":"https://doi.org/10.1109/ICBIM.2014.6970951","url":null,"abstract":"Performance management is the process of creating a work environment or setting in which people are enabled to perform to the best of their abilities. It emphasizes communication and focuses on adding value to the organization by promoting improved job performance and encouraging skill development. Performance Management involves clarifying the job duties, defining performance standards, and documenting, evaluating and discussing performance with each employee .This paper aims at studying the process of performance management and exploring factors that can make causal factors to make harm for performance management in higher educational institutions. This paper will focus on the proposed strategies for improving bad performance management in higher educational institutions. This paper also tries to focus on the reasons for performance failure.","PeriodicalId":6549,"journal":{"name":"2014 2nd International Conference on Business and Information Management (ICBIM)","volume":"19 1","pages":"58-63"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84346758","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}
Pub Date : 2014-12-04DOI: 10.1109/ICBIM.2014.6970965
Ratna Mandal, Nitin Agarwal, S. Nandi, Sujoy Saha
Developing a robust and well-informed cellular phone based transportation system comes with increasing popularity and availability of digital maps that has certainly made navigation simpler. But that comes with a serious limitation of narrow unknown paths which does not hold any place on these maps. The drawbacks of inaccuracy of road geometry and the lack of fine-grained information hampers a route guidance system. In this paper, we present an approach to build high-precision maps from the GPS traces of crowd, equipped with differential GPS receivers, for updating existing paths and adding new path segments scaled according to digital map. Due to decreasing cost, we expect that large volume of GPS traces can be gathered for building up new road segments. Our approach is to build a smart system where the crowd traces will be uploaded on the server through a cellular user-interface, to generate a fine-grained map based on human labelling.
{"title":"Personalised route-map generation using crowd sourced GPS traces","authors":"Ratna Mandal, Nitin Agarwal, S. Nandi, Sujoy Saha","doi":"10.1109/ICBIM.2014.6970965","DOIUrl":"https://doi.org/10.1109/ICBIM.2014.6970965","url":null,"abstract":"Developing a robust and well-informed cellular phone based transportation system comes with increasing popularity and availability of digital maps that has certainly made navigation simpler. But that comes with a serious limitation of narrow unknown paths which does not hold any place on these maps. The drawbacks of inaccuracy of road geometry and the lack of fine-grained information hampers a route guidance system. In this paper, we present an approach to build high-precision maps from the GPS traces of crowd, equipped with differential GPS receivers, for updating existing paths and adding new path segments scaled according to digital map. Due to decreasing cost, we expect that large volume of GPS traces can be gathered for building up new road segments. Our approach is to build a smart system where the crowd traces will be uploaded on the server through a cellular user-interface, to generate a fine-grained map based on human labelling.","PeriodicalId":6549,"journal":{"name":"2014 2nd International Conference on Business and Information Management (ICBIM)","volume":"6 1","pages":"154-158"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80187995","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}
Pub Date : 2014-12-04DOI: 10.1109/ICBIM.2014.6970943
A. Sarkar, U. Marjit, U. Biswas
Nowadays with the rapid use of Internet makes it easy to collect information as a matter of mouse click over the Web. With this enormous opportunity it becomes easy to make copy and use of someone else's works or ideas without giving the proper credit to the original owner. Normally this kind of practice is known as plagiarism. Plagiarism has already become a serious issue for the different publishing house of journals or the conference organizers to prevent the authors to plagiarize their work. Considering this issue several tools have been developed to check for plagiarism mostly based on syntactical or word based matching. In this paper a new conceptual model is proposed to generate a decent tool to identify the plagiarized content based on syntactical and semantic matching.
{"title":"A conceptual model to develop an advanced plagiarism checking tool based on semantic matching","authors":"A. Sarkar, U. Marjit, U. Biswas","doi":"10.1109/ICBIM.2014.6970943","DOIUrl":"https://doi.org/10.1109/ICBIM.2014.6970943","url":null,"abstract":"Nowadays with the rapid use of Internet makes it easy to collect information as a matter of mouse click over the Web. With this enormous opportunity it becomes easy to make copy and use of someone else's works or ideas without giving the proper credit to the original owner. Normally this kind of practice is known as plagiarism. Plagiarism has already become a serious issue for the different publishing house of journals or the conference organizers to prevent the authors to plagiarize their work. Considering this issue several tools have been developed to check for plagiarism mostly based on syntactical or word based matching. In this paper a new conceptual model is proposed to generate a decent tool to identify the plagiarized content based on syntactical and semantic matching.","PeriodicalId":6549,"journal":{"name":"2014 2nd International Conference on Business and Information Management (ICBIM)","volume":"8 1","pages":"104-108"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87917731","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}
Pub Date : 2014-12-04DOI: 10.1109/ICBIM.2014.6970976
A. Banerjee, Gautam Bandyopadhyay, Anupam De, L. Ramani
The objective of this paper is to understand the impact of four factors as defined by Carhart on a portfolio return that exactly replicates Nifty in Indian market. The findings are interesting as we found that the momentum factor ((Jegadeesh and Titman, 1993) has a very limited influence on estimating the expected return of Nifty. The maximum explanation of expected return comes from the market factor defined by Sharpe-Lintner model during the period under consideration.
本文的目的是了解卡哈特定义的四个因素对投资组合回报的影响，该投资组合回报完全复制了印度市场上的漂亮。研究结果很有趣，因为我们发现动量因子((Jegadeesh and Titman, 1993)对估计Nifty的预期收益的影响非常有限。期望收益的最大解释来自于Sharpe-Lintner模型所定义的市场因素。
{"title":"A Study on Carhart four-factor model in the perspective of Indian market","authors":"A. Banerjee, Gautam Bandyopadhyay, Anupam De, L. Ramani","doi":"10.1109/ICBIM.2014.6970976","DOIUrl":"https://doi.org/10.1109/ICBIM.2014.6970976","url":null,"abstract":"The objective of this paper is to understand the impact of four factors as defined by Carhart on a portfolio return that exactly replicates Nifty in Indian market. The findings are interesting as we found that the momentum factor ((Jegadeesh and Titman, 1993) has a very limited influence on estimating the expected return of Nifty. The maximum explanation of expected return comes from the market factor defined by Sharpe-Lintner model during the period under consideration.","PeriodicalId":6549,"journal":{"name":"2014 2nd International Conference on Business and Information Management (ICBIM)","volume":"107 1","pages":"141-143"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79699717","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}
Pub Date : 2014-12-04DOI: 10.1109/ICBIM.2014.6970959
S. R. Chowdhury, Koushik Ghosh
Not a single Indian university is among the World's top 200, according to a new global ranking. The QS World Universities Ranking published has miserable news for India's education system. Around 11 Indian institutes/universities feature in the top 800 of the global lists with the highest ranking going to IIT Delhi which is passed 222 in the list. Two other made it to the top 300 are IIT Bombay and IIT Kanpur. The story was similar in the latest Times Higher Education World Universities ranking with no Indian institution being ranked among the top 200. A country of India's rich intellectual history, vast size and growing economic power needs at least some world class universities that can compete with the very best universities in the world. This paper tries to examine the average score difference between Indian top institutes with the global top universities on the basis of QS database and tries to explore the reasons for such differences. This paper also tries to show the level of competitiveness amongst Indian top institutes and adherence to global practices for attaining global standards to catch up the top universities of the world and revive India's lost glory.
{"title":"Profile and practices of Indian premier institutes compared to global standards on the basis of QS World Universities Ranking 2013–14","authors":"S. R. Chowdhury, Koushik Ghosh","doi":"10.1109/ICBIM.2014.6970959","DOIUrl":"https://doi.org/10.1109/ICBIM.2014.6970959","url":null,"abstract":"Not a single Indian university is among the World's top 200, according to a new global ranking. The QS World Universities Ranking published has miserable news for India's education system. Around 11 Indian institutes/universities feature in the top 800 of the global lists with the highest ranking going to IIT Delhi which is passed 222 in the list. Two other made it to the top 300 are IIT Bombay and IIT Kanpur. The story was similar in the latest Times Higher Education World Universities ranking with no Indian institution being ranked among the top 200. A country of India's rich intellectual history, vast size and growing economic power needs at least some world class universities that can compete with the very best universities in the world. This paper tries to examine the average score difference between Indian top institutes with the global top universities on the basis of QS database and tries to explore the reasons for such differences. This paper also tries to show the level of competitiveness amongst Indian top institutes and adherence to global practices for attaining global standards to catch up the top universities of the world and revive India's lost glory.","PeriodicalId":6549,"journal":{"name":"2014 2nd International Conference on Business and Information Management (ICBIM)","volume":"28 1","pages":"74-78"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87402337","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}
Pub Date : 2014-12-04DOI: 10.1109/ICBIM.2014.6970941
Rama Ranjan Panda, M. Reza
In this paper we consider Mamdani fuzzy inference system to study for optimizing the buffer overflow probability in a single M/M/1 queue and two M/M/1 queue in tandem Jackson networks. Mamdani fuzzy inference system is proposed to estimate the service rate for the Jackson queueing network. The arrival rate and the highest overflow level of a particular queue are provided to the Mamdani fuzzy inference system which generates the service rate according to the fuzzy rule base. The arrival rate, the highest overflow level and the new service rate will be used to estimate the buffer overflow in a single M/M/1queueing network then in two queues in tandem queueing network. Simulation results shows that Mamdani fuzzy inference system reduce the buffer overflow probability as compared with the normal estimation of buffer overflow probability.
{"title":"Optimization of buffer overflow probability in Jackson queueing networks using Mamdani fuzzy inferecnce system","authors":"Rama Ranjan Panda, M. Reza","doi":"10.1109/ICBIM.2014.6970941","DOIUrl":"https://doi.org/10.1109/ICBIM.2014.6970941","url":null,"abstract":"In this paper we consider Mamdani fuzzy inference system to study for optimizing the buffer overflow probability in a single M/M/1 queue and two M/M/1 queue in tandem Jackson networks. Mamdani fuzzy inference system is proposed to estimate the service rate for the Jackson queueing network. The arrival rate and the highest overflow level of a particular queue are provided to the Mamdani fuzzy inference system which generates the service rate according to the fuzzy rule base. The arrival rate, the highest overflow level and the new service rate will be used to estimate the buffer overflow in a single M/M/1queueing network then in two queues in tandem queueing network. Simulation results shows that Mamdani fuzzy inference system reduce the buffer overflow probability as compared with the normal estimation of buffer overflow probability.","PeriodicalId":6549,"journal":{"name":"2014 2nd International Conference on Business and Information Management (ICBIM)","volume":"58 1","pages":"92-98"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90648038","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}
Pub Date : 2014-12-04DOI: 10.1109/ICBIM.2014.6970958
Sarmistha Agasti, P. Sengupta
Consumer satisfaction and consumer protection are the main challenging issues to modern day marketing. Consumer Protection offers business to re-examine its marketing policies and programmes for meeting the ever growing needs of consumer welfare. The present study has been undertaken to examine the Consumer Protection movement in India.
{"title":"Business regulation for consumer welfare- consumer protection in India, related to marketing","authors":"Sarmistha Agasti, P. Sengupta","doi":"10.1109/ICBIM.2014.6970958","DOIUrl":"https://doi.org/10.1109/ICBIM.2014.6970958","url":null,"abstract":"Consumer satisfaction and consumer protection are the main challenging issues to modern day marketing. Consumer Protection offers business to re-examine its marketing policies and programmes for meeting the ever growing needs of consumer welfare. The present study has been undertaken to examine the Consumer Protection movement in India.","PeriodicalId":6549,"journal":{"name":"2014 2nd International Conference on Business and Information Management (ICBIM)","volume":"1 1","pages":"69-73"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89843575","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}
Pub Date : 2014-12-04DOI: 10.1109/ICBIM.2014.6970956
Chaitali Biswas Dutta, U. Biswas
In wireless network, nodes are not connected by physical links. Routing is an important factor in wireless network. Ad-hoc On-demand Distance Vector (AODV) is one of the most widely used routing protocol in wireless sensor networks. AODV is a stateless protocol that establishes and maintains a single route between source and destination. If the path is disrupted, then another alternate path is determined. An alternative of AODV, called multipath AODV, has been proposed that establishes multiple routes between source and destination nodes in a single route discovery. So, multipath AODV can use alternative paths in case of failure without going for another route discovery phase. So multipath AODV gives better performance compared to single path AODV. The traditional AODV protocol is vulnerable to the well-known black hole attack. In case of multipath AODV, when one path is affected by blackhole attack, then source node can choose another alternative path. In this paper we propose a new type blackhole attack mainly targeting multipath AODV. To the best of our knowledge there is no blackhole attack which specifically targets multipath AODV. Broadly speaking, in the proposed blackhole attack, the attacker looks for nodes through which many alternative paths of multipath AODV passes through. Such nodes are selected and blackhole attack is launched targeting them, thereby damaging more number of paths in a single attempt. Further, the attacker selects only those genuine nodes through more than a threshold number of alternative paths pass through, thereby facilitating the attacker to use less number of nodes. So the attack scheme is power aware. NS2 experimental results show the validity of the proposed attack.
{"title":"An energy aware blackhole attack for multipath AODV","authors":"Chaitali Biswas Dutta, U. Biswas","doi":"10.1109/ICBIM.2014.6970956","DOIUrl":"https://doi.org/10.1109/ICBIM.2014.6970956","url":null,"abstract":"In wireless network, nodes are not connected by physical links. Routing is an important factor in wireless network. Ad-hoc On-demand Distance Vector (AODV) is one of the most widely used routing protocol in wireless sensor networks. AODV is a stateless protocol that establishes and maintains a single route between source and destination. If the path is disrupted, then another alternate path is determined. An alternative of AODV, called multipath AODV, has been proposed that establishes multiple routes between source and destination nodes in a single route discovery. So, multipath AODV can use alternative paths in case of failure without going for another route discovery phase. So multipath AODV gives better performance compared to single path AODV. The traditional AODV protocol is vulnerable to the well-known black hole attack. In case of multipath AODV, when one path is affected by blackhole attack, then source node can choose another alternative path. In this paper we propose a new type blackhole attack mainly targeting multipath AODV. To the best of our knowledge there is no blackhole attack which specifically targets multipath AODV. Broadly speaking, in the proposed blackhole attack, the attacker looks for nodes through which many alternative paths of multipath AODV passes through. Such nodes are selected and blackhole attack is launched targeting them, thereby damaging more number of paths in a single attempt. Further, the attacker selects only those genuine nodes through more than a threshold number of alternative paths pass through, thereby facilitating the attacker to use less number of nodes. So the attack scheme is power aware. NS2 experimental results show the validity of the proposed attack.","PeriodicalId":6549,"journal":{"name":"2014 2nd International Conference on Business and Information Management (ICBIM)","volume":"73 1","pages":"142-147"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75067307","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：