Membrane proteins are an important kind of proteins embedded in the membranes of cells and play crucial roles in living organisms, such as ion channels,transporters, receptors. Because it is difficult to determinate t...
详细信息
Membrane proteins are an important kind of proteins embedded in the membranes of cells and play crucial roles in living organisms, such as ion channels,transporters, receptors. Because it is difficult to determinate the membrane protein's structure by wet-lab experiments,accurate and fast amino acid sequence-based computational methods are highly desired. In this paper, we report an online prediction tool called Mem Brain, whose input is the amino acid sequence. Mem Brain consists of specialized modules for predicting transmembrane helices, residue–residue contacts and relative accessible surface area of a-helical membrane proteins. Mem Brain achieves aprediction accuracy of 97.9% of ATMH, 87.1% of AP,3.2 ± 3.0 of N-score, 3.1 ± 2.8 of C-score. Mem BrainContact obtains 62%/64.1% prediction accuracy on training and independent dataset on top L/5 contact prediction,respectively. And Mem Brain-Rasa achieves Pearson correlation coefficient of 0.733 and its mean absolute error of13.593. These prediction results provide valuable hints for revealing the structure and function of membrane *** Brain web server is free for academic use and available at ***/bioinf/Mem Brain/.
This paper presents a lithium-ion battery pack equalization system and method. The batteries are divided into several groups, which are connected in parallel with the bidirectional DC-DC converters respectively, and t...
详细信息
ISBN:
(纸本)9781509046584
This paper presents a lithium-ion battery pack equalization system and method. The batteries are divided into several groups, which are connected in parallel with the bidirectional DC-DC converters respectively, and the output of DC-DC converters ends are connected in series with each other as a DC bus. The scheme divides equalization of the cells into two stages: intra-group equalization and inter-group equalization, and the two stages are respectively realized by battery time-sharing-access structure and stack energy-sharing structure. Then equalization strategy of the distributed battery energy storage system under two stages is proposed, especially the Single Cell Battery Access Timing Algorithm and MPC Algorithm. The simulation results show that the proposed battery management structure and control strategy can realize fast and accurate SOC equalization.
For those who love painting but unfortunately have visual impairments, holding a paintbrush to create a work is really a difficult task. For the purpose of solving this problem, a painting navigation system for visual...
详细信息
This paper investigates how to maintain an efficient dynamic ordered set of bit strings, which is an important problem in the field of information search and information processing. Generally, a dynamic ordered set is...
详细信息
This paper investigates how to maintain an efficient dynamic ordered set of bit strings, which is an important problem in the field of information search and information processing. Generally, a dynamic ordered set is required to support 5 essential operations including search, insertion, deletion, max-value retrieval and next-larger-value retrieval. Based on previous research fruits, we present an advanced data structure named rich binary tree (RBT), which follows both the binary-search-tree property and the digital-search-tree property. Also, every key K keeps the most significant difference bit (MSDB) between itself and the next larger value among K's ancestors, as well as that between itself and the next smaller one among its ancestors. With the new data structure, we can maintain a dynamic ordered set in O(L) time. Since computers represent objects in binary mode, our method has a big potential in application. In fact, RBT can be viewed as a general-purpose data structure for problems concerning order, such as search, sorting and maintaining a priority queue. For example, when RBT is applied in sorting, we get a linear-time algorithm with regard to the key number and its performance is far better than quick-sort. What is more powerful than quick-sort is that RBT supports constant-time dynamic insertion/deletion.
A slot-fed dualband rectangular dielectric resonator antenna (DRA) for WLAN applications is investigated. ANSYS HFSS was used to study the reflection coefficient, radiation patterns and antenna gain of the dualband DR...
详细信息
作者:
Man, JingtaoZeng, ZhigangXiao, Qiang
Key Laboratory of Image Information Processing and Intelligent Control Ministry of Education of China Wuhan China
Spatial deployment of large-scale heterogeneous multi-agent systems (HMASs) over desired 2D or 3D curves is investigated in this paper. With assumption that HMASs consist of numerous first-order agents (FOAs) and seco...
详细信息
A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate...
详细信息
A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate the convergence, which can generate a DNA words set satisfying some thermodynamic and combinatorial constraints. Based on the algorithm, a software for DNA words design is developed.
Unsupervised learning methods in computer vision have achieved remarkable success, exceeding the performance of supervised learning methods. It is noteworthy that current unsupervised learning methods share certain si...
详细信息
The thesis studies the semi-global scaled edge-consensus of linear discrete-time multi-agent systems under both the directed networks and undirected networks, where the states of each edge are subject to input saturat...
详细信息
Membrane algorithms (MAs), which inherit from P systems, constitute a new parallel and distribute framework for approximate computation. In the paper, a membrane algorithm is proposed with the improvement that the i...
详细信息
Membrane algorithms (MAs), which inherit from P systems, constitute a new parallel and distribute framework for approximate computation. In the paper, a membrane algorithm is proposed with the improvement that the involved parameters can be adaptively chosen. In the algorithm, some membranes can evolve dynamically during the computing process to specify the values of the requested parameters. The new algorithm is tested on a well-known combinatorial optimization problem, the travelling salesman problem. The em-pirical evidence suggests that the proposed approach is efficient and reliable when dealing with 11 benchmark instances, particularly obtaining the best of the known solutions in eight instances. Compared with the genetic algorithm, simulated annealing algorithm, neural net-work and a fine-tuned non-adaptive membrane algorithm, our algorithm performs better than them. In practice, to design the airline network that minimize the total routing cost on the CAB data with twenty-five US cities, we can quickly obtain high quality solutions using our algorithm.
暂无评论