Optimal PID Tuning of PLL for PV Inverter Based on Aquila Optimizer

Phase-locked loop (PLL) is a fundamental and crucial component of a photovoltaic (PV) connected inverter, which plays a significant role in high-quality grid connection by fast and precise phase detection and lock. Several novel critical structure improvements and proportional-integral (PI) parameter optimization techniques of PLL were proposed to reduce shock current and promote the quality of grid connection at present. However, the present techniques ignored the differential element of PLL and did not acquire ideal results. Thus, this paper adopts Aquila optimizer algorithm to regulate the proportional-integral-differential (PID) parameters of PLL for smoothing power fluctuation and improving grid connection quality. Three regulation strategies (i.e., PLL regulation, global regulation, and step regulation) are carefully designed to systematically and comprehensively evaluate the performance of the proposed method based on a simulation model in MATLAB/Simulink, namely, “250-kW Grid-Connected PV Array”. Simulation results indicate that PLL regulation strategy can effectively decrease power fluctuation and overshoot with a short response time, low complexity, and time cost. Particularly, the Error(P) and the maximum deviation of output power under optimal parameters obtained by PLL strategy are decreased by 418 W and 12.5 kW compared with those under initial parameters, respectively.

Context-bounded verification of thread pools

Thread pooling is a common programming idiom in which a fixed set of worker threads are maintained to execute tasks concurrently. The workers repeatedly pick tasks and execute them to completion. Each task is sequential, with possibly recursive code, and tasks communicate over shared memory. Executing a task can lead to more new tasks being spawned. We consider the safety verification problem for thread-pooled programs. We parameterize the problem with two parameters: the size of the thread pool as well as the number of context switches for each task. The size of the thread pool determines the number of workers running concurrently. The number of context switches determines how many times a worker can be swapped out while executing a single task---like many verification problems for multithreaded recursive programs, the context bounding is important for decidability. We show that the safety verification problem for thread-pooled, context-bounded, Boolean programs is EXPSPACE-complete, even if the size of the thread pool and the context bound are given in binary. Our main result, the EXPSPACE upper bound, is derived using a sequence of new succinct encoding techniques of independent language-theoretic interest. In particular, we show a polynomial-time construction of downward closures of languages accepted by succinct pushdown automata as doubly succinct nondeterministic finite automata. While there are explicit doubly exponential lower bounds on the size of nondeterministic finite automata accepting the downward closure, our result shows these automata can be compressed. We show that thread pooling significantly reduces computational power: in contrast, if only the context bound is provided in binary, but there is no thread pooling, the safety verification problem becomes 3EXPSPACE-complete. Given the high complexity lower bounds of related problems involving binary parameters, the relatively low complexity of safety verification with thread-pooling comes as a surprise.

A Lightweight Learning Method for Stochastic Configuration Networks Using Non-Inverse Solution

Stochastic configuration networks (SCNs) face time-consuming issues when dealing with complex modeling tasks that usually require a mass of hidden nodes to build an enormous network. An important reason behind this issue is that SCNs always employ the Moore–Penrose generalized inverse method with high complexity to update the output weights in each increment. To tackle this problem, this paper proposes a lightweight SCNs, called L-SCNs. First, to avoid using the Moore–Penrose generalized inverse method, a positive definite equation is proposed to replace the over-determined equation, and the consistency of their solution is proved. Then, to reduce the complexity of calculating the output weight, a low complexity method based on Cholesky decomposition is proposed. The experimental results based on both the benchmark function approximation and real-world problems including regression and classification applications show that L-SCNs are sufficiently lightweight.

MEMe: A Mutually Enhanced Modeling Method for Efficient and Effective Human Pose Estimation

In this paper, a mutually enhanced modeling method (MEMe) is presented for human pose estimation, which focuses on enhancing lightweight model performance, but with low complexity. To obtain higher accuracy, a traditional model scale is largely expanded with heavy deployment difficulties. However, for a more lightweight model, there is a large performance gap compared to the former; thus, an urgent need for a way to fill it. Therefore, we propose a MEMe to reconstruct a lightweight baseline model, EffBase transferred intuitively from EfficientDet, into the efficient and effective pose (EEffPose) net, which contains three mutually enhanced modules: the Enhanced EffNet (EEffNet) backbone, the total fusion neck (TFNeck), and the final attention head (FAHead). Extensive experiments on COCO and MPII benchmarks show that our MEMe-based models reach state-of-the-art performances, with limited parameters. Specifically, in the same conditions, our EEffPose-P0 with 256 × 192 can use only 8.98 M parameters to achieve 75.4 AP on the COCO val set, which outperforms HRNet-W48, but with only 14% of its parameters.

Tensor-Based Recursive Least-Squares Adaptive Algorithms with Low-Complexity and High Robustness Features

The recently proposed tensor-based recursive least-squares dichotomous coordinate descent algorithm, namely RLS-DCD-T, was designed for the identification of multilinear forms. In this context, a high-dimensional system identification problem can be efficiently addressed (gaining in terms of both performance and complexity), based on tensor decomposition and modeling. In this paper, following the framework of the RLS-DCD-T, we propose a regularized version of this algorithm, where the regularization terms are incorporated within the cost functions. Furthermore, the optimal regularization parameters are derived, aiming to attenuate the effects of the system noise. Simulation results support the performance features of the proposed algorithm, especially in terms of its robustness in noisy environments.

Using synthetic chromosome controls to evaluate the sequencing of difficult regions within the human genome

Background Next-generation sequencing (NGS) can identify mutations in the human genome that cause disease and has been widely adopted in clinical diagnosis. However, the human genome contains many polymorphic, low-complexity, and repetitive regions that are difficult to sequence and analyze. Despite their difficulty, these regions include many clinically important sequences that can inform the treatment of human diseases and improve the diagnostic yield of NGS. Results To evaluate the accuracy by which these difficult regions are analyzed with NGS, we built an in silico decoy chromosome, along with corresponding synthetic DNA reference controls, that encode difficult and clinically important human genome regions, including repeats, microsatellites, HLA genes, and immune receptors. These controls provide a known ground-truth reference against which to measure the performance of diverse sequencing technologies, reagents, and bioinformatic tools. Using this approach, we provide a comprehensive evaluation of short- and long-read sequencing instruments, library preparation methods, and software tools and identify the errors and systematic bias that confound our resolution of these remaining difficult regions. Conclusions This study provides an analytical validation of diagnosis using NGS in difficult regions of the human genome and highlights the challenges that remain to resolve these difficult regions.

Ciphered BCH Codes for PAPR Reduction in the OFDM in Underwater Acoustic Channels

We propose an effective, low complexity and multifaceted scheme for peak-to-average power ratio (PAPR) reduction in the orthogonal frequency division multiplexing (OFDM) system for underwater acoustic (UWA) channels. In UWA OFDM systems, PAPR reduction is a challenging task due to low bandwidth availability along with computational and power limitations. The proposed scheme takes advantage of XOR ciphering and generates ciphered Bose–Chaudhuri–Hocquenghem (BCH) codes that have low PAPR. This scheme is based upon an algorithm that computes several keys offline, such that when the BCH codes are XOR-ciphered with these keys, it lowers the PAPR of BCH-encoded signals. The subsequent low PAPR modified BCH codes produced using the chosen keys are used in transmission. This technique is ideal for UWA systems as it does not require additional computational power at the transceiver during live transmission. The advantage of the proposed scheme is threefold. First, it reduces the PAPR; second, since it uses BCH codes, the bit error rate (BER) of the system improves; and third, a level of encryption is introduced via XOR ciphering, enabling secure communication. Simulations were performed in a realistic UWA channel, and the results demonstrated that the proposed scheme could indeed achieve all three objectives with minimum computational power.