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

Proceedings of the 2020 9th International Conference on Software and Computer Applications最新文献

筛选
英文 中文
Backward Slicing Analysis on Debug Log for Crash Comprehension 面向崩溃理解的调试日志倒向切片分析
Proceedings of the 2020 9th International Conference on Software and Computer Applications Pub Date : 2020-02-18 DOI: 10.1145/3384544.3384560
Ma Chi
{"title":"Backward Slicing Analysis on Debug Log for Crash Comprehension","authors":"Ma Chi","doi":"10.1145/3384544.3384560","DOIUrl":"https://doi.org/10.1145/3384544.3384560","url":null,"abstract":"Debugging costs almost half of the development time of programmers. To understand what happened in the buggy execution, one has to backtrack on the execution history, examine suspicious behaviours one by one and finally locate the key symptom. Accelerating this searching procedure will largely reduce the debugging time. In this paper, I propose a backward slicing method to reason the cause of the memory crash on the source code execution trace. It iteratively finds the last modification of new tainted seeds in a thin data slicing style and generates the interprocedural data dependency graph. The slicing method can perform inner function alias analysis and a cross procedural argument tainting analysis. The call sites of dynamic function pointers or call sites expanded by macros are also handled in a heuristic way. I demonstrate the efficacy of method by applying the proto-type system ClueHunter in the vulnerability analysis procedure of 7 open-source projects. The tracing method reduce the amount of code to inspect by 94% for trace-based crash analysis.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127175892","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
Comparison Method for Handling Missing Data in Clinical Studies 临床研究中缺失数据处理的比较方法
Proceedings of the 2020 9th International Conference on Software and Computer Applications Pub Date : 2020-02-18 DOI: 10.1145/3384544.3384594
Heru Nugroho, N. P. Utama, K. Surendro
{"title":"Comparison Method for Handling Missing Data in Clinical Studies","authors":"Heru Nugroho, N. P. Utama, K. Surendro","doi":"10.1145/3384544.3384594","DOIUrl":"https://doi.org/10.1145/3384544.3384594","url":null,"abstract":"Missing data is an issue that cannot be avoided. Most data mining algorithms cannot work with data that consist of missing values. Complete case analysis, single imputation, multiple imputations, and kNN imputation are some methods that can be used to handle the missing data. Each method has is own advantages and disadvantages. This paper compares of these methods using datasets in clinical studies, chronic kidney disease, Indian Pima diabetes, thyroid, and hepatitis. The accuracy of each method was compared using several classifiers. The experimental results show that kNN imputation method provides better accuracy than other methods.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"91 4-5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116625513","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 Evaluation for Class Center-Based Missing Data Imputation Algorithm 基于类中心的缺失数据补全算法性能评价
Proceedings of the 2020 9th International Conference on Software and Computer Applications Pub Date : 2020-02-18 DOI: 10.1145/3384544.3384575
Heru Nugroho, N. P. Utama, K. Surendro
{"title":"Performance Evaluation for Class Center-Based Missing Data Imputation Algorithm","authors":"Heru Nugroho, N. P. Utama, K. Surendro","doi":"10.1145/3384544.3384575","DOIUrl":"https://doi.org/10.1145/3384544.3384575","url":null,"abstract":"The imputation method should be able to reproduce the actual values in the data or Predictive Accuracy (PAC) and maintaining the distribution of these values or Distributional Accuracy (DAC). However, in most studies, evaluation of imputation performance was measured based on classification accuracy. On classification issues, class center-based methods for missing data imputation are developed and outperform other methods for numeric and mixed data types. This paper will be evaluated the accuracy of class center-based methods for missing data imputation, which has been modified by considering the correlation between attributes. A class center-based method for missing data imputation produces an average value of r is 0.96, with the lowest average value for MSE and DKS is 0.04 and 0.03. This result shows that the imputation method is more efficient and can maintain the actual data value distribution.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123918299","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}
引用次数: 6
Anchor Based Geographical Routing in WSN 基于锚点的WSN地理路由
Proceedings of the 2020 9th International Conference on Software and Computer Applications Pub Date : 2020-02-18 DOI: 10.1145/3384544.3384562
N. Gupta, R. S. Yadav, R. Nagaria
{"title":"Anchor Based Geographical Routing in WSN","authors":"N. Gupta, R. S. Yadav, R. Nagaria","doi":"10.1145/3384544.3384562","DOIUrl":"https://doi.org/10.1145/3384544.3384562","url":null,"abstract":"A big problem of multi-hop wireless networks is to find a path with a smaller number of longer hops while minimizing the routing cost. The traditional proactive or reactive routing approaches require higher route establishment and maintenance cost because of lack of local decision-making capability. Therefore, position-based geographical routing approach is a solution which works efficiently due to availability of location information, which results local decision capability. Further, the network may have a portion where either nodes are not available, or cannot be deployed, such portion is termed as network void. The traditional geographical routing protocols follow the boundary to detour the void, which causes a longer path to route the packet. This paper presents an anchor-based void handling (AVH) routing protocol which relies on geographic positions. The protocol uses contention mechanism to overcome unnecessary beaconing. The simulation results indicate that proposed AVH protocol outperforms existing protocols in terms of hop stretch, network traffic overhead, delivery ratio, and energy efficiency.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121511410","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
Responsive Motif Exploration Using Symmetry Dependency Syntax 使用对称依赖句法的响应式主题探索
Proceedings of the 2020 9th International Conference on Software and Computer Applications Pub Date : 2020-02-18 DOI: 10.1145/3384544.3384583
Xinwei Zhang, Jin Wang, Yuxiao Zhang, Guodong Lu
{"title":"Responsive Motif Exploration Using Symmetry Dependency Syntax","authors":"Xinwei Zhang, Jin Wang, Yuxiao Zhang, Guodong Lu","doi":"10.1145/3384544.3384583","DOIUrl":"https://doi.org/10.1145/3384544.3384583","url":null,"abstract":"Motifs are widely used as textures on daily products for their regular and repetitive aesthetics. However, motif design is hard for novices. In this article, we introduce a design exploring system to enable novices to experience motif design easily by simple interactions. We propose the symmetry dependency syntax to encode motif elements and symmetric relations to diverse tree structures. Based on that, we provide motif variation mechanisms, including propagation, adjustment, and attachment, to generate new motifs while recovering motif symmetries broken by the user's manipulations on a motif. When the user deletes, inserts, transforms or replaces an element in a motif, the system automatically generates diverse new symmetric motifs by an encoding-variation flow. Experimental results show that our system can generate diverse motifs in regular visual effects with simple editing interactions, significantly reduce the barrier of motif design for novices.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121661273","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
Non-Stationary Car-Following Dynamics: Driving Simulator Experiments 非静止车辆跟随动力学:驾驶模拟器实验
Proceedings of the 2020 9th International Conference on Software and Computer Applications Pub Date : 2020-02-18 DOI: 10.1145/3384544.3384559
I. Lubashevsky, Akihito Usui, Kaito Morimura
{"title":"Non-Stationary Car-Following Dynamics: Driving Simulator Experiments","authors":"I. Lubashevsky, Akihito Usui, Kaito Morimura","doi":"10.1145/3384544.3384559","DOIUrl":"https://doi.org/10.1145/3384544.3384559","url":null,"abstract":"Using a car-driving simulator created based on the open source engine---TORCS---we investigate human behavior in car-driving within the car-following setup. Five subjects with different skill of driving were involved in these experiments. Here we present the results of experiments comparing two particular versions of car-following setup; within one the lead car speed was fixed, within the other it changed in a certain irregular way. The latter setup was implemented for three different time scales of speed change representing \"fast,\" \"intermediate,\" and \"slow\" speed variations. In the case of \"fast\" speed variations a subject just cannot drive the car such that its speed and the lead car speed vary in time synchronically. In the case of \"slow\" speed variations it is an easy task. The histograms of the headway, velocity, acceleration, jerk, and the time derivative of pedal position (the main control parameter) constructed based on the collected data are compared. Previously we have demonstrated that driver actions should be categorized as human intermittent control. Based on the presented results we draw the conclusion that this type of driver actions is not sensitive to the uncertainty in the lead car motion.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129878341","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
Modeling and Simulating Concurrent Communications of Distributed Sensing Networks 分布式传感网络并发通信建模与仿真
Proceedings of the 2020 9th International Conference on Software and Computer Applications Pub Date : 2020-02-18 DOI: 10.1145/3384544.3384545
T. Truong, T. Le
{"title":"Modeling and Simulating Concurrent Communications of Distributed Sensing Networks","authors":"T. Truong, T. Le","doi":"10.1145/3384544.3384545","DOIUrl":"https://doi.org/10.1145/3384544.3384545","url":null,"abstract":"This paper describes research on modeling and simulating concurrent communications of distributed wireless sensor networks for improving available network capacity. The workflow with software tools was proposed that allows producing automatically Occam-Pi code to feature a concurrency model inspired by Communicating Sequential Processes (CSP) paradigm. Wireless networks are presented based on a graph abstraction model for simulating the complex behaviors of systems. Concurrent communications of distributed sensing networks are handled by the well-known message-passing model used to program parallel and distributed applications. Parallel and distributed algorithms were employed to describe the local node's behaviors to build up the networks and manage communications. Finally, simulation experiments were carried out on an abstract LoRa wireless network in order to evaluate and validate the accomplishment of the proposed approach for concurrent communications in large-scale distributed sensing networks.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128611819","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
Digital Shop Floor Management: A Practical Framework For Implementation 数字化车间管理:一个实用的实施框架
Proceedings of the 2020 9th International Conference on Software and Computer Applications Pub Date : 2020-02-18 DOI: 10.1145/3384544.3384611
Raphael Hartner, V. Mezhuyev, Martin Tschandl, C. Bischof
{"title":"Digital Shop Floor Management: A Practical Framework For Implementation","authors":"Raphael Hartner, V. Mezhuyev, Martin Tschandl, C. Bischof","doi":"10.1145/3384544.3384611","DOIUrl":"https://doi.org/10.1145/3384544.3384611","url":null,"abstract":"In the context of manufacturing, shop floor management (SFM) is employed to ensure efficient production operations and workflows. Advanced technologies and methods can be used to improve the SFM and achieve close to real-time responsiveness. Even though there is a number of research available for the digitalized SFM (DSFM), a supportive framework for implementation purposes was not considered yet. Consequently, this paper utilizes concepts from related disciplines and research areas to derive an architectural framework for a DSFM. This particular architecture is then implemented to ensure its practicability and foster the understanding of challenges and opportunities. The proposed multi-layer framework and supportive methods can be employed by manufacturing companies to implement a DSFM focused on interoperability, security and low-latency.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115393637","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
Applying Prefixed-Itemset and Compression Matrix to Optimize the MapReduce-based Apriori Algorithm on Hadoop 应用Prefixed-Itemset和压缩矩阵优化Hadoop基于mapreduce的Apriori算法
Proceedings of the 2020 9th International Conference on Software and Computer Applications Pub Date : 2020-02-18 DOI: 10.1145/3384544.3384610
Ruiqi Sun, Yuqiang Li
{"title":"Applying Prefixed-Itemset and Compression Matrix to Optimize the MapReduce-based Apriori Algorithm on Hadoop","authors":"Ruiqi Sun, Yuqiang Li","doi":"10.1145/3384544.3384610","DOIUrl":"https://doi.org/10.1145/3384544.3384610","url":null,"abstract":"Apriori algorithm is the classical algorithm for mining association rules. However, it also has some problems, such as comparing the identical itemset repeatedly and scanning the external storage database frequently. Based on the previous research, this paper proposed a method of applying the prefixed-itemset and the compression matrix to optimize the connection step, pruning step, support counting step and transaction storage mode of the Apriori algorithm. The experimental results show that compared with the conventional Apriori algorithm, the optimized Apriori algorithm has more powerful mining efficiency and more excellent performance.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123029468","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
Training Strategies for CNN-based Models to Parse Complex Floor Plans 基于cnn模型解析复杂平面图的训练策略
Proceedings of the 2020 9th International Conference on Software and Computer Applications Pub Date : 2020-02-18 DOI: 10.1145/3384544.3384566
Ruiyun Zhu, Jingcheng Shen, Xiangtian Deng, M. Wallden, Fumihiko Ino
{"title":"Training Strategies for CNN-based Models to Parse Complex Floor Plans","authors":"Ruiyun Zhu, Jingcheng Shen, Xiangtian Deng, M. Wallden, Fumihiko Ino","doi":"10.1145/3384544.3384566","DOIUrl":"https://doi.org/10.1145/3384544.3384566","url":null,"abstract":"A floor plan is one of the most fundamental diagrams for architectural design. Considering a large proportion of floor plans are rasterized images, we believe that parsing the rasterized images is a crucial procedure to automate architectural design. In this study, we evaluate the use of convolutional neural network (CNN) based image segmentation methods to handle floor plan parsing, instead of traditional measures such as template matching. Especially, we analyzed samples whose features are difficult for CNN-based models to learn; thus, we propose two training strategies, separate training and the use of a weighted loss function, to improve the learning accuracy for such complex samples. Experimental results demonstrate that the proposed strategies performed well for the complex samples, generating more favorable parsing output.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129229450","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}
引用次数: 6
下一页 尾页
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学术官方微信