Identifying the credibility of executable files is critical for the security of an operating system. Modern operating systems rely on code signing, which uses a default-valid trust model, for executable files to ident...
详细信息
Identifying the credibility of executable files is critical for the security of an operating system. Modern operating systems rely on code signing, which uses a default-valid trust model, for executable files to identify their publishers. A malware could pass software validation of operating systems and security software by using counterfeit code-signing certificates. Although the counterfeit certificates can be revoked by CAs, the previous research showed that the revocation delay takes as long as 5.6 months. In this paper, we attempt to identify the credibility of software with multiple-version executable files without relying on public key infrastructure (PKI), where a new-version executable file is usually developed incrementally based on the previous versions. The sharing features among different versions can be extracted for identifying the software. Accordingly, we present a software-birthmark scheme to serve our purpose. Our scheme generates a cross-version software birthmark for executable files of the same software. The proposed software birthmark is a binary-classification model of a machine learning algorithm based on imported and exported function names extracted from different-version executable files. To evaluate the performance of version-wide software birthmarks, our experiments include 138 versions of Windows *** and 545 versions of ***. We also use multiple machine learning algorithms for performance comparisons. The results show that proposed software birthmark can effectively identify the derivations of these executable files. The proposed software birthmark can be used by operating systems or security software to evaluate the credibility of executable files with suspicious certificates.
Today most people can't live without electronic devices. And more and more new devices are coming to the market every day. Apps running on these devices often connect to one or several web-based server side applic...
详细信息
Today most people can't live without electronic devices. And more and more new devices are coming to the market every day. Apps running on these devices often connect to one or several web-based server side applications, which in turn put a lot of load and management pressure on the servers and clusters serving these web applications. Technologies such as Nginx and Keepalived were invented to address the load issues faced by these high concurrency applications. This paper tested a server cluster environment based on Nginx and Keepalived, evaluated the performance of Nginx based algorithms such as WRR, IP_HASH and LEAST_CONN, and designed an optimized version of IP_HASH (named as NEW_HASH). Compared to the original IP_HASH, the NEW_HASH reduces the probability of hash collisions and improves the performance of searching back-end nodes. The test showed NEW_HASH outperforms the original method of IP_HASH, with reduced response time, lower failure rates and increased throughput. Overall, the server cluster performed better under the high load pressure using NEW_HASH.
Autonomous underwater vehicles (AUVs) have been widely implemented to explore marine resources or perform marine missions;meanwhile, complex mission planning has been expected to enhance the intelligence level, improv...
详细信息
Autonomous underwater vehicles (AUVs) have been widely implemented to explore marine resources or perform marine missions;meanwhile, complex mission planning has been expected to enhance the intelligence level, improve energy efficiency, and expand AUVs' application areas. The mission planning model needs to consider energy consumption, mission quality, and mission quantity of long-term working in the marine environment. In this article, one unified and robust model was proposed based on the above requirements in the complex marine environment to improve the automaticity of AUV. However, solving this mission planning model is a nontrivial problem, especially when high robustness, high efficiency, fast response, and near-optimal results are required. Therefore, we propose a novel hyperheuristic algorithm based on evolutionary strategy (ES-HH). The proposed ES-HH combines a metaheuristic framework with a selection function to evaluate the performance of low-level heuristic operators online. This evolutionary strategy endows the hyperheuristic algorithm with the online learning feature, giving the ES-HH algorithm better computing efficiency, robustness, and near-optimal results. The experiment results show that the ES-HH algorithm can achieve better convergence and higher robustness than other algorithms, such as ant colony optimization and biogeography-based optimization algorithms. Compared with ACO and BBO algorithms, the proposed ES-HH algorithm can improve the mission completion rate by 3.42% and reduce the average energy consumption of a single task by 8.02%.
This article presents a model-based motion planning and control system for autonomous vehicles and its experimental validation. The system consists of four modules: 1) global routing;2) behavior planner;3) local traje...
详细信息
This article presents a model-based motion planning and control system for autonomous vehicles and its experimental validation. The system consists of four modules: 1) global routing;2) behavior planner;3) local trajectory generation;and 4) trajectory tracking. The algorithm and software of each module are detailed, including a behavior planner with unified models to handle typical scenarios in both highway and urban driving, a deterministic sampling algorithm for robust responsive trajectory generation, and a dynamics-and-delay-aware preview algorithm to achieve accurate trajectory tracking. The developed system is implemented and tested at the Mcity test facility with a full-size automated car and a dozen of challenging traffic scenarios.
Polynomial multiplication is one of the heaviest operations for a lattice-based public key algorithm in Post-Quantum Cryptography (PQC). Many studies have been done to accelerate polynomial multiplication with newly d...
详细信息
Polynomial multiplication is one of the heaviest operations for a lattice-based public key algorithm in Post-Quantum Cryptography (PQC). Many studies have been done to accelerate polynomial multiplication with newly developed hardware accelerators or special CPU instructions. However, another method utilizes previously implemented and commercial hardware accelerators for RSA/elliptic curve cryptography (ECC). Reusing an existing hardware accelerator is advantageous, not only for the cost benefit but also for the improvement in performance. In this case, the developer should adopt the most efficient implementation method for the functions provided by a given legacy hardware accelerator. It is difficult to find an optimized implementation for a given hardware accelerator because there are a variety of methods, and each method depends on the functions provided by the given accelerator. In order to solve the problem, we survey methods for polynomial multiplication using RSA/ECC coprocessors and their application for Learning With Error (LWE)-based KEM algorithms of National Institute of Standards and Technology (NIST) PQC round 3 candidates. We implement all known methods for polynomial multiplication with RSA/ECC coprocessors in a platform, commercial mobile system-on-chip (SoC), the Exynos2100 Smart Secure Platform (SSP). We present and analyze the simulation results for various legacy hardware accelerators and give guidance for optimized implementation.
Nautilus Framework allows practitioners to develop and experiment with several multi- and many-objective evolutionary algorithms-guided (or not) by human participation-in a few steps with a minimum required background...
详细信息
Nautilus Framework allows practitioners to develop and experiment with several multi- and many-objective evolutionary algorithms-guided (or not) by human participation-in a few steps with a minimum required background in coding and search-based algorithms.
A record of spatial and temporal parking occupancy is critical to optimize on-street parking resources and to develop effective parking policies. Such data are often obtained through advanced and costly occupancy moni...
详细信息
A record of spatial and temporal parking occupancy is critical to optimize on-street parking resources and to develop effective parking policies. Such data are often obtained through advanced and costly occupancy monitoring technologies. Moreover, it is usually challenging to integrate bay-level occupancies and parking data from other systems. Accurate occupancy-payment data are required for a wide range of analytical and practical purposes, including but not limited to investigating payment behavior, estimating and forecasting occupancy, and evaluating the efficiency and effectiveness of enforcement policies. This study proposes a metaheuristic optimization algorithm to integrate snapshots of bay-level parking occupancy, captured using simple cameras, with transactions from a conventional parking payment management system. The resulting integrated data were used to develop, calibrate and validate a parking occupancy estimation method utilizing parking payment data only. Details of the design, implementation, and validation of the proposed algorithm and modelling technique are provided. Logistic regression analysis was used to tune parameters of the data integration algorithm. Deep learning, gradient boosting and random forests were used to develop a model of parking occupancy. Evaluation of the algorithm indicated an accuracy of 76% of correct data integration;that is, individual bay occupancies integrated with the correct corresponding payment transactions. The best occupancy estimation model also showed a very high accuracy, with an R-2 above 94% and a root mean square error (RMSE) of 1.2 (occupied bays), when tested with a random sample from the integrated data.
The present study aims to provide a suitable approach to optimize transmission line towers with size, shape and panel design variables. MSTOWER software was used for modeling, analysis and design of the transmission t...
详细信息
The present study aims to provide a suitable approach to optimize transmission line towers with size, shape and panel design variables. MSTOWER software was used for modeling, analysis and design of the transmission tower. The design requirements applied to the structure were in accordance with ASCE10-97 standard. Transmission line towers are optimized in two ways. The first method combines Biogeography based Optimization (BBO) algorithm with MSTOWER software called BBO-MSTOWER and the second method, called BBO-ANFIS, uses an adaptive fuzzy neural inference system (ANFIS). To analyze the structure in the optimization process with the aim of reducing the computations and time of the optimization process. In order to evaluate the proposed method, two full-scale transmission towers were optimized as numerical models using the above two methods. Finally, the optimal design and time required in the two optimization methods were compared with each other as well as with the initial design of the tower and the results reported in previous studies. The results showed that with acceptable accuracy, ANFIS resulted in a significant reduction in the calculation time of the entire optimization process.
software defect prediction can predict the defective modules in the project in advance, which is helpful to optimize the allocation of test resources. Recently, privacy protection for datasets and models has gradually...
详细信息
software defect prediction can predict the defective modules in the project in advance, which is helpful to optimize the allocation of test resources. Recently, privacy protection for datasets and models has gradually attracted the attention of researchers. In this study, we are the first to apply homomorphic encryption to software defect prediction model construction and propose a novel method HOPE. Specifically, we adopt an algorithm approximation strategy to approximate the sigmoid function and select the Paillier homomorphic encryption algorithm for Logistical regression. In our case study, we choose the MORPH dataset gathered from real-world open-source projects as our experimental subjects. Then we design three control groups to simulate three different scenarios based on whether the client sends the encrypted data to the server and whether the server uses the HOPE method. The final results show that if the server uses the original Logistic regression to construct the model on the encrypted data, the performance of the trained model is similar to random guess, which can guarantee the privacy protection of the data. Moreover, compared with the original Logistical regression method, the method HOPE only needs a small amount of computational cost, but there is no obvious performance decrease. We share our implementation scripts and datasets to encourage researchers to conduct more studies on this research direction.
In wireless networks, the network coverage and sustainable operations are closely interlinked. These are the most critical problems in any wireless sensor networks (WSNs), which are based on software defined networks....
详细信息
In wireless networks, the network coverage and sustainable operations are closely interlinked. These are the most critical problems in any wireless sensor networks (WSNs), which are based on software defined networks. However, in previous literature, these problems are always considered separately. Consequently, these problems are not addressed in an efficient manner. In this work, we focus on new network structures known as software defined wireless rechargeable sensor networks (SDWRSNs) to ensure long-term operations and full coverage of the network simultaneously. In this work, we propose the least nodes deployment and charging algorithm (LNDCA) based on the homology theory. In the proposed LNDCA, the SDN controller requests the mobile chargers to replenish the energy for the node with the lowest energy. Additionally, the algorithm fully covers the whole network by using minimum number of nodes and ensures continuous operations in the network. The simulation results and analysis conducted in this work show that the proposed algorithm performs well in terms of energy consumption, coverage, and sustainable operations.
暂无评论