英语人>网络例句>programming 相关的网络例句
programming相关的网络例句

查询词典 programming

与 programming 相关的网络例句 [注:此内容来源于网络,仅供参考]

As a result of analyzing, because of Delphi's strong support ability to the database while developing the forestage and succinct and lucid programming language, powerful component, flexible and convenient programming environment and the offered support of window body that develops the fast prototype, We decide to use Borland Delphi 6.0 of Borland Company as the developing instrument of forestage together with Microsoft SQL Server 2000 as backstage supporter.

经过分析,由于Delphi 在开发数据库前端对数据库的强大支持能力及其具有的简洁明快的编程语言、功能强大的组件、灵活方便的编程环境和提供的窗体对快速原型开发的支持,我们以Borland公司的BORLAND DELPHI 6.0作为前端开发工具,以 Microsoft SQL Server 2000作为后台数据库开发工具,系统采用C/S结构。

Use artificial intelligence programming language prolog programming formula software source code.

利用人工智能程序设计语言prolog编程实现的公式计算软件源代码。

Friendly interface of the game software, animation, image, observed from time to time players make each other's fighting, in addition to the author also carefully developed to preserve the game algorithm module, so that players can be stored and playback unforgettable exciting game screen, and enjoy more of the Game bring the fun Keywords: Tetris; TCP / IP network programming; client and server programming; Save Game Algorithm

本游戏软件界面友好,动画形象,能使玩家时时观测到对方的战况,此外笔者还精心开发了保存游戏算法的模块,使玩家可保存和回放精彩难忘的游戏画面,进而享受到更多本游戏带来的乐趣关键词:俄罗斯方块;TCP/IP网络编程;客户端和服务器编程;保存游戏算法

Automatic Programming for NC Machining of Gear Indexing Cam with Smaller Cutter;2. Study on the Technologies of Computer-aided Designing and Programming of Gear Indexing Cam

本文结合弧面分度凸轮加工的工程实际,以微分几何和空间曲面啮合理论为工具,对弧面分度凸轮机构的传动规律、啮合原理和数控加工进行了系统的研究。

Furthermor, we consider their nondiferentiable situation, we define nonsmooth univex functions for Lipschitz functions by using Clarke generalized directional derivative and study nonsmooth multiobjective fractional programming with the new convexity. We establish generalized Karush-Kuhn-Tucker necessary and sufficient optimality condition and prove weak, strong and strict converse duality theorems for nonsmooth multiobjective fractional programming problems containing univex functions.

而且,本文利用Clarke广义方向导数针对Lipschitz函数在原来一致凸函数概念的基础上定义了不可微的一致凸函数,并利用这类新凸性,我们研究了非光滑多目标分式规划,获得了广义Karush-Kuhn-Tucher最优性条件;弱对偶定理、强对偶定理和严格逆对偶定理。

However, object-oriented programming can provide many benefits, which is why there are several toolkits that let you write object-oriented code in G, known as GOOP (G Object-Oriented Programming).

但是,面向对象语言有很多的优点,那也就是为什么有几个可以让你在G语言中编写面向对象的代码的工具包,就是通常所说的GOOP(G Object-Oriented Programming)。

System is used VB6.0, MATLAB6.5 and MATLAB and Visual Basic OLE interface methods of production, use VB Visual Interface, the real object-oriented, event-driven approach using the structure of high-level programming language, the perfect tool Integrated production and friendly interface and features of MATLAB numerical terms, such as a strong graphic image processing function for the core to achieve the limit, derivative, differential, integral and indefinite integral, vector algebra and analytic geometry of space for the function will be Two aspects of the unique advantages of combining the strong points, to shorten the development cycle and reduce programming difficulty, the current rapidly changing information age is of high practical value.

在线等汉-英翻译,网上在线翻译的别回!!!!!系统是采用VB6.0、MATLAB6.5 和MATLAB与Visual Basic接口OLE方法制作的,利用VB界面的可视化、真正面向对象、采用事件驱动方式的结构化高级程序设计语言、工具的完美集成和友好性特点制作界面和MATLAB的数值计算、图形图像等强大的处理功能为内核来实现函数极限、导数、微分、定积分和不定积分、空间解析几何和向量代数的求解功能;将两方面具有的独特优势结合起来,取长补短,以缩短开发周期,降低编程难度,这对当前日新月异的信息时代是具有很高的实用价值。

Not considering the restriction of the depot s transporting ability in the existing achievement of emergency dispatch, consequently, this chapter establishes a sole-resource optimized dispatch model aimed at "the shortest dispatch time" which includes the constraint of transporting ability under time restriction firstly. Moreover, the chapter deduces the algorithm of the model by mathematical induction step by step. Secondl y, it simplifies the former model and gives a simpler sole-objective model and corresponding algorithm including the constraint of transporting ability. At last, on the basis of the improved model, this chapter discusses a two-phase programming model and a multi-objective programming model which are aimed at "the shortest dispatch time" and "the fewest number of mobilized depots" including the constraint of transporting ability under time restriction.

由于现有应急调运的研究成果中没有考虑到各物资供应点受运输能力的约束,因此本章首先建立限制期内以"应急调运时间最短"为目标且含有运输能力约束的单物资调运优化模型:并利用逐步递推法推导出具体的求解算法;然后,进一步地将此模型及算法进行简化,建立更加简单的含有运输能力约束的单目标优化模型:并且讨论其算法;最后,在改进的优化模型的基础上,讨论限制期内含有运输能力约束且以"调运时间最短"、"出动的供应点数目最少"为目标的双层规划及多目标规划的优化模型及解法。

For the first time,the authors apply sequential quadratic programming of inner point as a solver to algorithm of quadratic programming for dynamic optimization of frame structure.

首次将内点序列二次规划法应用于框架结构的动力优化领域,并作为二次规划算法的求解器,改善整个优化问题的运算效率。

Both models of nonlinear recursive programming and mixed integer programming for crude optimization were introduced.

介绍原油优选模型中的非线性递归模型和混合整数规划模型技术。

第12/100页 首页 < ... 8 9 10 11 12 13 14 15 16 ... > 尾页
相关中文对照歌词
22 Going On 23
Cyborg Bette
Thank God
After The War
Army Of Bono
Death Of The Robot With Human Hair
Big Time
Trapped
Robots
Bloodfire
推荐网络例句

The dissecting of samples in group2 were difficult. The root of pulmonary artery and ascending aorta failed to be unfolded because fibrous tissue was tough, right and left fibrous trigone were too firm to be solved by hand. Cardiac muscle fibers couldn't be stripped along myofibrillar trajectory since they were prone to break because of their friability.

组2的心脏解剖困难,表现为纤维组织坚韧,游离肺动脉非常困难;徒手无法松解左、右纤维三角,肺动脉和主动脉根部的游离非常困难;心肌纤维坚硬、质脆,解剖时容易断离成碎块,无法沿纤维走行方向剥离。

We have battled against the odds in a province that has become increasingly violent.

我们对在一个争夺日益激烈省的可能性。

MILAN - The team has left for the States at 10.15am CET from Terminal 1, Milan Malpensa airport. The Rossoneri will land in New York at 12.50am local time (6.50pm CET), after a nine-hour flight.

米兰—球队在上午10:15从米兰马尔朋萨机场第一登机口登机,出发前往美国,预计于纽约时间上午12:50降落(意大利时间下午6:50),飞行时间大约9个小时。