Green scheduling in the manufacturing industry has attracted increasing attention academic research and industrial applications with a focus on energy saving. As typical problem, no-wait flow-shop been extensively studied due to its wide applications. However, consumption is usually ignored study of problems. In this article, two-stage cooperative evolutionary algorithm problem-specific knowledge called TS-CEA proposed address energy-efficient problem (EENWFSP) criteria minimizing both...

The flowshop sequence-dependent group scheduling problem (FSDGSP) with the production efficiency measures has been extensively studied due to its wide industrial applications. However, energy indicators are often ignored in literature. This article considers FSDGSP minimize makespan, total flow time, and consumption, simultaneously. After problem-specific knowledge is extracted, a mixed-integer linear programming model critical path-based accelerated evaluation method proposed. Since...

巴洛克时期的组曲作为17 至18 世纪欧洲最具代表性的器乐体裁之一，既是音乐形式演变的枢纽，亦是社会文化交融的镜像。本文以巴洛克时期历史背景为研究点，浅谈巴洛克时期组曲的发展过程及特点。研究指出：组曲的标准化舞曲序列（阿勒曼德、库朗特、萨拉班德、吉格）不仅是音乐结构的创新，更映射了巴洛克时期宫廷文化，同时论文通过介绍巴洛克时期最具代表性的作曲家“巴赫”的组曲，进一步了解组曲对于西洋乐器产生了怎样的影响。

Microelectrode recording (MER) along surgical trajectories is commonly applied for refinement of the target location during deep brain stimulation (DBS) surgery. In this study, we utilize automatically detected MER features in order to locate subthalamic nucleus (STN) employing an unsupervised algorithm. The automated algorithm makes use background noise level, compound firing rate and power spectral density trajectory applies a threshold-based method detect dorsal ventral borders STN....

We consider construction of deletion and substitution correcting codes with low redundancy efficient encoding/ decoding. First, by simplifying the method Sima <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al</i> . (ISIT 2020), we construct a family binary single-deletion <inline-formula xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$s$ </tex-math></inline-formula> -substitution notation="LaTeX">$(s+1) (2s+1)\log...

The practical NAND flash memory suffers from various non-stationary noises that are difficult to be predicted. For example, the data retention noise induced channel offset is unknown during readback process, and hence severely affects reliability of recovery cell. In this paper, we first propose a novel recurrent neural network (RNN)-based detector effectively detect stored in multi-level-cell (MLC) without prior knowledge channel. However, compared with conventional threshold detector,...

In this letter, we consider the bit mapping (BM) design for regular low-density parity-check (LDPC) coded bit-interleaved modulation (BICM) schemes. We propose a check-node type distribution and develop multi-edge extrinsic information transfer (EXIT) functions LDPC BICM Based on EXIT functions, two-phase method to generate optimized practical BM in terms of lowest decoding threshold given finite length code. Simulation results show that proposed has better compared with those existing works.

A severe problem for mutual information-maximizing lookup table (MIM-LUT) decoding of low-density parity-check (LDPC) code is the high memory cost using large tables, while decomposing tables to small deteriorates error performance. In this paper, we propose a systematic method, called information- maximizing quantized belief propagation (MIM-QBP) decoding, remove used MIM-LUT decoding. Our method leads very practical decoder, namely MIM-QBP which can be implemented based only on simple...

In this article, under a general cost function C, we present dynamic programming (DP) method to obtain an optimal sequential deterministic quantizer (SDQ) for q-ary input discrete memoryless channel (DMC). The DP has complexity O(q (N-M) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> M), where N and M are the alphabet sizes of DMC output output, respectively. Then, starting from quadrangle inequality, two techniques applied reduce...

In this paper, we propose a framework of the mutual information-maximizing (MIM) quantized decoding for low-density parity-check (LDPC) codes by using simple mappings and fixed-point additions. Our method is generic in sense that it can be applied to LDPC with arbitrary degree distributions, implemented based on either belief propagation (BP) algorithm or min-sum (MS) algorithm. particular, MIM density evolution (MIM-DE) construct lookup tables (LUTs) node updates. The computational...

In this paper, we propose a new multi-edge metric-constrained quasi-cyclic progressive edge-growth algorithm (MM-QC-PEGA), which is suitable for constructing both single- and multi-weighted (binary) QC low-density parity-check (LDPC) codes with arbitrary lengths, rates, circulant sizes, variable node (VN)-degree distributions. The MM-QC-PEGA able to detect all cyclic-edge-set-minimum-virtual cycles (CMVCs), as it accurately computes the metric value of each CMVC an posteriori test. addition,...

As emerging memories such as spin-torque transfer magnetic random access memory (STT-MRAM) suffer from reliability issues caused by process variations and thermal fluctuations, the design of channel quantizer with minimum number quantization bits is critical to support effective error correction coding for ensuring high-density high-speed data storage. In this paper, we first propose a quantized model STT-MRAM. Based on model, derive various information theoretic bounds, including mutual...

In this paper, we consider the decoding of fountain codes where received symbols may have errors. It is motivated by application in DNA-based data storage systems inner code decoding, which generally has undetectable errors, performed before outer decoding. We propose a novel and efficient algorithm, namely basis-finding algorithm (BFA), followed three implementations. The key idea BFA to find basis symbols, then use most reliable elements recover source with inactivation Gaussian...

End-to-end transformer-based detectors (DETRs) have shown exceptional performance in both closed-set and open-vocabulary object detection (OVD) tasks through the integration of language modalities. However, their demanding computational requirements hindered practical application real-time (OD) scenarios. In this paper, we scrutinize limitations two leading models OVDEval benchmark, OmDet Grounding-DINO, introduce OmDet-Turbo. This novel OVD model features an innovative Efficient Fusion Head...

The Mixtures-of-Experts (MoE) model is a widespread distributed and integrated learning method for large language models (LLM), which favored due to its ability sparsify expand efficiently. However, the performance of MoE limited by load imbalance high latency All-to-All communication, along with relatively redundant computation owing expert capacity. Load may result from existing routing policies that consistently tend select certain experts. frequent inter-node communication in procedure...

There is limited information on the occurrence of respiratory events in postoperative patients after discharge from postanesthesia care unit. We studied rate (RR) 68 aged 60 years and above during first 6 hours following elective surgery under general anesthesia to assess frequency unit ward. RR was derived continuous counter RespiR8, measuring by quantifying humidity exhaled air. One-minute-averaged RRs were collected analyzed bradypnea (RR 1-6 breaths/minute) apnea (cessation inspiratory...

The iterated local search (ILS) is exceptionally successful in combinatorial solution spaces. However, few research works have reported on the application of ILS continuous problems. In this article, a new hybrid population-based (HILS) algorithm proposed for solving numerical optimization method introduces both success-history based parameter adaptation differential evolution (SHADE) and limited-memory Broyden–Fletcher–Goldfarb–Shanno (LBFGS) as perturbation strategy, respectively,...

In this paper, by applying the precoding technique in conjunction with syndrome compression approach, we construct systematic <tex>$t$</tex>-deletion <tex>$s$</tex>-substitution correcting codes, where <tex>$t$</tex> and <tex>$s$</tex> are fixed positive integers. The redundancy of our construction is <tex>$(4t+3s)\log n+o(\log n)$</tex> for binary case <tex>$(4t+4s-1- \mathrm{L}\frac{2s-1}{q}\rfloor)\bar{\mathrm{l}}\text{og}_{q}n+o(\bar{\mathrm{l}}\text{og}_{q}n)$</tex> <tex>$q$</tex>-ary...

This paper proposes two new cycle-optimized algorithms, called the multi-step progressive edge-growth (PEG) algorithm and approximate cycle extrinsic message degree (ACE) constrained PEG algorithm, to design an LDPC code with larger girth better cycle-connectivity. In addition, efficient method is developed calculate distances between variable nodes (VNs) check (CNs) in proposed algorithms. Simulation results show that compared conventional algorithms can achieve both cycle-connectivity...

GC-content and homopolymer run are two constraints of interest in DNA storage systems. Extensive experiments showed that if is too high (low), or exceeds six a sequence, there will give rise to dramatical increase insertion, deletion substitution errors. Committing study the sequences with both constraints, recent work (Nguyen et al. 2020) proposed class (ϵ, ℓ)-constrained codes can only asymptotically approach capacity, but may have reasonable loss for finite code lengths.In this paper, we...