Smooth Shape‐Aware Functions with Controlled Extrema

Functions that optimize Laplacian‐based energies have become popular in geometry processing, e.g. for shape deformation, smoothing, multiscale kernel construction and interpolation. Minimizers of Dirichlet energies, or solutions of Laplace equations, are harmonic functions that enjoy the maximum principle, ensuring no spurious local extrema in the interior of the solved domain occur. However, these functions are only C⁰ at the constrained points, which often causes smoothness problems. For this reason, many applications optimize higher‐order Laplacian energies such as biharmonic or triharmonic. Their minimizers exhibit increasing orders of continuity but lose the maximum principle and show oscillations. In this work, we identify characteristic artifacts caused by spurious local extrema, and provide a framework for minimizing quadratic energies on manifolds while constraining the solution to obey the maximum principle in the solved region. Our framework allows the user to specify locations and values of desired local maxima and minima, while preventing any other local extrema. We demonstrate our method on the smoothness energies corresponding to popular polyharmonic functions and show its usefulness for fast handle‐based shape deformation, controllable color diffusion, and topologically‐constrained data smoothing.     

浅析受贿罪讯问中的逻辑错误

犯罪嫌疑人的供述是认定受贿罪的“证据之王”,而讯问中逻辑错误的常见、多发,却严重削弱了其证明力,给反贪工作造成不必要的损失。为此,侦查人员在讯问中必须杜绝预期理由、混淆论题、不正当的复杂问语、推不出、论题含混等逻辑错误。     

A Monadic Semantics for Core Curry

We give a deterministic, big-step operational semantics for the essential core of the Curry language, including higher-order functions, call-by-need evaluation, non-determinism, narrowing, and residuation. The semantics is structured in modular monadic style, and is presented in the form of an executable interpreter written in Haskell. It uses monadic formulations of state, non-determinism, and resumption-based concurrency.     

Introducing QoS awareness in distributed programming: QTcl

A number of distributed applications require communication services with quality of service (QoS) guarantees. Building global‐scale distributed systems with predictable properties is one of the great challenges for computer systems engineering in the new century. Work undertaken within the Internet Engineering Task Force has led to the definition of novel architectural models for the Internet with QoS support. According to these models, the network has to be appropriately configured in order to provide applications with the required performance guarantees. In next‐generation networks, enabling applications to interact with the underlying QoS services is of primary importance. Hence, several special‐purpose application programming interfaces (APIs) have been defined to let applications negotiate QoS parameters across QoS‐capable networks. However, so far, none of these APIs are available in different operating environments. We believe that such features should be embedded in programming environments for distributed applications. In this work we present how we included QoS control features in Tcl, a programming language that has been widely adopted for the development of distributed multimedia applications. Our work has led to the implementation of QTcl, an extended Tcl interpreter that provides programmers with a new set of primitives, in full compliance with the standard SCRAPI programming interface for the RSVP protocol. QTcl in highly portable, in that it enables standard QoS negotiation to be performed in a seamless fashion on the most common operating systems. Copyright © 2003 John Wiley & Sons, Ltd.     

A residualizing semantics for the partial evaluation of functional logic programs

Recent proposals for multi-paradigm declarative programming combine the most important features of functional, logic and concurrent programming into a single framework. The operational semantics of these languages is usually based on a combination of narrowing and residuation. In this paper, we introduce a non-standard, residualizing semantics for multi-paradigm declarative programs and prove its equivalence with a standard operational semantics. Our residualizing semantics is particularly relevant within the area of program transformation where it is useful, e.g., to perform computations during partial evaluation. Thus, the proof of equivalence is a crucial result to demonstrate the correctness of (existing) partial evaluation schemes.     

Parameterizing and Eliciting Text Elements across Languages for Use in Natural Language Processing Systems

This paper analyzes the structure and meaning of text elements cross-linguistically and discusses how that information can be elicited from people in a way that is directly useful for NLP applications. We describe a recently developed computer-based linguistic knowledge elicitation system that initiates a new paradigm of knowledge acquisition methodologies for NLP. In particular, we describe the natural language phenomena the system seeks to cover, the approach to knowledge elicitation and its rationale, the elicitation modules themselves, and broader implications of this work.     

EDEN: An Intelligent Software Environment for Diagnosis of Discrete-Event Systems

A software environment, called EDEN, that prototypes a recent approach to model-based diagnosis of discrete-event systems, is presented. The environment integrates a specification language, called SMILE, a model base, and a diagnostic engine. SMILE enables the user to create libraries of models and systems, which are permanently stored in the model base, wherein both final and intermediate results of the diagnostic sessions are hosted as well. Given the observation of a physical system gathered during its reaction to an external event, the diagnostic engine performs the a posteriori reconstruction of all the possible evolutions of the system over time and, then, draws candidate diagnoses out of them. The diagnostic method is described using a simplified example within the domain of power transmission networks. Strong points of the method include compositional modeling, support for model update, ability to focus on any sub-system, amenability to parallel execution, management of multiple faults, and broad notions of system and observation.     

无界Petri网的进程表达式

借助进程网系统的概念，首先证明了无界Petri网∑的进程与其进程网系统∑p，的语言之间存在一一映射关系，将求取∑的进程表达式的问题转化成求取∑p，的语言问题．由于∑p，的结构一般比较复杂，直接求取其语言仍然比较困难．通过定义库所的指标函数，将结构复杂的∑p，分解成结构简单的子网系统，引入了语言的同步交运算，给出了利用这些子网系统求取结构复杂的∑p，语言的方法，从而得到了求取无界Petri网∑的进程表达式的算法．     

Patterns of self-stabilization in database consistency maintenance

A substantial portion of the database programming efforts are invested in integrity constraints enforcement. Traditionally, both the constraint semantics and their enforcement were embedded inside application programs. In recent years several studies have dealt with specifying integrity constraints as separate entities (e.g. rules), and relating the database consistency requirements to these rules. In this paper we deal with the complementary issue of stabilizing the database when update exceptions occur. While a simplistic approach is to abort any transaction that inflicts consistency violations, this is not always the desired action. We take advantage of the empirical observation that most of the exception-handling policies follow a small number of behavior patterns. Unlike some previous approaches that base their repair solution on syntactic analysis of the constraints and performance issues, we base our approach on the application semantics as reflected in these behavioral patterns. We describe a model that uses high-level abstractions called stabilizer types denoting these behavior patterns for consistency restorations, whose exact semantics is case dependent. It follows the fault tolerance's self-stabilization approach. An inference mechanism translates these abstractions into executable active rules. This approach provides high-level language to the exception handling portion of the application and substantially reduces the required programming.