检索结果-南通市图书馆

A trust region algorithm for bilevel programing problems

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1998年第10期43卷 820-824页

作者： LIU Guoshan 1, HAN Jiye 2.and WANG Shouyang 3.1. Department of mathematics, beijing Normal University, beijing 100875, china 2. Institute of applied mathematics, Chinese academy of sciences, beijing 100080, china 3. Institute of Systems Science, Chi Department of mathematics Beijing Normal University Beijing China Institute of applied mathematics Chinese Academy of Sciences Beijing China Institute of Systems Science Chinese Academy of Sciences Beijing China

A trust region algorithm is proposed for solving bilevel programming problems where the lower level programming problem is a strongly convex programming problem with linear constraints. This algorithm is based on a tr... 详细信息

关键词： bilevel programming problem trust region algorithm global convergence.

Two-dimensional Riemann problems of simplified Euler equation

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1998年第6期43卷 441-444页

作者： YANG Xiaozhou 1,2.and HUANG Feimin+1 1. Institute of applied mathematics, Chinese {2. of sciences, beijing 100080, china 2. Department of mathematics, Shantou University, Guangdong 515063. china Institute of applied mathematics Chinese Academy of Sciences Beijing China Department of mathematics Shantou University Guangdong China

The two-dimensional Riemann problem of simplifed Euler equation is discussed, in which initial value contains two different constant states that are separated by a smooth curve. This problem is a natural description of realistic phenomena, but it is hard to study by conventional idea. So a new approach is proposed. Some new properties about two-dimensional rarefaction wave, shock wave and intermediate state of solutions are disclosed.

关键词： D Riemann problem implicit functions cylindrical surface pencil of cylindrical surface.

Approximation of dense-n/2.subgraph and table compression problems

在线全文

学校读者我要写书评

暂无评论

Science china mathematics 2005年第9期48卷 1223-1233页

作者： XU Dachuan~1 HAN Jiye~2.& DU Dongle~3.1. College of applied sciences,{2. University of Technology,{2. 10002.,china 2. Institute of applied mathematics,academy of mathematics and Systems Science,Chinese academy of sciences,{2. {12.,china 3. Faculty of Administration,University of New Brunswick,P.O.Box 4400,Fredericton,NB E3. 5A3.Canada College of applied sciences Beijing University of Technology Beijing 100022 China Institute of applied mathematics Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100080 China Faculty of Administration University of New Brunswick P.O. Box 4400 Fredericton NB E3B 5A3 Canada

We develop improved approximation algorithms for two NP-hard problems: the dense-n/2.subgraph and table *** on SDP relaxation and advanced rounding techniques,we first propose 0. 5982.and 0. 5970-approximation algorithms respec- tively for the dense-n/2.subgraph problem (DSP) and the table compression problem (TCP). Then we improve these bounds to 0. 62.3.and 0. 6708 respectively for DSP and TCP by adding triangle inequalities to strengthen the SDP *** results for TCP beat the 0. 5 bound of a simple greedy algorithm on this problem,and hence answer an open question of Anderson in an affirmative way.

关键词： dense-n/2.subgraph problem(DSP) table compression problem(TCP) SDP approximation ratio

A predict-correct projection method for monotone variant variational inequalities

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1998年第15期43卷 1264-1267页

作者： HAN Qiaoming 1 and HE Bingsheng 2.1. Institute of applied mathematics, Chinese {2. of sciences, beijing 100080, china 2. Department of mathematics, Nanjing University, Nanjing 2.0093. china Institute of applied mathematics Chinese Academy of Sciences Beijing China Department of mathematics Nanjing University Nanjing China

A predict_correct projection method is presented for solving monotone variant variational inequalities, which could exploit the advantages and overcome the difficulties of both explicit and implicit projection methods.

关键词： variant variational inequality explicit projection method implicit projection method predict_correct projection method.

Integrated precise orbit determination of Shenzhou IV unmanned spacecraft

在线全文

学校读者我要写书评

暂无评论

Science china(Technological sciences) 2004年第5期47卷 518-525页

作者： L Congmin1,2. GU Yidong3. LIN Baojun3.& GUO Jiong3.1. Center for Space Science and applied Research, Chinese academy of {2., beijing 100080, china 2. Graduate School of the Chinese academy of {2., beijing 10003., china 3. General Establishment of Space Science and Application, Chinese academy of {2., beijing 100080, china Correspondence should be addressed to L Congmin General Establishment of Space Science and Application Chinese Academy of Sciences

Considering the characteristic orbit of Shenzhou IV spacecraft and the advantages and disadvantages of several types of domestic orbit measurements, a scheme of IPOD is determined, which uses GPS, SLR and USB observation data jointly plus precise ionosphere corrections to GPS observation data. IPOD system and mathematic models of OD are introduced. The results of different joint OD are analyzed using true observation data, and show that radial accuracy is better than 2.m.

关键词： Shenzhou IV unmanned spacecraft integrated precise orbit determination GPS SLR USB.

A new DNA algorithm to solve graph coloring problem

在线全文

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2007年第6期17卷 733-738页

作者： Jiang Xingpeng1, Li Yin2. Meng Ya3.and Meng Dazhi2.1. National Laboratory of Pattern Recognition,Institute of Automation, Chinese academy of {3.,{2., china 2. College of applied {3., beijing University of Technology, beijing 10002., china 3. School of Science, beijing Institute of Technology, beijing 100081, china) National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing 100080 China National High Magnetic Field Laboratory Florida State University 1800 East Paul Dirac Drive Tallahassee Florida 32306 USA

Using a small quantity of DNA molecules and little experimental time to solve complex problems successfully is a goal of DNA computing. Some NP-hard problems have been solved by DNA computing with lower time complexity than conventional computing. However, this advantage often brings higher space complexity and needs a large number of DNA encoding molecules. One example is graph coloring problem. Current DNA algorithms need exponentially increasing DNA encoding strands with the growing of problem size. Here we propose a new DNA algorithm of graph coloring problem based on the proof of four-color theorem. This algorithm has good properties of needing a relatively small number of operations in polynomial time and needing a small number of DNA encoding molecules (we need only 6R DNA encoding molecules if the number of regions in a graph is R).

关键词： DNA computing NP-hard problem graph coloring problem.

On the periodic solutions of a type of differential-iterative equations

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1998年第3期43卷 204-206页

作者： GE Weigao 1, LIU Zhengrong 2.and YU Yuanhong 3.1. Department of applied mathematics, {2. Institute of Technology, {2. 100081, china 2. Department of mathematics, Yunnan University, Kunming 650091, china 3. Institute of applied mathematics, C Department of applied mathematics Beijing Institute of Technology Beijing China Department of mathematics Yunnan University Kunming China Institute of applied mathematics Chinese Academy of Sciences Beijing China

Sufficient conditions for the existence of periodic solutions to a type of nonautonomous differential_iterative equations are given.

关键词： differential_iterative equation periodic solution fixed point.

Existence of the solutions and the attractors for the large-scale atmospheric equations

在线全文

学校读者我要写书评

暂无评论

Science china Earth sciences 2006年第6期49卷 650-660页

作者： HUANG Haiyang1 & GUO Boling2.1. Department of mathematics, beijing Normal University, beijing 100875, china 2. Institute of applied Physics and Computational mathematics, beijing 100080, china Department of mathematics Beijing Normal University Beijing China Institute of applied Physics and Computational mathematics Beijing China

In this paper, firstly, the proper function space is chosen, and the proper expression of the operators is introduced such that the complex large-scale atmospheric motion equations can be described by a simple and abstract equation, by which the definition of the weak solution of the atmospheric equations is made. Secondly, the existence of the weak solution for the atmospheric equations and the steady state equations is proved by using the Galerkin method. The existence of the non-empty global attractors for the atmospheric equations in the sense of the Chepyzhov-Vishik’s definition is obtained by constructing a trajectory attractor set of the atmospheric motion equations. The result obtained here is the foundation for studying the topological structure and the dynamical behavior of the atmosphere attractors. Moreover, the methods used here are also valid for studying the other atmospheric motion models.

关键词： atmosphere equations, weak solution, trajectory attractor, global attractor, equilibrium.

The proof of FFD(L)≤11/9OPT(L) +7/9

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1997年第15期42卷 1262-1265页

作者： LI Rongheng, YUE Minyi1. Department of mathematics, Hunan Normal University, Changsha 410081, china 2. Institute of {2. mathematics, Chinese academy of sciences, beijing 100080, china Department of mathematics Hunan Normal University Changsha 410081 China Institute of applied mathematics Chinese Academy of Sciences Beijing 100080 China

THE one-dimensional bin-packing problem is defined as follows: for a given list L={p1, p2.…, Pn}, where 0i≤1 denotes the item and its size as well, we are to pack all the items in-to bins, each of which has a capaci... 详细信息

THE one-dimensional bin-packing problem is defined as follows: for a given list L={p1, p2./sub>,…, Pn}, where 0i≤1 denotes the item and its size as well, we are to pack all the items in-to bins, each of which has a capacity 1, and the goal is to minimize the number of bins *** first-fit-decreasing （FFD） algorithm is a famous approximate algorithm for the bin-pack-ing problem. The FFD algorithm first sorts all the list into non-increasing order and then pro-cesses the pieces in that order by placing each item into the first bin into which it fits.

关键词： bin-packing minimal counter-example weigtht-function FFD-algorithm.