Hyperspectral object tracking (HOT) captures subtle object features, enabling precise identification and tracking in complex backgrounds. However, the high-dimensional nature of data and rapid object changes in dynami...
详细信息
Challenged networks (CNs) contain resource-constrained nodes deployed in regions where human intervention is difficult. Opportunistic networks (OppNets) are CNs with no predefined source-to-destination paths. Due to t...
详细信息
Many civil structures are at risk of failure due to bolts loosening under shock or vibration. Early detection of looseness is critical for safety. In this research, we utilize mathematical model with motion equations ...
详细信息
To solve the problem of grid coarse-grained reconfigurable array task mapping under multiple constraints,we propose a Loop Subgraph-Level Greedy Mapping(LSLGM)algorithm using parallelism and processing element *** the...
详细信息
To solve the problem of grid coarse-grained reconfigurable array task mapping under multiple constraints,we propose a Loop Subgraph-Level Greedy Mapping(LSLGM)algorithm using parallelism and processing element *** the constraint of a reconfigurable array,the LSLGM algorithm schedules node from a ready queue to the current reconfigurable cell array *** mapping a node,its successor’s indegree value will be dynamically *** its successor’s indegree is zero,it will be directly scheduled to the ready queue;otherwise,the predecessor must be dynamically *** the predecessor cannot be mapped,it will be scheduled to a blocking *** dynamically adjust the ready node scheduling order,the scheduling function is constructed by exploiting factors,such as node number,node level,and node *** with the loop subgraph-level mapping algorithm,experimental results show that the total cycles of the LSLGM algorithm decreases by an average of 33.0%(PEA44)and 33.9%(PEA_(7×7)).Compared with the epimorphism map algorithm,the total cycles of the LSLGM algorithm decrease by an average of 38.1%(PEA_(4×4))and 39.0%(PEA_(7×7)).The feasibility of LSLGM is verified.
To reconstruct 3D human figures with fine-grained details from sparse views, this paper proposes a novel framework called VR-Recon, which is based on a viewpoint refiner. In this framework, we first decouple geometric...
详细信息
Regression testing of software systems is an important and critical activity yet expensive and resource-intensive. An approach to enhance its efficiency is Regression Test Selection (RTS), which selectively re-execute...
详细信息
Regression testing of software systems is an important and critical activity yet expensive and resource-intensive. An approach to enhance its efficiency is Regression Test Selection (RTS), which selectively re-executes a subset of relevant tests that are impacted by code modifications. Previous studies on static and dynamic RTS for Java software have shown that selecting tests at the class level is more effective than using finer granularities like methods or statements. Nevertheless, RTS at the package level, which is a coarser granularity than class level, has not been thoroughly investigated or evaluated for Java projects. To address this gap, we propose PKRTS, a static package-level RTS approach that utilizes the structural dependencies of the software system under test to construct a package-level dependency graph. PKRTS analyzes dependencies in the graph and identifies relevant tests that can reach modified packages, i.e., packages containing altered classes. In contrast to conventional static RTS techniques, PKRTS implicitly considers dynamic dependencies, such as Java reflection and virtual method calls, among classes belonging to the same package by treating all those classes as a single cohesive node in the dependency graph. We evaluated PKRTS on 885 revisions of 9 open-source Java projects, with its performance compared to Ekstazi, a state-of-the-art dynamic class-level approach, and STARTS, a state-of-the-art static class-level approach. We used Ekstazi as the baseline to measure the safety and precision violations of PKRTS and STARTS. The results indicated that PKRTS outperformed static class-level RTS in terms of safety violation, which measures the extent to which relevant test cases are missed. PKRTS showed an average safety violation of 2.29% compared to 5.94% safety violation of STARTS. Despite this, PKRTS demonstrated lower precision violation and lower reduction in test suite size than class-level RTS, as it selects higher number of irrelevant te
Area has become one of the main bottlenecks restricting the development of integrated circuits. The area optimization approaches of existing XNOR/OR-based mixed polarity Reed-Muller(MPRM) circuits have poor optimizati...
详细信息
Area has become one of the main bottlenecks restricting the development of integrated circuits. The area optimization approaches of existing XNOR/OR-based mixed polarity Reed-Muller(MPRM) circuits have poor optimization effect and efficiency. Given that the area optimization of MPRM logic circuits is a combinatorial optimization problem, we propose a whole annealing adaptive bacterial foraging algorithm(WAA-BFA), which includes individual evolution based on Markov chain and Metropolis acceptance criteria, and individual mutation based on adaptive probability. To address the issue of low conversion efficiency in existing polarity conversion approaches, we introduce a fast polarity conversion algorithm(FPCA). Moreover, we present an MPRM circuits area optimization approach that uses the FPCA and WAA-BFA to search for the best polarity corresponding to the minimum circuits area. Experimental results demonstrate that the proposed MPRM circuits area optimization approach is effective and can be used as a promising EDA tool.
The low-intensity attack flows used by Crossfire attacks are hard to distinguish from legitimate *** methods to identify the malicious flows in Crossfire attacks are rerouting,which is based on *** these existing mech...
详细信息
The low-intensity attack flows used by Crossfire attacks are hard to distinguish from legitimate *** methods to identify the malicious flows in Crossfire attacks are rerouting,which is based on *** these existing mechanisms,the identification of malicious flows depends on the IP ***,the IP address is easy to be changed by *** the IP address,the certificate ismore challenging to be tampered with or ***,the traffic trend in the network is towards *** certificates are popularly utilized by IoT devices for authentication in encryption *** proposed a new way to verify certificates for resource-constrained IoT devices by using the SDN *** on DTLShps,the SDN controller can collect statistics on *** this paper,we proposeCertrust,a framework based on the trust of certificates,tomitigate the Crossfire attack by using SDN for *** goal is ***,the trust model is built based on the Bayesian trust system with the statistics on the participation of certificates in each Crossfire ***,the forgetting curve is utilized instead of the traditional decay method in the Bayesian trust system for achieving a moderate decay ***,for detecting the Crossfire attack accurately,a method based on graph connectivity is ***,several trust-based routing principles are proposed tomitigate the Crossfire *** principles can also encourage users to use certificates in *** performance evaluation shows that Certrust is more effective in mitigating the Crossfire attack than the traditional rerouting ***,our trust model has a more appropriate decay rate than the traditional methods.
Fatigue driving is one of the main causes of traffic accidents. Effective fatigue driving detection technology can reduce traffic accidents caused by fatigue driving. Traditional fatigue driving detection methods usua...
详细信息
The Internet of Things (IoT) has gained widespread use across various domains, necessitating robust trust management for safeguarding data integrity and device reliability. Existing trust management algorithms often o...
详细信息
暂无评论