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

folding KINETICS OF DESIGNER PROTEINS - APPLICATION OF THE DIFFUSION-COLLISION MODEL TO A DENOVO DESIGNED 4-HELIX BUNDLE

引用

BIOPHYSICAL JOURNAL 1992年第1期63卷 296-299页

作者： YAPA, KK WEAVER, DL Department of Physics Tufts University Medford Massachusetts 02155.

A folding algorithm is described, based on the diffusion-collision model, combining static and dynamic calculational methods. The algorithm is applied to predict the basic structure and schematic folding pathways of a... 详细信息

关键词： .predict simplified designed three-dimensional microdomains static minimization atom folding kinetics folding algorithm diffusion-collision four-helix designer proteins schematic folding pathways

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On the convergence of traffic measurement and queueing analysis: A statistical-matching and queueing (SMAQ) tool

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 1997年第1期5卷 95-110页

作者： Li, SQ Hwang, CL Dept. of Electr. & Comput. Eng. Texas Univ. Austin TX USA

The analytical tool developed in this paper provides a general solution technique for integration of traffic measurement and queueing analysis, The frequency-domain approach is used to combine the advanced techniques in two areas: signal processing and queueing analysis, Essentially, signal processing techniques are used to obtain the steady-state and second-order statistics of a traffic stream. We propose a new programming method far construction of a special class of Markov chains to statistically match with each given traffic stream (or superposition of heterogeneous traffic streams). The analytical queueing solutions can therefore be obtained by the folding-algorithm based on Markov chain input modeling. Comprehensive numerical examples show the great potential of the statistical-matching and queueing (SMAQ) tool to solve measurement-based traffic management issues.

关键词： Maintenance Engineering Telecommunication Network Management Telecommunication Traffic Queueing Theory Signal Processing Statistical Analysis Telecommunication Computing Programming Environments Markov Processes Frequency Domain Analysis Traffic Measurement Traffic Queueing Analysis Statistical Matching And Queueing Tool Frequency Domain Approach Signal Processing Steady State Statistics Second Order Statistics Traffic Stream Programming Method Markov Chains Heterogeneous Traffic Streams Superposition Analytical Queueing Solutions folding algorithm Markov Chain Input Modeling Measurement Based Traffic Management Queueing Analysis Convergence Traffic Control Telecommunication Traffic Higher Order Statistics Signal Processing Steady State Statistical Distributions Signal Processing algorithms Signal Analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A matrix-analytic approach to the N-player ruin problem

引用

JOURNAL OF APPLIED PROBABILITY 2006年第3期43卷 755-766页

作者： Swan, Yvik C. Bruss, F. Thomas Univ Libre Bruxelles Dept Math B-1050 Brussels Belgium Univ Libre Bruxelles ISRO B-1050 Brussels Belgium

Consider N players, respectively owning x(1), x(2),..., x(N) monetary units, who play a sequence of games, winning from and losing to each other integer amounts according to fixed rules. The sequence stops as soon as (at least) one player is ruined. We are interested in the ruin process of these N players, i.e. in the probability that a given player is ruined first, and also in the expected ruin time. This problem is called the N-player ruin problem. In this paper, the problem is set up as a multivariate absorbing Markov chain with an absorbing state corresponding to the ruin of each player. This is then discussed in the context of phase-type distributions where each phase is represented by a vector of size N and the distribution has as many absorbing points as there are ruin events. We use this modified phase-type distribution to obtain an explicit solution to the N-player problem. We define a partition of the set of transient states into different levels, and on it give an extension of the folding algorithm (see Ye and Li (1994)). This provides an efficient computational procedure for calculating some of the key measures.

关键词： Markov process phase-type distribution hitting time hitting probability 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

来源：评论

学校读者我要写书评

暂无评论

IRfold: An RNA Secondary Structure Prediction Approach 20th

IRfold: An RNA Secondary Structure Prediction Approach

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Automatic Measurement of Linewidth Enhancement Factor Using Optical Feedback Self-mixing Interferometry

Automatic Measurement of Linewidth Enhancement Factor Using ...

引用

2nd International Symposium on Test Automation and Instrumentation

作者： Zhao Yan Yu Yanguang Ye Huiying Xi Jiangtao Zhengzhou Univ Coll Informat Engn Zhengzhou 450052 Peoples R China

ISBN: (纸本)9787506292207

This paper presents an automatic measurement method for the linewidth enhancement factor (LEF) of semiconductor lasers by folding method at moderate and strong levels of feedback. The folding method can measure LEF using the characteristic points on the optical feedback self-mixing interferometry (OFSMI) signals. The automatic algorithm proposed can locate the characteristic points, identify different kinds of OFSMI signal waveforms and produce LEF value.

关键词： Semiconductor laser sensor linewidth enhancement factor folding algorithm optical feedback self-mixing interferometry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：