Average Running Time Research Articles

OPTIMIZATION PROBLEM FOR NUMBER OF LOGIC GATES NEEDED TO IMPLEMENT MULTIPLE BOOLEAN FUNCTIONS USING DECODER

Abstract. Background. Computer circuits enable almost every piece of electronics to function. An opportunity for their optimization was found in one of the ways to implement a circuit, which involves a decoder. Decoders are basic circuit components whose behavior makes it easy to implement multiple Boolean functions. Functions are just rules by which informational signals are being processed in the circuit. To implement a function Logic gatEs (LEs) are used. LEs group multiple input signals and process them using binary logic operators like AND or NOR. Purpose. Develop a computer program that, based on provided functions, will find a solution associated with approximately minimal number of logic gates. Relevance. Prevalence of circuits increases the value of small optimizations, since any improvement gets multiplied by millions of circuits produced. Optimization at the logic level is being explored, which will retain value regardless of the physical properties of the circuit. Additionally, the theory of optimizing LE usage for circuits built on decoders is examined, which will alleviate future research. Methods. Development of the theory arose from an understanding that input signals can be grouped using LEs consciously. This way, LE outputs can be used in more than one function, which results in reduction of total number of LEs. It becomes evident that the problem can be restated in terms of sets. Similarity to known NP-hard problems emerges, which prompts usage of existing solution approaches. Among them, the greedy algorithm is chosen for its simplicity in program implementation. The connection between the problem and digital circuitry is weakened by the introduction of special evaluation functions that work with sets. So, the problem is reduced to several mathematical rules, which then are used as the appropriate parts of the greedy algorithm. Development of knowledge necessary to create the target program is thus concluded. Results. The target program is successfully implemented and can be seen in full at https://github.com/Gleb-05/MakeFuncForDC. A test is conducted on 1000 sets of four pseudorandom eight-term functions. It is estimated that the implementations proposed by the program require on average 0.75 of the initial number of LEs. The average running time is estimated at 2 milliseconds. In contrast, brute-force search for the same problem is theorized to run for years. Conclusions. A working program that finds an almost optimal solution is successfully created and tested. Its performance makes it potentially useful in the industrial scale of circuit manufacturing. Since the program essentially offers workload management, its possible applications go beyond the domain of digital electronics. Additionally, the theory of optimizing the use of LEs is presented for the first time. It can be used as the basis for future research on the implementation of multiple Boolean functions using decoder.

Time-Efficient RSA over Large-Scale Multi-Domain EON

The poor timeliness of routing has always been an urgent problem in practical operator networks, especially in situations with large-scale networks and multiple network domains. In this article, a pruning idea of routing integrated with Dijkstra’s shortest path searching is utilized to accelerate the process of routing in large-scale multi-domain elastic optical networks (EONs). The layered-graph approach is adopted in the spectrum allocation stage. To this end, an efficient heuristic algorithm is proposed, called “Branch-and-Bound based Routing and Layered Graph based Spectrum Allocation algorithm (BBR-LGSA)”, which is an integrated RSA algorithm. Notably, the significant reduction in algorithm time complexity is not only reflected in the pruning method used in the routing stage but also in the construction of auxiliary graphs during the spectrum allocation stage utilizing the Branch-and-Bound method. Simulation results show that the proposed BBR-LGSA significantly reduces the average running time by nearly 78% with higher spectrum utilization in large-scale multi-domain EONs, compared with benchmark algorithms. In addition, the impact of key parameters on performance comparisons of different algorithms is evaluated.

An adaptive robust watermarking scheme based on chaotic mapping

Digital images have become an important way of transmitting information, and the risk of attacks during transmission is increasing. Image watermarking is an important technical means of protecting image information security and plays an important role in the field of information security. In the field of image watermarking technology, achieving a balance between imperceptibility, robustness, and embedding capacity is a key issue. To address this issue, this paper proposes a high-capacity color image adaptive watermarking scheme based on discrete wavelet transform (DWT), Heisenberg decomposition (HD), and singular value decomposition (SVD). In order to enhance the security of the watermark, Logistic chaotic mapping was used to encrypt the watermark image. By adaptively calculating the embedding factor through the entropy of the cover image, and then combining it with Alpha blending technology, the watermark image is embedded into the Y component of the YCbCr color space to enhance the imperceptibility of the algorithm. In addition, the robustness of the algorithm was further improved through singular value correction methods. The experimental results show that the average PSNR and SSIM of the watermarking scheme are 45.3437dB and 0.9987, respectively. When facing various attacks, the average NCC of the extracted watermark reaches above 0.95, indicating good robustness. The embedding capacity of this scheme is 0.6667bpp, which is higher than other watermarking schemes, and the average running time is 1.1136 seconds, which is better than most schemes.

Enhancing energy-efficient building design: a multi-agent-assisted MOEA/D approach for multi-objective optimization

Energy-efficient building design is often challenged by multiple optimization problems due to contradictory objectives that are often hard to balance, so an effective optimization method should be thoroughly considered. Accordingly, a multi-objective evolutionary algorithm is then proposed. Firstly, the multi-agent auxiliary objective evolutionary algorithm for building energy efficiency model is established. According to model result analysis, the proposed algorithm runs fastest for 1640s with the average running time of 1710s in a single-room building, comparing to the least running time of 1680s for the multi-objective particle swarm optimization algorithm. In multi-room buildings, the proposed algorithm runs from 3350s to 3650s, with the average running time of 3500s. In conclusion, the model proposed in this study can comprehensively consider multiple objectives such as energy consumption, cost, comfort, etc. No matter in single-room or multi-room buildings, the model demonstrates superior performance and stability to realize comprehensive optimization of energy conservation design.

Analysis and prediction of energy consumption in office buildings with variable refrigerant flow systems: A case study

Accurately predicting building air-conditioning energy consumption is particularly important for energy management. However, for small datasets, there is a lack of simple and effective prediction methods applicable to multiple buildings. In order to fully explore the energy consumption mode of Variable Refrigerant Flow (VRF) air conditioning system and improve the accuracy of the model. This study uses the weather data of an outdoor meteorological data collection system and the air conditioning system and energy consumption data of an office building in Jinan. Initial analysis revealed that occupant behavior and daily variations in outdoor air temperatures significantly impact the energy consumption of air conditioning systems. Then, by applying the random forest algorithm and Pearson correlation analysis, the study identified daily average outdoor air temperature and VRF indoor unit running time as critical features for prediction. Subsequently, three machine learning models—Multiple Linear Regression (MLR), Back Propagation Neural Network (BPNN), and Long Short-Term Memory (LSTM) neural network—were developed and assessed using a 4:1 training-to-testing set ratio. Comparative analysis revealed that all models performed robustly, with the MLR model exhibited superior predictive accuracy (R2 (Coefficient of Determination) = 0.98, MAE (Mean Absolute Error) = 0.005 kWh/(m2·day), and RMSE (Root Mean Square Error) = 0.007 kWh/(m2·day) for the testing set) and simplicity. Furthermore, the effectiveness of the MLR model in handling small sample sizes was confirmed through cross-validation of data from two additional office buildings, highlighting its suitability for predicting energy consumption of VRF air conditioning systems in office buildings.

FaSS-MVS: Fast Multi-View Stereo with Surface-Aware Semi-Global Matching from UAV-Borne Monocular Imagery.

With FaSS-MVS, we present a fast, surface-aware semi-global optimization approach for multi-view stereo that allows for rapid depth and normal map estimation from monocular aerial video data captured by unmanned aerial vehicles (UAVs). The data estimated by FaSS-MVS, in turn, facilitate online 3D mapping, meaning that a 3D map of the scene is immediately and incrementally generated as the image data are acquired or being received. FaSS-MVS is composed of a hierarchical processing scheme in which depth and normal data, as well as corresponding confidence scores, are estimated in a coarse-to-fine manner, allowing efficient processing of large scene depths, such as those inherent in oblique images acquired by UAVs flying at low altitudes. The actual depth estimation uses a plane-sweep algorithm for dense multi-image matching to produce depth hypotheses from which the actual depth map is extracted by means of a surface-aware semi-global optimization, reducing the fronto-parallel bias of Semi-Global Matching (SGM). Given the estimated depth map, the pixel-wise surface normal information is then computed by reprojecting the depth map into a point cloud and computing the normal vectors within a confined local neighborhood. In a thorough quantitative and ablative study, we show that the accuracy of the 3D information computed by FaSS-MVS is close to that of state-of-the-art offline multi-view stereo approaches, with the error not even an order of magnitude higher than that of COLMAP. At the same time, however, the average runtime of FaSS-MVS for estimating a single depth and normal map is less than 14% of that of COLMAP, allowing us to perform online and incremental processing of full HD images at 1-2 Hz.

Study Evaluates Long-Term Corrosion Risk of Load-Bearing, High-Power ESP Cable

_ This article, written by JPT Technology Editor Chris Carpenter, contains highlights of paper OTC 34898, “Long-Term Corrosion-Risk Evaluation of Load-Bearing, High-Power Electrical Submersible Pump Cable,” by Serko A. Sarian, SPE, Alkhorayef Petroleum, and Hattan Banjar, SPE, and Chidirim Ejim, SPE, Saudi Aramco, et al. The paper has not been peer reviewed. Copyright 2024 Offshore Technology Conference. _ In this study, a fit-for-purpose electrical submersible pump (ESP) load-bearing power cable was deployed inside the production tubing of a sour oil well for an extended period of service. Project economics required the power-cable metallurgy to survive long-term exposure reliably for up to 15% hydrogen sulfide (H2S) and high-salinity production fluids. Laboratory tests simulating varying sour well and extended galvanic corrosion conditions have been performed to determine the adequacy of the selected armor metallurgy in downhole corrosive environments. Introduction In recent years, various types of load-bearing power cable-deployed ESP (CDESP) systems have been introduced, eliminating the need to install or remove a conventional ESP along with the completion and reducing ESP changeover time by more than 80%. More recently, live-well CDESP systems have been developed and tested to eliminate the need for a well-kill operation. The most-critical and costly component of such a system is the load-bearing power cable. The cable has the dual purpose of conveyance and long-term powering-up of the ESP. In a conventional artificial lift operation, the ESP is conveyed using the production tubing with a non-load-bearing power cable strapped to the outside of the tubing. This operation requires a workover rig to remove and reinstall the entire completion and a killed-well operation that might permanently damage the reservoir. The main advantages of a CDESP system include operational efficiency gain and cost reduction, no reservoir skin damage, and production-loss minimization. However, a few challenges exist with the use of CDESP. These cables must have significantly different structures from commercial oil and gas power cables. These differences are detailed in the complete paper. Cable-Design Requirements CDESP system criteria include multiple-year continued service in adverse oilwell and reservoir conditions such as sour fluids, high gas/oil ratios (GOR) and temperatures, and abrasion caused by solids production. The following product acceptance requirements were set in advance: - Three redeployments or retrievals after the initial deployment - Single deployment continued runtime to meet or exceed the regional conventional ESP system runtime Based on regional statistics, a conventional ESP system single-deployment average run time is 2.5 years. The effective CDESP power-cable service life target then becomes 2.5 years × four total deployments = 10 years, which served as the basis for all cable-associated testing and reliability metrics.

CT image reconstruction: integrating iterative methods with Ml-EM algorithm and deep learning models

Computed Tomography (CT) imaging faces limitations, including low spatial resolution and noise, particularly in low-radiation-dose imaging. To address these challenges, researchers are exploring CT image reconstruction from sinogram data. Sinograms represent X-ray absorption throughout the body, and sophisticated image reconstruction methods, including machine learning algorithms and generative adversarial networks (GANs), can improve precision and resolution without increasing patient radiation exposure. This study proposes an iterative reconstruction approach that combines filters from deep learning models (Convolutional Neural Networks and UNet) with the Maximum Likelihood Expectation Maximization (ML-EM) algorithm and the Enhanced Super-Resolution Generative Adversarial Networks (ESRGAN) model. Our method aims to enhance image quality and reconstruction speed. Experimental results show significant improvements in image quality and resolution, with the proposed method (DL-MLEM-IR-UNET-ESRGAN) achieving an average SSIM of 0.9980 and PSNR of 53.2119, outperforming other methods. Additionally, our method reduces reconstruction time, with an average runtime of 131 seconds.

A model template for reachability-based containment checking of imprecise observations in timed automata

AbstractVerifying safety requirements by model checking becomes increasingly important for safety-critical applications. For the validity of such proof in practice, the model needs to capture the actual behavior of the real system, which could be tested by containment checks of real observation traces. Basic equivalence checks, however, are not applicable if the system is only partially or imprecisely observable, if the model abstracts from explicit states with symbolic semantics, or if the checks are not expressible in the logics supported by a model checker. In this article, we solve the problem of observation containment checking in timed automata via reachability checking on tester systems. We introduce the logic SRL (sequence reachability logic) to express observations as sequences of delayed reachability properties. Through SBLL (introduced by Aceto et al.) as intermediate logic, we synthesize a set of matcher model templates for partial and imprecise observations and further extend these templates for the case of limited state accessibility in a model. For the obtained matching traces, we define the back-transformation into the original model domain and formally prove the correctness of the transformation. We implemented the observation matching approach, and apply it to a set of 7 demo and 3 case study models with different levels of observability. The results show that all positive and negative observations are correctly classified, and that the most advanced matcher model instance still offers average run times between 0.1 and 1 s in all but 3 scenarios.

Evolutionary Mechanism Based Conserved Gene Expression Biclustering Module Analysis for Breast Cancer Genomics.

The identification of significant gene biclusters with particular expression patterns and the elucidation of functionally related genes within gene expression data has become a critical concern due to the vast amount of gene expression data generated by RNA sequencing technology. In this paper, a Conserved Gene Expression Module based on Genetic Algorithm (CGEMGA) is proposed. Breast cancer data from the TCGA database is used as the subject of this study. The p-values from Fisher's exact test are used as evaluation metrics to demonstrate the significance of different algorithms, including the Cheng and Church algorithm, CGEM algorithm, etc. In addition, the F-test is used to investigate the difference between our method and the CGEM algorithm. The computational cost of the different algorithms is further investigated by calculating the running time of each algorithm. Finally, the established driver genes and cancer-related pathways are used to validate the process. The results of 10 independent runs demonstrate that CGEMGA has a superior average p-value of 1.54 × 10-4 ± 3.06 × 10-5 compared to all other algorithms. Furthermore, our approach exhibits consistent performance across all methods. The F-test yields a p-value of 0.039, indicating a significant difference between our approach and the CGEM. Computational cost statistics also demonstrate that our approach has a significantly shorter average runtime of 5.22 × 100 ± 1.65 × 10-1 s compared to the other algorithms. Enrichment analysis indicates that the genes in our approach are significantly enriched for driver genes. Our algorithm is fast and robust, efficiently extracting co-expressed genes and associated co-expression condition biclusters from RNA-seq data.

Logistics distribution model and storage planning design based on multi-source information positioning in smart city development

The research mainly focuses on the inefficient planning of autonomous distribution and storage modes of distribution vehicles in smart city logistics and distribution, which in turn leads to poor customer experience, rising distribution costs, and wasted distribution resources. From the perspective of information processing in the logistics distribution process, the study takes multi-angle and multi-source information collection and fusion processing strategy as the main basis to help smart delivery robots realize map construction and autonomous positioning in the distribution process, and then facilitate real-time logistics distribution and storage mode planning by robots in combination with their own states. The research results show that the algorithm accuracy, standard error, and average running time of the extended Kalman filter localization model designed in the study are 0.96, 1.52, and 105s, respectively, with the algorithm accuracy being the highest and the other two values being the lowest in its class. Meanwhile, in the simulation logistics planning, the research-designed logistics planning model has the strongest information capturing ability, and the planning of distribution routes and storage modes is more reasonable, which can provide more efficient autonomous planning solutions.

Image Inpainting via Correlated Multi-Resolution Feature Projection.

With the advancement in image editing applications, image inpainting is gaining more attention due to its ability to recover corrupted images efficiently. Also, the existing methods for image inpainting either use two-stage coarse-to-fine architectures or single-stage architectures with a deeper network. On the other hand, shallow network architectures lack the quality of results and the methods with remarkable inpainting quality have high complexity in terms of number of parameters or average run time. Despite the improvement in the inpainting quality, these methods still lack the correlated local and global information. In this work, we propose a single-stage multi-resolution generator architecture for image inpainting with moderate complexity and superior outcomes. Here, a multi-kernel non-local (MKNL) attention block is proposed to merge the feature maps from all the resolutions. Further, a feature projection block is proposed to project features of MKNL to respective decoder for effective reconstruction of image. Also, a valid feature fusion block is proposed to merge encoder skip connection features at valid region and respective decoder features at hole region. This ensures that there will not be any redundant feature merging while reconstruction of image. Effectiveness of the proposed architecture is verified on CelebA-HQ Liu, et al. 2015, Karras et al. 2017, and Places2 Zhou et al. 2018 datasets corrupted with publicly available NVIDIA mask dataset Liu et al. 2018. The detailed ablation study, extensive result analysis, and application of object removal prove the robustness of the proposed method over existing state-of-the-art methods for image inpainting.

Performance evaluation and factors influencing a drinking water treatment plant, Shire Indassilassie, Ethiopia

This research assesses the efficacy of the water treatment plant in Shire Indassilassie, Tigray, Ethiopia, focusing on the slow sand filtration system. Despite the inclusion of horizontal roughing filtration and a sedimentation tank, the water treatment plant struggles with an inadequate and turbid water supply. This study evaluates the water treatment plant’s performance through field evaluation, interviews, and laboratory experiments, concentrating on major treatment processes to identify performance-limiting factors. The water source had an average turbidity of 29.70 ± 1.03 NTU in the dry season and 94.27 ± 16.71 NTU in the summer. Results indicate that horizontal roughing filtration, sedimentation tank, and slow sand filtration achieve average turbidity removal efficiencies of 42.02% ± 4.00%, 5.67% ± 3.15%, and 83.51% ± 8.75%, respectively, during the dry season. In the summer or wet season, these treatment units achieve efficiencies of 40.06% ± 3.26%, 28.17% ± 4.62%, and 77.07% ± 4.61%, respectively. Additionally, the average run times for slow sand filtration are 22 days in the dry season and 13 days in the summer. Total and fecal coliform removals were effective, except in the sedimentation tank. A one-way ANOVA confirms a significant difference in turbidity among treatment units. Factors such as fine filter sand particles causing faster clogging, pipe misconnections, inadequate cleaning practices, irregular filtration rates, air binding due to a lack of backfilling at startup, and a lack of periodic monitoring and emergency response lead to suboptimal turbidity removal and shorter slow sand filtration run times. The study underscores the need for corrective measures to address these issues, enhancing water treatment plant sustainability in the region.

Delivering holistic energy-saving operation for heterogeneous all-parallel chiller plant systems through two-stage optimization assisted by input convex neural networks

With the rapid growth of building cooling demand and energy consumption, the potential for energy-saving operations gave rise to the popularity of implementing heterogeneous all-parallel chiller plant systems in large-scale public buildings. Meanwhile, heterogeneity, multi-dimensionality, and tight coupling interactions considerably complicate the holistically optimal operation of the system. Although artificial neural networks (ANN) have achieved great success in complex system identification, the endogenous non-convexity of classical feedforward neural networks (FNN), which are widely applied in model-based optimization for chiller plant operation, makes conventional optimizers prone to falling into local optima, forcing previous methodologies to sacrifice model precision for computational tractability. In this study, a special type of ANN named input convex neural network (ICNN) was leveraged to identify five individual convex models for energy-consuming units in the chiller plant system, providing convex input-output mappings while preserving high-resolution representations. Then, a two-stage optimizer with a sequential integration of a global searcher and a local optimizer was developed to effectively solve the holistic energy-saving problem by optimizing ten decision variables including chilled water supply temperature, partial load ratio of chillers, speed ratios of pumps and cooling tower fans, cooling water flow rate of cooling towers, and on/off states of devices. Finally, the methodology was deployed to a case study using on-site operation data and was compared with conventional candidates. Average holistic energy-saving ratios of 13.37% and 9.14% were achieved with average runtimes of 1.12 s and 1.07 s by the proposed optimizer in the high-load and light-load scenarios, respectively, showcasing more advantageous in resolving the operation optimization of complicated chiller plant systems.

Interoperable Integration of Automatic ECG Processing Using DICOMweb and the AcuWave Software Suite.

Established cardiovascular risk scores are typically based on items from structured clinical data such as age, sex, or smoking status. Cardiovascular risk is also assessed from physiological measurements such as electrocardiography (ECG). Although ECGs are standard diagnostic tools in clinical care, they are scarcely integrated into clinical information systems. To overcome this roadblock, we propose the integration of an automatic workflow for ECG processing using the DICOMweb interface to transfer ECGs in a standardised way. We implemented the workflow using non-commercial software and tested it with about 150,000 resting ECGs acquired in a maximum-care hospital. We employed Orthanc as DICOM server and AcuWave as signal processing application and implemented a fully-automated workflow which reads the ECG data and computes heart rate-related parameters. The workflow is evaluated on off-the-shelf hardware and results in an average run time of approximately 40 ms for processing a single ECG.

A low-complexity ADMM-based secure beamforming for IRS-assisted uplink cognitive radio networks with NOMA

Intelligent reflecting surface (IRS) and non-orthogonal multiple access (NOMA) are both powerful means to improve the spectrum efficiency and can assist the cognitive radio network (CRN) in achieving more effective spectrum allocation. However, spectrum sharing in CRNs and the utilization of the scarce bandwidth in NOMA make it vulnerable to security threats. The secure beamforming design in IRS-assisted CRNs with NOMA is complicated and non-convex. Traditional semidefinite relaxation along with Gaussian randomization (SDR-GR) algorithm can solve the non-convex problem, however a high computational complexity. This paper proposes an alternating direction method of multipliers (ADMM)-based sum secrecy rate maximization (A-SSRM) scheme to achieve secure transmission with low computation complexity in IRS-assisted uplink CRNs with NOMA. Specifically, we derive an appropriate transformation of the original problem based on the ADMM framework and decompose it into multiple sub-problems, which are carefully designed to have closed-form solutions. Furthermore, an eavesdropper zero forcing (EZF)-based sub-optimal scheme is presented. Simulation results reveal that our proposed A-SSRM scheme outperforms other benchmarks in terms of sum secrecy rate and reduces the average running time by 6 times compared with the traditional SDR-GR algorithm. This is attributed to our effective decoupling and decomposing of the original problem, which enables each sub-problem to obtain a simple closed-form solution through derivation.

Real-time fault-tolerant guidance for launch vehicle ascending flight under thrust drop failure

This paper presents a real-time fault-tolerant guidance method, which solves the autonomous rescue problem in the event of thrust drop failure during the final stage flight of launch vehicles. The core of the method is the online and optimal reconstruction of both the degraded target orbit and the subsequent flight trajectory. Aiming at achieving satisfied onboard computing performance and making the best use of the launcher’s residual energy, a unique relaxation-penalization model transformation method for the nonlinear orbit injection conditions is proposed, and a successive convexification algorithm is developed to solve the problem. Furthermore, both the two classic thrust drop failure situations, that is the mass flow rate drop and the specific impulse drop problems, can be resolved by the proposed algorithm. The average run-time of this orbit-trajectory joint optimization algorithm is below 150ms in an embedded ARM processor @1.5 GHz, which is adequate for onboard use. Using the above algorithm as a central infrastructure, a receding-horizon-strategy-based fault-tolerant guidance method is proposed. By performing the optimization repeatedly at a high frequency, the effects of parameter deviations and external disturbances can be absorbed for the most part, for example, the guidance algorithm is verified to be capable of tolerating at least ±5% thrust deviations. Comprehensive numerical and hardware-in-the-loop simulations are performed to demonstrate the computational performance, accuracy, and reliability of the proposed algorithms.

A Novel Voltage-Abnormal Cell Detection Method for Lithium-Ion Battery Mass Production Based on Data-Driven Model with Multi-Source Time Series Data

Before leaving the factory, lithium-ion battery (LIB) cells are screened to exclude voltage-abnormal cells, which can increase the fault rate, troubleshooting difficulty, and degrade pack performance. However, the time interval to obtain the detection results through the existing voltage-abnormal cell method is too long, which can seriously affect production efficiency and delay shipment, especially in the mass production of LIBs when facing a large number of time-critical orders. In this paper, we propose a data-driven voltage-abnormal cell detection method, using a fast model with simple architecture, which can detect voltage-abnormal cells based on the multi-source time series data of the LIB without a time interval. Firstly, our method transforms the different source data of a cell into a multi-source time series data representation and utilizes a recurrent-based data embedding to model the relation within it. Then, a simplified MobileNet is used to extract hidden feature from the embedded data. Finally, we detect the voltage-abnormal cells according to the hidden feature with a cell classification head. The experiment results show that the accuracy and average running time of our model on the voltage-abnormal cell detection task is 95.42% and 0.0509 ms per sample, which is a considerable improvement over existing methods.

TREAFET: Temperature-Aware Real-Time Task Scheduling for FinFET based Multicores

The recent shift in the VLSI industry from conventional MOSFET to FinFET for designing contemporary chip-multiprocessor (CMP) has noticeably improved hardware platforms’ computing capabilities, but at the cost of several thermal issues. Unlike the conventional MOSFET, FinFET devices experience a significant increase in circuit speed at a higher temperature, called temperature effect inversion (TEI), but higher temperature can also curtail the circuit lifetime due to self-heating effects (SHEs). These fundamental thermal properties of FinFET introduced a new challenge for scheduling time-critical tasks on FinFET-based multicores that how to exploit TEI towards improving performance while combating SHEs. In this work, TREAFET , a temperature-aware real-time scheduler, attempts to exploit the TEI feature of FinFET-based multicores in a time-critical computing paradigm. At first, the overall progress of individual tasks is monitored, tasks are allocated to the cores, and finally, a schedule is prepared. By considering the thermal profiles of the individual tasks and the current thermal status of the cores, hot tasks are assigned to the cold cores and vice-versa. Finally, the performance and temperature are balanced on-the-fly by incorporating a prudential voltage scaling towards exploiting TEI while guaranteeing the deadline and thermal safety. Moreover, TREAFET stimulates the average runtime frequency by employing an opportunistic energy-adaptive voltage spiking mechanism, in which energy saving during memory stalls at the cores is traded off during the time slice having the spiked voltage. Simulation results claim TREAFET maintains a safe and stable thermal status (peak temperature below 80 °C) and improves frequency up to 17% over the assigned value, which ensures legitimate time-critical performance for a variety of workloads while surpassing a state-of-the-art technique. The stimulated frequency in TREAFET also finishes the tasks early, thus providing opportunities to save energy by power gating the cores, and achieves a 24% energy delay product (EDP) gain on average.

Cooperative path planning study of distributed multi-mobile robots based on optimised ACO algorithm

The rapid development of robotics technology has driven the growth of robot types and the development of related technologies. As an important aspect of robot research, path planning technology plays an irreplaceable role in practical production and application. Ant colony algorithm has a wide range of applications in robot path planning, but there is also a problem of performance overly relying on initial parameter selection. In order to solve this problem and improve the performance of mobile robot path planning, an improved ant colony algorithm based on firefly algorithm was studied and designed in a two-dimensional environment. In order to further explore the performance of ant colony algorithm in solving robot coordinated path planning problems, an improved ant colony algorithm based on heuristic function was also designed. In a three-dimensional environment, an improved ant colony algorithm based on the improved artificial potential field method was designed. The research results show that the maximum running time of the improved ant colony algorithm based on the firefly algorithm in different grid environments is 819.36 s, 847.01 s, and 811.54 s, respectively. The average running time of the improved ant colony algorithm based on heuristic function in different grid environments is 5.19 s, 5.97 s, and 9.09 s, with average path lengths of 29.90 cm, 31.08 cm, and 37.01 cm, and path length variances of 0.35, 0.87, and 2.21, respectively. The ant colony algorithm based on the improved artificial potential field method has a running time of 1.930 s, 3.182 s, and 4.662 s in different grid environments, and a path length of 29.275 cm, 49.447 cm, and 67.057 cm, respectively. The ant colony algorithm for research and design optimization has good performance. The contribution of the research lies in the design of three path planning methods for mobile robots, including two-dimensional path planning and three-dimensional path planning, which improves the time of path planning and shortens the average path length. The novelty of the research is reflected in the design of a path planning method for mobile robots in two-dimensional and three-dimensional environments, which improves the ant colony algorithm through firefly algorithm and heuristic function, and combines the ant colony algorithm with the improved artificial potential field method. The method designed by the research institute can provide technical support for path planning of mobile robots.