{"title":"A Distributed Directed Breadth-First Search Algorithm Based on Message-Passing Model for Efficient Line-of-Sight Computation","authors":"T. Truong, T. Le","doi":"10.1145/3384544.3384570","DOIUrl":"https://doi.org/10.1145/3384544.3384570","url":null,"abstract":"This paper presents an efficient distributed algorithm for line-of-sight (LoS) computation using directed breadth-first search (DBFS). LoS computation could be achieved between objects located at different points of a digital-elevation-model (DEM) which could also match particular geographic or electromagnetic dynamic considerations. Cellular automata (CA) is efficient for modeling and simulating dynamic complex systems, especially suitable for parallel processing on grid cell data. Occam, a parallel programming language following the formalization of Communicating Sequential Processes (CSP), was introduced for achieving high performance on multi-core processors. The goal of this work is to produce a power profile as a function of the route for radio propagation analysis taking into account geographical topology, for example long-range (LoRa) technology. To evaluate the proposed approach, cell local behavior was developed in Occam for horizontal routing information based on a message-passing model in order to satisfy the requirements of distributed sensing networks, such as maximizing coverage area, saving energy consumption and improving system performance as well.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"10 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":"128616007","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}
Abdullah B. Nasser, Antar S.H. Abdul-Qawy, Nibras Abdullah, Fadhl Hujainah, K. Z. Zamli, W. Ghanem
{"title":"Latin Hypercube Sampling Jaya Algorithm based Strategy for T-way Test Suite Generation","authors":"Abdullah B. Nasser, Antar S.H. Abdul-Qawy, Nibras Abdullah, Fadhl Hujainah, K. Z. Zamli, W. Ghanem","doi":"10.1145/3384544.3384608","DOIUrl":"https://doi.org/10.1145/3384544.3384608","url":null,"abstract":"T-way testing is a sampling strategy that generates a subset of test cases from a pool of possible tests. Many t-way testing strategies appear in the literature to-date ranging from general computational ones to meta-heuristic based. Owing to its performance, man the meta-heuristic based t-way strategies have gained significant attention recently (e.g. Particle Swarm Optimization, Genetic Algorithm, Ant Colony Algorithm, Harmony Search, Jaya Algorithm and Cuckoo Search). Jaya Algorithm (JA) is a new metaheuristic algorithm, has been used for solving different problems. However, losing the search's diversity is a common issue in the metaheuristic algorithm. In order to enhance JA's diversity, enhanced Jaya Algorithm strategy called Latin Hypercube Sampling Jaya Algorithm (LHS-JA) for Test Suite Generation is proposed. Latin Hypercube Sampling (LHS) is a sampling approach that can be used efficiently to improve search diversity. To evaluate the efficiency of LHS-JA, LHS-JA is compared against existing metaheuristic-based t-way strategies. Experimental results have shown promising results as LHS-JA can compete with existing t-way strategies.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"7 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":"127500871","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}
Hernan M. Palombo, Egor Dolzhenko, Jay Ligatti, Hao Zheng
{"title":"Stream-Monitoring Automata","authors":"Hernan M. Palombo, Egor Dolzhenko, Jay Ligatti, Hao Zheng","doi":"10.1145/3384544.3384609","DOIUrl":"https://doi.org/10.1145/3384544.3384609","url":null,"abstract":"Over the past nearly twenty years, numerous formal models of enforcement and runtime monitors have been investigated. This paper takes the lessons learned from earlier models and proffers a new general model of runtime enforcement that is more suitable for modeling security mechanisms that operate over infinite event streams. The new model, called Stream-Monitoring Automata (SMAs), enables the constraints and analyses of interest in previous models to be encoded, and overcomes several shortcomings of existing models with respect to expressiveness. SMAs capture the practical abilities of mechanisms to monitor infinite event streams, execute even in the absence of event inputs, enforce non-safety policies, and operate an enforcement model in which extraneous constraints such as transparency and uncontrollable events may be specified as meta-policies.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"7 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":"126865531","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}
{"title":"Development of a Parameterizable Process-Oriented Model for Freight Cost Estimation","authors":"Uwe Brunner, C. Hechtl, V. Mezhuyev","doi":"10.1145/3384544.3384612","DOIUrl":"https://doi.org/10.1145/3384544.3384612","url":null,"abstract":"Reliable estimation of costs in road freight transportation gives a decisive advantage for industrial companies both on the supplier and customer side. However, existing methods of costs estimation are complex, time-consuming and may produce inaccurate results. This paper aims to develop a parameterizable process-oriented model based on historical transport data, which allows a reliable estimation of the transport costs before transportation is carried out. The core of this model is the filter process, which enables to select respective historical data sets in the best possible way. The paper gives a comprehensive literature review of existing solutions, discusses the methods of analysis and processing of available data under the existing conditions, resulting in the development of a new model and a corresponding filter process. The proposed model allows a reliable estimation of the transport costs on the chosen route, which can be obtained in a shorter time as compared with existing methods. The process model has already been validated by the industry and continues to be applied and improved due to the growing importance of the logistics sector.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"18 2 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":"123268559","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}
{"title":"A Method of Workpiece Coherent Line Detection Based on Progressive Probabilistic Hough Transform","authors":"Ziyao Wang, Dali Yang, Qiang Tong","doi":"10.1145/3384544.3384580","DOIUrl":"https://doi.org/10.1145/3384544.3384580","url":null,"abstract":"The detection and extraction of workpiece lines is the basis and key in the industrial production practice. In order to solve the discontinuity and disconnection problem during the line detection and extraction of a workpiece, we propose a coherent line detection method, which is Improved Progressive Probabilistic Hough Transform line detection(PPHT). Improved PPHT first performs edge detection combine with original PPHT algorithm to find lines of workpiece object. After discarding noise lines, this method divide the detected lines into several groups by finding collinear candidates. Then we calculate the supporting pixels of every group with foreground image, and apply Least Square Regression to achieve final line results. In this paper, we performed an experiment on thirty images of three different rectangular workpieces.The results indicate that, comparing to the PPHT, Improved PPHT decreased the relative error rate of the linear detection accuracy p by 62.06% on average, and the relative error rate of the recall rate R has decreased by 43.6% on average, thereby significantly mitigate the discontinuity existing in PPHT.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"49 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":"114730158","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}
{"title":"Mixed Initiative Realizability Problem Resolution Using UML Composite States","authors":"Muhammad Sohaib Munir, Hafsa Tanveer, U. Fatima","doi":"10.1145/3384544.3384550","DOIUrl":"https://doi.org/10.1145/3384544.3384550","url":null,"abstract":"Realizability problems may emerge when specifications of complex distributed reactive systems are mapped to local distributed designs that may contain undesired behaviours, sometimes termed as implied scenarios. In this paper, we focus on resolving one of these realizability problems named as mixed initiative that occurs when independent and concurrent entities take uncoordinated initiatives autonomously. The mixed initiative problem is unavoidable in the execution of some distributed reactive systems and can normally not be prevented. Mixed initiative resolution guidelines have been proposed in the past that use UML activity diagrams and/or additional transitions in UML state machines. The novelty in our approach lies in the use of UML composite states for resolving the mixed initiative problem. However, UML does not have well-defined guidelines on serialization/unfolding of composite states. This paper, therefore, first proposes guidelines on how to serialize/unfold a UML composite state and then how to use it for addressing mixed initiative realizability problem using a case study named Call Centre.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"4 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":"128914992","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}
{"title":"Sub-word Embedding Auxiliary Encoding in Mongolian-Chinese Neural Machine Translation","authors":"Tiangang Bai, H. Hou, Yatu Ji","doi":"10.1145/3384544.3384565","DOIUrl":"https://doi.org/10.1145/3384544.3384565","url":null,"abstract":"For low-resource Mongolian-Chinese neural machine translation (NMT), the common pre-processing methods such as byte pair encoding (BPE) and tokenization, are unable to recognize Mongolian special character, which leads to the loss of complete sentence information. The translation quality of low-frequency words is undesirable due to the problem of data sparsity. In this paper, we firstly propose a process method for Mongolian special character, which can transform the Mongolian special characters into explicit form to decrease the pre-processing error. Secondly, according to the morphological knowledge of Mongolian, we generate the sub-word embedding with large scale monolingual corpus to enhance the contextual information of the representation of low-frequency words. The experiments show that 1) Mongolian special character processing can minimize the semantic loss, 2) systems with sub-word embedding from large scale monolingual corpus can capture the semantic information of low-frequency words effectively 3) the proposed approaches can improve 1-2 BLEU points above the baselines.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"2 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":"124807270","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}
{"title":"BGSGA: Combining Bi-GRU and Syntactic Graph Attention for Improving Distant Supervision Relation Extraction","authors":"Chengcheng Peng, Bin Wu, Zekun Li","doi":"10.1145/3384544.3384582","DOIUrl":"https://doi.org/10.1145/3384544.3384582","url":null,"abstract":"Distant supervision Relation Extraction(RE) aligns entities in a Knowledge Base (KB) with text to automatically construct large-labeled corpus, which alleviates the need for manual annotation in traditional RE. However, most existing models can't take full advantage of the syntactic structure information of each word in the dependency tree. In this paper, we propose BGSGA, a novel distant supervision RE model, to capture both semantic information and syntactic structure in the bag. BGSGA constructs the syntactic graph by combining the dependency trees of the sentences in the bag and then employs a syntactic structure attention mechanism to update the word embedding obtained from Bi-GRU. The syntactic structure attention mechanism captures the cross-sentence information with different weight by implementing the special attention operation between the target word and its neighbors of first-order and second-order in the graph. The experiments show that BGSGA outperforms our baseline models on benchmark datasets.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"150 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":"116342199","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}
{"title":"New Approach on Steganalysis: Reverse-Engineering based Steganography SW Analysis","authors":"Hanseong Lee, Hyung-Woo Lee","doi":"10.1145/3384544.3384571","DOIUrl":"https://doi.org/10.1145/3384544.3384571","url":null,"abstract":"Recently, steganography tools for concealing messages in images have been widely used, and internal mechanisms for hiding messages using steganography tools are mostly unknown to public. Therefore, we adopted the reverse engineering for unveiling the information hiding algorithm and operation mechanism applied to 'Steg' steganography software using IDA tool. By reversing the steganography software, we disclosed the internal steganographic mechanism used on 'Steg' software. Therefore, we can propose a new approach for efficiently detecting and automatically extracting hidden messages in stego data using the software reversing technique.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"42 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":"122507526","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}
{"title":"A Systematical Study for Deep Learning Based Android Malware Detection","authors":"Huanyu Wu","doi":"10.1145/3384544.3384546","DOIUrl":"https://doi.org/10.1145/3384544.3384546","url":null,"abstract":"Nowadays with the development of smartphone and its operating system, such as Android, the amount of mobile malware is correspondingly increasing. To protect the privacy security of both users and manufacturers, Android malware detection has received a lot of research focuses. Traditional methods mainly rely on static analysis or dynamic monitoring, which is either software sensitive or time-consuming. Recently, with the development of machine learning and deep learning techniques, many efforts introduced such learning-based techniques into the Android malware detection and achieved promising detection results as well as substantially reduced time costing. Nevertheless, there is still a lack of a comprehensive summary at the deep learning technical level for these learning-based malware detection works. As a result, it is limited to improve the detection technique referring to existing works from a global map. To address the challenge, in this paper, we systematically study existing deep learning-based malware detection works and classify them from the technique perspective. We also conclude the advantages and threats within each category of detection technique and provide a concrete technical reference for future improvement work.","PeriodicalId":200246,"journal":{"name":"Proceedings of the 2020 9th International Conference on Software and Computer Applications","volume":"109 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":"127090791","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}