下一代最新文献

筛选
英文 中文
A comparative study of potential of various social networks for target brand marketing 各种社会网络对目标品牌营销潜力的比较研究
下一代 Pub Date : 2016-10-01 DOI: 10.1109/INCITE.2016.7857636
Tripti Agrawal, A. Singhal, Shikha Agarwal
{"title":"A comparative study of potential of various social networks for target brand marketing","authors":"Tripti Agrawal, A. Singhal, Shikha Agarwal","doi":"10.1109/INCITE.2016.7857636","DOIUrl":"https://doi.org/10.1109/INCITE.2016.7857636","url":null,"abstract":"Social Networks are imperative source of data analysis due to availability of data in high volume. Data available on these social networks have diverse features and utilities for different organizations. Marketing of brands on social networks is a vital step for business organizations these days. Customer brand perceptions and their purchasing decisions are highly influenced by web communications and social networking services. There are many business organizations who are marketing their brands on every social network with the aim of driving high user traffic but in actual, they are facing low user engagement towards their brand posts. It has also been observed that there are business organizations that still consider only Twitter and Facebook for brand marketing ignoring potential of other social networks. Thus, the aim of study is to analyze potential of various social networks in enhancing user engagement level for various brands and also finding reasons for variation in the user engagement level for same brands on different social networks. The present paper gives an insight to business organizations in enhancing their marketing strategy on suitable social networks. A case study has been given to compare and highlight potential of various social networks in increasing user engagement for brand information.","PeriodicalId":59618,"journal":{"name":"下一代","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75495402","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
Design of a compact triple band-notch flower-shaped hexagonal microstrip patch antenna 一种紧凑的三带陷波花型六边形微带贴片天线的设计
下一代 Pub Date : 2016-10-01 DOI: 10.1109/INCITE.2016.7857634
Sayed Arif Ali, D. Jhanwar, Dhirendra Mathur
{"title":"Design of a compact triple band-notch flower-shaped hexagonal microstrip patch antenna","authors":"Sayed Arif Ali, D. Jhanwar, Dhirendra Mathur","doi":"10.1109/INCITE.2016.7857634","DOIUrl":"https://doi.org/10.1109/INCITE.2016.7857634","url":null,"abstract":"In this paper, a compact triple band-notch Direct fed Flower-shaped Hexagonal Microstrip Patch Antenna is presented for embedding in UWB (Ultra-Wide Band) systems. The antenna consists of two C-shape slot resonators in the patch and two parasitic strips parallel to microstrip feed line. The antenna is designed in Ansoft HFSS ver. 15. Three notched bands created are 3.3–4.2 GHz, 5.15–5.825 GHz and 8.025–8.4 GHz. These three notched-bands includes rejection characteristics for IEEE 802.16 i.e. WI-Max at 3.5/5.5 GHz (3.3 to 3.7 GHz and 5.25–5.85 GHz), IEEE 802.11a i.e. WLAN2 systems at 5.2/5.8 GHz (5.15–5.35 and 5.725–5.825 GHz), Satellite C Band at 4 GHz (3.7–4.2 GHz) and ITU Band at 8.2 GHz (8.025–8.4 GHz). Overall six standard bands are notched. All notches are controllable. The simulation results of antenna shows ultra-wide impedance matching, good gain and stable radiation patterns across operational bandwidth and is suitable for wireless UWB applications.","PeriodicalId":59618,"journal":{"name":"下一代","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74643208","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
Performance evaluation of segmenting images using improved FELICM based gray stretch 基于改进FELICM的灰度拉伸图像分割性能评价
下一代 Pub Date : 2016-10-01 DOI: 10.1109/INCITE.2016.7857601
Ritambhra Vaid, N. Bawa
{"title":"Performance evaluation of segmenting images using improved FELICM based gray stretch","authors":"Ritambhra Vaid, N. Bawa","doi":"10.1109/INCITE.2016.7857601","DOIUrl":"https://doi.org/10.1109/INCITE.2016.7857601","url":null,"abstract":"Segmenting an image plays a crucial role in digital image processing. Segmentation depicts how the object is composed in an image and aids in extracting useful information from it so that interpretation becomes easier. Segmentation may be regarded as an essential pre-processing stage that will help to acquire objects that can be efficiently utilized in further steps of processing. This extraction of objects is helpful in almost every field today such as medical, forensic, industry and agriculture. Instead of using pixels, DWT make use of waves that helps to extract object efficiently. To raise the segmentation accuracy further an improved Fuzzy-C Mean with Edge and Local Information (FELICM) based gray stretch strategy is suggested that will help to segment an image by obtaining an optimistic and adaptive threshold by incorporating FELICM and gray stretch on coefficients with low frequency and edge enhancement on coefficients with high frequency after DWT. Existing and the proposed strategies have been compared using parameters Accuracy, Uniformity, Shape measurement and Regional Contrast.","PeriodicalId":59618,"journal":{"name":"下一代","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75141020","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}
引用次数: 0
CSplineT: A cubic spline based target tracking protocol for wireless sensor networks CSplineT:基于三次样条的无线传感器网络目标跟踪协议
下一代 Pub Date : 2016-10-01 DOI: 10.1109/INCITE.2016.7857631
Tauseef Ahmad, A. Abbas
{"title":"CSplineT: A cubic spline based target tracking protocol for wireless sensor networks","authors":"Tauseef Ahmad, A. Abbas","doi":"10.1109/INCITE.2016.7857631","DOIUrl":"https://doi.org/10.1109/INCITE.2016.7857631","url":null,"abstract":"Devising a scheme for tracking a moving object in a WSN is a challenging task. In this paper, we propose a protocol for tracking a moving object by predicting its positions in a wireless sensor network. The proposed scheme uses the locations obtained through estimations for predicting the next target locations. The estimated locations are obtained by computing the locations of the object by sensors lying in the communication range. Extensive simulations are done to evaluate the performance of proposed protocol. The results show that the proposed scheme is efficient and possesses good tracking accuracy.","PeriodicalId":59618,"journal":{"name":"下一代","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80881056","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
NTRP: Novel approach for DUT testing based on nonintrusive timing randomization probes using SystemC verification library NTRP:采用SystemC验证库的基于非侵入式时序随机化探针的被测件测试新方法
下一代 Pub Date : 2016-10-01 DOI: 10.1109/INCITE.2016.7857632
Nishit Gupta, Sunil Alag
{"title":"NTRP: Novel approach for DUT testing based on nonintrusive timing randomization probes using SystemC verification library","authors":"Nishit Gupta, Sunil Alag","doi":"10.1109/INCITE.2016.7857632","DOIUrl":"https://doi.org/10.1109/INCITE.2016.7857632","url":null,"abstract":"To meet the rapidly transforming computing requirement of System on Chip (SoC), On-Chip Interconnect BUS specifications is been evolved continuously from single-channel one-way, serial, in-order, shared BUS communication system to complex multi-channel, burst based, out-of-order, separate read/ write/ address BUS communication system. This resulted in development of several industry standard verification methodologies using Hardware Description Languages particularly System Verilog like Universal Verification Methodology (UVM) facilitating constrained randomization based stimulus generation and functional coverage. Adopting such methodologies involves its know-how to get accustomed, recurring licensing charges and simulation overhead. In this work, for stress testing of Design Under Test (DUT), a novel approach is proposed based on Bus Cycle Accurate Nonintrusive Timing Randomization Probes (NTRP) using SystemC Verification (SCV) Library. Based on empirical results, it is argued that the annotations proposed in the work using NTRP causes little overhead, however provides convenient approach for adding timing delays to the interface of DUT including other advantages particularly — transactions reordering for better BUS utilization, selective constrained randomization on interface signal timing, score boarding for self-checking, little simulation overheads and no licensing terms, being based on Open Source SCV, makes it convenient to adopt for DUT testing.","PeriodicalId":59618,"journal":{"name":"下一代","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85852861","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}
引用次数: 0
Internet of Things with mruby 物联网与mruby
下一代 Pub Date : 2016-10-01 DOI: 10.1109/INCITE.2016.7857606
Avinash Dev Nagumanthri, Kazauki Tanaka
{"title":"Internet of Things with mruby","authors":"Avinash Dev Nagumanthri, Kazauki Tanaka","doi":"10.1109/INCITE.2016.7857606","DOIUrl":"https://doi.org/10.1109/INCITE.2016.7857606","url":null,"abstract":"Internet of Things is a new trend outside traditional computing devices which are connected to the Internet whereby linking small and efficient embedded computing to a web-platform, thereby creating a new world of connected devices. Internet of Things (IoT) concentrates on the fact that the “things” that surround us can generate data which can be collected and analyzed by providing a gateway between the things and the Internet, thus offering live data acquisition and control. This paper introduces mruby which is a scripting programming language to connect with IoT based web-platform contemporary to C programming language for embedded systems. Experimental results demonstrate the effectiveness of mruby when connected to the cloud.","PeriodicalId":59618,"journal":{"name":"下一代","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83223039","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
Performance analysis of GPON network for maximum Q-FACTOR and minimum BER for various fiber length using uniform fiber Bragg's grating 采用均匀光纤布拉格光栅的GPON网络在不同光纤长度下最大q因子和最小误码率的性能分析
下一代 Pub Date : 2016-10-01 DOI: 10.1109/INCITE.2016.7857625
Sanjeev Verma, Amayika Kakati, M. Tripathy, Aran Kumar Singh, Sunil Kumar, H. Rana
{"title":"Performance analysis of GPON network for maximum Q-FACTOR and minimum BER for various fiber length using uniform fiber Bragg's grating","authors":"Sanjeev Verma, Amayika Kakati, M. Tripathy, Aran Kumar Singh, Sunil Kumar, H. Rana","doi":"10.1109/INCITE.2016.7857625","DOIUrl":"https://doi.org/10.1109/INCITE.2016.7857625","url":null,"abstract":"Today' New generation need a high speed communication so we use numerous type of communication system. Transmission of data are occurred in various way like wired, wireless or in optical fiber. For transmission through optical fiber, various Parameter such as Maximum Q-factor, Minimum BER, Eye height, Threshold are those parameters' which define the efficiency of the network for different type of application like live television broadcast, video on demand, video on internet etc. In this paper, our main focus is that how we can improve Q-Factor and minimize minimum BER by varying kilometer and user defined bit sequence in optical fiber communication system using uniform fiber Bragg grating in “OPTISYSTEM” software. By using user defined bit 1010101010 as input at kilometer 70km we get maximum Q-factor of 13.9572 and minimum BER of 1.21174e-044 as output.","PeriodicalId":59618,"journal":{"name":"下一代","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83715764","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
Low-power stack pseudo domino logic using contention-alleviated precharge keeper 低功耗堆栈伪多米诺逻辑,使用减少争用的预充值器
下一代 Pub Date : 2016-10-01 DOI: 10.1109/INCITE.2016.7857614
Deepika Bansal, B. P. Singh, Ajay Kumar
{"title":"Low-power stack pseudo domino logic using contention-alleviated precharge keeper","authors":"Deepika Bansal, B. P. Singh, Ajay Kumar","doi":"10.1109/INCITE.2016.7857614","DOIUrl":"https://doi.org/10.1109/INCITE.2016.7857614","url":null,"abstract":"The dynamic circuits propose superior speed and low power dissipation over static CMOS circuits. The domino logic circuits are used for high system performance but these circuits suffer from the degradation of the precharge pulse. Therefore, this article provides different design topologies on the pseudo domino circuits to overcome the charge sharing and charge leakage with reference to the power dissipation. The circuit analysis of the power dissipation have been done on Tanner EDA tool for 45 nm technology. The proposed pseudo domino techniques are proffered to economize power dissipation and delay up to 32% and 20% in half adder circuit respectively.","PeriodicalId":59618,"journal":{"name":"下一代","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85977249","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
Quantifying software reliability using testing effort 通过测试工作来量化软件可靠性
下一代 Pub Date : 2016-10-01 DOI: 10.1109/INCITE.2016.7857582
S. Khatri, S. A. John, R. Majumdar
{"title":"Quantifying software reliability using testing effort","authors":"S. Khatri, S. A. John, R. Majumdar","doi":"10.1109/INCITE.2016.7857582","DOIUrl":"https://doi.org/10.1109/INCITE.2016.7857582","url":null,"abstract":"Multiple Software Reliability Growth Models (SRGM) has been illustrated to inspire designers and software developers to develop quality software. These models implicitly assume that expenditure is constant throughout testing effort. Recently importance was given to the testing phase by the development team and it requires controlled screening closely to raise its overall operational efficiency. Software Reliability Growth Models exhibits a precise relation between the failure patterns with time. Considering this as a basic building block a SRGM which is a Non-Homogeneous Poisson Process in nature is i in this work. The various aspects of our proposed model are testing effort function and fault detection rate (FDR). Mainly in Software Reliability Growth Model it was assumed that fault removal process are perfect which is not true in reality as new faults may get introduced during removal or some faults may not get removed due to its complexity. Thus in this model the concept of imperfect debugging was considered and assists us to justify the software reliability more convincingly through the help of testing effort function.","PeriodicalId":59618,"journal":{"name":"下一代","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82443562","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
Automated Massecuite Sucro Crystal Size characterization system for crystallization pan in sugar industry 用于制糖工业结晶盘的自动Massecuite超晶粒尺寸表征系统
下一代 Pub Date : 2016-10-01 DOI: 10.1109/INCITE.2016.7857595
L. R. Sreedhanya, Philomina Simon, L. Thomas
{"title":"Automated Massecuite Sucro Crystal Size characterization system for crystallization pan in sugar industry","authors":"L. R. Sreedhanya, Philomina Simon, L. Thomas","doi":"10.1109/INCITE.2016.7857595","DOIUrl":"https://doi.org/10.1109/INCITE.2016.7857595","url":null,"abstract":"Automated Massecuite Sucro Crystal Sizing System has been developed to analyze the sucrose crystals, size and shape in the crystallization pan. The sucrose crystals present in the massecuite are analyzed by a microscopic camera. This paper proposes an automated method for identifying the size of sucro crystal by performing a series of contrast enhancement techniques including statistical momentary analysis through standard deviation. This helps to equalize the intensity distribution in the massecuite images at the preprocessing stage. This work Identifies the crystal cluster from the massecuite which helps to characterize crystal size distribution in the crystallization pan. Crystal Size analysis guides the plant operator to improve the quality of the final product in sugar industry.","PeriodicalId":59618,"journal":{"name":"下一代","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73274220","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学术文献互助群
群 号:481959085
Book学术官方微信