Updating Polygonizations*

In this paper we consider polygonizations that are robust when faced with changes in the vertices that are present or in their position. We analyze the dynamic maintenance of different types of polygonizations (monotone, star-shaped…) and we introduce monotone half-convex polygonizations that are specially interesting because they provide minimum cost per insertion or deletion. If we had to delete not only one point but several external layers of the set, then the onion polygonizations would be suited, because they can be updated in constant time. We also consider the case of points that can be moved to contiguous positions and we show how to polygonize the set for updating in linear time. We deal too with security problems for a polygon: What is the maximum distance the vertices of a polygon could be moved away of their position in such a way that the topology on the boundary of the polygon (or its convexity) remains the same?.     

Connecting forward and backward autoregressive models

The aim of this paper is to describe procedures for computing the matrix polynomial defining a vector backward autoregressive recursion from the matrix polynomial defining a vector forward autoregressive recursion. Direct procedures for computing the backward polynomial which do not involve a solution of a matrix Lyapunov equation are described. A novel interpretation is also included of a known procedure which involves the computation of covariance data via the matrix Lyapunov equation. This procedure depends on a standard result connecting forward and reverse time state-space models. A comparison involving operation counts is given of the algorithms.     

Connecting Logical Representations and Efficient Computations

When combining logic level theorem proving with computational methods it is important to identify both functions that can be efficiently computed and the objects they can be applied to. This is generally achieved by mappings of logic level terms and functions to their computational counterparts. However, these mappings are often quite ad hoc and fragile depending very much on the particular logic representations of terms. We present a method of annotating terms in logic proofs with their computational properties. This enables the compact representation of computational objects in deduction systems as well as their connection to functions that can be easily computed for them. This eases the identification of deduction problems that can be treated efficiently by computational methods and also abstracts from trivial properties that are artefacts of a particular representation. We ensure logical correctness of our concepts by providing the possibility to replace terms by their logical representation and by expanding computational procedures by tactic application that can be rigorously checked.     

漫步HDTV的殿堂

相信大家对画面清晰细腻的DVD并不陌生吧？不过它在高清晰视觉、高画面质感的HDTV面前可就显得将黯然失色了！作为一个电脑爱好者。你听说过HDTV吗？你接触、了解过HDTV吗？伴随着这些话题．接下来我们就一起进入HDTV的殿堂。     

Windows与Linux的互连技术

目前最常用的两种操作系统就是Windows和Linux,在局域网中这两种操作系统共存的情况也普遍存在,使用samba技术可以实现Windows和Linux之间文件和打印机的共享,本文介绍了利用samba实现Windows与Linux互连的方法。     

Connecting filtering and control sensitivity functions

In this paper we establish a relationship between the complementary sensitivity function of output feedback control and two other sensitivity functions, namely a (scaled) complementary sensitivity function associated with feedback control based on an auxiliary variable, and a complementary sensitivity function associated with an observer. Implications of the results in related problem areas, e.g. robust model predictive control, are briefly discussed.     

Connecting Design with Code

Jon Bentley wrote his thesis on divide-and-conquer algorithms and came to greatly admire C.A.R. Hoare's original quicksort algorithm. Yet for years, Bentley "tiptoed around its innermost loop" because he didn't understand it (Beautiful Code, O'Reilly, 2007). It was only after he implemented his own quicksort based on an elegant partitioning scheme for programming Pearls (Addison-Wesley, 1999) that he truly understood the reason for that inner loop. He also trimmed the original bulkier algorithm to a mere dozen tight lines of code. Code clutter and unnecessary complexity can obscure a design. However, connecting design decisions to code won't happen unless developers embrace the practice of writing code as if expressing design intent matters.     

Connecting architecture reconstruction frameworks

A number of standalone tools are designed to help developers understand software systems. These tools operate at different levels of abstraction, from low level source code to software architectures. Although recent proposals have suggested how code-level frameworks can share information, little attention has been given to the problem of connecting software architecture level frameworks. In this paper, we describe the TA Exchange Format (TAXForm) exchange format for frameworks at the software architecture level. By defining mappings between TAXForm and formats that are used within existing frameworks, we show how TAXForm can be used as a “binding glue” to achieve interoperability between these frameworks without having to modify their internal structure.     

Connecting PEACE to UNIX

The SUPRENUM-machine consists of two components with different operating systems: a host (STR) with UNIX V.3 and a high-performance kernel (HLK) with PEACE. SUPRENUM-programs will be started on the STR and executed mainly on the HLK. Every communication with the outside world will run through the STR. Suprenum-programs are distributed programs. In general, processes of a SUPRENUM-program will be executed on different processing nodes of different clusters of the HLK. For some of these processes, especially those which communicate with the world, it seems to be useful to be executed on the STR. To provide this, parts of PEACE will be emulated in UNIX V. By doing this one achieves that STR and HLK form a single machine from the viewpoint of the user. In addition, this provides the user with the possibility to develop and test his program on the STR and after that run it on the HLK. The transformation on the HLK will be achieved by the usage of a different library.     

在Dreamweaver中数据库的连接与使用

该文详细介绍在Dreamweaver中连接数据库及使用数据库的原理和方法。     

运用ADO实现ObjectARX与数据库的连接

本文以AutoCAD2000为基础软件,用VC＋＋6．0为开发工具,数据库为Access97,运用ADO数据库技术实现ARX与数据库的连接。     

Connecting geodesics on smooth surfaces

In this paper, we present a novel method for computing multiple geodesic connections between two arbitrary points on a smooth surface. Our method is based on a homotopy approach that is able to capture the ambiguity of geodesic connections in the presence of positive Gaussian curvature that generates focal curves. Contrary to previous approaches, we exploit focal curves to gain theoretical insights on the number of connecting geodesics and a practical algorithm for collecting these. We consider our method as a contribution to the contemporary debate regarding the calculation of distances in general situations, applying continuous concepts of classical differential geometry which are not immediately transferable in purely discrete settings.     

XML与Database的连接方法

本文提出了一个全新的基于XML技术的远程考试系统的模型的设计与具体实现，该系统将成为下一代远程考试系统，分数据层，服务层，表现层三层结构，数据层采用XML技术存储，按照IMS规范中统一的数据结构设计XML Schema，充分何证了课程试题数据的反复可重用性与其他系统的交互性及数据存储的长期有效性。中间服务层采用Web Service结构，保证了整个系统良好的模块化结构特征与优秀的可扩展性。同时着重介绍了其中的关键技术，即XML与Datebase的连接方法。     

在PowerBuilder应用程序中建立数据库连接的参数配置方法

PowerBuilder作为目前先进的数据库开发工具和前台应用程序开发工具,在访问数据库之前,必须首先与要操作的数据库成功地建立连接。介绍了3种PowerBuilder与数据库连接的参数配置方法。     

CAN总线与组态软件的连接工具

设计的CAN总线连接工具可兼容多种自定义的CAN应用协议,提供了组态软件应用程序与CAN总线系统通信的接口,可以方便地通过调用自主开发CAN卡的DLL连接CAN总线应用系统,通过DDE连接组态软件应用程序,具有通用性.介绍了该连接工具的实现原理和实现方法,并利用该工具建立一个"组态王"与CAN总线系统的应用工程.     

业务选择网关的连接模型研究

业务选择网关是随着Internet和网络个性化服务的发展应运而生的。本文通过对基于请求内容分配机制的主要技术之一TCP Handoff技术的分析介绍,提出了一种不同于传统的业务选择网关请求连接和实现的模型。利用TCP handoff技术能将客户请求的响应结果直接返回客户端,消除了由业务选择网关节点而引起的网络通信瓶颈,从而可以显著提高整个服务系统的吞吐率,使整体性能得到极大的改善。