-
581
A study on the cabin indoor localization algorithm based on adaptive -values
Published 2022-02-01“…In order to improve the positioning accuracy, this article proposes an adaptive K -value-based cabin indoor positioning algorithm. The algorithm constructs a fingerprint library by collecting Received Signal Strength Indication data and carries out filtering; matches fingerprint information by adaptive K -values during the localization process, while using double K -nearest neighbor to reduce the influence of outlier points on the final localization; and finally uses the multi-point mass center method to determine the final localization results. …”
Get full text
Article -
582
Quantum Circuit Synthesis Using Fuzzy-Logic-Assisted Genetic Algorithms
Published 2025-03-01“…Therefore, interest has grown towards heuristics-based synthesis techniques, which are able to produce approximations of the desired algorithm, while optimizing depth and gate-count. In this work, we investigate using genetic algorithms (GA)—a proven gradient-free optimization technique based on natural selection—for circuit synthesis. …”
Get full text
Article -
583
Vision-based detection algorithm for monitoring dynamic change of fire progression
Published 2025-05-01Get full text
Article -
584
On-board Multi-User Detection Algorithm Based on Conditional Neural Process
Published 2021-12-01“…With the characteristics of all-terrain, all-weather and seamless coverage, satellite communications have become a potentially important part of 6G.An important prerequisite for achieving satellite intelligence is that the satellite have on-board processing capabilities.Multi-user detection (MUD) is a classic method of suppressing multiple access interference (MAI) in wireless communication, such as MMSE, Gaussian processregression (GPR) and other algorithms.Due to the inverse matrix required in the detection process, the algorithm complexity is usually cubic, and it is diff cult to directly apply to satellite platforms because of its limited processing capabilities.The conditional neural process combined the characteristics of the low complexity of the neural network and the data-eff cient of the Gaussian process.The neural network was used to parameterized the Gaussian process to avoided the inversion of the matrix, thereby reduced the computational complexity.The application of conditional neural process in MUD was studied.The simulation results showed that, while reduced complexity, conditional neural process also greatly improved the performance of bit error rate (BER).…”
Get full text
Article -
585
Joint scheduling algorithm for correlative tasks in multi-access edge computing
Published 2023-04-01“…Multi-access edge computing (MEC) has emerged as a promising computing paradigm for resource-intensive applications.However, most of the previous research work has not considered correlative tasks, which may lead to infeasible scheduling decisions.Considering that some tasks on the application must be completed locally and another non-negligible energy consumption problem in the multi-access edge computing offloading scenario, the joint scheduling algorithm of correlative tasks on the local and edge sides was studied.The problem was formalized as minimizing the energy consumption in the system while satisfying the application’s completion deadline constraints, and the joint scheduling (JS) algorithm was proposed to solve the problem.Finally, the performance of the JS algorithm in the application completion rate and system energy consumption were analyzed through simulation experiments.The simulation results show that the JS algorithm is superior to other comparison algorithms in the application completion rate and can save at least 43% of the system energy consumption.…”
Get full text
Article -
586
Deduplication algorithm based on condensed nearest neighbor rule for deduplication metadata
Published 2015-08-01“…Building effective deduplication index in the memory could reduce disk access times and enhance chunk fingerprint lookup speed,which was a big challenge for deduplication algorithms in massive data environments.As deduplication data set had many samples with high similarity,a deduplication algorithm based on condensed nearest neighbor rule,which was called Dedup<sup>2</sup>,was proposed.Dedup<sup>2</sup>uses clustering algorithm to divide the original deduplication metadata into several categories.According to these categories,it employs condensed nearest neighbor rule to remove the highest similar data in the deduplication metadata.After that it can get the subset of deduplication metadata.Based on this subset,new data objects will be deduplicated based on the principle of data similarity.The results of experiments show that Dedup<sup>2</sup>can reduce the size of deduplication data set more than 50% effectively while maintain similar deduplication ratio.…”
Get full text
Article -
587
EAQR: A Multiagent Q-Learning Algorithm for Coordination of Multiple Agents
Published 2018-01-01“…We propose a cooperative multiagent Q-learning algorithm called exploring actions according to Q-value ratios (EAQR). …”
Get full text
Article -
588
A Group Search Algorithm for Optimal Scheduling of Cascade Hydropower Stations
Published 2025-01-01“…These improvements balanced global search and local search, preventing premature convergence while accelerating the convergence speed. Simulation results for four cascade hydropower plants in a region in southwest China show that the difference between the results of CHIO and LCHIO and the dynamic programming POA-DDDP is less than 1%, and the variation coefficients are 0.13% and 0.11%, which verify the rationality and effectiveness of CHIO to solve the cascade reservoir group scheduling problem and the improvement effect of LCHIO algorithm on CHIO. …”
Get full text
Article -
589
A Novel Image Mosaicking Algorithm for Wireless Multimedia Sensor Networks
Published 2013-10-01“…Furthermore, the simulation results also show that the proposed algorithm can improve the accuracy of image registration, reduce the complexity of the image mosaic, and prolong the network lifetime while providing better image quality.…”
Get full text
Article -
590
Application of Artificial Intelligence with Ant Colony Algorithm in construction projects schedule
Published 2018-11-01“…Many methodsThe existing scheduling of the activities of a project is applicable, while complicatedMany organizations face the challenge of managing multiple projects simultaneously. …”
Get full text
Article -
591
Path Optimization of Welding Robot Based on Ant Colony and Genetic Algorithm
Published 2022-01-01“…While the process of intelligent industrial production is accelerating, the application scope of welding robots is also expanding. …”
Get full text
Article -
592
Modify PRESENT Algorithm by New technique and key Generator by External unit
Published 2023-04-01“…We also used a physical part with the developed algorithm (an external unit that is a USB and using it as a fingerprint for the system) to generate the key while ensuring that the system does not work until after the external unit is connected to the calculator to provide more security for the system from breaches. …”
Get full text
Article -
593
A Social DTN Network Routing Algorithm Based on Data Link
Published 2020-02-01“…Data transmission in the network rely on network protocols, while the design of network protocols also require accommodation with the communication environmental characteristics. …”
Get full text
Article -
594
Deduplication algorithm based on condensed nearest neighbor rule for deduplication metadata
Published 2015-08-01“…Building effective deduplication index in the memory could reduce disk access times and enhance chunk fingerprint lookup speed,which was a big challenge for deduplication algorithms in massive data environments.As deduplication data set had many samples with high similarity,a deduplication algorithm based on condensed nearest neighbor rule,which was called Dedup<sup>2</sup>,was proposed.Dedup<sup>2</sup>uses clustering algorithm to divide the original deduplication metadata into several categories.According to these categories,it employs condensed nearest neighbor rule to remove the highest similar data in the deduplication metadata.After that it can get the subset of deduplication metadata.Based on this subset,new data objects will be deduplicated based on the principle of data similarity.The results of experiments show that Dedup<sup>2</sup>can reduce the size of deduplication data set more than 50% effectively while maintain similar deduplication ratio.…”
Get full text
Article -
595
A NOVEL SERPENT ALGORITHM IMPROVEMENT BY THE KEY SCHEDULE INCREASE SECURITY
Published 2020-12-01“…AES Algorithm Proposals. In this paper, a new proposal is presented to improve and support the confidentiality of data while adhering to the external structure of the standard algorithm, relying on designing a new approach to the key generation function because the sobriety of block cipher relies on the use of a strong and unique key. …”
Get full text
Article -
596
Lower bounds for quantum-inspired classical algorithms via communication complexity
Published 2025-01-01“…In the past several years, numerous efficient algorithms for various tasks have been found, while an analysis of lower bounds is still missing. …”
Get full text
Article -
597
Vehicle detection and recognition algorithm based on function improvement of YOLOv3
Published 2023-12-01“…YOLOv3 algorithm is characterized by high detection accuracy and high speed in the aspect of target detection and recognition. …”
Get full text
Article -
598
Evolutionary search algorithm for learning activation function of an artificial neural network
Published 2025-01-01“…The proposed method aims to enhance the efficiency of the search process for optimal activation functions. Our algorithm employs genetic programming to evolve the general form of activation functions, while gradient descent optimizes their parameters during network training. …”
Get full text
Article -
599
Proxy caching algorithm based on segment popularity for mobile streaming media
Published 2007-01-01“…A novel dynamic scheduling algorithm P2CAS2M2(proxy caching algorithm based on segment popularity for mobile streaming media)based on segment popularity for mobile streaming media was proposed.Proxy caching admis-sion and replacement algorithm based on the object segment popularity for mobile streaming media was implemented.The principle was obeyed that the data cached for each mobile streaming media object were in proportion to their popu-larity at the proxy server.The cache window size was updated periodically according to the average access time of the clients.Simulation results show that this algorithm is more adaptive than A2LS(adaptive and lazy segmentation algorithm) for the variety of the proxy server cache.It can gain more average number of cached mobile streaming media objects and less delayed requested ratio while byte-hit ratio of P2CAS2M2 is close to or exceeds A2LS under the circumstance of the same proxy cache space.…”
Get full text
Article -
600
Performance Evaluation of a Topology Control Algorithm for Wireless Sensor Networks
Published 2010-07-01“…OTC is evaluated against two well-known algorithms from the literature, namely, Span and GAF through realistic simulations using TOSSIM. …”
Get full text
Article