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

Asia-Pacific International Symposium on Aerospace Technology

作者： Xu Kaichuan Wang Jianxin Zhao Zilong Wang Mingxin Army Aviat Inst Dept Helicopter Mech Engn Beijing 101123 Peoples R China

ISBN: (纸本)9787561228999

In space battle application, orbital design is the most important part;such as design for intercepting orbit, meanwhile, considering the optimization of intercepting orbit, it has very important meanings to design an intercepting orbit with minimal flight time. By the way of analytic method and using optimal algorithm, on the premise of Keplerian orbit under two-body hypothesis and one-off impulse orbit maneuver, this paper discusses design for optimal intercepting orbit with minimal flight time under constraint of the magnitude of initial velocity impulse, and gets the optimal launch point (or orbit-changing point) on initial orbit by iterative search algorithm. It gives the mathematic model and process of calculation in the paper, and by means of model simulation in three different cases, we prove that it is a simple, quick and effective arithmetic for orbital design. We believe that it would provide more reference for orbit optimal design in space application.

关键词： orbital design minimal flight time intercepting orbit optimal algorithm Keplerian orbit

来源：评论

学校读者我要写书评

暂无评论

AN optimal algorithm FOR THE MAXIMUM 2-CHAIN PROBLEM

引用

SIAM JOURNAL ON DISCRETE MATHEMATICS 1992年第2期5卷 285-304页

作者： LOU, RD SARRAFZADEH, M LEE, DT

Given a point set rho, a chain is a subset C is-contained-in-or-equal-to rho of points in which, for any two points, one is dominated by the other. A two-chain is a subset of rho that can be partitioned into two chains. A two-chain with maximum cardinality among all possible two-chains is called a maximum two-chain. This paper presents a THETA(n log n) time and THETA(n) space algorithm for finding a maximum two-chain in a point set rho, where n = \rho\. Maximum two-chain has applications in, for example, graph-theoretic problems, VLSI layout, and sequence manipulation.

关键词： POINT DOMINANCE DOMINANCE HULL MAX 2-CHAIN optimal algorithm LOWER BOUND

来源：评论

学校读者我要写书评

暂无评论

An optimal algorithm for a Special Flow Shop Problem with Infinite Buffer Capacity

An Optimal Algorithm for a Special Flow Shop Problem with In...

引用

2nd International Conference on Engineering Design and Optimization (ICEDO 2011)

作者： Wei, Qi Zhejiang Univ Ningbo Inst Technol Ningbo 315100 Zhejiang Peoples R China

ISBN: (纸本)9783037852590

In this paper, a two-machine flow shop problem with infinite buffer capacity is considered. Each of jobs is identical and has two tasks. The first task can be processed on either machine, called flexible task, while the second task must be processed on the second machine and can't be processed unless the first task has been processed. There is infinite buffer capacity between two machines. The problem is to determine the assignment of the flexible tasks to the machines for each job, with the objective of maximizing the makespan. We present an optimal algorithm for this problem.

关键词： optimal algorithm NP-hard Hybrid flow shop Scheduling

来源：评论

学校读者我要写书评

暂无评论

An Improved optimal algorithm For A Location Choice Problem

An Improved Optimal Algorithm For A Location Choice Problem

引用

1st International Conference on Networking and Digital Society

作者： Ma Ran Han Xuefeng Henan Polytech Univ Coll Math & Informat Sci Jiaozuo 454000 Peoples R China

The paper presents an improved optimal location choice in a network. The location choice model considers not only the maximum distances between the vertices but also the sum of the whole cost, which is a common proble... 详细信息

ISBN: (纸本)9780769536354

关键词： network optimal algorithm location choice problem

来源：评论

学校读者我要写书评

暂无评论

The optimal algorithm of a Two-stage Flow shop Problem with Infinite Number of Jobs

The Optimal Algorithm of a Two-stage Flow shop Problem with ...

引用

2nd International Conference on Engineering Design and Optimization (ICEDO 2011)

作者： Wei, Qi Wu, Yong Zhejiang Univ Ningbo Inst Technol Ningbo 315100 Zhejiang Peoples R China

ISBN: (纸本)9783037852590

In this paper, a two-machine two-stage flow shop with identical jobs is considered. Each of identical jobs has two tasks. The first task can be processed on either machine, called flexible task, while the second task must be processed on the second machine and can't be processed unless the first task has been processed. The problem is to determine the assignment of the flexible tasks to the machines for each job, with the objective of maximizing the throughput rate. This model is applied to the graphic programs processing which comprises data processing and graphics processing. We consider three cases regarding the capacity of the buffer between the machines with infinite number of jobs. We present optimal algorithm for each variant of the problem.

关键词： optimal algorithm Flow shop Hybrid flow shop

来源：评论

学校读者我要写书评

暂无评论

Parametric study and optimal algorithm of a simultaneous estimation in two-dimensional inverse heat conduction problem

引用

INVERSE PROBLEMS IN SCIENCE AND ENGINEERING 2008年第4期16卷 461-482页

作者： Abboudi, Said Artioukhine, Eugene UTBM Lab Syst Transports SET Dept GMC F-90010 Belfort France UFC Inst Genie Energet CREST UMR 6174FEMTO ST F-90000 Belfort France

A simultaneous estimation of two boundary conditions in a two-dimensional linear heat conduction problem is proposed by numerical approach. The aim is to estimate the evolution of the distributions of the unknown surface heat fluxes from the transient temperature histories taken with several sensors inside a two-dimensional specimen. The inverse numerical algorithm is based on the iterative regularization method and on the conjugate gradient method. Unknown functions are parametrized in the form of a cubic B-spline. The utilization of an optimal choice of the matrix of the descent parameters is at the origin of this method showing an increase in the convergence rate. The effects of the parameters of the cubic B-spline approximation, the number and the position of the sensors and the magnitude of measurement errors on the inverse solutions are discussed.

关键词： inverse problem simultaneous estimation transient conduction two-dimensional heat conduction optimal algorithm iterative regularization

来源：评论

学校读者我要写书评

暂无评论

An optimal algorithm to Resolve the Impact of Big Data in IoT Application using Bayesian Network

引用

Procedia Computer Science 2019年 163卷 603-608页

作者： Soheli Farhana Md Masum Billah Zulkhairi Mohd Yusof Kushairy Kadir UniKL MIIT 1016 Jalan Sultan Ismail 50250 Kuala Lumpur Malaysia UniKL BMI Jalan Sg. Pusu 53100 Selangor Malaysia

Internet of Things (IoT) becomes the hot cake in all technological fields. IoT applications concurrently generate the huge amount of data that need to be handled. In this paper, an optimal mechanism is proposed to handle big data for decision making. Based on the classical decision-making process in the field of Big Data, we design an adaptive knowledge-based method through IoT application. A Bayesian network model is used to manage knowledge formation in all direction for the decision-making process. Knowledge of Bayesian networks is habitually emitted as an optimal solution, where the analysis job is to locate a formation that exploits a statistically motivated score. Generally, accessible knowledge tools deal with this optimal solution by means of ordinary search methods. As it required big amount of data space, therefore it is a time consuming procedure that should be avoided. The situation becomes decisive once big data involve in searching for optimal solution. An algorithm is introduced to accomplish faster processing of optimal solution by limiting the search data space. The proposed recursive algorithm will limit the search space. The result shows that the optimal mechanism of the decision process is able to handle big data by reducing processing time, computational complexity and a higher percentage of prediction rates.

关键词： Big data optimal algorithm bayesian network impacct

来源：评论

学校读者我要写书评

暂无评论

optimal Parallel algorithm for the Knapsack Problem Without Memory Conflicts

引用

Journal of Computer Science & Technology 2004年第6期19卷 760-768页

作者： Ken-LiLi Ren-FaLi Qing-HuaLi SchoolofComputerandCommunication HunanUniversityChangsha410082P.R.China SchoolofComputerScienceandTechnology HuazhongUniversityofScienceandTechnologyWuhan430074P.R.China

The knapsack problem is well known to be NP-complete. Due to its importance in cryptosystem and in number theory, in the past two decades, much effort has been made in order to find techniques that could lead to practical algorithms with reasonable running time. This paper proposes a new parallel algorithm for the knapsack problem where the optimal merging algorithm is adopted. The proposed algorithm is based on anEREW-SIMD machine with shared memory. It is proved that the proposed algorithm is both optimal and the first without memory conflicts algorithm for the knapsack problem. The comparisons of algorithm performance show that it is an improvement over the past researches. Keywords knapsack problem - NP-complete - parallel algorithm - optimal algorithm - memory conflict Supported by the National Natural Science Foundation of China under Grant No.60273075, the National High Technology Development 863 Program of China under Grant No.863-306-ZD-11-01-06. Ken-Li Li received his B.S. and M.S. degrees in mathematics from National University of Defense Technology and Central South University in 1995 and 2000 respectively and he is now a Ph.D. candidate in computer software and theory at Huazhong University of Science and Technology. His main research interests include parallel computing and combinatorial optimization. Ren-Fa Li received his Ph.D. degree in computer software and theory at Huazhong University of Science and Technology, and he is concurrently a professor and Ph.D. supervisor in School of Computer and Communication, Human University. His main research interests include network computing. Qing-Hua Li received his M.S. degree in computer science from Huazhong University of Science and Technology in 1981, and he is concurrently a professor and Ph.D. supervisor in School of Computer Science and Technology, Huazhong University of Science and Technology. His current research interests include parallel processing, combinatorial optimization, and grid comp

关键词： knapsack problem NP-complete parallel algorithm optimal algorithm memory conflict

来源：评论

学校读者我要写书评

暂无评论

THE COMPLEXITY OF AN optimal algorithm FOR THE GENERALIZED TOWER OF HANOI PROBLEM

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1990年第1-2期36卷 1-8页

作者： VANZANTEN, AJ Department of Mathematics and Informatics Delft University of Technology BL Delft Julianalaan 132 2628 Netherlands

The Generalized Tower of Hanoi Problem is the transformation of an arbitrary initial configuration of n discs distributed among three pegs to an arbitrary final configuration, subject to the well-known Tower of Hanoi rules. The total number of disc moves in an optimal algorithm for this problem is computed, and expressed in terms of two binary numbers. A simple criterion is derived, to decide whether in an optimal algorithm the largest disc is moved once or twice. © 1990, Taylor & Francis Group, LLC. All rights reserved.

关键词： complexity optimal algorithm Tower of Hanoi problem

来源：评论

学校读者我要写书评

暂无评论

Comments on "An optimal algorithm for Testing Stuck-at Faults in Random Access Memories"

引用

IEEE Transactions on Computers 1979年第3期C-28卷 258-261页

作者： Nair IBM Thomas J. Watson Research Center Yorktown Heights NY USA

An efficient, optimal test sequence for detecting multiple stuck-at faults in random access memories (RAM's) for any decoder implementation is presented. Another algorithm which does not assume any particular wire... 详细信息

关键词： Wired Logic Behavior Arbitrary Decoder Implementation Fault Detection Multiple Stuck At Faults optimal algorithm Random Access Memories

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：