提高ORACLE数据库检索速度

介绍了在ORACLE数据库中，如何优化SQL语句，提高查询速度，从而提高整个数据库的运行性能。     

使用ODBC API访问SQL Server数据库

ODBC是Microsoft公司提供的一个调用级别接口，是一种可以用来在不同DBMS中存取数据的标准接口。本文讨论了在VB应用程序中使用ODBCAPI访问SQL Server数据库的方法。     

SQL Server事务处理程序设计实例

给出了一个基于SQL SERVER 2000事务处理的编程实例，讨论了如何使用Delhpi6作为开发工具调用ADO控件，使事务处理编程更为安全简单．     

Excel 2000在测量不确定度计算中的应用

介绍了应用Excel2000电子表格软件的数据分析处理功能来编辑计算公式的方法,并通过数据检验给出测量不确定度计算工作表格式,使测量不确定度评定中复杂的计算变得简单,且不容易出错。     

基于ASP.NET的科研管理系统的设计与实现

描述基于ASP.NET的科研管理系统的框架结构及各模块的主要功能,并阐述系统实现的一些关键技术:对照数据库验证用户凭据、使用存储过程、同时处理分页排序.     

Convexifactors,generalized convexity and vector optimization

In this article we study a recently introduced notion of non-smooth analysis, namely convexifactors. We study some properties of the convexifactors and introduce two new chain rules. A new notion of non-smooth pseudoconvex function is introduced and its properties are studied in terms of convexifactors. We also present some optimality conditions for vector minimization in terms of convexifactors.     

Ratio-conjugation tool and its application in linear optimization models†

The ratio-conjugation-tool (RC) is constructed systematically, and its applicability for analysis of economic models is demonstrated. One of the main results establishes a general formula for RC of aggregative function. This tool is applied to the analysis of linear economic dynamics models of Neumann–Gale type which can be solved by a dynamic programming method: for each direct problem we construct the corresponding dual RC-problem. Moreover, we consider three examples of the most important economic dynamics models and look at these now from a unified general position.     

An Alternative Way to Generalize the Pentagon

We introduce the concept of a pentagonal geometry as a generalization of the pentagon and the Desargues configuration, in the same vein that the generalized polygons share the fundamental properties of ordinary polygons. In short, a pentagonal geometry is a regular partial linear space in which for all points x, the points not collinear with the point x, form a line. We compute bounds on their parameters, give some constructions, obtain some nonexistence results for seemingly feasible parameters and suggest a cryptographic application related to identifying codes of partial linear spaces.     

A variational approach to second-order approximability of sliding mode control systems

We consider robustness properties of second-order methods for the sliding mode control of nonlinear ordinary differential equations. A new approach is presented based on the theory of well-posed optimization problems. It is shown that the convergence of the real states of the control system to the ideal one is intimately related to Tykhonov well-posedness of suitably defined dynamic optimization problems.     

Cousin I condition and Stein spaces

Here we give a few n-dimensional extensions of a recent result of M. Abe concerning a Cousin I characterization of two-dimensional Stein manifolds.