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

Int. J. Embed. Syst.最新文献

筛选
英文 中文
A method of crime rate forecast based on wavelet transform and neural network 基于小波变换和神经网络的犯罪率预测方法
Int. J. Embed. Syst. Pub Date : 2019-12-02 DOI: 10.1504/ijes.2019.10025624
L. Mao, Wei Du
{"title":"A method of crime rate forecast based on wavelet transform and neural network","authors":"L. Mao, Wei Du","doi":"10.1504/ijes.2019.10025624","DOIUrl":"https://doi.org/10.1504/ijes.2019.10025624","url":null,"abstract":"Accurate prediction of crime is highly challenging. In order to improve efficiency of situational crime prevention, the temporal distribution of the crime rate within 24 hours was analysed and a forecast model combining discrete wavelet transform and resilient backpropagation neural network (DWT-RBPNN) is presented. First, historical crime incidence sequences obtained by the sliding window were decomposed by discrete wavelet transform. Then RBPNN trained decomposition sequences to predict the incidence of future trends and details. Finally, the trends and details were reconstructed to get the final prediction sequence. The experimental results showed that the proposed model has relatively high accuracy and feasibility on the crime rate prediction compared with single method of BPNN. The utility of the DWTRBPNN model can offer an exciting new horizon to provide crime rate forecasting and early warning in the situational crime prevention.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114515078","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
Big data and collective intelligence 大数据和集体智慧
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/ijes.2019.102430
M. Ivanović, Aleksandra Klašnja-Milićević
{"title":"Big data and collective intelligence","authors":"M. Ivanović, Aleksandra Klašnja-Milićević","doi":"10.1504/ijes.2019.102430","DOIUrl":"https://doi.org/10.1504/ijes.2019.102430","url":null,"abstract":"Nowadays the creation and accumulation of big data is an unavoidable process in a wide range of situations and scenarios. Smart environments and diverse sources of sensors, as well as the content created by humans, contribute to the big data's enormous size and characteristics. To make sense of the data, analyse and use these data, more and more efficient algorithms are being developed constantly. Still, the effectiveness of these algorithms depends on the specific nature of big data: analogue, noisy, implicit, and ambiguous. At the same time, there is the unavoidable scientific area of collective intelligence. It represents the capability of interconnected intelligences to collectively and more efficiently solve concrete problems than each individual intelligence would be able to do on its own. The paper presents an overview of recent achievements in big data and collective intelligence research areas. At the end, the perspectives and challenges of the common directions of these two areas will be discussed.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121894685","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
Research on borrower's credit classification of P2P network loan based on LightGBM algorithm 基于LightGBM算法的P2P网络借贷借款人信用分类研究
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/ijes.2019.102434
Sen Zhang, Yuping Hu, Zhuoyi Tan
{"title":"Research on borrower's credit classification of P2P network loan based on LightGBM algorithm","authors":"Sen Zhang, Yuping Hu, Zhuoyi Tan","doi":"10.1504/ijes.2019.102434","DOIUrl":"https://doi.org/10.1504/ijes.2019.102434","url":null,"abstract":"The credit classification of a borrower is the main method to effectively reduce the credit risk of P2P online loans. In this paper, LightGBM algorithm has the advantage in the high accuracy of data classification. Feature extraction, selection and reconstruction of the original data are performed by feature engineering. The One hot Encoding technology is used to re-encode the discretised feature indicators. Z-score data normalisation normalises the characteristics of continuous variables. Re-sort all feature indicators by contribution and perform PCA dimensionality reduction, and filter out effective feature indicators for training and testing. Finally, the problem of imbalance of samples and optimisation of model parameters is solved by ten-fold cross-validation. Result of simulation experiment shows that the LightGBM model has good stability, good fitting ability and high classification prediction accuracy.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131741427","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
Differentially private geospatial data publication based on grid clustering 基于网格聚类的差分私有地理空间数据发布
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/ijes.2019.102435
Dongni Yang, Songyan Li, Zhaobin Liu, Xinfeng Ye
{"title":"Differentially private geospatial data publication based on grid clustering","authors":"Dongni Yang, Songyan Li, Zhaobin Liu, Xinfeng Ye","doi":"10.1504/ijes.2019.102435","DOIUrl":"https://doi.org/10.1504/ijes.2019.102435","url":null,"abstract":"Collecting geospatial data from location-based services can provide location evidence while analysing spatial information. However, releasing location data may result in the disclosure of sensitive personal information. The adaptive grid method (AG) uses differential privacy to protect information. In AG, the algorithm uses two levels of grids over data domain. However, it does not take into account the data distribution. Usually, the accuracy will be reduced in response to long-range counting queries. In this paper, the adjacent grid cells with similar data density are clustered together. Laplace noise is added to the clusters created by the clustering of the grid cells. The noisy count obtained from the grid cells that form each cluster is evenly redistributed to the grid cells in the cluster. Extensive experiments on real-world datasets showed that the query accuracy of the proposed method is higher than the existing methods.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126469929","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
Cryptanalysis of the existing integrated PKE and PEKS schemes 现有集成PKE和PEKS方案的密码分析
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/ijes.2019.102438
Yang Lu, Qiya Zeng
{"title":"Cryptanalysis of the existing integrated PKE and PEKS schemes","authors":"Yang Lu, Qiya Zeng","doi":"10.1504/ijes.2019.102438","DOIUrl":"https://doi.org/10.1504/ijes.2019.102438","url":null,"abstract":"Public key encryption with keyword search (PEKS) is a useful cryptographic primitive which allows one to delegate to an untrusted storage server the capability of searching on publicly encrypted data without impacting the security and privacy of original data. However, due to lack of data encryption/decryption function, a PEKS scheme cannot be used alone but has to be coupled with a standard public key encryption (PKE) scheme. For this reason, a new cryptographic primitive called integrated PKE and PEKS (PKE/PEKS) was introduced by Baek et al. in 2006, which provides the functions of both PKE and PEKS. So far, several PKE/PEKS schemes have been proposed in the literature. However, none of them considers the keyword guessing attack. The first PKE/PEKS scheme proposed by Baek et al. was shown to be insecure under this attack. In this paper, we analyse the security of other PKE/PEKS schemes. We demonstrate that none of these schemes can resist the keyword guessing attack. The presented attacks show that a malicious storage server can successfully guess the keyword encoded in any keyword trapdoor produced by these schemes. Therefore, it is still an unsolved problem to devise a PKE/PEKS scheme withstanding the keyword guessing attack.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124589252","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
A novel HHT and KS statistic approach to detect RoQ attack in wireless sensor network 一种新的HHT和KS统计方法检测无线传感器网络中的RoQ攻击
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/ijes.2019.102439
Hongsong Chen, Zhongchuan Fu, G. Wang
{"title":"A novel HHT and KS statistic approach to detect RoQ attack in wireless sensor network","authors":"Hongsong Chen, Zhongchuan Fu, G. Wang","doi":"10.1504/ijes.2019.102439","DOIUrl":"https://doi.org/10.1504/ijes.2019.102439","url":null,"abstract":"Reduction of quality (RoQ) attack is a special denial of service (DoS) attack. It is a serious threat to the security of wireless sensor network (WSN). The RoQ attack combines the attack effectiveness and the similarity to normal traffic, so it is difficult to detect by traditional methods. Hilbert-Huang transform (HHT) time frequency analysis method can be utilised to analyse the nonlinear small signal produced by RoQ attack. However, false IMF components are the challenge problems to detect the RoQ attack. Kolmogorov-Smirnov (KS) test approach is proposed to recognise the false intrinsic mode function (IMF) components. CC2530 system-on-chip is selected to build WSN experimental node. Ad hoc on-demand distance vector (AODV) routing protocol and random routing request (RREQ) flooding attack are simulated to implement RoQ attack in Zigbee wireless sensor network. Experimental results demonstrate that the novel approach is effective to detect RoQ attack in Zigbee WSN.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129534395","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
A design methodology for mobile and embedded applications on FPGA-based dynamic reconfigurable hardware 基于fpga的动态可重构硬件的移动和嵌入式应用设计方法
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/IJES.2019.10018522
D. Perera, K. F. Li
{"title":"A design methodology for mobile and embedded applications on FPGA-based dynamic reconfigurable hardware","authors":"D. Perera, K. F. Li","doi":"10.1504/IJES.2019.10018522","DOIUrl":"https://doi.org/10.1504/IJES.2019.10018522","url":null,"abstract":"With the proliferation of mobile/embedded devices, multiple running applications are becoming a necessity on these devices. Thus, state-of-the-art techniques are needed to support complex applications running on mobile systems. We envision in the near future, many mobile devices will be implemented/delivered on FPGA-based reconfigurable chips. Previous analysis illustrated that FPGA-based dynamic-reconfigurable-hardware is currently the best option to deliver embedded applications that have stringent requirements. However, computation models and application characteristics play significant roles in determining whether this hardware is indeed a good match for specific embedded applications. Furthermore, selecting a specific dynamic reconfiguration method (out of many) and designing the corresponding hardware architectures for an application are important and challenging tasks. This paper proposes a design methodology for FPGA-based dynamic-reconfigurable-hardware that provides guidelines in mapping application's computation models and characteristics to the most suitable reconfiguration methods. Pipelined and functional-parallel models are used as case studies to illustrate the design methodology.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122821880","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
Research on profit abilities of order placement strategies in pairs trading 配对交易中下单策略盈利能力研究
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/ijes.2019.102433
Suyuan Luo
{"title":"Research on profit abilities of order placement strategies in pairs trading","authors":"Suyuan Luo","doi":"10.1504/ijes.2019.102433","DOIUrl":"https://doi.org/10.1504/ijes.2019.102433","url":null,"abstract":"This paper discusses profit abilities of three pairs-trading strategies. When spreads of one pair reach an entry threshold, traders submit limit orders for one lowly liquid stock and market orders for the other highly liquid stock. In order to research on profit abilities, this paper models spreads of that pair of stocks as an Ornstein-Uhlenbeck (OU) process and supposes execution time of limit orders as a random variable independent of spreads of the pair. Strategy 1 is a traditional pairs-trading strategy with market orders. Inversely, strategies 2 and 3 are pairs-trading strategies related to limit orders. Finally, this research finds out that pairs-trading strategies with limit orders can beat pairs-trading strategies with market orders through an empirical experiment with real-world data. The contribution of this paper is to analyse three strategies and verify that strategy 3 has the best performance when the investment threshold is low. The results of this paper can help investors to make rational investment.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127098167","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
HighPU: a high privacy-utility approach to mining frequent itemset with differential privacy HighPU:一种高隐私效用的方法，用于挖掘具有差分隐私的频繁项集
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/ijes.2019.10024129
Yabin Wang, Yi Qiao, Zhaobin Liu, Zhiyi Huang
{"title":"HighPU: a high privacy-utility approach to mining frequent itemset with differential privacy","authors":"Yabin Wang, Yi Qiao, Zhaobin Liu, Zhiyi Huang","doi":"10.1504/ijes.2019.10024129","DOIUrl":"https://doi.org/10.1504/ijes.2019.10024129","url":null,"abstract":"In the field of data mining, frequent itemset mining (FIM) is a popular technique for analysing transaction datasets and establishing the foundation of association rules. Publishing frequent itemsets, however presents privacy challenges. Differential privacy provides strong privacy assurance to users. In this paper, we study the problem of mining frequent itemsets under the rigorous differential privacy model. We propose an approach, called HighPU, which achieves both high data utility and high degree of privacy in FIM. HighPU begins by truncating transactions over the original dataset. Then HighPU directly searches for maximal frequent itemsets. And we use a consistent approach to improve the accuracy of the results. Extensive experiments using several real datasets illustrate that HighPU significantly outperforms the current state of the art.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133407475","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
DDoS attack detection based on global unbiased search strategy bee colony algorithm and artificial neural network 基于全局无偏搜索策略蜂群算法和人工神经网络的DDoS攻击检测
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/ijes.2019.102432
Qiuting Tian, Dezhi Han, Zhenxin Du
{"title":"DDoS attack detection based on global unbiased search strategy bee colony algorithm and artificial neural network","authors":"Qiuting Tian, Dezhi Han, Zhenxin Du","doi":"10.1504/ijes.2019.102432","DOIUrl":"https://doi.org/10.1504/ijes.2019.102432","url":null,"abstract":"Distributed denial of service (DDoS) attacks are one of the common cyber threats today and are difficult to trace and prevent. The DDoS attack detection method for a single artificial neural network has the problems of slow convergence speed and easy to fall into local optimum. A DDoS attack detection method combining global unbiased search strategy bee colony algorithm and artificial neural network is proposed. This method uses the loss function of the artificial neural network as the objective function of the global unbiased search strategy bee colony algorithm. The optimal weights and thresholds are chosen as the initialisation parameters of the artificial neural network, in order to avoid the artificial neural network falling into a slow convergence speed and local optimum, thereby realising efficient DDoS attack detection. Experimental results show that the DDoS attack detection method has improved the detection accuracy, convergence speed and has good generalisation ability.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125767580","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学术官方微信