Sybase 推出SQL Anywhere Studio

６月１７日,Ｓｙｂａｓｅ公司在京召开了主题为“跨入移动计算,拓展互联空间”的移动及嵌入计算新品——ＳｙｂａｓｅＳＱＬＡｎｙｗｈｅｒｅＳｔｕｄｉｏ发布会。ＳｙｂａｓｅＳＱＬＡｎｙｗｈｅｒｅＳｔｕｄｉｏ是Ｓｙｂａｓｅ针对移动计算和移动设备推出的集成的产品...     

与Sybase SQL Server交互的客户应用程序设计方法

介绍了３种客户／服务器模式,发析了Ｓｙｂａｓｅ客户／服务器体系结构,并分别举列说明了如何利用Ｓｙｂａｓｅ的ＤＢ－Ｌｉｂｒａｒｙ和Ｃｌｉｅｎｔ－Ｌｉｂｒａｒｙ来设计与ＳｙｂａｓｅＳＱＬＳｅｒｖｅｒ交互的客户应用程序。     

与Sybase SQL Server交互应用程序设计

本文分析了Ｓｙｂａｓｅ客户／服务器体系结构,并结合“河南洛阳首阳山电厂远动ＤＡＳ接口工程”项目说明了如何利用Ｓｙｂａｓｅ的ＤＢ－Ｌｉｂｒａｒｙ来设计与Ｓｙｂａｓｅ ＳＱＬ Ｓｅｒｖｅｒ交互的客户应用程序的方法。     

Sybase的开放技术及应用方法

本文介绍了在ＳｙｂａｓｅＤＢＭＳ系统中的开放性，并进一步分析和讨论了ＳｙｂａｓｅＯｐｅｎＣｌｉｅｎｔ和ＯｐｅｎＳｅｒｖｅｒ的开放技术和应用开发方法，提出并建立了一个基于Ｓｙｂａｓｅ开放技术的异构型分布式数据库的应用环境。     

如何对Sybase SQL Anywhere数据库进行数据备份和数据恢复

本文详细介绍了 Ｓｙｂａｓｅ公司开发的 Ｓｙｂａｓｅ ＳＱＬ Ａｎｙｗｈｅｒｅ小型数据库的数据备份和数据恢复方法以及具体的操作步骤。     

如何实现Foxpro和Sybase之间的数据传输

本文讲述了Ｓｙｂａｓｅ和Ｆｏｘｐｒｏ之间的数据传输问题，重点介绍了使用Ｂｃｐ．ＣｏｐｙＴｏ命令及Ｅｄｉｔ软件将Ｆｏｘｐｒｏ数据库内容复制到Ｓｙｂａｓｅ数据表的实现方法     

如何对Sybase SQL Anywhere数据库进行数据备份和数据恢复

本文详细介绍了 Ｓｙｂａｓｅ公司开发的 Ｓｙｂａｓｅ ＳＱＬ Ａｎｙｗｈｅｒｅ小型数据库的数据备份和数据恢复方法以及具体的操作步骤。     

Sybase与用户一起迎接挑战——Sybase的电子商务策略

Ｓｙｂａｓｅ电子商务的产品策略Ｓｙｂａｓｅ在电子商务方面的产品策略可以概括为以下两点：１．通过Ｓｙｂａｓｅ的数据库服务器（ＡｄａｐｔｉｖｅＳｅｒｖｅｒ）、应用服务器（ＰｏｗｅｒＤｙｎａｍｏ，ＪａｇｕａｒＣＴＳ）、互连产品（ＯｍｉｎＣｏｎｎｅｃｔ，Ｄ...     

基于ASP／Sybase应用程序的优化

Ｓｙｂａｓｅ是一个基于Ｃｌｉｅｎｔ／Ｓｅｒｖｅｒ体系结构的关系数据库管理系统,在一个浏览器／服务器（Ｂ／Ｓ）模式的应用中,为了提高整个系统的性能必须根据Ｓｙｂａｓｅ的特点对应用程序进行了优化,本文主要从查询结构方面来讨论这个问题。     

Sybase客户机／服务器的面向对象开发

Ｓｙｂａｓｅ是当前应用广泛的基于客户机／服务器体系结构的数据库管理系统。通过Ｓｙｂａｓｅ的开放性接口Ｏｐｅｎ Ｃｌｉｅｎｔ,第三方开发工具能方便地访问Ｓｙｂａｓｅ ＳＱＬ Ｓｅｒｖｅｒ。讨论了Ｃ／Ｃ＋＋通过Ｏｐｅｎ Ｃｌｉｅｎｔ对数据库的访问例程,并利用Ｃ＋＋的面向对象设计实现了简单易操作和访问对象。     

Multiple Objective Optimization Problems in Statistics

Many statistical problems can be viewed as optimization problems. A careful and detailed analysis of these procedures reveals that many of these problems are essentially multiple objective optimization problems. Furthermore, most of the standard statistical procedures aim at finding an efficient (non-dominated) solution. Our objective in this paper is to introduce some of the single sample statistical problems that can be formulated and solved as multiple objective optimization problems.     

A survey of problems,solution techniques,and future challenges in scheduling semiconductor manufacturing operations

In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting from describing the manufacturing process, we identify typical scheduling problems found in semiconductor manufacturing systems. We describe batch scheduling problems, parallel machine scheduling problems, job shop scheduling problems, scheduling problems with auxiliary resources, multiple orders per job scheduling problems, and scheduling problems related to cluster tools. We also present important solution techniques that are used to solve these scheduling problems by means of specific examples, and report on known implementations. Finally, we summarize some of the challenges in scheduling semiconductor manufacturing operations.     

决策问题结构的形式化研究

运用分形理论研究决策问题结构，对决策问题进行形式化描述，定义其结构函数和结构指数，并将决策问题从定性上分为良好结构、未结构化和纯不良结构。给出了关于决策问题结构的几个定理，讨论了决策问题结构化的测度，提出了决策问题简化的判据。     

Suboptimal control of singularly perturbed systems and periodicoptimization

A traditional approach to singularly perturbed optimal control problems is based on an approximation of these problems by reduced problems which are obtained via the formal replacement of the fast variables by the states of equilibrium of the fast subsystems considered with frozen slow variables and controls. It is shown that such an approximation is valid if and only if certain families of periodic optimization problems admit steady state solutions. It is also shown how the solutions of these problems can be used to construct suboptimal controls for singularly perturbed problems when approximation by reduced problems is not possible     

Disjunctive optimization,max-separable problems and extremal algebras

The paper was motivated by solution methods suggested in the literature for solving linear optimization problems over (max,+)- or (max,min)-algebras and certain class of so called max-separable optimization problems. General features of these optimization problems, which play a crucial role in the optimization methods were used to formulate a general class of optimization problems with disjunctive constraints and a max-separable objective function and suggest a solution procedure for solving such problems. Linear problems over (max,+)-algebras and the max-separable problems are contained in this general class of optimization problems as special cases.     

A comparison of usability evaluation methods for evaluating e-commerce websites

The importance of evaluating the usability of e-commerce websites is well recognised. User testing and heuristic evaluation methods are commonly used to evaluate the usability of such sites, but just how effective are these for identifying specific problems? This article describes an evaluation of these methods by comparing the number, severity and type of usability problems identified by each one. The cost of employing these methods is also considered. The findings highlight the number and severity level of 44 specific usability problem areas which were uniquely identified by either user testing or heuristic evaluation methods, common problems that were identified by both methods, and problems that were missed by each method. The results show that user testing uniquely identified major problems related to four specific areas and minor problems related to one area. Conversely, the heuristic evaluation uniquely identified minor problems in eight specific areas and major problems in three areas.     

A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results

A very close relationship between the compaction, retraction, and constraint satisfaction problems has been established earlier providing evidence that it is likely to be difficult to give a complete computational complexity classification of the compaction and retraction problems for reflexive or bipartite graphs. In this paper, we give a complete computational complexity classification of the compaction and retraction problems for all graphs (including partially reflexive graphs) with four or fewer vertices. The complexity classification of both the compaction and retraction problems is found to be the same for each of these graphs. This relates to a long-standing open problem concerning the equivalence of the compaction and retraction problems. The study of the compaction and retraction problems for graphs with at most four vertices has a special interest as it covers a popular open problem in relation to the general open problem. We also give complexity results for some general graphs. The compaction and retraction problems are special graph colouring problems, and can also be viewed as partition problems with certain properties. We describe some practical applications also.     

约束分解技术回顾与展望

约束满足问题是一个强有力的知识表示框架,可以有效地解决许多问题。由于约束满足问题一般情况下是NP难度的问题,因此通过约束分解来降低计算的开销具有十分重要的意义。主要描述约束分解在约束满足问题中的地位、经典的分解技术和约束分解技术的发展历史,然后简要地分析这些分解技术。介绍了关于约束分解研究的最新状况,并描述、分析和总结其主要求解思想。最后根据存在的问题与不足提出了下一步的工作方向和研究思路。     

Logspace Optimization Problems and Their Approximability Properties

Logspace optimization problems are the logspace analogues of the well-studied polynomial-time optimization problems. Similarly to them, logspace optimization problems can have vastly different approximation properties even though their underlying decision problems have the same computational complexity. Natural problems - including the shortest path problems for directed graphs, undirected graphs, tournaments, and forests - exhibit such a varying complexity. In order to study the approximability of logspace optimization problems in a systematic way, polynomial-time approximation classes and polynomial-time reductions between optimization problems are transferred to logarithmic space. It is proved that natural problems are complete for different logspace approximation classes. This is used to show that under the assumption L ≠ NL some logspace optimization problems cannot be approximated with a constant ratio; some can be approximated with a constant ratio, but do not permit a logspace approximation scheme; and some have a logspace approximation scheme, but optimal solutions cannot be computed in logarithmic space.     

Equivalent stochastic control problems

A decentralized stochastic control problem is called static if the observations available for any one decision do not depend on the other decisions. Otherwise it is called dynamic. We consider only problems with a finite number of decisions. A notion of equivalence between problems, suitable for complexity analysis, is defined. It turns out that a large class of dynamic problems can be reduced to equivalent static problems. The class includes all sequential discrete variable problems and some of the most studied continuous variable problems.