检索结果-内蒙古大学图书馆

20th International Conference on Artificial Intelligence Applications and Innovations (AIAI)

作者： Hurst, David Iliopoulos, Costas S. Lim, Zara Moraru, Ionut Kings Coll London Dept Informat London England Univ Lincoln Lincoln Inst Agrifood Technol Lincoln England

ISBN: (纸本)9783031632136;9783031632112;9783031632105

Ribonucleic acid (RNA) sequences can be viewed as an ordered list of symbols representing the component nucleobases of the RNA sequence also known as its primary structure. The prediction of an RNA's secondary structure from its primary structure involves predicting which of its bases are most likely to pair. Computing the likelihood of each pair to obtain the set of pairings with the highest cumulative probability is computationally intractable. We propose a new approach, IRfold, which considers possible base pairings across secondary structures known as inverted repeats (IRs) and composes a secondary structure prediction. Our approach identifies the set of minimal thermodynamic free energy IRs that satisfies empirically determined thermodynamic and steric constraints. The proposed method is implemented as a constraint programming problem, which is benchmarked against state-of-the-art secondary structure prediction approaches on the bpRNA-1m dataset. Our results yield promising initial outcomes, and we discuss potential avenues for further investigation.

关键词： folding algorithm Minimum Free Energy Secondary Structure Integer Linear Programming

来源：评论

学校读者我要写书评

暂无评论

Noise Reduction for Digital Communications—The Masterpiece, a Modified Costas Loop

引用

Circuits and Systems 2020年第6期11卷 57-64页

作者： János Ladvánszky Retired from Ericsson Hungary Budapest Hungary

An efficient way of noise reduction has been presented: A modified Costas loop called as Masterpiece. The basic version of the Costas loop has been developed for SSB SC demodulation, but the same circuit can be applied for QAM (quadrature amplitude modulation) demodulation as well. Noise sensitivity of the basic version has been decreased. One trick is the transformation of the real channel input into complex signal, the other one is the application of our folding algorithm. The result is that the Masterpiece provides a 4QAM symbol error rate (SER) of 6 × 10⁻⁴ for input signal to noise ratio (SNR) of −1 dB. In this paper, an improved version of the original Masterpiece is introduced. The complex channel input signal is normalized, and rotational average is applied. The 4QAM result is SER of 3 × 10⁻⁴ for SNR of −1 dB. At SNR of 0 dB, the improved version produces 100 times better SER than that the original Costas loop does. In our times, this topic has a special importance because by application of our Masterpiece, all dangerous field strengths from 5G and WiFi, could be decreased by orders of magnitude. The Masterpiece can break the Shannon formula.

关键词： Noise Symbol Error Rate QAM Costas Loop Hilbert Filter folding algorithm

来源：评论

学校读者我要写书评

暂无评论

Noise reduction for digital communications - A modified Costas loop

INFOCOMMUNICATIONS JOURNAL

引用

INFOCOMMUNICATIONS JOURNAL 2020年第4期12卷 2-5页

作者： Ladvanszky, Janos Ericsson Hungary Budapest Hungary

An efficient way of noise reduction has been presented: A modified Costas loop called as Masterpiece. The basic version of the Costas loop has been developed for SSB SC demodulation, but the same circuit can be applied for QAM demodulation as well. Noise sensitivity of the basic version has been decreased. One trick is the transformation of the real channel input into complex signal, the other one is the application of our folding algorithm. The result is that the Masterpiece provides a 4QAM symbol error rate (SER) of 6*10(-4) for input signal to noise ratio (SNR) of -1 dB. In this paper, an improved version of the original Masterpiece is introduced. The complex channel input signal is normalized, and rotational average is applied. The 4QAM result is SER of 3*10(-4) for SNR of -1 dB. At SNR of 0 dB, the improved version produces 100 times better SER than that the original Costas loop does.

关键词： noise symbol error rate QAM Costas loop Hilbert filter folding algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Color Image Encryption algorithm Based on Quantum Chaos Sequence

引用

3D RESEARCH 2017年第1期8卷 1-13页

作者： Liu, Hui Jin, Cong Cent China Normal Univ Sch Comp Wuhan 430079 Hubei Peoples R China

In this paper, a novel algorithm of image encryption based on quantum chaotic is proposed. The keystreams are generated by the two-dimensional logistic map as initial conditions and parameters. And then general Arnold scrambling algorithm with keys is exploited to permute the pixels of color components. In diffusion process, a novel encryption algorithm, folding algorithm, is proposed to modify the value of diffused pixels. In order to get the high randomness and complexity, the two-dimensional logistic map and quantum chaotic map are coupled with nearest-neighboring coupled-map lattices. Theoretical analyses and computer simulations confirm that the proposed algorithm has high level of security.

关键词： Image encryption Arnold scrambling folding algorithm Quantum chaotic map Twodimensional logistic map

来源：评论

学校读者我要写书评

暂无评论

Compressive measurement and feature reconstruction method for autonomous star trackers

引用

OPTICS AND LASER TECHNOLOGY 2016年 86卷 103-114页

作者： Yin, Hang Yan, Ye Song, Xin Yang, Yueneng Natl Univ Def Technol Coll Aerosp Sci & Engn Changsha 410073 Hunan Peoples R China

Compressive sensing (CS) theory provides a framework for signal reconstruction using a sub-Nyquist sampling rate. CS theory enables the reconstruction of a signal that is sparse or compressible from a small set of measurements. The current CS application in optical field mainly focuses on reconstructing the original image using optimization algorithms and conducts data processing in full-dimensional image, which cannot reduce the data processing rate. This study is based on the spatial sparsity of star image and proposes a new compressive measurement and reconstruction method that extracts the star feature from compressive data and directly reconstructs it to the original image for attitude determination. A pixel-based folding model that preserves the star feature and enables feature reconstruction is presented to encode the original pixel location into the superposed space. A feature reconstruction method is then proposed to extract the star centroid by compensating distortions and to decode the centroid without reconstructing the whole image, which reduces the sampling rate and data processing rate at the same time. The statistical results investigate the proportion of star distortion and false matching results, which verifies the correctness of the proposed method. The results also verify the robustness of the proposed method to a great extent and demonstrate that its performance can be improved by sufficient measurement in noise cases. Moreover, the result on real star images significantly ensures the correct star centroid estimation for attitude determination and confirms the feasibility of applying the proposed method in a star tracker. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Compressive sensing Star tracker folding algorithm Centroid extraction Compressive feature reconstruction

来源：评论

学校读者我要写书评

暂无评论

Nonconvex cases for carpenter's rulers

引用

THEORETICAL COMPUTER SCIENCE 2015年 586卷 12-25页

作者： Chen, Ke Dumitrescu, Adrian Univ Wisconsin Milwaukee Dept Comp Sci Milwaukee WI 53211 USA

We consider the carpenter's ruler folding problem in the plane, i.e., finding a minimum area shape with diameter 1 that accommodates foldings of any ruler whose longest link has length 1. An upper bound of pi/3-root 3/4 = 0.614... and a lower bound of root 10+2 root 5/8 = 0.475... are known for convex cases. We generalize the problem to simple nonconvex cases: in this setting we improve the upper bound to 0.583 and establish the first lower bound of 0.073. A variation is to consider rulers with at most k links. The current best convex upper bounds are (about) 0.486 for k= 3, 4 and pi/6 = 0.523... for k = 5, 6. These bounds also apply to nonconvex cases. We derive a better nonconvex upper bound of 0.296 for k= 3, 4. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Carpenter's ruler Universal case folding algorithm

来源：评论

学校读者我要写书评

暂无评论

Effective browsing of image search results via diversified visual summarization by clustering and refining clusters

引用

SIGNAL IMAGE AND VIDEO PROCESSING 2014年第4期8卷 699-721页

作者： Alamdar, Fatemeh Keyvanpour, Mohammad Reza Alzahra Univ Dept Comp Engn Tehran Iran

The unprecedented growth in applications making use of digital images and multimedia references raised the requirement for image and topic search. Systematic processing of this information is a basic prerequisite for effective analysis of this information, as well as organization and management of it. Likewise, large collections of images are available on the Web, and many search engines provide the possibility of Web image searching based on the keywords. However, there are some problems in finding the desirable image according to the user needs. These problems include inexpressiveness of queries in description of user requirement, large number of irrelevant images to the intended search, lack of summarization, time-consuming review of overall images and lack of diversity. Clustering of image search results can be an efficient solution in solving these problems. In this work, several folding-based algorithms have been proposed for clustering of image search results. In these algorithms, the efficiency, in comparison with folding algorithm, is improved through a more effective selection of cluster's representatives, fuzziness, weight and utilization of hierarchical algorithm preferences. In the represented system, in order to fit clusters with data more appropriately, an algorithm is proposed for refining the clusters. The proposed clustering causes a more convenient task in retrieval process for the user and also causes the efficient retrieval of images. According to the experiences, the proposed method improves the acceptable precision of image clustering.

关键词： Image clustering folding algorithm Feature extraction Refining of clusters Visual diversity Effective browsing Image search engine

来源：评论

学校读者我要写书评

暂无评论

Nonconvex Cases for Carpenter's Rulers

Nonconvex Cases for Carpenter's Rulers

引用

7th International Conference on Fun with algorithms

作者： Chen, Ke Dumitrescu, Adrian Univ Wisconsin Dept Comp Sci Milwaukee WI 53201 USA

ISBN: (纸本)9783319078908;9783319078892

关键词： Carpenter's ruler universal case folding algorithm

来源：评论

学校读者我要写书评

暂无评论

Segment assembly, structure alignment and iterative simulation in protein structure prediction

引用

BMC BIOLOGY 2013年第1期11卷 44-44页

作者： Zhang, Yang Skolnick, Jeffrey Univ Michigan Dept Computat Med & Bioinformat Ann Arbor MI 48109 USA Georgia Inst Technol Sch Biol Ctr Study Syst Biol Atlanta GA 30318 USA

Doc number: 44

关键词： Protein Data Bank Structure Alignment Protein Structure Prediction Template Identification folding algorithm

来源：评论

学校读者我要写书评

暂无评论

ViennaRNA Package 2.0

引用

algorithmS FOR MOLECULAR BIOLOGY 2011年第1期6卷 26-26页

作者： Lorenz, Ronny Bernhart, Stephan H. Siederdissen, Christian Hoener Zu Tafer, Hakim Flamm, Christoph Stadler, Peter F. Hofacker, Ivo L. Univ Vienna Inst Theoret Chem & Struct Biol A-1090 Vienna Austria Univ Leipzig Bioinformat Grp Dept Comp Sci D-04107 Leipzig Germany Univ Leipzig Interdisciplinary Ctr Bioinformat D-04107 Leipzig Germany Univ Copenhagen Ctr Noncoding RNA Technol & Hlth DK-1870 Frederiksberg C Denmark Max Planck Inst Math Sci D-04103 Leipzig Germany Fraunhofer Inst Cell Therapy & Immunol D-04103 Leipzig Germany Santa Fe Inst Santa Fe NM 87501 USA Univ Vienna Res Grp Bioinformat & Computat Biol Fac Comp Sci A-1090 Vienna Austria

Background: Secondary structure forms an important intermediate level of description of nucleic acids that encapsulates the dominating part of the folding energy, is often well conserved in evolution, and is routinely used as a basis to explain experimental findings. Based on carefully measured thermodynamic parameters, exact dynamic programming algorithms can be used to compute ground states, base pairing probabilities, as well as thermodynamic properties. Results: The ViennaRNA Package has been a widely used compilation of RNA secondary structure related computer programs for nearly two decades. Major changes in the structure of the standard energy model, the Turner 2004 parameters, the pervasive use of multi-core CPUs, and an increasing number of algorithmic variants prompted a major technical overhaul of both the underlying RNAlib and the interactive user programs. New features include an expanded repertoire of tools to assess RNA-RNA interactions and restricted ensembles of structures, additional output information such as centroid structures and maximum expected accuracy structures derived from base pairing probabilities, or z-scores for locally stable secondary structures, and support for input in fasta format. Updates were implemented without compromising the computational efficiency of the core algorithms and ensuring compatibility with earlier versions. Conclusions: The ViennaRNA Package 2.0, supporting concurrent computations via OpenMP, can be downloaded from http://***/RNA.

关键词： Partition Function Minimum Free Energy Matthews Correlation Coefficient Consensus Structure folding algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：