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

Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering最新文献

筛选
英文 中文
Practical Control Flow Integrity using Multi-Variant execution 使用多变量执行的实际控制流完整性
Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering Pub Date : 2020-01-14 DOI: 10.1145/3424311.3424312
D. Yao, Zheng Zhang, Gaofei Zhang
{"title":"Practical Control Flow Integrity using Multi-Variant execution","authors":"D. Yao, Zheng Zhang, Gaofei Zhang","doi":"10.1145/3424311.3424312","DOIUrl":"https://doi.org/10.1145/3424311.3424312","url":null,"abstract":"The popularity of computers and networks brings many conveniences to our daily life but also brings a variety of security threats. The proliferation of attacks and the rapid spread of viruses make security researchers gradually shift their perspective from passive defense to active defense. Among many active defenses, the technique of software multi-variant execution (MVX) framework has been widely concerned. It can detect and defend most known or even 0-day attacks without depending on the feature of specific threats. However, there is a big performance bottleneck in this technique. Control flow integrity (CFI) is another ideal security solution, but it is not widely used in practice because of performance loss and compatibility problems. In this paper, we propose a multi-variant execution framework called MVX-CFI. MVX-CFI improves execution efficiency without losing its original security. MVX-CFI is a dynamic and transparent CFI implementation based on the MVX framework. It can effectively capture the control flow of the target software and find illegal path transfer caused by malicious acts such as attacks. MVX-CFI extends the general MVX with a feedback assisted-detection module, which reduces a lot of repetitive voting work of traditional MVX and improves the performance. It also provides a probability to detect preset back door in a software.","PeriodicalId":330920,"journal":{"name":"Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116922413","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
Toward U-Net-based GANs for Diverse Facial Image Synthesis from Sketch 基于u - net的人脸图像合成算法研究
Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering Pub Date : 2020-01-14 DOI: 10.1145/3424311.3424323
W. Phusomsai, Y. Limpiyakorn
{"title":"Toward U-Net-based GANs for Diverse Facial Image Synthesis from Sketch","authors":"W. Phusomsai, Y. Limpiyakorn","doi":"10.1145/3424311.3424323","DOIUrl":"https://doi.org/10.1145/3424311.3424323","url":null,"abstract":"Face physical changes may result from aging, surgery, or disguise. The criminal suspects conceal their identity with false appearances such as wearing a wig, glasses, beard and mustache. This research benefits the generation of various fictitious appearances of the suspects or facial changes of lost persons. The technique of GANs is applied for synthesizing a color image from a sketch. The output image can be varied in five facial attributes with a toggle: bald, makeup, straight hair, wearing glasses, beard and mustache. The approach enhances the Generator of StarGan2 with the U-Net architecture. The experiments were carried out to evaluate the performance of the proposed model compared to that of StarGan2. FID scores are used for measuring the quality of the generated images. The FID scores measured on the test data reported about 40% less than that of the baseline model and the synthesized images with varied facial attributes look natural and realistic.","PeriodicalId":330920,"journal":{"name":"Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114381347","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
Grey Wolf Optimizer with Multi-Strategy Optimization and Its Application on TSP 多策略优化灰狼优化器及其在TSP中的应用
Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering Pub Date : 2020-01-14 DOI: 10.1145/3424311.3424318
Rumeng Wang, Ke-wen Xia, Mukase Sandrine
{"title":"Grey Wolf Optimizer with Multi-Strategy Optimization and Its Application on TSP","authors":"Rumeng Wang, Ke-wen Xia, Mukase Sandrine","doi":"10.1145/3424311.3424318","DOIUrl":"https://doi.org/10.1145/3424311.3424318","url":null,"abstract":"The Grey Wolf Optimizer (GWO) is an optimized search method inspired by the grey wolf predation activity in the wolf pack. Due to the shortcomings of GWO that are easy to fall into the local minimum and slow convergence speed, a GWO with Multi-Strategy Optimization (MSO-GWO) is proposed, that is, the opposition-based learning strategy method is used in the population initialization stage and the weighted distance is used in the search stage to update the position, so to improve the population diversity and avoid falling into the local minimum. After testing and comparative analysis of various international benchmark functions, the results show that the MSO-GWO algorithm has obvious convergence speed and conversion accuracy. Finally, the MSO-GWO algorithm is used to solve Traveling Salesman Problem (TSP), and its solution effect is remarkable.","PeriodicalId":330920,"journal":{"name":"Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130970352","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
Analysis of Convolutional Neural Network for Lifelong Learning on Indonesian Sentiment Analysis 卷积神经网络在印尼语情感分析中的终身学习分析
Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering Pub Date : 2020-01-14 DOI: 10.1145/3424311.3424331
Zaid Abdurrahman, H. Murfi, Y. Widyaningsih
{"title":"Analysis of Convolutional Neural Network for Lifelong Learning on Indonesian Sentiment Analysis","authors":"Zaid Abdurrahman, H. Murfi, Y. Widyaningsih","doi":"10.1145/3424311.3424331","DOIUrl":"https://doi.org/10.1145/3424311.3424331","url":null,"abstract":"Sentiment analysis is a process to obtain the tendency of the authors in an article. Sentiment analysis classifies textual data into a class of positive, negative, or neutral sentiments. CNN is one of the deep learning algorithms capable of classifying textual data into positive, negative, or natural classes. In general, the standard learning methods learn from one domain to produce a model. Another learning paradigm is lifelong learning which is believed to be able to accumulate learning from various domains for learning in the new domain. In this paper, we examine lifelong learning of CNN for sentiment analysis on Indonesian textual data. Our simulation shows that the accuracy of CNN increases with the increase in the number of source domains where CNN learns. This shows that lifelong learning using CNN works well for sentiment analysis on Indonesian textual data.","PeriodicalId":330920,"journal":{"name":"Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133505170","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
Performance Analysis of Real-Time Scheduling Algorithms 实时调度算法的性能分析
Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering Pub Date : 2020-01-14 DOI: 10.1145/3424311.3424317
Arwa Z. Selim, N. El-Attar, Mohamed Ghoneim, W. Awad
{"title":"Performance Analysis of Real-Time Scheduling Algorithms","authors":"Arwa Z. Selim, N. El-Attar, Mohamed Ghoneim, W. Awad","doi":"10.1145/3424311.3424317","DOIUrl":"https://doi.org/10.1145/3424311.3424317","url":null,"abstract":"Real-time systems are intensively used nowadays. Scheduling algorithms are very important to manage the scheduling of tasks in real-time systems. In this paper we give an overview on the real-time scheduling techniques for uniprocessors and multiprocessors, then we present a comparison between the multiprocessor scheduling algorithms which are classified into partitioning and global scheduling algorithms. The results achieved from the comparison have showed that the parameters such as makespan, waiting time, missed deadlines and task preemptions are better in performance when using partitioned scheduling algorithms than that for global scheduling algorithms when the number of tasks is small. While when the number of tasks increased, it gives more better performance when using global scheduling algorithms than partitioned scheduling algorithms using all parameters except for some of the algorithms gave low performance in missed deadlines, they give a high number of missed deadlines. But in total when the number of tasks increased the global scheduling algorithms gives better performance than partitioned scheduling algorithms.","PeriodicalId":330920,"journal":{"name":"Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114844589","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
The Application of Continuous Time SRML 连续时间SRML的应用
Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering Pub Date : 2020-01-14 DOI: 10.1145/3424311.3424316
N. Yu, M. Wirsing
{"title":"The Application of Continuous Time SRML","authors":"N. Yu, M. Wirsing","doi":"10.1145/3424311.3424316","DOIUrl":"https://doi.org/10.1145/3424311.3424316","url":null,"abstract":"The SENSORIA Reference Modeling Language (SRML) aims at modeling composite services at a high level. Continuous time SRML extends SRML in that it extends the semantic domain of SRML with Service-Oriented Hybrid Doubly Labeled Transition Systems, and thus provides a way to model services with continuous time executions. In this paper, we apply continuous time SRML to a traffic control system, to show the approach for using continuous time SRML to model continuous time executions in a service-oriented context; and make comparison of our approach with other related works to show the advantages of it.","PeriodicalId":330920,"journal":{"name":"Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128089695","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 High-Speed Cauchy CODEC Algorithm for Distributed Storage System 分布式存储系统中的高速柯西编解码器算法
Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering Pub Date : 2020-01-14 DOI: 10.1145/3424311.3424313
Ruizhen Wu, Lin Wang, Yan Wu
{"title":"A High-Speed Cauchy CODEC Algorithm for Distributed Storage System","authors":"Ruizhen Wu, Lin Wang, Yan Wu","doi":"10.1145/3424311.3424313","DOIUrl":"https://doi.org/10.1145/3424311.3424313","url":null,"abstract":"The erasure codes such as Reed-Solomon (RS) code and Cauchy Reed-Solomon (CRS) code have been widely used in distributed storage system. Though all the erasure codes are able to help recover the storage data successfully when errors happening, the computation cost of different Cauchy CODEC implementation makes a great impact to the performance of its practical application especially due to its complexity of generating the decoding matrix. This paper introduces a new high-speed Cauchy algorithm to construct an encoding algorithm based on the hardware implementation mechanism of decoding. In comparison to Gauss LU, GS-Cauchy, GS-direct-Cauchy for both decoding matrix generation and CODEC all through, the proposed algorithm requires much less complexities to gain the same performance of CRS.","PeriodicalId":330920,"journal":{"name":"Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115997103","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
Design and Implementation of Medical Process Visualization CDSS Oriented to NCCN Guidelines 面向NCCN准则的医疗过程可视化CDSS的设计与实现
Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering Pub Date : 2020-01-14 DOI: 10.1145/3424311.3424322
MingXuan Liu, Ju Zhang, Xiaoguang Lin
{"title":"Design and Implementation of Medical Process Visualization CDSS Oriented to NCCN Guidelines","authors":"MingXuan Liu, Ju Zhang, Xiaoguang Lin","doi":"10.1145/3424311.3424322","DOIUrl":"https://doi.org/10.1145/3424311.3424322","url":null,"abstract":"The contents of modern medicine are various and complicated, so clinicians need to master more about medical knowledge. This paper introduces a medical process visualization clinical medical decision support system (CDSS) oriented to NCCN clinical practice guidelines, which can assist clinicians to make diagnosis and treatment decisions. And a new knowledge representation model is designed for NCCN guidelines. The model can express medical knowledge freely and flexibly, and medical knowledge also can be updated in time. At present, medical process visualization CDSS has been implemented for many different cancers.","PeriodicalId":330920,"journal":{"name":"Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127297672","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
Type II Diabetes Analysis using Naïve Bayesian Classification Algorithm 利用Naïve贝叶斯分类算法分析II型糖尿病
Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering Pub Date : 2020-01-14 DOI: 10.1145/3424311.3424327
Jake Libed, Rosemarie Perreras, Jennifer Carpio
{"title":"Type II Diabetes Analysis using Naïve Bayesian Classification Algorithm","authors":"Jake Libed, Rosemarie Perreras, Jennifer Carpio","doi":"10.1145/3424311.3424327","DOIUrl":"https://doi.org/10.1145/3424311.3424327","url":null,"abstract":"Patients medical historical record has been extensively used in different data mining methods in order to provide a more reliable medical diagnosis. In this study, the researchers developed a type II diabetes analysis using Naïve Bayesian classification algorithm in constructing a map rule for the prediction process.","PeriodicalId":330920,"journal":{"name":"Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering","volume":"s3-21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130083723","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 Fragment Matching Evaluation Method Based on Character Structure 一种基于字符结构的片段匹配评价方法
Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering Pub Date : 2020-01-14 DOI: 10.1145/3424311.3424325
Nan Xing, Y. Xing, Lifang Gao
{"title":"A Fragment Matching Evaluation Method Based on Character Structure","authors":"Nan Xing, Y. Xing, Lifang Gao","doi":"10.1145/3424311.3424325","DOIUrl":"https://doi.org/10.1145/3424311.3424325","url":null,"abstract":"Information recovery is an important research topic in the field of information security, and assessing the degree to which fragments match is a key step in recovery algorithm. In this study, based on a character's structure in real document fragments, a novel measurment function for fragment matching is presented that can evaluate the degree of correlation between the fragments. In addition, the function is used as the judgment basis in the fragment search algorithm to determine whether a found match is the global optimum. The experimental results show that the proposed method can effectively inhibit information damage and noise interference that exist in real document fragments, and that it accurately reflects the degree to which the fragments match. The information in document can be effectively restored by this method.","PeriodicalId":330920,"journal":{"name":"Proceedings of the 2020 International Conference on Internet Computing for Science and Engineering","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131926074","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
下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信