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

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

筛选
英文 中文
Design and application of real-time network abnormal traffic detection system based on Spark Streaming 基于Spark Streaming的实时网络异常流量检测系统的设计与应用
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/ijes.2019.102428
Fucheng Pan, Dezhi Han, Yuping Hu
{"title":"Design and application of real-time network abnormal traffic detection system based on Spark Streaming","authors":"Fucheng Pan, Dezhi Han, Yuping Hu","doi":"10.1504/ijes.2019.102428","DOIUrl":"https://doi.org/10.1504/ijes.2019.102428","url":null,"abstract":"In order to realise the rapid analysis and identification of abnormal traffic in real-time networks, a distributed real-time network abnormal traffic detection system (DRNATDS) was designed, which could effectively analyse abnormal network traffic. DRNATDS provided effective real-time big data analysis platform and guaranteed network security. The paper proposes K-means algorithm based on relative density and distance, integrated with Spark Streaming and Kafka. It could effectively detect various network attacks under real-time data stream. The experimental results show that DRNATDS has good high availability and stability. Compared to other algorithms, K-means algorithm based on relative density and distance could more effectively identify abnormal network traffic and improve the recognition rate.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"32 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":"125908644","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
A dynamic cluster job scheduling optimisation algorithm based on data irreversibility in sensor cloud 传感器云中基于数据不可逆性的动态集群作业调度优化算法
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/ijes.2019.102427
Zeyu Sun, Jun Liu, X. Xing, Chuanfeng Li, Xiaoyan Pan
{"title":"A dynamic cluster job scheduling optimisation algorithm based on data irreversibility in sensor cloud","authors":"Zeyu Sun, Jun Liu, X. Xing, Chuanfeng Li, Xiaoyan Pan","doi":"10.1504/ijes.2019.102427","DOIUrl":"https://doi.org/10.1504/ijes.2019.102427","url":null,"abstract":"The optimisation algorithm based on irreversible data for the job scheduling of dynamic cluster is crucial to the improvement of the cluster rendering throughput and the cluster rendering efficiency. However, the dispatching imbalance of the cluster rendering task on the massive number of cluster rendering nodes will prolong the waiting time for the completion of job. Therefore, we propose dynamic cluster job scheduling optimisation algorithm based on data irreversibility (DCJS_DI). Firstly, we analyse the job scheduling target. Then, we exploit the frame independence with the clustering rendering and further establish the job scheduling model for the irreversible data dynamic cluster. Next, we elaborate on the job scheduling process of the irreversible data dynamic cluster and the dispatching process of the cluster rendering task. Finally, we investigate via simulation results the impacts of the job hunger and the resource fragmentation issue of the traditional job scheduling strategies on the system performance, the impacts of the multi-progress and multi-threading cluster rendering on the job completion time and the resource efficiency of the irreversible data dynamic cluster. We further study the extension of the cluster computation capability and the reliability issue of the cloud service.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"212 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":"133451622","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
Research on user acceptance behaviour of mobile group intelligent sensing applications based on UTAUT 基于UTAUT的移动群组智能传感应用的用户接受行为研究
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/ijes.2019.102431
Xiaolong Ma, Yonghui Dai, Weining Tang, Guowei Li, Shengqi Lu
{"title":"Research on user acceptance behaviour of mobile group intelligent sensing applications based on UTAUT","authors":"Xiaolong Ma, Yonghui Dai, Weining Tang, Guowei Li, Shengqi Lu","doi":"10.1504/ijes.2019.102431","DOIUrl":"https://doi.org/10.1504/ijes.2019.102431","url":null,"abstract":"In the era of rapid development of the internet of things, group intelligence perception technology is widely used in various mobile APPs such as QQ, Alipay, Baidu map, etc. User's participation behaviour is a key factor in the system service quality and development. According to the analysis of the characteristics of group intelligence perception and the application development of mobile group intelligent sensing applications, we add the perceived trust, user acceptance and task technology matching to construct the UTAUT seven-factor model. Through the empirical test of 341 valid questionnaires collected in the survey, the results show that convenience conditions, perceived trust, performance expectations, effort expectations and task technology matching have a significant impact on users' willingness to adopt. Finally, based on the experimental results, we propose effective countermeasures and suggestions for the development of mobile group intelligent sensing applications.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"33 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":"114824686","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
Microcontroller design for security system: implementation of a microcontroller based on STM32F103 microchip 安防系统的单片机设计:基于STM32F103微芯片的单片机实现
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/ijes.2019.102440
Tabi Fouda Bernard Marie, D. Han, Bowen An
{"title":"Microcontroller design for security system: implementation of a microcontroller based on STM32F103 microchip","authors":"Tabi Fouda Bernard Marie, D. Han, Bowen An","doi":"10.1504/ijes.2019.102440","DOIUrl":"https://doi.org/10.1504/ijes.2019.102440","url":null,"abstract":"In the monitoring system, the server can crash at any time; therefore a low-cost performant microcontroller is implemented to enable the server to reset after crashing while protecting its data core, and then be able to display in real time the information saved during the crash. This paper encompasses a complete successful designed and tested microcontroller based on STM32F103C8T6 microchip. The design of the microcontroller through a printed circuit board (PCB) prototype, peripherals and chips was assembled to reset the server from the relay chip. The connection and data communication between the microcontroller and the server are via universal serial bus (USB) and J-link connection. The design is also using the AES256encryption algorithm to protect the data of the system. The simulation results show that after the server crashes, it can easily restart and run, avoiding hassles with insurance of protecting the data core of the system.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"62 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":"120948002","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
Research on modelling and scheduling strategy for mine transportation control system based on CPS 基于CPS的矿山运输控制系统建模与调度策略研究
Int. J. Embed. Syst. Pub Date : 2019-09-20 DOI: 10.1504/IJES.2019.10022383
Jingzhao Li, Dayu Yang, Xiaoming Zhang
{"title":"Research on modelling and scheduling strategy for mine transportation control system based on CPS","authors":"Jingzhao Li, Dayu Yang, Xiaoming Zhang","doi":"10.1504/IJES.2019.10022383","DOIUrl":"https://doi.org/10.1504/IJES.2019.10022383","url":null,"abstract":"Cyber-physical systems (CPS) have made great strides in industrial control, intelligent transportation, remote medical and other fields. Coal mine transportation control system is a representative multi-subsystem of CPS. In this study, for the sake of optimising the scheduling mechanism for event response and precise control of tramcar behaviour in the system, we propose an event-orient scheduling algorithm (EOSA) to achieve a rapid response based on building a no-memory continuous time model. Therefore, the control system can match tasks in the queue according to the real-time load situation, and each physical entity can accurately execute the instruction under discrete event environment. Simulation results have shown that the proposed algorithm has a higher execution speed compared with the hybrid genetic algorithm and fuzzy clustering scheduling algorithm. Our approach realises the load balancing of global task scheduling and is more suitable for mine transportation scenario.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"27 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":"121580594","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
Energy oriented EDF for real-time systems 面向实时系统的能源EDF
Int. J. Embed. Syst. Pub Date : 2019-06-25 DOI: 10.1504/IJES.2019.10022128
Gil Kedar, A. Mendelson, I. Cidon
{"title":"Energy oriented EDF for real-time systems","authors":"Gil Kedar, A. Mendelson, I. Cidon","doi":"10.1504/IJES.2019.10022128","DOIUrl":"https://doi.org/10.1504/IJES.2019.10022128","url":null,"abstract":"Energy is a major concern when designing real-time systems. A common method for saving energy while still guaranteeing the real-time constraints is to embed dynamic voltage and frequency scaling (DVFS) mechanisms and dynamic power management (DPM) mechanisms within a real-time scheduling algorithm such as EDF. This paper proposes a new extension to the EDF scheduler, termed energy oriented EDF (EO-EDF). The new scheduler makes it possible to change the original EDF task execution order to better utilise the slack time and thus decrease the energy consumption, while still meeting the task deadlines. The new task order is defined according to a novel criterion we invented, termed task prediction order (TPO). The paper introduces two new versions of the EO-EDF scheduler, termed TPO-EDF and STPO-EDF. While STPO-EDF applies the TPO criterion in a static manner, TPO-EDF allows it to be used dynamically. We simulate the new proposed algorithms using both synthetic workloads and real-time benchmarks. The evaluations show that integrating both the TPO-EDF and STPO-EDF scheduling algorithms with DVFS and DPM mechanisms achieves an energy savings of 30% on average, in comparison with current known EDF based scheduling utilising DVFS and DPM mechanisms.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133646435","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 randomised Kaczmarz method-based matrix completion algorithm for data collection in wireless sensor networks 基于随机Kaczmarz方法的无线传感器网络数据采集矩阵补全算法
Int. J. Embed. Syst. Pub Date : 2019-06-25 DOI: 10.1504/IJES.2019.10022140
Ying Wang, Guorui Li, Sancheng Peng, Cong Wang, Ying Yuan
{"title":"A randomised Kaczmarz method-based matrix completion algorithm for data collection in wireless sensor networks","authors":"Ying Wang, Guorui Li, Sancheng Peng, Cong Wang, Ying Yuan","doi":"10.1504/IJES.2019.10022140","DOIUrl":"https://doi.org/10.1504/IJES.2019.10022140","url":null,"abstract":"The paper proposes a novel matrix completion algorithm for data collection in wireless sensor networks through incorporating a randomised version of Kaczmarz method. By splitting the matrix completion problem into two convex sub-problems and solving the optimal probability computing problem in the randomised Kaczmarz method approximately with the D-optimal design solution, we reduce the reconstruction error and accelerate the convergence speed of the matrix completion computation. The synthetic data experiments show that the proposed algorithm presents more accurate reconstruction accuracy and faster reconstruction speed than the state-of-the-art matrix completion algorithms. Furthermore, we verify the practicality of the proposed matrix completion algorithm in real data collection scenario of wireless sensor networks through the experiments based on the real sensed dataset.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114095018","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
MOESIF: a MC/MP cache coherence protocol with improved bandwidth utilisation MOESIF:一个提高带宽利用率的MC/MP缓存一致性协议
Int. J. Embed. Syst. Pub Date : 2019-06-25 DOI: 10.1504/IJES.2019.10022129
Geeta Patil, Neethu Bal Mallya, B. Raveendran
{"title":"MOESIF: a MC/MP cache coherence protocol with improved bandwidth utilisation","authors":"Geeta Patil, Neethu Bal Mallya, B. Raveendran","doi":"10.1504/IJES.2019.10022129","DOIUrl":"https://doi.org/10.1504/IJES.2019.10022129","url":null,"abstract":"This paper proposes a novel cache coherence protocol - MOESIF - to improve the off chip and on chip bandwidth usage. This is achieved by the reducing the number of write backs to the next level memory and by reducing the numbers of responders to a cache miss when multiple copies of data exists in private caches. Experimental evaluation of various splash-2 benchmark programs on the CACTI 5.3 and CACOSIM simulators reveals that the MOESIF protocol outperforms all other hardware based coherence protocols in terms of energy consumption and access time. MOESIF protocol on an average offers 94.62%, 88.94%, 88.88% and 4.47% energy saving, and 96.37%, 92.83%, 92.77% and 9.21% access time saving over MI, MESI, MESIF and MOESI protocol respectively for different numbers of cores/processors.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"337 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121901996","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
A result correctness verification mechanism for cloud computing based on MapReduce 基于MapReduce的云计算结果正确性验证机制
Int. J. Embed. Syst. Pub Date : 2019-06-25 DOI: 10.1504/IJES.2019.10022132
Zi-yi Liu, Tao Jiang, Xiaoling Tao
{"title":"A result correctness verification mechanism for cloud computing based on MapReduce","authors":"Zi-yi Liu, Tao Jiang, Xiaoling Tao","doi":"10.1504/IJES.2019.10022132","DOIUrl":"https://doi.org/10.1504/IJES.2019.10022132","url":null,"abstract":"MapReduce is widely applied as a parallel programming model to process massive amounts of data in cloud computing environment. However, in open systems, the workers of MapReduce framework are provided with various administration domains that may be unreliable or malicious. The existing schemes of MapReduce processing model based on multiply duplicate tasks can effectively detect the lazy and non-collusive workers. However, they can not cope with the vulnerability that malicious workers collude to return incorrect results and thereby undermine the final computation results of users' outsourced tasks. In this paper, we present an effective result correctness verification mechanism for MapReduce in public cloud computing environment. By using task duplication and weighted correctness attestation graph, our mechanism can effectively detect both non-collusive and collusive malicious workers in public cloud environment. In order to further improve the detection speed, we introduce a workers' selection method based on trust values and consistency relationship. Finally, we conduct the analysis and experimental evaluation, and the results indicate that our mechanism can guarantee higher detection rate with proper additional computation overhead.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"331 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134331216","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
On parallelisation of image dehazing with OpenMP 基于OpenMP的图像去雾并行化研究
Int. J. Embed. Syst. Pub Date : 2019-06-25 DOI: 10.1504/IJES.2019.10022123
Tien-Hsiung Weng, Yi-Siang Chen, Huimin Lu, M. Marino, Kuan-Ching Li
{"title":"On parallelisation of image dehazing with OpenMP","authors":"Tien-Hsiung Weng, Yi-Siang Chen, Huimin Lu, M. Marino, Kuan-Ching Li","doi":"10.1504/IJES.2019.10022123","DOIUrl":"https://doi.org/10.1504/IJES.2019.10022123","url":null,"abstract":"In this paper, we present our learning experience on the design and implementation of image dehazing parallel code with OpenMP developed from existing fast sequential version. The aim of this work is to present an analysis of a case study showing the development of parallel haze removal with practical and efficient use of shared memory multi-core servers. Implementation technique and result discussions in terms of program improvements that may be needed to support parallel application developers with similar high performance goals are presented. Preliminary studies, results and experiments on haze removal application program are executed on multi-core shared memory platforms, and results show that the performance of the proposed parallel code is promising.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125554412","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
首页 上一页
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学术官方微信