• Title/Summary/Keyword: Best basis

Search Result 873, Processing Time 0.026 seconds

A Study on the Improvement of Wavelet-Based Best-Basis Algorithm for Image Compression (영상압축을 위한 웨이브릿 기반 Best-Basis 알고리즘의 개선에 관한 연구)

  • 안종구;추형석;박제선
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.10
    • /
    • pp.591-597
    • /
    • 2003
  • In this paper, a best-basis selection algorithm that improves the performance of the coding gains and the computational complexity is proposed. The proposed algorithm limits the computational complexity according to the resolved threshold value and decomposes the parent subbands by using the top-down tree search and the relative energy between the parent subbands and the child subbands. For the experiments of the proposed algorithm, the bit-rates, the peak signal-to-noise ratio (PSNR), and the reconstructed images are presented by using the Quad-tree coder. The result of the proposed algorithm is compared to that of DWT algorithm using the Quad-tree coder for a set of standard test images. In addition, the result of the proposed algorithm is compared to that of JPEG-2000 algorithm and that of S+P algorithm.

Testing for Lack of Fit via the Generalized Neyman Smooth Test

  • Lee, Geung-Hee
    • Journal of the Korean Statistical Society
    • /
    • v.27 no.3
    • /
    • pp.305-318
    • /
    • 1998
  • Smoothing tests based on an L$_2$ error between a truncated courier series estimator and a true function have shown good powers for a wide class of alternatives, These tests have the same form of the Neyman smooth test whose performance depends on the selected order, a basis, the farm of estimators. We construct flexible data driven Neyman smooth tests by changing a basis, combining model selection criteria and different series estimators. A simulation study shows that the generalized Neyman smooth test with the best basis provides good power for a wider class of alternatives compared with other data driven Neyman smooth tests based on a fixed form of estimator, a fixed basis and a fixed criterion.

  • PDF

Application of neural networks and an adapted wavelet packet for generating artificial ground motion

  • Asadi, A.;Fadavi, M.;Bagheri, A.;Ghodrati Amiri, G.
    • Structural Engineering and Mechanics
    • /
    • v.37 no.6
    • /
    • pp.575-592
    • /
    • 2011
  • For seismic resistant design of critical structures, a dynamic analysis, either response spectrum or time history is frequently required. Owing to the lack of recorded data and the randomness of earthquake ground motion that may be experienced by structure in the future, usually it is difficult to obtain recorded data which fit the requirements (site type, epicenteral distance, etc.) well. Therefore, the artificial seismic records are widely used in seismic designs, verification of seismic capacity and seismic assessment of structures. The purpose of this paper is to develop a numerical method using Artificial Neural Network (ANN) and wavelet packet transform in best basis method which is presented for the decomposition of artificial earthquake records consistent with any arbitrarily specified target response spectra requirements. The ground motion has been modeled as a non-stationary process using wavelet packet. This study shows that the procedure using ANN-based models and wavelet packets in best-basis method are applicable to generate artificial earthquakes compatible with any response spectra. Several numerical examples are given to verify the developed model.

Cytosolic domain regulates the calcium sensitivity and surface expression of BEST1 channels in the HEK293 cells

  • Kwon Woo Kim;Junmo Hwang;Dong-Hyun Kim;Hyungju Park;Hyun-Ho Lim
    • BMB Reports
    • /
    • v.56 no.3
    • /
    • pp.172-177
    • /
    • 2023
  • BEST family is a class of Ca2+-activated Cl- channels evolutionary well conserved from bacteria to human. The human BEST paralogs (BEST1-BEST4) share significant amino acid sequence homology in the N-terminal region, which forms the transmembrane helicases and contains the direct calcium-binding site, Ca2+-clasp. But the cytosolic C-terminal region is less conserved in the paralogs. Interestingly, this domain-specific sequence conservation is also found in the BEST1 orthologs. However, the functional role of the C-terminal region in the BEST channels is still poorly understood. Thus, we aimed to understand the functional role of the C-terminal region in the human and mouse BEST1 channels by using electrophysiological recordings. We found that the calcium-dependent activation of BEST1 channels can be modulated by the C-terminal region. The C-terminal deletion hBEST1 reduced the Ca2+-dependent current activation and the hBEST1-mBEST1 chimera showed a significantly reduced calcium sensitivity to hBEST1 in the HEK293 cells. And the C-terminal domain could regulate cellular expression and plasma membrane targeting of BEST1 channels. Our results can provide a basis for understanding the C-terminal roles in the structure-function of BEST family proteins.

Low Space Complexity Bit-Parallel Shifted Polynomial Basis Multipliers using Irreducible Trinomials (삼항 기약다항식 기반의 저면적 Shifted Polynomial Basis 비트-병렬 곱셈기)

  • Chang, Nam-Su;Kim, Chang-Han
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.5
    • /
    • pp.11-22
    • /
    • 2010
  • Recently, Fan and Dai introduced a Shifted Polynomial Basis and construct a non-pipeline bit-parallel multiplier for $F_{2^n}$. As the name implies, the SPB is obtained by multiplying the polynomial basis 1, ${\alpha}$, ${\cdots}$, ${\alpha}^{n-1}$ by ${\alpha}^{-\upsilon}$. Therefore, it is easy to transform the elements PB and SPB representations. After, based on the Modified Shifted Polynomial Basis(MSPB), SPB bit-parallel Mastrovito type I and type II multipliers for all irreducible trinomials are presented. In this paper, we present a bit-parallel architecture to multiply in SPB. This multiplier have a space complexity efficient than all previously presented architecture when n ${\neq}$ 2k. The proposed multiplier has more efficient space complexity than the best-result when 1 ${\leq}$ k ${\leq}$ (n+1)/3. Also, when (n+2)/3 ${\leq}$ k < n/2 the proposed multiplier has more efficient space complexity than the best-result except for some cases.

A comparative study in Bayesian semiparametric approach to small area estimation

  • Heo, Simyoung;Kim, Dal Ho
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.5
    • /
    • pp.1433-1441
    • /
    • 2016
  • Small area model provides reliable and accurate estimations when the sample size is not sufficient. Our dataset has an inherent nonlinear pattern which signicantly affects our inference. In this case, we could consider semiparametric models such as truncated polynomial basis function and radial basis function. In this paper, we study four Bayesian semiparametric models for small areas to handle this point. Four small area models are based on two kinds of basis function and different knots positions. To evaluate the different estimates, four comparison measurements have been employed as criteria. In these comparison measurements, the truncated polynomial basis function with equal quantile knots has shown the best result. In Bayesian calculation, we use Gibbs sampler to solve the numerical problems.

Low-Power and Low-Hardware Bit-Parallel Polynomial Basis Systolic Multiplier over GF(2m) for Irreducible Polynomials

  • Mathe, Sudha Ellison;Boppana, Lakshmi
    • ETRI Journal
    • /
    • v.39 no.4
    • /
    • pp.570-581
    • /
    • 2017
  • Multiplication in finite fields is used in many applications, especially in cryptography. It is a basic and the most computationally intensive operation from among all such operations. Several systolic multipliers are proposed in the literature that offer low hardware complexity or high speed. In this paper, a bit-parallel polynomial basis systolic multiplier for generic irreducible polynomials is proposed based on a modified interleaved multiplication method. The hardware complexity and delay of the proposed multiplier are estimated, and a comparison with the corresponding multipliers available in the literature is presented. Of the corresponding multipliers, the proposed multiplier achieves a reduction in the hardware complexity of up to 20% when compared to the best multiplier for m = 163. The synthesis results of application-specific integrated circuit and field-programmable gate array implementations of the proposed multiplier are also presented. From the synthesis results, it is inferred that the proposed multiplier achieves low power consumption and low area complexitywhen compared to the best of the corresponding multipliers.

Intelligent Android Malware Detection Using Radial Basis Function Networks and Permission Features

  • Abdulrahman, Ammar;Hashem, Khalid;Adnan, Gaze;Ali, Waleed
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.6
    • /
    • pp.286-293
    • /
    • 2021
  • Recently, the quick development rate of apps in the Android platform has led to an accelerated increment in creating malware applications by cyber attackers. Numerous Android malware detection tools have utilized conventional signature-based approaches to detect malware apps. However, these conventional strategies can't identify the latest apps on whether applications are malware or not. Many new malware apps are periodically discovered but not all malware Apps can be accurately detected. Hence, there is a need to propose intelligent approaches that are able to detect the newly developed Android malware applications. In this study, Radial Basis Function (RBF) networks are trained using known Android applications and then used to detect the latest and new Android malware applications. Initially, the optimal permission features of Android apps are selected using Information Gain Ratio (IGR). Appropriately, the features selected by IGR are utilized to train the RBF networks in order to detect effectively the new Android malware apps. The empirical results showed that RBF achieved the best detection accuracy (97.20%) among other common machine learning techniques. Furthermore, RBF accomplished the best detection results in most of the other measures.

A Comparative Study of 3D DWT Based Space-borne Image Classification for Differnet Types of Basis Function

  • Yoo, Hee-Young;Lee, Ki-Won;Kwon, Byung-Doo
    • Korean Journal of Remote Sensing
    • /
    • v.24 no.1
    • /
    • pp.57-64
    • /
    • 2008
  • In the previous study, the Haar wavelet was used as the sole basis function for the 3D discrete wavelet transform because the number of bands is too small to decompose a remotely sensed image in band direction with other basis functions. However, it is possible to use other basis functions for wavelet decomposition in horizontal and vertical directions because wavelet decomposition is independently performed in each direction. This study aims to classify a high spatial resolution image with the six types of basis function including the Haar function and to compare those results. The other wavelets are more helpful to classify high resolution imagery than the Haar wavelet. In overall accuracy, the Coif4 wavelet has the best result. The improvement of classification accuracy is different depending on the type of class and the type of wavelet. Using the basis functions with long length could be effective for improving accuracy in classification, especially for the classes of small area. This study is expected to be used as fundamental information for selecting optimal basis function according to the data properties in the 3D DWT based image classification.

RESEARCH OF THE BEST TIMING FOR GOVERNMENT'S TERMINATION OF FREEWAY REPAIR WORK CONTRACT

  • Jin-Fang Shr;Da-Jung Chang
    • International conference on construction engineering and project management
    • /
    • 2005.10a
    • /
    • pp.699-704
    • /
    • 2005
  • Normally, monetary penalties for breach of agreement will be stipulated in the contract. The contractor parties, who fail to fulfill the agreement, are required to pay the other parties a certain amount or proportion of money as a fine. However, it is worth our study - whether or not the scope of monetary penalty implementation and bases for determination of a fine will cover the losses of social and administrative costs incurred by the interruption of the contract. This research is about the best timing for government to cancel the freeway repair work contracts. Under the goal of the maximum social welfare, the limitation of government spending for the social and administrative costs invoked by interruption of contracts will have to be considered to attain the best timing of contracts' suspension or deferment. According to the factors of social and administrative costs, the best time point is calculated to reduce the loss of the aforesaid costs, which can also be used as theoretical basis for the future road-widening construction at home.

  • PDF