PBD-YOLO: Dual-Strategy Integration of Multi-Scale Feature Fusion and Weak Texture Enhancement for Lightweight Particleboard Surface Defect Detection by Haomeng Guo, Zheming Chai, Huize Dai, Lei Yan, Pengle Cheng, Jianhua Yang

“…In order to improve the ability of the algorithm to extract weak texture features, the SPDDEConv (Space to Depth and Difference Enhance Convolution) module was introduced in this study, which reduced the loss of information in the down-sampling process through space-to-depth transformation and enhanced the edge information of weak texture defects through difference convolution. …”
Get full text

A fish counting model based on pyramid vision transformer with multi-scale feature enhancement by Jiaming Xin, Yiying Wang, Dashe Li, Zhongliang Xiang

“…Subsequently, a spatial domain multi-scale edge enhancement module is introduced to enhance the detection of fish edge features. …”
Get full text

Effects of Leaf Trait Variability on PM Retention: A Systematic Review by Wenkai Xue, Yongjun Lin, Zhengqi Sun, Yuchong Long, Dele Chen, Shan Yin

“…Numerous studies have been conducted to explore the process and mechanism of atmospheric PM retention by plant leaves in the past. …”
Get full text

Compressing Neural Networks on Limited Computing Resources by Seunghyun Lee, Dongjun Lee, Minju Hyun, Heeje Kim, Byung Cheol Song

“…Network compression is a crucial technique for applying deep learning models to edge or mobile devices. However, the cost of achieving higher benchmark performance through compression is continuously increasing, making network compression a significant burden—especially for small industries focused on developing compact models. …”
Get full text

Grinding power model for flute grinding of solid tools based on equivalent chip thickness by Lei REN, Jiangtao PAN, Daohui XIANG, Junjin MA, Xiaobin CUI

“…The grinding power can be precisely controlled by adjusting grinding parameters with this model, and the maximum equivalent chip thickness and the maximum grinding power per unit width exist at the edge of the grinding wheel during the grinding process of the chute, which will lead to non-uniform wear in the direction of the width of the grinding wheel.…”
Get full text

Unveiling CNS cell morphology with deep learning: A gateway to anti-inflammatory compound screening. by Hyunseok Bahng, Jung-Pyo Oh, Sungjin Lee, Jaehong Yu, Jongju Bae, Eun Jung Kim, Sang-Hun Bae, Ji-Hyun Lee

“…This innovative method enhances our understanding of neuroinflammation and streamlines the process for screening potential therapeutic compounds, bridging a gap in neuropathological research and pharmaceutical development.…”
Get full text

BHGNN-RT: Capturing bidirectionality and network heterogeneity in graphs. by Xiyang Sun, Fumiyasu Komaki

“…In this study, we proposed a novel embedding method, a bidirectional heterogeneous graph neural network with random teleport (BHGNN-RT) that leverages the bidirectional message-passing process and network heterogeneity, for directed heterogeneous graphs. …”
Get full text

Survivor optimizer: A competitive strategy for enhanced search efficiency by Arif Yelği

“…We suggest the Survivor Algorithm, a cutting-edge method that improves search robustness and efficiency, to address this. …”
Get full text

Embedded Artificial Intelligence for IoT Applications Using the MAX78000 by Martina Balbi, Lance Doherty, Thomas Watteyne

“…Recent advances in embedded AI and IoT have revolutionized the development of intelligent edge devices. This work provides a tutorial on developing and deploying AI models on the MAX78000, a low-power microcontroller designed specifically for AI applications. …”
Get full text

CRACK GROWTH SIMULATION BASED ON ABAQUS SECONDARY EVELOPMENT by ZHANG WenDong, FAN JunLing, CHEN Li, LV YuanBo

“…Compared to the exact results, this method can effectively simulate the process of crack propagation. The propagation of multiple cracks was simulated at the same time. …”
Get full text

Strategies for Reducing Purine Accumulation in Beer: From Metabolic Mechanisms to Brewing Technology Innovations by Jun Liu, Jian Lu

“…By integrating multidisciplinary approaches ranging from synthetic biology to process optimization, this work provides a roadmap for developing commercially viable low-purine beers, bridging the gap between public health priorities and brewing industry innovation.…”
Get full text

Active Compliance Control System for Intelligent Inspection Robot in Power Room by Ning Guan, Pei Zhang

“…The experimental results show that the ineffective fluctuation range of torque of each joint is the smallest when the inspection robot is disturbed by obstacles in the process of executing signal change instructions, and the average fluctuation range of robot limbs is 0.65%. …”
Get full text

Diffraction correction of frequency response for loudspeaker in rectangular baffle by A. Dobrucki

“…The conclusions can be useful for design process of the baffles.…”
Get full text

Unveiling kink band formation mechanism in MAX phases by Rana Hossain, Shigenobu Ogata

“…However, understanding of the kink banding process remains limited and often contradictory, hindering advances in controlling this unique mode of plastic deformation. …”
Get full text

Remote Sensing Applications in Ocean Observation (Second Edition) by Chung-Ru Ho

“…The articles presented in this Special Issue epitomize the convergence of cutting-edge sensor technologies, innovative data processing techniques, and advanced algorithmic approaches in ocean remote sensing. …”
Get full text

Design of nodes importance assessment method for complex network based on neighborhood information by Xing LI, Jie ZHAN, Baoquan REN, Siqi ZHU

“…Accurate identification of influential nodes in complex networks is crucial for network management and network security.The local centrality method is concise and easy to use, but ignores the topological relationship between neighboring nodes and cannot provide globally optimal results.A node importance assessment method was proposed to correlate the node edge relationship and topology, which firstly applied the H-index and information entropy to assess the nodes, then combined the structural holes of the nodes with the structural characteristics of the nodes, and took into account the attribute of “bridging” while focusing on the node’s own quality and the amount of information about the neighboring nodes.The algorithm was validated by simulating the propagation process using the SIR model, and the Kendall correlation coefficient, complementary cumulative distribution function and propagation influence were applied to validate the validity and applicability of the method.Comparison of the experimental results on six real network datasets shows that the proposed method is more accurate than the traditional centrality methods in identifying and ordering the key nodes in the network.…”
Get full text

Finite element analysis of mechanical impacts in large imaging detectors by Ma Li, Li Weibo, Zhang Hengwen, Wang Chunqiu

“…These analyses offer valuable insights for optimizing the detector's structural design and mitigating potential weaknesses during the manufacturing process.…”
Get full text

Sustainable Development Requires an Integrated Design Discipline to Address Unique Problems by Rui Helder Dos Santos Martins

“…A futuresecond paper will draw on the behaviour of non-linear, complex adaptive systemsas self-organising emergence at the edge of chaos and re-interpret the designthinking process in a way which encompasses the intuitive, non-linear andqualitative way in which sustainable development problems need to be addressed.   …”
Get full text

Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation by Qing ZHU, Le-nan WU, Yong-biao YANG, Jie LI, Shi-ming XU

“…Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 basic graph structures were defined to realize recursive calculate in the implementation process.Compared with previous works,the algorithm provided many methods for counting the same length of cycles.The same result confirmed the correctness of the algorithm.The new algorithm could not only calculate the total number of cycles,but also gave the number each edge participating in fixed-length cycles.Its complexity was proportional to the product of D and square of N,where D was the average degree of variable nodes,and N denoted the code length.For LDPC codes,D was far less than N.For most of the LDPC codes,the calculation for numbers of cycle-length g、g+2、g+4 was only several seconds.…”
Get full text

Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation by Qing ZHU, Le-nan WU, Yong-biao YANG, Jie LI, Shi-ming XU

“…Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 basic graph structures were defined to realize recursive calculate in the implementation process.Compared with previous works,the algorithm provided many methods for counting the same length of cycles.The same result confirmed the correctness of the algorithm.The new algorithm could not only calculate the total number of cycles,but also gave the number each edge participating in fixed-length cycles.Its complexity was proportional to the product of D and square of N,where D was the average degree of variable nodes,and N denoted the code length.For LDPC codes,D was far less than N.For most of the LDPC codes,the calculation for numbers of cycle-length g、g+2、g+4 was only several seconds.…”
Get full text