Numerical Investigations on the Resonance Errors of Multiscale Discontinuous Galerkin Methods for One-Dimensional Stationary Schrödinger Equation

In this paper,numerical experiments are carried out to investigate the impact of penalty parameters in the numerical traces on the resonance errors of high-order multiscale discontinuous Galerkin(DG)methods(Dong et al.in J Sci Comput 66:321–345,2016;Dong and Wang in J Comput Appl Math 380:1–11,2020)for a one-dimensional stationary Schrödinger equation.Previous work showed that penalty parameters were required to be positive in error analysis,but the methods with zero penalty parameters worked fine in numerical simulations on coarse meshes.In this work,by performing extensive numerical experiments,we discover that zero penalty parameters lead to resonance errors in the multiscale DG methods,and taking positive penalty parameters can effectively reduce resonance errors and make the matrix in the global linear system have better condition numbers.

Prediction of one-dimensional CrN nanostructure as a promising ferromagnetic half-metal

Searching for one-dimensional(1D)nanostructure with ferromagnetic(FM)half-metallicity is of significance for the development of miniature spintronic devices.Here,based on the first-principles calculations,we propose that the 1D CrN nanostructure is a FM half-metal,which can generate the fully spin-polarized current.The ab initio molecular dynamic simulation and the phonon spectrum calculation demonstrate that the 1D CrN nanostructure is thermodynamically stable.The partially occupied Cr-d orbitals endow the nanostructure with FM half-metallicity,in which the half-metallic gap(?s)reaches up to 1.58 eV.The ferromagnetism in the nanostructure is attributed to the superexchange interaction between the magnetic Cr atoms,and a sizable magnetocrystalline anisotropy energy(MAE)is obtained.Moreover,the transverse stretching of nanostructure can effectively modulate?s and MAE,accompanied by the preservation of half-metallicity.A nanocable is designed by encapsulating the CrN nanostructure with a BN nanotube,and the intriguing magnetic and electronic properties of the nanostructure are retained.These novel characteristics render the 1D CrN nanostructure as a compelling candidate for exploiting high-performance spintronic devices.

Size effect on light propagation modulation near band edges in one-dimensional periodic structures

Periodic photonic structures can provide rich modulation in propagation of light due to well-defined band structures.Especially near band edges,light localization and the effect of near-zero refractive index have attracted wide attention.However,the practically fabricated structures can only have finite size,i.e.,limited numbers of periods,leading to changes of the light propagation modulation compared with infinite structures.Here,we study the size effect on light localization and near-zero refractive-index propagation near band edges in one-dimensional periodic structures.Near edges of the band gap,as the structure's size shrinks,the broadening of the band gap and the weakening of the light localization are discovered.When the size is small,an added layer on the surface will perform large modulation in the group velocity.Near the degenerate point with Dirac-like dispersion,the zero-refractive-index effects like the zero-phase difference and near-unity transmittance retain as the size changes,while absolute group velocity fluctuates when the size shrinks.

A Dugdale-Barenblatt model for elliptical orifice problem with asymmetric cracks in one-dimensional orthorhombic quasicrystals

By means of Muskhelishvili’s method and the technique of generalized conformal mapping,the physical plane problems are transformed into regular mathematical problems in quasicrystals(QCs).The analytical solution to an elliptical orifice problem with asymmetric cracks in one-dimensional(1D)orthorhombic QCs is obtained.By using the Dugdale-Barenblatt model,the plastic simulation at the crack tip of the elliptical orifice with asymmetric cracks in 1D orthorhombic QCs is performed.Finally,the size of the atomic cohesive force zone is determined precisely,and the size of the atomic cohesive force zone around the crack tip of an elliptical orifice with a single crack or two symmetric cracks is obtained.

Robust Damage Detection and Localization Under Complex Environmental Conditions Using Singular Value Decomposition-based Feature Extraction and One-dimensional Convolutional Neural Network

Ultrasonic guided wave is an attractive monitoring technique for large-scale structures but is vulnerable to changes in environmental and operational conditions(EOC),which are inevitable in the normal inspection of civil and mechanical structures.This paper thus presents a robust guided wave-based method for damage detection and localization under complex environmental conditions by singular value decomposition-based feature extraction and one-dimensional convolutional neural network(1D-CNN).After singular value decomposition-based feature extraction processing,a temporal robust damage index(TRDI)is extracted,and the effect of EOCs is well removed.Hence,even for the signals with a very large temperature-varying range and low signal-to-noise ratios(SNRs),the final damage detection and localization accuracy retain perfect 100%.Verifications are conducted on two different experimental datasets.The first dataset consists of guided wave signals collected from a thin aluminum plate with artificial noises,and the second is a publicly available experimental dataset of guided wave signals acquired on a composite plate with a temperature ranging from 20℃to 60℃.It is demonstrated that the proposed method can detect and localize the damage accurately and rapidly,showing great potential for application in complex and unknown EOC.

Analysis of Dynamical Behavior of One-Dimensional Real Maps: An Executable Dynamical Programming Software Approach

The dynamical behavior of real-world phenomena is implausible graphically due to the complexity of mathematical coding. The present article has mainly focused on some one-dimensional real maps’ dynamical behavior irrespective of using coding. In continuation, linear, quadratic, cubic, higher-order, exponential, logarithmic, and absolute value maps have been used to scrutinize their dynamical behavior, including the characteristics of the orbit of points. Dynamical programming software (DPS.exe) will be proposed as a new technique to ascertain the dynamical behavior of said maps. Thus, a mathematician can automatically determine one-dimensional real maps’ dynamical behavior apart from complicated programming code and analytical solutions.

适用2000 HSC CODE的高速船特点及总体设计要求

高速船由于其航速高、质量轻、营运特殊等特点,需要适用的规则与常规船型不同。2000年的《国际高速船安全规则》(简称2000 HSC CODE)作为较完备的适用于高速船的规则,被各海事主管机关广泛接受作为高速船的设计依据。文中简要介绍2000 HSC CODE的安全原理,以及该规则对各海事主管机关的适用程度;然后通过国内外高速船事故来分析该类船的事故类型及致因特点,并进一步介绍了适用高速船的风险控制及设计措施,包括营运限制、破舱稳性、防火要求和撤离分析等总体设计要求,以供理解高速船的安全原理并指导其设计。

CodeScore-R:用于评估代码合成功能准确性的自动化鲁棒指标

评估指标在代码合成领域中至关重要.常用的代码评估指标可以分为3种类型:基于匹配、基于语义和基于执行.其中,基于执行的Pass@k指标通过执行测试用例,能够准确判断预测代码的功能准确性.然而,该指标的计算需要大量开销,因此亟需设计一种自动化评估指标,在无需测试用例时仍可评估预测代码的功能准确性.此外,好的评估指标应当具有鲁棒性,即预测代码发生微小改变时,评估指标仍能保持其准确性.为此,提出了一种基于UniXcoder和对比学习的自动化鲁棒指标CodeScore-R,用于评估代码合成的功能准确性. CodeScore-R采用草图化处理、语法等价转换和变异测试等技术手段,有效减轻了标识符、语法结构和运算符对评估结果的干扰.实验结果表明,在Java和Python语言上的代码生成和迁移任务中,CodeScore-R的表现优于其他无需测试用例的评估指标,且更接近Pass@k指标,并具有更强的鲁棒性.

Thermal-induced interfacial behavior of a thin one-dimensional hexagonal quasicrystal film

In this paper,we investigate the interfacial behavior of a thin one-dimensional(1D)hexagonal quasicrystal(QC)film bonded on an elastic substrate subjected to a mismatch strain due to thermal variation.The contact interface is assumed to be nonslipping,with both perfectly bonded and debonded boundary conditions.The Fourier transform technique is adopted to establish the integral equations in terms of interfacial shear stress,which are solved as a linear algebraic system by approximating the unknown phonon interfacial shear stress via the series expansion of the Chebyshev polynomials.The expressions are explicitly obtained for the phonon interfacial shear stress,internal normal stress,and stress intensity factors(SIFs).Finally,based on numerical calculations,we briefly discuss the effects of the material mismatch,the geometry of the QC film,and the debonded length and location on stresses and SIFs.

Improved Belief Propagation Decoder for LDPC-CRC-Polar Codes with Bit-Freezing

Though belief propagation bit-flip(BPBF)decoding improves the error correction performance of polar codes,it uses the exhaustive flips method to achieve the error correction performance of CA-SCL decoding,thus resulting in high decoding complexity and latency.To alleviate this issue,we incorporate the LDPC-CRC-Polar coding scheme with BPBF and propose an improved belief propagation decoder for LDPC-CRC-Polar codes with bit-freezing(LDPCCRC-Polar codes BPBFz).The proposed LDPCCRC-Polar codes BPBFz employs the LDPC code to ensure the reliability of the flipping set,i.e.,critical set(CS),and dynamically update it.The modified CS is further utilized for the identification of error-prone bits.The proposed LDPC-CRC-Polar codes BPBFz obtains remarkable error correction performance and is comparable to that of the CA-SCL(L=16)decoder under medium-to-high signal-to-noise ratio(SNR)regions.It gains up to 1.2dB and 0.9dB at a fixed BLER=10-4compared with BP and BPBF(CS-1),respectively.In addition,the proposed LDPC-CRC-Polar codes BPBFz has lower decoding latency compared with CA-SCL and BPBF,i.e.,it is 15 times faster than CA-SCL(L=16)at high SNR regions.

Doped low-density parity-check codes

In this paper,we propose a doping approach to lower the error floor of Low-Density Parity-Check(LDPC)codes.The doping component is a short block code in which the information bits are selected from the coded bits of the dominant trapping sets of the LDPC code.Accordingly,an algorithm for selecting the information bits of the short code is proposed,and a specific two-stage decoding algorithm is presented.Simulation results demonstrate that the proposed doped LDPC code achieves up to 2.0 dB gain compared with the original LDPC code at a frame error rate of 10^(-6)Furthermore,the proposed design can lower the error floor of original LDPC Codes.

Efficient unequal error protection for online fountain codes

In this paper,an efficient unequal error protection(UEP)scheme for online fountain codes is proposed.In the buildup phase,the traversing-selection strategy is proposed to select the most important symbols(MIS).Then,in the completion phase,the weighted-selection strategy is applied to provide low overhead.The performance of the proposed scheme is analyzed and compared with the existing UEP online fountain scheme.Simulation results show that in terms of MIS and the least important symbols(LIS),when the bit error ratio is 10-4,the proposed scheme can achieve 85%and 31.58%overhead reduction,respectively.

Design of Protograph LDPC-Coded MIMO-VLC Systems with Generalized Spatial Modulation

This paper investigates the bit-interleaved coded generalized spatial modulation(BICGSM) with iterative decoding(BICGSM-ID) for multiple-input multiple-output(MIMO) visible light communications(VLC). In the BICGSM-ID scheme, the information bits conveyed by the signal-domain(SiD) symbols and the spatial-domain(SpD) light emitting diode(LED)-index patterns are coded by a protograph low-density parity-check(P-LDPC) code. Specifically, we propose a signal-domain symbol expanding and re-allocating(SSER) method for constructing a type of novel generalized spatial modulation(GSM) constellations, referred to as SSERGSM constellations, so as to boost the performance of the BICGSM-ID MIMO-VLC systems.Moreover, by applying a modified PEXIT(MPEXIT) algorithm, we further design a family of rate-compatible P-LDPC codes, referred to as enhanced accumulate-repeat-accumulate(EARA) codes,which possess both excellent decoding thresholds and linear-minimum-distance-growth property. Both analysis and simulation results illustrate that the proposed SSERGSM constellations and P-LDPC codes can remarkably improve the convergence and decoding performance of MIMO-VLC systems. Therefore, the proposed P-LDPC-coded SSERGSM-mapped BICGSMID configuration is envisioned as a promising transmission solution to satisfy the high-throughput requirement of MIMO-VLC applications.

Gray code based gradient-free optimization algorithm for parameterized quantum circuit

A Gray code based gradient-free optimization(GCO)algorithm is proposed to update the parameters of parameterized quantum circuits(PQCs)in this work.Each parameter of PQCs is encoded as a binary string,named as a gene,and a genetic-based method is adopted to select the offsprings.The individuals in the offspring are decoded in Gray code way to keep Hamming distance,and then are evaluated to obtain the best one with the lowest cost value in each iteration.The algorithm is performed iteratively for all parameters one by one until the cost value satisfies the stop condition or the number of iterations is reached.The GCO algorithm is demonstrated for classification tasks in Iris and MNIST datasets,and their performance are compared by those with the Bayesian optimization algorithm and binary code based optimization algorithm.The simulation results show that the GCO algorithm can reach high accuracies steadily for quantum classification tasks.Importantly,the GCO algorithm has a robust performance in the noise environment.

An Encode-and CRT-Based Scalability Scheme for Optimizing Transmission in Blockchain

Blockchain technology has witnessed a burgeoning integration into diverse realms of economic and societal development.Nevertheless,scalability challenges,characterized by diminished broadcast efficiency,heightened communication overhead,and escalated storage costs,have significantly constrained the broad-scale application of blockchain.This paper introduces a novel Encode-and CRT-based Scalability Scheme(ECSS),meticulously refined to enhance both block broadcasting and storage.Primarily,ECSS categorizes nodes into distinct domains,thereby reducing the network diameter and augmenting transmission efficiency.Secondly,ECSS streamlines block transmission through a compact block protocol and robust RS coding,which not only reduces the size of broadcasted blocks but also ensures transmission reliability.Finally,ECSS utilizes the Chinese remainder theorem,designating the block body as the compression target and mapping it to multiple modules to achieve efficient storage,thereby alleviating the storage burdens on nodes.To evaluate ECSS’s performance,we established an experimental platformand conducted comprehensive assessments.Empirical results demonstrate that ECSS attains superior network scalability and stability,reducing communication overhead by an impressive 72% and total storage costs by a substantial 63.6%.

C-CORE:Clustering by Code Representation to Prioritize Test Cases in Compiler Testing

Edge devices,due to their limited computational and storage resources,often require the use of compilers for program optimization.Therefore,ensuring the security and reliability of these compilers is of paramount importance in the emerging field of edge AI.One widely used testing method for this purpose is fuzz testing,which detects bugs by inputting random test cases into the target program.However,this process consumes significant time and resources.To improve the efficiency of compiler fuzz testing,it is common practice to utilize test case prioritization techniques.Some researchers use machine learning to predict the code coverage of test cases,aiming to maximize the test capability for the target compiler by increasing the overall predicted coverage of the test cases.Nevertheless,these methods can only forecast the code coverage of the compiler at a specific optimization level,potentially missing many optimization-related bugs.In this paper,we introduce C-CORE(short for Clustering by Code Representation),the first framework to prioritize test cases according to their code representations,which are derived directly from the source codes.This approach avoids being limited to specific compiler states and extends to a broader range of compiler bugs.Specifically,we first train a scaled pre-trained programming language model to capture as many common features as possible from the test cases generated by a fuzzer.Using this pre-trained model,we then train two downstream models:one for predicting the likelihood of triggering a bug and another for identifying code representations associated with bugs.Subsequently,we cluster the test cases according to their code representations and select the highest-scoring test case from each cluster as the high-quality test case.This reduction in redundant testing cases leads to time savings.Comprehensive evaluation results reveal that code representations are better at distinguishing test capabilities,and C-CORE significantly enhances testing efficiency.Across four datasets,C-CORE increases the average of the percentage of faults detected(APFD)value by 0.16 to 0.31 and reduces test time by over 50% in 46% of cases.When compared to the best results from approaches using predicted code coverage,C-CORE improves the APFD value by 1.1% to 12.3% and achieves an overall time-saving of 159.1%.

Variational Learned Talking-Head Semantic Coded Transmission System

Video transmission requires considerable bandwidth,and current widely employed schemes prove inadequate when confronted with scenes featuring prominently.Motivated by the strides in talkinghead generative technology,the paper introduces a semantic transmission system tailored for talking-head videos.The system captures semantic information from talking-head video and faithfully reconstructs source video at the receiver,only one-shot reference frame and compact semantic features are required for the entire transmission.Specifically,we analyze video semantics in the pixel domain frame-by-frame and jointly process multi-frame semantic information to seamlessly incorporate spatial and temporal information.Variational modeling is utilized to evaluate the diversity of importance among group semantics,thereby guiding bandwidth resource allocation for semantics to enhance system efficiency.The whole endto-end system is modeled as an optimization problem and equivalent to acquiring optimal rate-distortion performance.We evaluate our system on both reference frame and video transmission,experimental results demonstrate that our system can improve the efficiency and robustness of communications.Compared to the classical approaches,our system can save over 90%of bandwidth when user perception is close.

Energy-Efficient Implementation of BCD to Excess-3 Code Converter for Nano-Communication Using QCA Technology

Code converters are essential in digital nano communication;therefore,a low-complexity optimal QCA layout for a BCD to Excess-3 code converter has been proposed in this paper.A QCA clockphase-based design technique was adopted to investigate integration with other complicated circuits.Using a unique XOR gate,the recommended circuit’s cell complexity has been decreased.The findings produced using the QCADesigner-2.0.3,a reliable simulation tool,prove the effectiveness of the current structure over earlier designs by considering the number of cells deployed,the area occupied,and the latency as design metrics.In addition,the popular tool QCAPro was used to estimate the energy dissipation of the proposed design.The proposed technique reduces the occupied space by∼40%,improves cell complexity by∼20%,and reduces energy dissipation by∼1.8 times(atγ=1.5EK)compared to the current scalable designs.This paper also studied the suggested structure’s energy dissipation and compared it to existing works for a better performance evaluation.

Quantized Decoders that Maximize Mutual Information for Polar Codes

In this paper,we innovatively associate the mutual information with the frame error rate(FER)performance and propose novel quantized decoders for polar codes.Based on the optimal quantizer of binary-input discrete memoryless channels(BDMCs),the proposed decoders quantize the virtual subchannels of polar codes to maximize mutual information(MMI)between source bits and quantized symbols.The nested structure of polar codes ensures that the MMI quantization can be implemented stage by stage.Simulation results show that the proposed MMI decoders with 4 quantization bits outperform the existing nonuniform quantized decoders that minimize mean-squared error(MMSE)with 4 quantization bits,and yield even better performance than uniform MMI quantized decoders with 5 quantization bits.Furthermore,the proposed 5-bit quantized MMI decoders approach the floating-point decoders with negligible performance loss.

Layered Coded Cache Placement and Cooperative Delivery with Sharing Links in Satellite-Terrestrial Integrated Networks

Cooperative utilization of multidimensional resources including cache, power and spectrum in satellite-terrestrial integrated networks(STINs) can provide a feasible approach for massive streaming media content delivery over the seamless global coverage area. However, the on-board supportable resources of a single satellite are extremely limited and lack of interaction with others. In this paper, we design a network model with two-layered cache deployment, i.e., satellite layer and ground base station layer, and two types of sharing links, i.e., terrestrial-satellite sharing(TSS) links and inter-satellite sharing(ISS) links, to enhance the capability of cooperative delivery over STINs. Thus, we use rateless codes for the content divided-packet transmission, and derive the total energy efficiency(EE) in the whole transmission procedure, which is defined as the ratio of traffic offloading and energy consumption. We formulate two optimization problems about maximizing EE in different sharing scenarios(only TSS and TSS-ISS),and propose two optimized algorithms to obtain the optimal content placement matrixes, respectively.Simulation results demonstrate that, enabling sharing links with optimized cache placement have more than 2 times improvement of EE performance than other traditional placement schemes. Particularly, TSS-ISS schemes have the higher EE performance than only TSS schemes under the conditions of enough number of satellites and smaller inter-satellite distances.