Search

The gig economy and gig work have grown quickly in recent years and have drawn much attention from researchers in different fields. Because the platform mediated gig economy is a relatively new phenomenon, studies have produced a range of interesting findings; of interest here are the socio‐technical issues that this work has surfaced. This systematic literature review (SLR) provides a snapshot of a range of socio‐technical issues raised in the last 12 years of literature focused on the platform mediated gig economy. Based on a sample of 515 papers gathered from nine databases in multiple disciplines, 132 were coded that specifically studied the gig economy, gig work, and gig workers. Three main socio‐technical themes were identified: (1) the digital workplace, which includes information infrastructure and digital labor that are related to the nature of gig work and the user agency; (2) algorithmic management, which includes platform governance, performance management, information asymmetry, power asymmetry, and system manipulation, relying on a diverse set of technological tools including algorithms and big data analytics; (3) ethical design, as a relevant value set that gig workers expect from the platform, which includes trust, fairness, equality, privacy, and transparency. A social informatics perspective is used to rethink the relationship between gig workers and platforms, extract the socio‐technical issues noted in prior research, and discuss the underexplored aspects of the platform mediated gig economy. The results draw attention to understudied yet critically important socio‐technical issues in the gig economy that suggest short‐ and long‐term opportunities for future research directions. [ABSTRACT FROM AUTHOR]

License plate detection is an important task in Intelligent Transportation Systems (ITS) and has a wide range of applications in vehicle management, traffic control, and public safety. In order to improve the accuracy and speed of mobile recognition, an improved lightweight YOLOv5s model is proposed for license plate detection. First, an improved Stemblock network is used to replace the original Focus layer in the network, which ensures strong feature expression capability and reduces a large number of parameters to lower the computational complexity; then, an improved lightweight network, ShuffleNetv2, is used to replace the backbone network of the YOLOv5s, which makes the model lighter and ensures the detection accuracy at the same time. Then, a feature enhancement module is designed to reduce the information loss caused by the rearrangement of the backbone network channels, which facilitates the information interaction in the feature fusion process; finally, the low‐, medium‐ and high‐level features in the Shufflenetv2 network structure are fused to form the final high‐level output features. Experimental results on the CCPD dataset show that compared to other methods this paper obtains better performance and faster speed in the license plate detection task, in which the average precision mean value reaches 96.6%, and can achieve a detection speed of 43.86 frame/s, and the parameter volume is reduced to 5.07 M. [ABSTRACT FROM AUTHOR]

This paper reflects on the paradigmatic assumptions and ideologies that have shaped algorithmic management research. We identify two sets of assumptions: one about the "ontology of algorithms" (which holds that human resource management [HRM] algorithms are non‐human entities with material agency) and one about the "ontology of management" that HRM algorithms afford (which understands algorithmic management as a form of control for maximizing economic/shareholder value). We explain how these core assumptions underpin existing research of HRM algorithms, causing blind spots that hinder new ways of understanding and studying algorithmic management. After identifying and unpacking the assumptions and blind spots, we offer avenues to overcome these blind spots, allowing for future research based on new ideological assumption grounds that will help move algorithmic management scholarship further in significant ways. [ABSTRACT FROM AUTHOR]

The YOLO series of algorithms have made substantial contributions to the detection of insulator defects in power transmission line operations. However, existing target detection algorithms for the small target detection and low‐quality insulator images encounter difficulties in effectively capturing relevant features, resulting in a higher probability of target loss. To identify and classify defects in the operational state of insulators, an improved YOLOv8 target identification algorithm called DGW‐YOLOv8 is proposed in this paper. The deformable attention backbone of the DGW‐YOLOv8 target identification algorithm is designed by adding the deformable ConvNets v2 module and the global attention mechanism. This addition reduces the feature loss caused by the network feature processing, enhances the sensitivity of the algorithm to small‐scale targets, and reduces the impact caused by the different global positions of the targets. Additionally, to address the problem of low quality of captured images, WIoU v3 is used to replace CIoU in the original YOLOv8 target identification algorithm to optimize the loss function, reduce the degrees of freedom, and improve the network robustness. Experimental results demonstrate that the enhanced YOLOv8 algorithm can achieve an improvement of 2.4% and 5.5% in mAP and mAP50‐95, respectively, compared with the original algorithm. [ABSTRACT FROM AUTHOR]

The vehicle's power battery is composed of a large number of battery cells series or in parallel. Due to the manufacturing process error and the different use environments, there are differences between the battery cells, and the battery pack will have inconsistency problems, which will increase the safety hazard. Therefore, it is of great practical significance to identify and warn about the inconsistency of power batteries. Based on the data of the internet of vehicles platform, this paper proposes an improved isolated forest power battery abnormal monomer identification and early warning method, which uses the sliding window (SW) to segment the dataset and update the data of the diagnosis model in real‐time. The scores of normal battery cells and abnormal battery cells were analyzed, and then the fault threshold was determined to be 0.75. The results show that the recall ratio and precision ratio of the algorithm are 0.91 and 0.95, respectively, which is more suitable for inconsistent battery cell identification than other methods. If the SW size is 15, the warning effect is the best. Before the vehicle alarm occurs, the algorithm can realize early fault warnings, thus effectively avoiding the safety problems caused by inconsistency faults. [ABSTRACT FROM AUTHOR]

Document forgeries that involve modification of the materials used, such as ink and paper, provide evidence of any malpractices being performed. Forensic specialists use different techniques to identify and classify these samples; however, the most preferred method is to use nondestructive techniques to avoid any potential damage to the original specimen under investigation. Hyperspectral imaging has already been explored in several application domains and used as a powerful method in forensic investigations to extract information about the materials under examination. To precisely classify the material information and utilize the hyperspectral imaging technique's potential, we probed the potential of some hybrid spectral similarity measures to classify different commonly used paper samples. A comparison of these methods is quantitatively presented in this article. Hybrid spectral similarity algorithms are tested on forensic analysis of paper data. We compared the classification capabilities of various hybrid spectral similarity algorithms on hyperspectral data of 40 different paper samples. The overall accuracy (OA), kappa K̂, Z‐score of kappa (ZK̂), and the 95% confidence interval of kappa (CI(K̂)) are used for comparison. The SID‐SAM and SID‐SCA produced an overall accuracy of 88% and 87%, respectively, which is highest among the hybrid spectral similarity measures tested. [ABSTRACT FROM AUTHOR]

In this paper, we present a new algorithm which can eliminate abnormal detection data of our OLED panels caused by damaged detection TFTs. During the manufacture of oversize OLED TVs, particles bring many serious problems especially when they make detection TFTs be damaged and these TFTs will cause one or even several columns of detection data to be abnormal. The new "abnormal detection data forbidden algorithm" will replace the adjacent normal column detection data for the column with obvious abnormal detection data and the new "mosaic algorithm" will scatter the detection data of these columns that the detection data is not obviously abnormal but they are thin lines visible to the human eyes when the panel is working. To sum up, the new integration algorithm is very important for improving the image quality and stable operation of our products. [ABSTRACT FROM AUTHOR]

Proper current sharing, DC bus voltage deviation reduction, and SOCs balancing, along with ensuring stability are the vital challenges of DC microgrids control algorithms. Addressing these challenges without communication links and a central controller is one of the priorities of control methods. Motivated by the above mentions, this paper presents a novel communication‐free control method. In this regard, a new parameter called "virtual current" is defined according to the unit current and its SOC. Then using a piecewise droop curve and the droop curve shift technique, the virtual current for each unit is determined. The units control coefficients and the relationship of the virtual current are allocated based on the location and power of the loads and RESs such that in the worst case; 1) SOCs are converged; 2) the DC bus voltage deviation is reduced; and 3) the current is appropriately distributed. The simulation and experimental results confirm that the proposed method can balance SOCs like SOC‐based methods and share power properly like piecewise droop methods while reducing DC bus voltage deviation. [ABSTRACT FROM AUTHOR]

Accurate modeling and parameter identification of photovoltaic (PV) cells is a difficult task due to the nonlinear characteristics of PV cells. The goal of this paper is to propose a multi strategy sine–cosine algorithm (SCA), named enhanced sine–cosine algorithm (ESCA), to evaluate nondirectly measurable parameters of PV cells. The ESCA introduces the concept of population average position to increase the population exploration ability, and at the same time introduces the personal destination agent mutation mechanism and competitive selection mechanism into SCA to provide more search directions for ESCA while ensuring the search accuracy and diversity maintenance. To prove that the proposed ESCA is the best choice for extracting nondirectly measurable parameters of PV cells, ESCA is evaluated by the single‐diode model, the double‐diode model, the three‐diode model, and the photovoltaic module model (PVM), and compared with eight existing popular methods. Experimental results show that ESCA outperforms similar methods in terms of diversity maintenance, high efficiency, and stability. In particular, the proposed ESCA method is less than the SCA by 0.081, 0.144, and 0.578 in the standard deviation statistics metrics of the three PVM models (PV‐PWP201, STM6‐40/36, and STP6‐120/36), respectively. Therefore, the proposed ESCA is an accurate and reliable method for parameter identification of PV cells. [ABSTRACT FROM AUTHOR]

The purpose of this study was to discuss how artificial intelligence (AI) methods have affected the field of drug development. It looks at how AI models and data resources are reshaping the drug development process by offering more affordable and expedient options to conventional approaches. The paper opens with an overview of well‐known information sources for drug development. The discussion then moves on to molecular representation techniques that make it possible to convert data into representations that computers can understand. The paper also gives a general overview of the algorithms used in the creation of drug discovery models based on AI. In particular, the paper looks at how AI algorithms might be used to forecast drug toxicity, drug bioactivity, and drug physicochemical properties. De novo drug design, binding affinity prediction, and other AI‐based models for drug–target interaction were covered in deeper detail. Modern applications of AI in nanomedicine design and pharmacological synergism/antagonism prediction were also covered. The potential advantages of AI in drug development are highlighted as the evaluation comes to a close. It underlines how AI may greatly speed up and improve the efficiency of drug discovery, resulting in the creation of new and better medicines. To fully realize the promise of AI in drug discovery, the review acknowledges the difficulties that come with its uses in this field and advocates for more study and development. [ABSTRACT FROM AUTHOR]

Due to the robustness of skeleton data to human scale, illumination changes, dynamic camera views, and complex backgrounds, great progress has been made in skeleton‐based video anomaly detection in recent years. The spatio‐temporal graph convolutional network has been proven to be effective in modelling the spatio‐temporal dependencies of non‐Euclidean data such as human skeleton graphs, and the autoencoder based on this basic unit is widely used to model sequence features. However, due to the limitations of the convolution kernel, the model cannot capture the correlation between non‐adjacent joints, and it is difficult to deal with long‐term sequences, resulting in an insufficient understanding of behaviour. To address this issue, this paper applies the Transformer to the human skeleton and proposes the Spatio‐Temporal Enhanced Graph‐Transformer AutoEncoder (STEGT‐AE) to improve the capability of modelling. In addition, the multi‐memory model with skip connections is employed to provide different levels of coding features, thereby enhancing the ability of the model to distinguish similar heterogeneous behaviours. Furthermore, the STEGT‐AE has a single encoder‐double decoder architecture, which can improve the detection performance by the combining reconstruction and prediction error. The experimental results show that performances of STEGT‐AE is significantly better than other advanced algorithms on four baseline datasets. [ABSTRACT FROM AUTHOR]

This paper proposes a deep reinforcement learning algorithm to achieve complete coverage path planning for deep‐sea mining vehicle clusters. First, the mining vehicles and the deep‐sea mining environment are modeled. Then, this paper implements a series of algorithm designs and optimizations based on Deep Q Networks (DQN). The map fusion mechanism can integrate the grid matrix data from multiple mining vehicles to get the state matrix of the complete environment. In this paper, a preprocessing method for the state matrix is also designed to provide suitable training data for the neural network. The reward function and action selection mechanism of the algorithm are also optimized according to the requirements of cluster cooperative operation. Furthermore, the algorithm uses distance constraints to prevent the entanglement of underwater hoses. To improve the training efficiency of the neural network, the algorithm filters and extracts training samples for training through the sample quality score. Considering the requirement of cluster complete coverage mission, this paper introduces Long Short‐Term Memory (LSTM) based on the neural network to achieve a better training effect. After completing the above optimization and design, the algorithm proposed in this paper is verified through simulation experiments. [ABSTRACT FROM AUTHOR]

This paper deals with the orbit tracking and formation motion problems with optimal energies and reduced computational cost. First, the orbit tracking and formation motion are decomposed into movements in the normal and tangent directions of level orbits, respectively, and simultaneously, the optimal value functions in both directions are defined. Then, to reduce the computational cost, a switching threshold event‐triggered (STET) mechanism is designed. Based on the STET mechanism, the optimal value functions are constructed to evaluate the optimal energies of orbit tracking and formation motion. Critic neural networks are then designed to approximate the optimal value functions, which yield the optimal policies along the normal and tangent directions of desired orbits, that is, a so‐called switching threshold event‐triggered critic algorithm (STET‐C). Theoretical analysis of system convergence is given in detail. Finally, two comparison simulations are given. The former intends to verify the optimal energy of STET‐C compared to the feedback controllers. The latter shows that STET‐C significantly reduces the computational cost in contrast with the non‐triggered actor‐critic algorithm, non‐triggered critic algorithm, and the relative threshold event‐triggered critic algorithm. [ABSTRACT FROM AUTHOR]

At present, in order to conduct non‐destructive testing on the grounding grid of substations under the condition of continuous power supply and no excavation, researchers have applied wireless technology based on electrochemical methods to remotely monitor the corrosion state of grounding conductors online. Nevertheless, wireless signals are affected by the environment when they are transmitted underground. In the field of grounding gird wireless monitoring, how to plan the information transmission path of wireless sensor network (WSN) with high accuracy of data transfer and low energy consumption earns growing research attention. To address the problem of WSN path planning in grounding grid area, a path planning method for WSN based on the hybrid algorithm of map‐matching algorithm and double‐pole search algorithm (MM‐DPS) is proposed in this paper. The map‐matching algorithm is employed to calculate the optimal sampling node number of the data transmission path. On the basis of the optimal sampling node number, the double‐pole search algorithm is employed in seeking out each sensor node of the path, and two groups of path plans are obtained. In the simulation experiment, compared with the A‐star algorithm, the MM‐DPS algorithm shortens the data transmission path length by about 39% and reduces the energy consumption by about 57%. The research work brings a method to alleviate the problem of data transmission underground of WSN in grounding grid area. The method not only ensures the accuracy of data transmission, but also shorts the transmission distance and reduces energy consumption. [ABSTRACT FROM AUTHOR]

Aiming at the matter of poor precision in predicting the charge of lithium battery by applying conventional integer‐order models and offline parameter identification, this paper proposes a joint fractional‐order multi‐innovations unscented Kalman filter (FOUKF‐FOMIUKF) algorithm for predicting the cells' state of charge (SOC) online and uses the theory of singular‐value decomposition to tackle the issue of failure of the traceless transformation. Initially, the circuitry model of fractional order is built. The parameters of the model are recognized online by fractional‐order unscented Kalman filtering (FOUKF), and the obtained parameters are then transmitted to the method known as the fractional order multi‐innovations unscented Kalman filter (FOMIUKF) to calculate the SOC of the cell. The algorithm was validated under four working conditions such as FUDS (US Federal Urban Driving Distance), BJDST (Beijing Dynamic Stress Test), DST (Dynamic Stress Test), and US06 (Highway Driving Distance Test), respectively, and compared with the FOMIUKF, MIUKF, and FOUKF algorithms for offline identification. The conclusions demonstrate that the SOC estimated by the FOUKF‐FOMIUKF method is controlled within 0.5% of the mean absolute error under the four conditions and the root‐mean‐square error is controlled within 0.8%. It is not difficult to find that the FOUKF‐FOMIUKF algorithm estimates SOC with higher accuracy and robustness. [ABSTRACT FROM AUTHOR]

Accurately assessing the quality of millet is of paramount importance for its storage, processing, and consumption. In complex environments, rapidly and precisely identifying densely packed millet poses a significant challenge in the quality grading process. This paper introduces an improved version of the YOLOv7 lightweight detection algorithm. The key enhancement involves integrating the super lightweight target detection algorithm ESNet. ESNet optimizes the lightweight design of the neck by enhancing the backbone network, thereby strengthening the network's feature extraction capabilities. Furthermore, by combining Soft non‐maximum suppression (NMS) with the EIOU Loss function, the accuracy of detecting dense millet in occluded scenarios is further optimized. Various models were evaluated using the millet dataset in this study. During the testing phase, images containing densely packed millet were randomly selected to assess the effectiveness of the models. The test results demonstrate that, compared to lightweight network architectures such as LCNet, ShuffleNetV2, and MobileNetV3, the improved YOLOv7‐ESNet model achieves higher average accuracy, precision, recall, and comprehensive evaluation metrics in detection. Additionally, by combining the YOLOv7‐ESNet model with Soft‐EIoU NMS, an average accuracy of 93.19% and an average prediction time of 52.5 ms were achieved. These results meet the real‐time grading requirements for millet quality, establishing a robust technical foundation for millet quality grading. This paper overcomes the challenge of precise millet detection in complex scenarios, providing a valuable contribution to the field. [ABSTRACT FROM AUTHOR]

The paper reviews the evolution of Interactive Management, later referred to as Structured Democratic Dialogue, starting from the early 1970s up to this date. The authors propose a generational classification scheme consisting of five periods based primarily on whether some or all stages of the process were implemented synchronously or asynchronously and whether the participants' presence was physical, virtual or hybrid. Other aspects such as modifications in the steps of the process; the evolution of the software; domains of applications; file management; methods of collecting or recording contributions, votes, clarifications and preparation of reports; and key players are also considered and reported within the context of the primary scheme. The paper considers key advances achieved at each generational stage in terms of process or software, discusses associated challenges and concludes with a view towards the future of the emerging fifth generation. [ABSTRACT FROM AUTHOR]

Developing safety and efficiency applications for Connected and Automated Vehicles (CAVs) requires a great deal of testing and evaluation. The need for the operation of these systems in critical and dangerous situations makes the burden of their evaluation very costly, possibly dangerous, and time‐consuming. As an alternative, researchers attempt to study and evaluate their algorithms and designs using simulation platforms. Modeling the behavior of drivers or human operators in CAVs or other vehicles interacting with them is one of the main challenges of such simulations. While developing a perfect model for human behavior is a challenging task and an open problem, a significant augmentation of the current models used in simulators for driver behavior is presented. In this paper, a simulation framework for a hybrid transportation system is presented that includes both human‐driven and automated vehicles. In addition, the human driving task is decomposed and a modular approach is offered to simulate a large‐scale traffic scenario, allowing for a thorough investigation of automated and active safety systems. Such representation through Interconnected modules offers a human‐interpretable system that can be tuned to represent different classes of drivers. Additionally, a large driving dataset is analyzed to extract expressive parameters that would best describe different driving characteristics. Finally, a similarly dense traffic scenario is recreated within the simulator and a thorough analysis of various human‐specific and system‐specific factors is conducted, studying their effect on traffic network performance and safety. [ABSTRACT FROM AUTHOR]

The linear mixed‐effects model (LME) is a versatile approach to account for dependence among observations. Many large‐scale neuroimaging datasets with complex designs have increased the need for LME; however LME has seldom been used in whole‐brain imaging analyses due to its heavy computational requirements. In this paper, we introduce a fast and efficient mixed‐effects algorithm (FEMA) that makes whole‐brain vertex‐wise, voxel‐wise, and connectome‐wide LME analyses in large samples possible. We validate FEMA with extensive simulations, showing that the estimates of the fixed effects are equivalent to standard maximum likelihood estimates but obtained with orders of magnitude improvement in computational speed. We demonstrate the applicability of FEMA by studying the cross‐sectional and longitudinal effects of age on region‐of‐interest level and vertex‐wise cortical thickness, as well as connectome‐wide functional connectivity values derived from resting state functional MRI, using longitudinal imaging data from the Adolescent Brain Cognitive DevelopmentSM Study release 4.0. Our analyses reveal distinct spatial patterns for the annualized changes in vertex‐wise cortical thickness and connectome‐wide connectivity values in early adolescence, highlighting a critical time of brain maturation. The simulations and application to real data show that FEMA enables advanced investigation of the relationships between large numbers of neuroimaging metrics and variables of interest while considering complex study designs, including repeated measures and family structures, in a fast and efficient manner. The source code for FEMA is available via: https://github.com/cmig-research-group/cmig_tools/. [ABSTRACT FROM AUTHOR]

Due to the extensive host range of influenza A viruses, it is difficult to determine the best diagnostic algorithm to efficiently screen samples from a variety of host species for influenza A viruses. While there are some influenza diagnostic algorithms that are specific to host species, to our knowledge, no single algorithm exists for the characterization of influenza A viruses across multiple host species. In this paper, we propose an algorithm that can serve as a guide for screening human, animal, and environmental samples for influenza A viruses of high human and animal health importance. [ABSTRACT FROM AUTHOR]

Clustering is a technique used to partition a dataset into groups of similar elements. In addition to traditional clustering methods, clustering for probability density functions (CDF) has been studied to capture data uncertainty. In CDF, automatic clustering is a clever technique that can determine the number of clusters automatically. However, current automatic clustering algorithms update the new probability density function (pdf) fi(t)$$ {f}_i(t) $$ based on the weighted mean of all previous pdfs fj(t−1),j=1,2,...,N$$ {f}_j\left(t-1\right),j=1,2,\dots, N $$, resulting in slow convergence. This paper proposes an efficient automatic clustering algorithm for pdfs. In the proposed approach, the update of fi(t)$$ {f}_i(t) $$ is based on the weighted mean of f1(t),f2(t),...,fi−1(t),fi(t−1),fi+1(t−1),...,fN(t−1)$$ \left\{{f}_1(t),{f}_2(t),\dots, {f}_{i-1}(t),{f}_i\left(t-1\right),{f}_{i+1}\left(t-1\right),\dots, {f}_N\left(t-1\right)\right\} $$, where N$$ N $$ is the number of pdfs and i=1,2,...,N$$ i=1,2,\dots, N $$. This technique allows for the incorporation of recently updated pdfs, leading to faster convergence. This paper also pioneers the applications of certain CDF algorithms in the field of surface image recognition. The numerical examples demonstrate that the proposed method can result in a rapid convergence at some early iterations. It also outperforms other state‐of‐the‐art automatic clustering methods in terms of the Adjusted Rand Index and the Normalized Mutual Information. Additionally, the proposed algorithm proves to be competitive when clustering material images contaminated by noise. These results highlight the applicability of the proposed method in the problem of surface image recognition. [ABSTRACT FROM AUTHOR]

A major advance in global bathymetric observation occurred in 2018 with the launch of NASA's ICESat‐2 satellite, carrying a green‐wavelength, photon‐counting lidar, the Advanced Topographic Laser Altimeter System (ATLAS). Although bathymetric measurement was not initially a design goal for the mission, pre‐ and post‐launch studies revealed ATLAS's notable bathymetric mapping capability. ICESat‐2 bathymetry has been used to support a wide range of coastal and nearshore science objectives. However, analysis of ICESat‐2 bathymetry in numerous locations around the world revealed instances of missing or clipped bathymetry in areas where bathymetric measurement should be feasible. These missing data were due to the ATLAS receiver algorithms not being optimized for bathymetry capture. To address this, two updates have been made to ICESat‐2's receiver algorithm parameters with the goal of increasing the area for which ICESat‐2 can provide bathymetry. This paper details the parameter changes and presents the results of a two‐phased study designed to investigate ICESat‐2's bathymetry enhancements at both local and global scales. The results of both phases confirm that the new parameters achieved the intended goal of increasing the amount of bathymetry provided by ICESat‐2. The site‐specific phase demonstrates the ability to fill critical bathymetric data gaps in open ocean and coastal settings. The global analysis shows that the area of potential bathymetry approximately doubled, with 6.1 million km2 of new area in which bathymetric measurements may be feasible. These enhancements are anticipated to facilitate a range of science objectives and close the gap between ICESat‐2 bathymetry and offshore sonar data. Key Points: Recent updates to ICESat‐2's receiver algorithm parameters have boosted the bathymetric measurement capabilitiesThe new updates allow ICESat‐2 to consistently measure bathymetry up to 41 m deepThe updates allow ICESat‐2 to potentially measure over 6.1 million km2 of new bathymetry in both coastal and ocean settings [ABSTRACT FROM AUTHOR]

The D50 CIELAB gamut volume was standardized as a suitable and unified gamut size measurement methodology. The color gamut volume is visualized using proportionate gamut rings in a two‐dimensional diagram. Gamut ring intersection assists the visual comparison of the size and shape of the color gamut coverage between a display and a reference. This paper introduces a desktop application with an intuitive graphical interface for visualizing the gamut rings and describes the algorithm of the gamut ring intersection. [ABSTRACT FROM AUTHOR]

This paper addresses the resource allocation (RA) for ultra‐dense network (UDN), where base stations (BSs) are densely deployed to meet the demands of future wireless communications. However, the design of RA in UDN is challenging, as the RA problem is non‐convex and NP‐hard. Therefore, this paper considers and studies a semi‐distributed resource block (RB) allocation scheme, in order to achieve a well‐balanced trade‐off between performance and complexity. In the context of semi‐distributed RB allocation scheme, the problem can be decomposed into the subproblem of clustering and the subproblem of cluster‐based RB allocation. We first improve the K‐means clustering algorithm by employing the Gaussian modified method, which can significantly decrease the number of iterations for carrying out the K‐means algorithm as well as the failure possibility of clustering. Then, bat algorithm (BA) is introduced to attack the problem of cluster‐based RB allocation. In order to make the original BA applicable to the problem of RB allocation, chaotic sequences are adopted to discretize the initial position of the bats, and simultaneously increase the population diversity of the bats. Furthermore, in order to speed up the convergence of BA, the logarithmic decreasing inertia weight is employed for improving the original BA. Our studies and performance results show that the proposed approaches are capable of achieving a desirable trade‐off between the performance and the implementation complexity. [ABSTRACT FROM AUTHOR]

Local dimming LCDs with a matrix backlight unit (BLU) are favored by many car manufacturers for high quality and low power displays. Automotive application sets high requirement like safety standard, whereas the temperature range and lifespan are wide. The contents are mostly HMIs with high contrast and circular structures. Thus, the two key components, BLU and the local dimming algorithm need to be adopted to automotive needs/demands and shall be jointly optimized. In this paper, the BLU design aspects and specification are described. Specific features relevant for automotive, like black corners and containment against LED outage, are introduced. The tradeoff between performance and cost is lifted. With a BLU with 384 LEDs, the contrast ratio may be enhanced by a factor of 20, while an average power saving ratio of 50% can be achieved. [ABSTRACT FROM AUTHOR]

This study conducts a bibliometric analysis and systematic review of cryptocurrency trading algorithms to identify existing gaps in the area. From our standpoint, this is the first study to carry out a deep analysis of price forecasts and portfolio management in cryptocurrencies in addition to analyzing the most relevant studies and authors, trend topics of the area, and identifying countries with the most published studies. During our research, we identified some gaps that can be used for further research. Currently, there are approximately 16,000 cryptocurrencies; however, in majority of the papers, the authors have only used the top 10 ranking market capitalization cryptocurrencies, leaving aside potential minor cryptocurrencies. Thus, trading strategies using Big Data can be a potential research topic, considering the greater number of emerging cryptocurrencies. [ABSTRACT FROM AUTHOR]

Visual SLAM algorithms can obtain a large amount of texture information from the environment and usually perform very well in static scenes, but there are a large number of irregular dynamic points when running in dynamic scenes, which can lead to increased error in SLAM feature point matching and loss of tracking localization. To address this challenge this paper proposes a SLAM system (YVG‐SLAM) that adapts to dynamic scenes. YVG‐SLAM is an improvement on the ORB‐SLAM3 algorithm, integrating the view geometry algorithm and the current powerful YOLOv5 algorithm, while proposing a dynamic feature removal strategy without a priori assumptions to reduce the influence of dynamic targets. In this paper, we first lighten the YOLOv5 algorithm, then process the image frame to get the bounding box, then use the view geometry algorithm to determine the dynamic feature points on the image frame, and finally remove the moving objects in the image frame according to the dynamic feature recognition strategy proposed in this paper. The performance of the algorithm is tested on the TUM RGB‐D and BONN RGB‐D datasets. The experimental results show that the robustness of the proposed algorithm on most video sequences is better than the existing SLAM algorithms dealing with dynamic scenes such as Detect‐SLAM and DynaSLAM, and the RMSE index of the absolute trajectory error measured on high‐speed dynamic video sequences can be significantly reduced by more than 93% compared to ORB‐SLAM3. © 2024 Institute of Electrical Engineer of Japan and Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

Like information science more broadly, search engine research has largely been fragmented into two factions: system‐oriented and user‐oriented studies. This limits our capacity for answering some fundamental questions surrounding an integral—often invisible—part of modern life. Given the "search‐ification" of this life, given an oligopolous global market and an information‐wealthy but attention‐poor audience, methods capable of studying search engines, as well as their relationship with users and society are increasingly necessary. This paper proposes critical discourse analysis (CDA) as an effectual, oft‐overlooked method for search engine research, one capable of interrogating both search engines and their use. The paper outlines CDA, provides examples of its application, and highlights its capacity for progressing our critical understanding of search engines. This developing understanding, evidenced by a review of the literature, suggests that challenges brought by search cannot be resolved by critiquing the power of systems alone. Rather, a reclaiming of today's information infrastructure requires we also illuminate the socio‐political environments of search systems, and the metacognitive, invisible processes pivotal to our communication with them. While power‐analyses of search continue, and some have begun to employ CDA, little recognition exists of this theoretical perspective's capacity for supporting both system‐oriented and user‐oriented studies. [ABSTRACT FROM AUTHOR]

The advancements in computing and storage capabilities of machines and their fusion with new technologies like the Internet of Thing (IoT), 5G networks, and artificial intelligence, to name a few, has resulted in a paradigm shift in the way computing is done in a cloud environment. In addition, the ever‐increasing user demand for cloud services and resources has resulted in cloud service providers (CSPs) expanding the scale of their data center facilities. This has increased energy consumption leading to more carbon dioxide emission levels. Hence, it becomes all the more important to design scheduling algorithms that optimize the use of cloud resources with minimum energy consumption. This paper surveys state‐of‐the‐art algorithms for scheduling workflow tasks to cloud resources with a focus on reducing energy consumption. For this, we categorize different workflow scheduling algorithms based on the scheduling approaches used and provide an analytical discussion of the algorithms covered in the paper. Further, we provide a detailed classification of different energy‐efficient strategies used by CSPs for energy saving in data centers. Finally, we describe some of the popular real‐world workflow applications as well as highlight important emerging trends and open issues in cloud computing for future research directions. [ABSTRACT FROM AUTHOR]

To improve the performance of real‐time systems, heterogeneous asymmetric multiprocessors are proposed. Heterogeneous asymmetric multiprocessor architecture allows the system to better match computational resources to meet the needs and dynamic workload of each application. The benefits of system performance and reduced power consumption cannot be fully exploited unless proper task scheduling and task allocation methods are implemented at the operating system level.The EDZL scheduling algorithm has been shown to be a better scheduling algorithm in heterogeneous multiprocessor platforms. In this paper, the BSF‐EDZL (best speed fit for earliest deadline first until zero‐laxity) performance asymmetric multiprocessor scheduling algorithm is proposed, and an effective schedulability analysis is performed. The algorithm selects an appropriate processor for non‐zero relaxation highest priority task rather than the fastest processor when assigning tasks. Experimental results show that the proposed BSF‐EDZL scheduling algorithm can schedule a larger set of tasks than the ordinary EDZL scheduling algorithm. [ABSTRACT FROM AUTHOR]

Imbalanced image datasets consist of image datasets where there is a significant disparity in the number of samples across different classes. With imbalanced image datasets, learning algorithms often tend to be biased toward the majority class samples. This leads to poor classification of minority class samples as their training is not properly conducted. It becomes more complicated when the number of samples in the minority class is very low. In this paper, a novel hierarchical algorithm is proposed for generating new data using Capsule Generative Adversarial Networks (CapsGAN) to address the class imbalance problem in imbalanced image datasets. Unlike common GAN models, the proposed method incorporates an auxiliary CapsNet to identify high‐value images in both minority and majority classes. This identification is based on the ability to detect complex relationships between low‐level and high‐level features present in capsule networks. Furthermore, the proposed CapsGAN model is conditioned to generate minority class samples based on feature vectors of last capsule layer to achieve a more balanced image dataset. For evaluating the performance of the proposed model, an image dataset called CICS was collected and introduced. Extensive experiments were also conducted using various online image datasets from different domains, with varying numbers of classes and data sizes. The experimental results demonstrated that the proposed model can generate high‐quality samples in cases where the image dataset or the number of minority class samples is relatively small. Furthermore, the proposed model has maintained an accuracy of over 80% in an imbalanced ratio of 1:60. [ABSTRACT FROM AUTHOR]

The traditional infrared inspection of substations is usually done by employees with handheld infrared equipment, but the traditional inspection efficiency is not high, and some of the inspection locations have harsh environments, high voltage levels, and high‐risk factors. Given the above problems, this paper proposes an improved defect detection algorithm for substations based on YOLO v7 to solve the difficult problem of infrared inspection of substations. First, the lighter SE‐GhostNetV2 feature extraction network is designed to reduce the computation volume; second, the de‐weighted BIFPN structure is designed for the substation infrared image features to improve the ability of information interaction; finally, the new C‐NWD Loss is proposed to realize the detection of smaller substation equipment and reducing missed detections. The experimental results show that the hybrid accuracy of the algorithm designed in this paper is improved from 92.1% to 96.6%, the model parameters are reduced by 40.1%, the computation amount is reduced by 65%, the detection speed is improved by 87 FPS, and the false detection and missed detections is less, which can achieve real‐time infrared inspection of substations and solve the difficulties existing in traditional substation infrared detection. [ABSTRACT FROM AUTHOR]

Summary: The enormous growth of mobile broadband traffic is a catalyst for expanding terrestrial communication systems and their integration with satellite communication systems. This results in sharing frequencies allocated to satellite communication systems with terrestrial systems. As this can lead to interference between the incumbent and the upcoming service, coexistence studies are conducted. In the case of sharing satellite uplink frequencies with terrestrial communication systems, interference from base stations (BSs) is dominant. While there are methods to estimate the number of BSs that may be deployed, it is unclear where the BSs will be located. The BS locations play a pivotal role in interference calculation, as the values of link budget parameters are highly dependent on the longitude and latitude of interfering transmitters. This article presents an intelligent method which balances network capacity and coverage for simulating base stations (BSs) in coexistence studies. A realistic BS distribution is generated using weighted K‐means clustering (WKMC) algorithm and incorporating population density along with Haversine distance. The paper provides a case study of co‐frequency, co‐coverage interference in the satellite uplink in the C‐band to demonstrate the impact of BS distribution on the results of coexistence studies. This paper will find applications in upcoming frequency sharing and coexistence studies and the design of integrated satellite‐terrestrial communication networks. [ABSTRACT FROM AUTHOR]

Summary: This paper proposes leaky least mean fourth (LLMF) algorithm for the control of five‐level series connected H‐bridge multilevel inverter (5L SCHB‐MLI). The SCHB multilevel inverter is a popular configuration due to its wide application for high‐power and medium‐voltage applications. The complete system comprising the grid, load, and compensator is modeled in MATLAB/SIMULINK. Prototype hardware is also developed in the laboratory for experimental validation. The 5L SCHB inverter is connected in a single‐phase power distribution system and controlled as a compensator. The voltage across both DC links of the H‐bridges is regulated to almost equal value by the proposed control algorithm. The closed loop system is designed to mitigate total harmonic distortion (THD) in the source current and improve the power quality of the proposed system. The system is analyzed under the steady state and dynamic state, and the results are also verified on the hardware prototype developed in the laboratory. The proposed algorithm is also compared with conventional least means square (LMS) algorithm and notch filter algorithm on several parameters. The paper discusses a detailed simulation and hardware analysis on the control of five‐level MLI topology. [ABSTRACT FROM AUTHOR]

Aim: This article aimed to explore the role of AI in advancing nursing practice, focusing on its impact on readiness for the future. Design and Methods: A position paper, the methodology comprises three key steps. First, a comprehensive literature search using specific keywords in reputable databases was conducted to gather current information on AI in nursing. Second, data extraction and synthesis from selected articles were performed. Finally, a thematic analysis identifies recurring themes to provide insights into AI's impact on future nursing practice. Results: The findings highlight the transformative role of AI in advancing nursing practice and preparing nurses for the future, including enhancing nursing practice with AI, preparing nurses for the future (AI education and training) and associated, ethical considerations and challenges. AI‐enabled robotics and telehealth solutions expand the reach of nursing care, improving accessibility of healthcare services and remote monitoring capabilities of patients' health conditions. [ABSTRACT FROM AUTHOR]

Image restoration with impulse noise is an important task in image processing. Taking into account the statistical distribution of impulse noise, the ℓ1‐norm data fidelity and total variation (ℓ1TV$\ell _1TV$) model has been widely used in this area. However, the ℓ1TV$\ell _1TV$ model usually performs worse when the noise level is high. To overcome this drawback, several nonconvex models have been proposed. In this paper, an efficient iterative algorithm is proposed to solve nonconvex models arising in impulse noise. Compared to existing algorithms, the proposed algorithm is a completely explicit algorithm in which every subproblem has a closed‐form solution. The key idea is to transform the original nonconvex models into an equivalent constrained minimization problem with two separable objective functions, where one is differentiable but nonconvex. As a consequence, the proximal linearized alternating direction method of multipliers is employed to solve it. Extensive numerical experiments are presented to demonstrate the efficiency and effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper deals with parameter estimation problem of large‐scale systems. A recursive distributed parameter estimation algorithm, based on the minimization of the prediction estimation error method, is developed. Specifically, the class of large‐scale systems that are composed of several interconnected sub‐systems is considered. Each interconnected sub‐system is modelled by a linear discrete‐time state space mathematical model with unknown parameters. The convergence analysis is then achieved using the Lyapunov approach. The theoretical analysis and simulation results prove the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a consensus based fully distributed optimization algorithm is proposed for solving economic dispatch problem (EDP) in smart grid. Since the incremental cost of all buses reach consensus when the optimal solution is achieved, it is selected as a consensus variable. An additional variable at each bus, called "surplus" is added to record the local power mismatch, which is used as a feedback variable to purse the balance between power supply and demand. Different from most of the existing distributed methods which require the communication network to be balanced, the algorithm uses a row random matrix and a column random matrix to precisely steer all the agents to asymptotically converge to a global optimal solution over a time‐varying directed communication network. Due to the use of a fixed step size, the proposed algorithm also outperforms other algorithms in terms of convergence speed. The graph and eigenvalue perturbation theories are employed for the algorithm convergence analysis, and the upper bound of the parameters required for convergence is given theoretically. Finally, the performance and scalability of the proposed distributed algorithm are verified by several case studies conducted on the IEEE 14‐bus power system and a 200‐node test system. [ABSTRACT FROM AUTHOR]

The paper proposes the method of uniform flow loading the improved consensus algorithm to achieve obstacle avoidance for multi‐UAV with 3‐D formation. In view of that the flow function is generally only applicable to two dimensional flow field, dimension reduction is to treat multi‐UAV formation as each UAV flows around along the circular surface of the projected cylinder of spherical obstacle at its different heights. To formation guaranteeing the smooth realization of obstacle avoidance of multi‐UAV formation centered on the leader, it is used the tactics of virtually expanding the radius of these static or moving equivalent cylindrical obstacles to reserve a certain space. The innovation of this strategy is to further reduce the possibility of collision between UAV formation and the edge of obstacles, meanwhile the problem of multi‐UAV formation avoiding obstacles is transformed into the problem of collision avoidance navigation for the leader treated as a particle. It is considered collision avoidance for multi‐UAV formation under three scenarios assumed are the most common situations, and the simulation experimental results of these scenarios are demonstrated on the validity of the designed experiments based on these algorithms. [ABSTRACT FROM AUTHOR]

In a series of papers, it has been developing last‐passage algorithms such as last‐passage algorithm and off‐centered last‐passage algorithm on a flat conducting surface, quadrupole last‐passage algorithm on an L‐shaped conducting surface and so on, held at (non)constant potentials. In this paper, it further develops the last‐passage algorithms on the Fichera‐corner (cubic trihedral) conducting flat surface. To demonstrate the algorithm, it computes charge densities on the Fichera‐corner conducting surface in 3D space and finds that the results agree very well with the ones from the Given‐Hwang's original last‐passage algorithm on a flat surface. Compared with the Given‐Hwang's last‐passage algorithm, the octupole last‐passage one is very suitable for computing charge density near the corner of the Fichera‐corner conducting surface. [ABSTRACT FROM AUTHOR]

Line coverage is the task of servicing a given set of one‐dimensional features in an environment. It is important for the inspection of linear infrastructure such as road networks, power lines, and oil and gas pipelines. This paper addresses the single robot line coverage problem for aerial and ground robots by modeling it as an optimization problem on a graph. The problem belongs to the broad class of arc routing problems and is closely related to the rural postman problem (RPP) on asymmetric graphs. The paper presents an integer linear programming formulation with proofs of correctness. Using the minimum cost flow problem, we develop approximation algorithms with guarantees on the solution quality. These guarantees also improve the existing results for the asymmetric RPP. The main algorithm partitions the problem into three cases based on the structure of the required graph, that is, the graph induced by the features that require servicing. We evaluate our algorithms on road networks from the 50 most populous cities in the world, consisting of up to 730 road segments. The algorithms, augmented with improvement heuristics, run within 3 s and generate solutions that are within 10% of the optimum. We experimentally demonstrate our algorithms with commercial UAVs on the UNC Charlotte campus road network. [ABSTRACT FROM AUTHOR]

Summary: Heuristic algorithms are widely used to solve multi‐objective test case prioritization (MOTCP) problems. However, they perform differently for different test scenarios, which conducts difficulty in applying a suitable algorithm for new test requests in the industry. A concrete hyper‐heuristic framework for MOTCP (HH‐MOTCP) is proposed for addressing this problem. It mainly has two parts: low‐level encapsulating various algorithms and hyper‐level including an evaluation and selection mechanism that dynamically selects low‐level algorithms. This framework performs good but still difficult to keep in the best three. If the evaluation mechanism can more accurately analyse the current results, it will help the selection strategy to find more conducive algorithms for evolution. Meanwhile, if the selection strategy can find a more suitable algorithm for the next generation, the performance of the HH‐MOTCP framework will be better. In this paper, we first propose new strategies for evaluating the current generation results, then perform an extensive study on the selection strategies which decide the heuristic algorithm for the next generation. Experimental results show that the new evaluation and selection strategies proposed in this paper can make the HH‐MOTCP framework more effective and efficient, which makes it almost the best two except for one test object and ahead in about 40% of all test objects. [ABSTRACT FROM AUTHOR]

Despite the fact that machine learning (ML) algorithms to construct predictive models for pressure injury development are widely reported, the performance of the model remains unknown. The goal of the review was to systematically appraise the performance of ML models in predicting pressure injury. PubMed, Embase, Cochrane Library, Web of Science, CINAHL, Grey literature and other databases were systematically searched. Original journal papers were included which met the inclusion criteria. The methodological quality was assessed independently by two reviewers using the Prediction Model Risk of Bias Assessment Tool (PROBAST). Meta‐analysis was performed with Metadisc software, with the area under the receiver operating characteristic curve, sensitivity and specificity as effect measures. Chi‐squared and I2 tests were used to assess the heterogeneity. A total of 18 studies were included for the narrative review, and 14 of them were eligible for meta‐analysis. The models achieved excellent pooled AUC of 0.94, sensitivity of 0.79 (95% CI [0.78–0.80]) and specificity of 0.87 (95% CI [0.88–0.87]). Meta‐regressions did not provide evidence that model performance varied by data or model types. The present findings indicate that ML models show an outstanding performance in predicting pressure injury. However, good‐quality studies should be conducted to verify our results and confirm the clinical value of ML in pressure injury development. [ABSTRACT FROM AUTHOR]

Nonstationary Gabor (NSG) frames for L2(ℝ)$$ {L}^2\left(\mathrm{\mathbb{R}}\right) $$ allow for flexible sampling and varying window functions and have found applications in adaptive signal analysis. Recently, the first author of this paper generalized the notion of NSG frames for L2(ℝ)$$ {L}^2\left(\mathrm{\mathbb{R}}\right) $$ to the space L2(ℝ,ℂK)$$ {L}^2\left(\mathrm{\mathbb{R}},{\mathrm{\mathbb{C}}}^K\right) $$ of vector‐valued signals and investigated the existence of vector‐valued NSG (VVNSG) frames. In this paper, we consider the reconstruction of any functions in L2(ℝ,ℂK)$$ {L}^2\left(\mathrm{\mathbb{R}},{\mathrm{\mathbb{C}}}^K\right) $$ from coefficients obtained from VVNSG frames. We provide different approximately dual frames of VVNSG frames and give the corresponding reconstruction error bounds. In particular, for a special class of VVNSG frames that are related to painless VVNSG frames, we show that the approximately dual frames carry the VVNSG structure, which is very important since there exist fast analysis and reconstruction algorithms for VVNSG frames. We also provide a method to construct the special class of VVNSG Bessel sequences. Finally, a constructive example is given to illustrate the theoretical results. [ABSTRACT FROM AUTHOR]

The study of how children learn numbers has yielded one of the most productive research programs in cognitive development, spanning empirical and computational methods, as well as nativist and empiricist philosophies. This paper provides a tutorial on how to think computationally about learning models in a domain like number, where learners take finite data and go far beyond what they directly observe or perceive. To illustrate, this paper then outlines a model which acquires a counting procedure using observations of sets and words, extending the proposal of Piantadosi et al. (2012). This new version of the model responds to several critiques of the original work and outlines an approach which is likely appropriate for acquiring further aspects of mathematics. [ABSTRACT FROM AUTHOR]

The goal of this paper is to characterize function distributions that general neural networks trained by descent algorithms (GD/SGD), can or cannot learn in polytime. The results are: (1) The paradigm of general neural networks trained by SGD is poly‐time universal: any function distribution that can be learned from samples in polytime can also be learned by a poly‐size neural net trained by SGD with polynomial parameters. In particular, this can be achieved despite polynomial noise on the gradients, implying a separation result between SGD‐based deep learning and statistical query algorithms, as the latter are not comparably universal due to cases like parities. This also shows that deep learning does not suffer from the limitations of shallow networks. (2) The paper further gives a lower‐bound on the generalization error of descent algorithms, which relies on two quantities: the cross‐predictability, an average‐case quantity related to the statistical dimension, and the null‐flow, a quantity specific to descent algorithms. The lower‐bound implies in particular that for functions of low enough cross‐predictability, the above robust universality breaks down once the gradients are averaged over too many samples (as in perfect GD) rather than fewer (as in SGD). (3) Finally, it is shown that if larger amounts of noise are added on the initialization and on the gradients, then SGD is no longer comparably universal due again to distributions having low enough cross‐predictability. [ABSTRACT FROM AUTHOR]

Fractional‐order calculus has broad application scenarios in engineering and physics. Unlike integer‐order calculus, fractional‐order calculus has the ability to analyze nonclassical phenomena in science and engineering. For industrial processes with strong nonlinear characteristics, nonlinear models such as the Wiener model have become research hotspots. This paper studies the parameter identification of the fractional‐order Wiener system. In this paper, the forgetting factor extended stochastic gradient (FF‐ESG) algorithm and the gradient iterative (GI) algorithm are proposed to identify the parameters of the fractional‐order Wiener system. Then, the convergence of the FF‐ESG algorithm for the fractional‐order Wiener system is analyzed. Both proposed algorithms can obtain exact parameter estimates, which are verified by a numerical example and a case study of a fluid control valve. [ABSTRACT FROM AUTHOR]

A full‐panel circuit model of the on‐cell touch AMOLED is introduced to simulate the mutual interference between touch and display operations. The proposed panel model successfully reproduced nonlinear behaviors of the display noise observed in real systems. Also, the reverse‐directional interference, i.e., touch‐to‐display coupling, was simulated, showing that touch stimulation incurs the fluctuation of display charging voltages, possibly causing perceivable line defects. The proposed panel model can be used for various touch/display algorithms to reduce the interference effects and to determine key design parameters for new panels. [ABSTRACT FROM AUTHOR]

This paper proposes a multitasking Demura algorithm based on backlight modulation and liquid crystal voltage adjustment that significantly increase the luminance uniformity and improves the details of high gray image without saturation issues. The multitasking Demura benefit was experimentally validated in a 55‐inch splicing module display, and the experimental results show that the multitasking Demura can eliminate severe mura, increasing the module's luminance uniformity from 34%, 60% and 88% to 83%, 95% and 98% at L25, L128 and L240 gray levels. [ABSTRACT FROM AUTHOR]

High resolution and high refresh rate increase the pressure of wide transmission. Usually, video compression is used to solve this problem. However, traditional video compression methods cannot be performed in bit‐plane, which will increase the cost of storage area. For this reason, this paper first introduces a bit just noticeable difference (BJND) model based on bit‐plane. By analyzing the relationship between the bit‐plane, frequency and eccentricity, the bit just noticeable difference threshold of viewpoint is calculated. Finally, the just noticeable difference model applied to bit‐plane is obtained. Then this paper proposes a video compression scheme based on bit motion estimation algorithm, which optimizes the search range of motion estimation into two small rhombuses of time dimension and gray‐scale dimension. According to human visual system and probability statistical analysis, supplementary matching blocks are added to replace residual data, so that the compression ratio will be constant. The experimental results show that the proposed scheme has the best comprehensive effect on the compression of the lower five‐bit plane. The compression ratio is 1.385, the data transmission is constant, and there is no obvious difference between the restored image and the original image, which conforms to the intuitive perception of the human eye. [ABSTRACT FROM AUTHOR]