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

Pure Azimuth Passive Positioning Model of UAV Based On dynamic programming

Procedia Computer Science 2024年 243卷 873-881页

作者： Zhehui Zhu Hanhan Wang College of Information Technology Shanghai Ocean University Shanghai 201306 China

In recent years, with the continuous development of electronic technology in the military field, passive positioning technology has become more and more important in the field of electronic countermeasures. At the same time, drone technology is widely used. When the drone swarm flies in formation, each drone will have its own fixed number, and the electromagnetic silence will be maintained during the flight to reduce the emission of electromagnetic wave signals and avoid the wrong information exchange between drones. The use of passive positioning technology can provide a new idea for UAV swarm orchestration queue, and through sensor technology and communication networking technology, UAV can be used as an air base station to achieve rapid positioning. Based on this idea, this paper establishes a pure azimuth passive positioning model based on the dynamic programming algorithm, and arranges UAV formations of different shapes, and studies the UAV position orchestration under different conditions.

关键词： dynamic programming algorithms Pure Azimuth Passive Localization Model UAV Formations Adjust dynamically Polar Coordinate System

来源：评论

学校读者我要写书评

暂无评论

Optimally rescheduling jobs with a Last-In-First-Out buffer

引用

JOURNAL OF SCHEDULING 2021年第6期24卷 663-680页

作者： Nicosia, Gaia Pacifici, Andrea Pferschy, Ulrich Resch, Julia Righini, Giovanni Univ Roma Tre Dipartimento Ingn Via Vasca Navale 79 I-00146 Rome Italy Univ Roma Tor Vergata Dipartimento Ingn Civile & Ingn Informat Via Politecn 1 I-00133 Rome Italy Karl Franzens Univ Graz Dept Operat & Informat Syst Univ Str 1 A-8010 Graz Austria Univ Milan Dipartimento Informat Via Celoria 18 I-20100 Milan Italy

This paper considers single-machine scheduling problems in which a given solution, i.e., an ordered set of jobs, has to be improved as much as possible by re-sequencing the jobs. The need for rescheduling may arise in different contexts, e.g., due to changes in the job data or because of the local objective in a stage of a supply chain that is not aligned with the given sequence. A common production setting entails the movement of jobs (or parts) on a conveyor. This is reflected in our model by facilitating the re-sequencing of jobs via a buffer of limited capacity accessible by a LIFO policy. We consider the classical objective functions of total weighted completion time, maximum lateness and (weighted) number of late jobs and study their complexity. For three of these problems, we present strictly polynomial-time dynamic programming algorithms, while for the case of minimizing the weighted number of late jobs NP-hardness is proven and a pseudo-polynomial algorithm is given.

关键词： Scheduling Rescheduling Sequence coordination Supply chain sustainability dynamic programming algorithms Complexity

来源：评论

学校读者我要写书评

暂无评论

Proteoform identification based on top-down tandem mass spectra with peak error corrections

引用

BRIEFINGS IN BIOINFORMATICS 2022年第2期23卷 bbab599-bbab599页

作者： Zhan, Zhaohui Wang, Lusheng City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

In this paper, we study the problem for finding complex proteoforms from protein databases based on top-down tandem mass spectrum data. The main difficulty to solve the problem is to handle the combinatorial explosion of various alterations on a protein. To overcome the combinatorial explosion of various alterations on a protein, the problem has been formulated as the alignment problem of a proteoform mass graph (PMG) and a spectrum mass graph (SMG). The other important issue is to handle mass errors of peaks in the input spectrum. In previous methods, an error tolerance value is used to handle the mass differences between the matched consecutive nodes/peaks in PMG and SMG. However, such a way to handle mass error can not guarantee that the mass difference between any pairs of nodes in the alignment is approximately the same for both PMG and SMG. It may lead to large error accumulation if positive (or negative) errors occur consecutively for a large number of consecutive matched node pairs. The problem is severe so that some existing software packages include a step to further refine the alignments. In this paper, we propose a new model to handle the mass errors of peaks based on the formulation of the PMG and SMG. Note that the masses of sub-paths on the PMG are theoretical and suppose to be accurate. Our method allows each peak in the input spectrum to have a predefined error range. In the alignment of PMG and SMG, we need to give a correction of the mass for each matched peak within the predefined error range. After the correction, we impose that the mass between any two (not necessarily consecutive) matched nodes in the PMG is identical to that of the corresponding two matched peaks in the SMG. Intuitively, this kind of alignment is more accurate. We design an algorithm to find a maximum number of matched node and peak pairs in the two (PMG and SMG) mass graphs under the new constraint. The obtained alignment can show matched node and peak pairs as well as the c

关键词： top-down tandem mass spectra proteoform identification peak error correction dynamic programming algorithms

来源：评论

学校读者我要写书评

暂无评论

FINITE- AND INFINITE-HORIZON SHAPLEY GAMES WITH NONSYMMETRIC PARTIAL OBSERVATION

引用

SIAM JOURNAL ON CONTROL AND OPTIMIZATION 2015年第6期53卷 3584-3619页

作者： Basu, Arnab Stettner, Lukasz Indian Inst Management Bangalore Quantitat Methods & Informat Syst Area Bangalore 560076 Karnataka India Polish Acad Sci Inst Math Dept Probabil Theory & Math Finance PL-00656 Warsaw Poland Vistula Univ Warsaw Poland

We consider asymmetric partially observed Shapley-type finite-horizon and infinite-horizon games where the state, a controlled Markov chain {X-t}, is not observable to one player (minimizer) who observes only a state-dependent signal {Y-t}. The maximizer observes both. The minimizer is informed of the maximizer's action after (before) choosing his control in the MINMAX (MAXMIN) game. A nontrivial open problem in such situations is how the minimizer can use this knowledge to update his belief about {X-t}. To address this, the maximizer uses off-line control functions which are known to the minimizer. Using these, novel control-parameterized nonlinear filters are constructed which are proved to characterize the conditional distribution of the full path of {X-t}. Using these filters, recursive algorithms are developed which show that saddle-points exist in both behavioral and Markov strategies for the finite-horizon case in both games. These algorithms are extended to prove saddle-points in Markov strategies for both games for the infinite-horizon case. A counterexample shows that the finite-horizon MINMAX value may be greater than the MAXMIN value. We show that the asymptotic limits of these values converge to the corresponding MINMAX and MAXMIN saddle-point values in the infinite-horizon setup. Another counterexample shows that the uniform value need not exist.

关键词： nonsymmetric partially observed game parameterized filtering zero-sum stochastic game finite-horizon and infinite-horizon discounted cost dynamic programming algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparison of HSRNAFold and RNAFold algorithms for RNA Secondary Structure Prediction

Comparison of HSRNAFold and RNAFold Algorithms for RNA Secon...

引用

IEEE Region 10 Conference 2009

作者： Mohsen, Abdulqader M. Khader, Ahamad Tajudin Ramachandram, Dhanesh Univ Sains Malaysia Sch Comp Sci George Town 11800 Malaysia

ISBN: (纸本)9781424445462

Ribonucleic Acid (RNA) has important structural and functional roles in the cell and plays roles in many stages of protein synthesis. The structure of RNA largely determines its function. Current physical methods for structure determination are time-consuming and expensive, thus the methods for the computational prediction of structure are necessary. Various algorithms that have been used for RNA structure prediction based in minimum free energy include dynamic programming (DP) and meta heuristic algorithms. One of the most recent meta heuristic algorithms is Musician's behavior-inspired harmony search (HS) algorithm that has been successful in numerous complex optimization problems. This paper builds on the previous work of the harmony search algorithm (HSRNAFold) which was used to find the RNA secondary structure with minimum free energy. In this paper, the accuracy of prediction is compared to the dynamic programming technique RNAFold. The results show that HSRNAFold is able to predict more accurate structures than RNAFold for all test sequences.

关键词： Meta heuristic algorithms dynamic programming algorithms RNA folding Minimum Free Energy

来源：评论

学校读者我要写书评

暂无评论

Stochastic scheduling to minimize expected maximum lateness

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2008年第1期190卷 103-115页

作者： Wu, Xianyi Zhou, Xian Hong Kong Polytech Univ Dept Appl Math Hong Kong Hong Kong Peoples R China E China Normal Univ Dept Stat Shanghai 200062 Peoples R China

This paper is concerned with the problems in scheduling a set of jobs associated with random due dates on a single machine so as to minimize the expected maximum lateness in stochastic environment. This is a difficult problem and few efforts have been reported on its solution in the literature. In this paper, we first derive a deterministic equivalent to the expected maximum lateness and then propose a dynamic programming algorithm to obtain the optimal solutions. The procedures to compute optimal solutions are initially developed in the case of deterministic processing times, and then extended to stochastic processing times following arbitrary probability distributions. Moreover, several heuristic rules are suggested to compute near-optimal solutions, which are shown to be highly efficient and accurate by computer-based experiments. (C) 2007 Elsevier B.V. All rights reserved.

关键词： stochastic scheduling due dates expected maximum lateness dynamic programming algorithms

来源：评论

学校读者我要写书评

暂无评论

Parallel pattern-based systems for computational biology: A case study

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2006年第8期17卷 750-763页

作者： Liu, Weiguo Schmidt, Bertil Nanyang Technol Univ Sch Comp Engn Singapore 639798 Singapore

Computational biology research is now faced with the burgeoning number of genome data. The rigorous postprocessing of this data requires an increased role for high-performance computing ( HPC). Because the development of HPC applications for computational biology problems is much more complex than the corresponding sequential applications, existing traditional programming techniques have demonstrated their inadequacy. Many high level programming techniques, such as skeleton and pattern-based programming, have therefore been designed to provide users new ways to get HPC applications without much effort. However, most of them remain absent from the mainstream practice for computational biology. In this paper, we present a new parallel pattern-based system prototype for computational biology. The underlying programming techniques are based on generic programming, a programming technique suited for the generic representation of abstract concepts. This allows the system to be built in a generic way at application level and, thus, provides good extensibility and flexibility. We show how this system can be used to develop HPC applications for popular computational biology algorithms and lead to significant runtime savings on distributed memory architectures.

关键词： high-performance computational biology dynamic programming algorithms hierarchical parallel genetic algorithms parallel patterns generic programming

来源：评论

学校读者我要写书评

暂无评论

Survey of biological high performance computing: algorithms, implementations and outlook research

Survey of biological high performance computing: Algorithms,...

引用

19th IEEE Canadian Conference on Electrical and Computer Engineering

作者： Hireche, Nasreddine Langlois, J. M. Pierre Nicolescu, Gabriela Ecole Polytech Dept Gen Informat Montreal PQ H3C 3A7 Canada

ISBN: (纸本)9781424400379

During recent years there has been an explosive growth of biological data coming from genome projects, proteomics, protein structure determination, and the rapid expansion in digitization of patient biological data. Powerful computational techniques are required to understand and analyze biological information encoded by DNA sequences, which are frequently compared and searched for matching or near-matching patterns. Comparison of DNA sequences and genes can be useful to investigate the common functionalities of the corresponding organisms and to get a better understanding of how specific genes or groups of genes are organized. This kind of similarity calculation is known as sequence alignment and its objective is to identify similarities between subsequences of strings. Gene sequence alignment is one such problem that serves as an initial step in many of the problems in bioinformatics. Solving computational biology problems can be accelerated by algorithmic improvements or with the help of high-performance computing architectures. Such architectures include superscalar uniprocessors, parallel systems and dedicated hardware implementations of algorithms. FPGAs have emerged as high-performance computing accelerators, capable of implementing massively parallelized versions of computationally intensive algorithms. Their reprogrammability allows different algorithm-specific computing architectures to be implemented using the same hardware resource. In this article we provide a state of the art review for this field of research. We identify specific algorithmic problems and how hardware architectures can be designed to solve them. We present systems recently reported, describe their main features, and provide a comparison between them. Finally, we offer some directions for future investigations.

关键词： DNA sequences alignment dynamic programming algorithms accelerators FPGAs

来源：评论

学校读者我要写书评

暂无评论

Fast algorithm for the metric-space analysis of simultaneous responses of multiple single neurons

引用

JOURNAL OF NEUROSCIENCE METHODS 2003年第2期124卷 175-179页

作者： Aronov, D Columbia Univ Dept Sci Biol New York NY 10027 USA

Spike train metrics quantify the notion of dissimilarity, or distance, between spike trains and between multineuronal responses (J. Neurophysiol. 76 (1996) 13 10, Network 8 (1997) 127). We present a new algorithm for the implementation of a metric based on the timing of individual spikes and on their neurons of origin. This algorithm surpasses the earlier approach in speed by a factor that grows exponentially with the number of neurons, substantially extending the applicability of metric space methods to the study of coding in larger neuronal populations. (C) 2003 Elsevier Science B.V. All rights reserved.

关键词： spike trains multineuronal analysis metric spaces dynamic programming algorithms

来源：评论

学校读者我要写书评

暂无评论

SUCCESSFUL PROTEIN FOLD RECOGNITION BY OPTIMAL SEQUENCE THREADING VALIDATED BY RIGOROUS BLIND TESTING

引用

PROTEINS-STRUCTURE FUNCTION AND GENETICS 1995年第3期23卷 387-397页

作者： JONES, DT MILLER, RT THORNTON, JM UNIV LONDON UNIV COLL DEPT BIOCHEM & MOLEC BIOLBIOMOLEC STRUCT & MODELLING UNITLONDON WC1E 6BTENGLAND NATL INST MED RES MATH BIOL LABLONDON NW7 1AAENGLAND

Analysis of the results of the recent protein structure prediction experiment for our method shows that we achieved a high level of success, Of the 18 available prediction targets of known structure, the assessors have identified 11 chains which either entirely match a previously known fold, or which partially match a substantial region of a known fold, Of these 11 chains, we made predictions for 9, and correctly assigned the folds in 5 cases, We have also identified a further 2 chains which also partially match known folds, and both of these were correctly predicted, The success rate for our method under blind testing is therefore 7 out of 11 chains, A further 2 folds could have easily been recognized but failed due to either overzealous filtering of potential matches, or to simple human error on our part. One of the two targets for which we did not submit a prediction, prosubtilisin, would not have been recognized by our usual criteria, but even in this case, it is possible that a correct prediction could have been made by considering a combination of pairwise energy and solvation energy Z-scores. Inspection of the threading alignments for the (alpha beta)(8) barrels provides clues as to how fold recognition by threading works, in that these folds are recognized by parts rather than as a whole. The prospects for developing sequence threading technology further is discussed. (C) 1995 Wiley-Liss, Inc.

关键词： PROTEIN STRUCTURE PREDICTION THREADING PROTEIN SEQUENCE ANALYSIS PROTEIN FOLDING COMPUTATIONAL METHODS dynamic programming algorithms

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：