Perfect Reconstructable Decimated One-Dimensional Empirical Mode Decomposition Filter Banks

This paper introduces decimated filter banks for the one-dimensional empirical mode decomposition （1D-EMD）. These filter banks can provide perfect reconstruction and allow for an arbitrary tree structure. Since the EMD is a data driven decomposition, it is a very useful analysis instrument for non-stationary and non-linear signals. However, the traditional 1D-EMD has the disadvantage of expanding the data. Large data sets can be generated as the amount of data to be stored increases with every decomposition level. The 1D-EMD can be thought as having the structure of a single dyadic filter. However, a methodology to incorporate the decomposition into any arbitrary tree structure has not been reported yet in the literature. This paper shows how to extend the 1D-EMD into any arbitrary tree structure while maintaining the perfect reconstruction property. Furthermore, the technique allows for downsampling the decomposed signals. This paper, thus, presents a method to minimize the data-expansion drawback of the 1D-EMD by using decimation and merging the EMD coefficients. The proposed algorithm is applicable for any arbitrary tree structure including a full binary tree structure.

The Cumulative Method for Multiplication and Division

This paper provides a method of the process of computation called the cumulative method, it is based upon repeated cumulative process. The cumulative method is being adapted to the purposes of computation, particularly multiplication and division. The operations of multiplication and division are represented by algebraic formulas. An advantage of the method is that the cumulative process can be performed on decimal numbers. The present paper aims to establish a basic and useful formula valid for the two fundamental arithmetic operations of multiplication and division. The new cumulative method proved to be more flexible and made it possible to extend the multiplication and division based on repeated addition/subtraction to decimal numbers.

Enhanced Wideband Frequency Estimation via FFT: Leveraging Polynomial Interpolation and Array Indexing

Accurate frequency estimation in a wideband digital receiver using the FFT algorithm encounters challenges, such as spectral leakage resulting from the FFT’s assumption of signal periodicity. High-resolution FFTs pose computational demands, and estimating non-integer multiples of frequency resolution proves exceptionally challenging. This paper introduces two novel methods for enhanced frequency precision: polynomial interpolation and array indexing, comparing their results with super-resolution and scalloping loss. Simulation results demonstrate the effectiveness of the proposed methods in contemporary radar systems, with array indexing providing the best frequency estimation despite utilizing maximum hardware resources. The paper demonstrates a trade-off between accurate frequency estimation and hardware resources when comparing polynomial interpolation and array indexing.

An optimized infinite time-evolving block decimation algorithm for lattice systems

The infinite time-evolving block decimation algorithm(i TEBD)provides an efficient way to determine the ground state and dynamics of the quantum lattice systems in the thermodynamic limit.In this paper we suggest an optimized way to take the i TEBD calculation,which takes advantage of additional reduced decompositions to speed up the calculation.The numerical calculations show that for a comparable computation time our method provides more accurate results than the traditional i TEBD,especially for lattice systems with large on-site degrees of freedom.

线性反馈移位寄存器的差分能量攻击

能否有效去除算法噪声的影响,直接关系到能量攻击成败。该文以线性反馈移位寄存器(LFSR)相邻两个时钟周期的能量消耗差异为出发点,提出了一种新的差分能量攻击算法。它从根本上去除了密码算法噪声在攻击过程中带来的影响。由于该算法随机选择初始向量(initialization vector),从而使攻击者能够容易地将其推广到具有类似结构的流密码体制。为了进一步验证攻击算法的有效性,该文利用软件仿真的方法对DECIM进行了模拟攻击。仿真结果表明,该攻击算法能够有效降低LFSR的密钥搜索的复杂度。

New method to implement digital down converter in radar system

Digital down converter （DDC） is the main part of the next generation high frequency （HF） radar. In order to realize the single chip integrations of digital receiver hardware in the next generation HF Radar, a new design for DDC by using FPGA is presented. Some important and practical applications are given in this paper, and the result can prove the validity. Because we can adjust the parameters freely according to our need, the DDC system can be adapted to the next generation HF radar system.

LS-SVM and Monte Carlo methods based reliability analysis for settlement of soft clayey foundation

A method which adopts the combination of least squares support vector machine（LS-SVM） and Monte Carlo（MC） simulation is used to calculate the foundation settlement reliability.When using LS-SVM,choosing the training dataset and the values for LS-SVM parameters is the key.In a representative sense,the orthogonal experimental design with four factors and five levels is used to choose the inputs of the training dataset,and the outputs are calculated by using fast Lagrangian analysis continua（FLAC）.The decimal ant colony algorithm（DACA） is also used to determine the parameters.Calculation results show that the values of the two parameters,and δ2 have great effect on the performance of LS-SVM.After the training of LS-SVM,the inputs are sampled according to the probabilistic distribution,and the outputs are predicted with the trained LS-SVM,thus the reliability analysis can be performed by the MC method.A program compiled by Matlab is employed to calculate its reliability.Results show that the method of combining LS-SVM and MC simulation is applicable to the reliability analysis of soft foundation settlement.

CONSTRUCTION OF SOME KIESSWETTER-LIKE FUNCTIONS-THE CONTINUOUS BUT NON-DIFFERENT-IABLE FUNCTION DEFINED BY QUINARY DECIMAL

In this paper, we construct some continuous but non-differentiable functions defined by quinary dec-imal, that are Kiesswetter-like functions. We discuss their properties, then investigate the Hausdorff dimensions of graphs of these functions and give a detailed proof.

颅骨切除减压治疗恶性大脑中动脉梗死试验(DECIMAL)

试验状态:从2003年11月开始,已纳入18例患者。试验目的:评价偏侧颅骨切除减压和硬膜成形术在恶性大脑中动脉(MCA)区梗死患者中的作用。试验设计:多中心随机对照试验。

Low complexity reconfigurable architecture for the 5/3 and 9/7 discrete wavelet transform

Efficient reconfigurable VLSI architecture for 1-D 5/3 and 9/7 wavelet transforms adopted in JPEG2000 proposal, based on lifting scheme is proposed. The embedded decimation technique based on fold and time multiplexing, as well as embedded boundary data extension technique, is adopted to optimize the design of the architecture. These reduce significantly the required numbers of the multipliers, adders and registers, as well as the amount of accessing external memory, and lead to decrease efficiently the hardware cost and power consumption of the design. The architecture is designed to generate an output per clock cycle, and the detailed component and the approximation of the input signal are available alternately. Experimental simulation and comparison results are presented, which demonstrate that the proposed architecture has lower hardware complexity, thus it is adapted for embedded applications. The presented architecture is simple, regular and scalable, and well suited for VLSI implementation.

A comparison of mapping strategies from DDC to CLC

Purpose: This study aims to discuss the strategies for mapping from Dewey Decimal Classification(DDC) numbers to Chinese Library Classification(CLC) numbers based on co-occurrence mapping while minimizing manual intervention.Design/methodology/approach: Several statistical tables were created based on frequency counts of the mapping relations with samples of USMARC records,which contain both DDC and CLC numbers. A manual table was created through direct mapping. In order to find reasonable mapping strategies,the mapping results were compared from three aspects including the sample size,the choice between one-to-one and one-to-multiple mapping relations,and the role of a manual mapping table.Findings: Larger sample size provides more DDC numbers in the mapping table. The statistical table including one-to-multiple DDC-CLC relations provides a higher ratio of correct matches than that including only one-to-one relations. The manual mapping table cannot produce a better result than the statistical tables. Therefore,we should make full use of statistical mapping tables and avoid the time-consuming manual mapping as much as possible.Research limitations: All the sample sizes were small. We did not consider DDC editions in our study. One-to-multiple DDC-CLC relations in the records were collected in the mapping table,but how to select one appropriate CLC number in the matching process needs to be further studied.Practical implications: The ratio of correct matches based on the statistical mapping table came up to about 90% by CLC top-level classes and 76% by the second-level classes in our study. The statistical mapping table will be improved to realize the automatic classification of e-resources and shorten the cataloging cycle significantly.Originality/value: The mapping results were investigated from different aspects in order to find suitable mapping strategies from DDC to CLC while minimizing manual intervention.The findings have facilitated the establishment of DDC-CLC mapping system for practical applications.

Dynamical signatures of the one-dimensional deconfined quantum critical point

We study the critical scaling and dynamical signatures of fractionalized excitations at two different deconfined quantum critical points(DQCPs)in an S=1/2 spin chain using the time evolution of infinite matrix product states.The scaling of the correlation functions and the dispersion of the conserved current correlations explicitly show the emergence of enhanced continuous symmetries at these DQCPs.The dynamical structure factors in several different channels reveal the development of deconfined fractionalized excitations at the DQCPs.Furthermore,we find an effective spin-charge separation at the DQCP between the ferromagnetic(FM)and valence bond solid(VBS)phases,and identify two continua associated with different types of fractionalized excitations at the DQCP between the X-direction and Z-direction FM phases.Our findings not only provide direct evidence for the DQCP in one dimension but also shed light on exploring the DQCP in higher dimensions.

A New Evolutionary Algorithm Based on the Decimal Coding

Traditional Evolutionary Algorithm (EAs) is based on the binary code, real number code, structure code and so on. But these coding strategies have their own advantages and disadvantages for the optimization of functions. In this paper a new Decimal Coding Strategy (DCS), which is convenient for space division and alterable precision, was proposed, and the theory analysis of its implicit parallelism and convergence was also discussed. We also redesign several genetic operators for the decimal code. In order to utilize the historial information of the existing individuals in the process of evolution and avoid repeated exploring, the strategies of space shrinking and precision alterable, are adopted. Finally, the evolutionary algorithm based on decimal coding (DCEAs) was applied to the optimization of functions, the optimization of parameter, mixed-integer nonlinear programming. Comparison with traditional GAs was made and the experimental results show that the performances of DCEAS are better than the tradition GAs.

Cancellable Multi-Biometric Template Generation Based on Arnold Cat Map and Aliasing

The cancellable biometric transformations are designed to be computationally difficult to obtain the original biometric data.This paper presents a cancellable multi-biometric identification scheme that includes four stages:biometric data collection and processing,Arnold’s Cat Map encryption,decimation process to reduce the size,and finalmerging of the four biometrics in a single generated template.First,a 2D matrix of size 128×128 is created based on Arnold’s Cat Map(ACM).The purpose of this rearrangement is to break the correlation between pixels to hide the biometric patterns and merge these patterns together for more security.The decimation is performed to keep the dimensions of the overall cancellable template similar to those of a single template to avoid data redundancy.Moreover,some sort of aliasing occurs due to decimation,contributing to the intended distortion of biometric templates.The hybrid structure that comprises encryption,decimation,andmerging generates encrypted and distorted cancellable templates.The simulation results obtained for performance evaluation show that the system is safe,reliable,and feasible as it achieves high security in the presence of noise.

HIERACHICAL STRUCTURES FOR GENERATING PSEUDO-RANDOM SEQUENCES AND ARRAYS

This paper proposes new hierarchical structures for generating pseudorandom sequences and arrays. The principle of the structures is based on a new concept-multi-interleaving. It is the generalization of normal sequence decimation(sampling). The kernal of the structures is a lower speed linear feedback shift register together with several high speed time-division multiplexers arranged hierarchically. These new structures have much higher speed compared with that of other schemes proposed before.

The ”Hot Spots” Conjecture on Homogeneous Hierarchical Gaskets

In this paper, using spectral decimation, we prove that the "hot spots" conjecture holds on a class of homogeneous hierarchical gaskets introduced by Hambly,i.e., every eigenfunction of the second-smallest eigenvalue of the Neumann Laplacian(introduced by Kigami) attains its maximum and minimum on the boundary.

Automatic Classification of Swedish Metadata Using Dewey Decimal Classification:A Comparison of Approaches

Purpose:With more and more digital collections of various information resources becoming available,also increasing is the challenge of assigning subject index terms and classes from quality knowledge organization systems.While the ultimate purpose is to understand the value of automatically produced Dewey Decimal Classification(DDC)classes for Swedish digital collections,the paper aims to evaluate the performance of six machine learning algorithms as well as a string-matching algorithm based on characteristics of DDC.Design/methodology/approach:State-of-the-art machine learning algorithms require at least 1,000 training examples per class.The complete data set at the time of research involved 143,838 records which had to be reduced to top three hierarchical levels of DDC in order to provide sufficient training data(totaling 802 classes in the training and testing sample,out of 14,413 classes at all levels).Findings:Evaluation shows that Support Vector Machine with linear kernel outperforms other machine learning algorithms as well as the string-matching algorithm on average;the string-matching algorithm outperforms machine learning for specific classes when characteristics of DDC are most suitable for the task.Word embeddings combined with different types of neural networks(simple linear network,standard neural network,1 D convolutional neural network,and recurrent neural network)produced worse results than Support Vector Machine,but reach close results,with the benefit of a smaller representation size.Impact of features in machine learning shows that using keywords or combining titles and keywords gives better results than using only titles as input.Stemming only marginally improves the results.Removed stop-words reduced accuracy in most cases,while removing less frequent words increased it marginally.The greatest impact is produced by the number of training examples:81.90%accuracy on the training set is achieved when at least 1,000 records per class are available in the training set,and 66.13%when too few records(often less than A Comparison of Approaches100 per class)on which to train are available—and these hold only for top 3 hierarchical levels(803 instead of 14,413 classes).Research limitations:Having to reduce the number of hierarchical levels to top three levels of DDC because of the lack of training data for all classes,skews the results so that they work in experimental conditions but barely for end users in operational retrieval systems.Practical implications:In conclusion,for operative information retrieval systems applying purely automatic DDC does not work,either using machine learning(because of the lack of training data for the large number of DDC classes)or using string-matching algorithm(because DDC characteristics perform well for automatic classification only in a small number of classes).Over time,more training examples may become available,and DDC may be enriched with synonyms in order to enhance accuracy of automatic classification which may also benefit information retrieval performance based on DDC.In order for quality information services to reach the objective of highest possible precision and recall,automatic classification should never be implemented on its own;instead,machine-aided indexing that combines the efficiency of automatic suggestions with quality of human decisions at the final stage should be the way for the future.Originality/value:The study explored machine learning on a large classification system of over 14,000 classes which is used in operational information retrieval systems.Due to lack of sufficient training data across the entire set of classes,an approach complementing machine learning,that of string matching,was applied.This combination should be explored further since it provides the potential for real-life applications with large target classification systems.

Multiplierless Wideband and Narrowband CIC Compensator for SDR Application

This paper presents multiplierless CIC compensator for software-defined radio (SDR) application. The compensator is composed of two simple filters with sinewave form of magnitude responses. The parameters of the design are the sinewave amplitudes expressed as powers-of-two and estimated in a way to fulfill the absolute value of the maximum passband deviation of 0.25 dB and 0.05 dB, for the wideband and narrowband compensations, respectively. The proposed compensator requires maximum nine adders. The comparisons with the methods proposed in literature show the benefits of the proposed compensator.

Search for Monic Irreducible Polynomials with Decimal Equivalents of Polynomials over Galois Field <I>GF</I>(<I>p^q</I>)

Substitution boxes or S-boxes play a significant role in encryption and de-cryption of bit level plaintext and cipher-text respectively. Irreducible Poly-nomials (IPs) have been used to construct 4-bit or 8-bit substitution boxes in many cryptographic block ciphers. In Advance Encryption Standard, the ele-ments of 8-bit S-box have been obtained from the Multiplicative Inverse (MI) of elemental polynomials (EPs) of the 1st IP over Galois field GF(28) by adding an additive element. In this paper, a mathematical method and the algorithm of the said method with the discussion of the execution time of the algorithm, to obtain monic IPs over Galois field GF(pq) have been illustrated with example. The method is very similar to polynomial multiplication of two polynomials over Galois field GF(pq) but has a difference in execution. The decimal equivalents of polynomials have been used to identify Basic Polynomials (BPs), EPs, IPs and Reducible polynomials (RPs). The monic RPs have been determined by this method and have been cancelled out to produce monic IPs. The non-monic IPs have been obtained with multiplication of α where?α∈ GF(pq)?and assume values from 2 to (p &#8722;1) to monic IPs.

The Approximation of Bosonic System by Fermion in Quantum Cellular Automaton

In one-dimensional multiparticle Quantum Cellular Automaton (QCA), the approximation of the bosonic system by fermion (boson-fermion correspondence) can be derived in a rather simple and intriguing way, where the principle to impose zero-derivative boundary conditions of one-particle QCA is also analogously used in particle-exchange boundary conditions. As a clear cut demonstration of this approximation, we calculate the ground state of few-particle systems in a box using imaginary time evolution simulation in 2nd quantization form as well as in 1st quantization form. Moreover in this 2nd quantized form of QCA calculation, we use Time Evolving Block Decimation (TEBD) algorithm. We present this demonstration to emphasize that the TEBD is most natu-rally regarded as an approximation method to the 2nd quantized form of QCA.