Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesperson problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt. 相似文献
The proposed European Artificial Intelligence Act (AIA) is the first attempt to elaborate a general legal framework for AI carried out by any major global economy. As such, the AIA is likely to become a point of reference in the larger discourse on how AI systems can (and should) be regulated. In this article, we describe and discuss the two primary enforcement mechanisms proposed in the AIA: the conformity assessments that providers of high-risk AI systems are expected to conduct, and the post-market monitoring plans that providers must establish to document the performance of high-risk AI systems throughout their lifetimes. We argue that the AIA can be interpreted as a proposal to establish a Europe-wide ecosystem for conducting AI auditing, albeit in other words. Our analysis offers two main contributions. First, by describing the enforcement mechanisms included in the AIA in terminology borrowed from existing literature on AI auditing, we help providers of AI systems understand how they can prove adherence to the requirements set out in the AIA in practice. Second, by examining the AIA from an auditing perspective, we seek to provide transferable lessons from previous research about how to refine further the regulatory approach outlined in the AIA. We conclude by highlighting seven aspects of the AIA where amendments (or simply clarifications) would be helpful. These include, above all, the need to translate vague concepts into verifiable criteria and to strengthen the institutional safeguards concerning conformity assessments based on internal checks.
Two experiments examined the role of valuing the welfare of a person in need as an antecedent of empathic concern. Specifically, these experiments explored the relation of such valuing to a well-known antecedent--perspective taking. In Experiment 1, both perspective taking and valuing were manipulated, and each independently increased empathic concern, which, in turn, increased helping behavior. In Experiment 2, only valuing was manipulated. Manipulated valuing increased measured perspective taking and, in part as a result, increased empathic concern, which, in turn, increased helping. Valuing appears to be an important, largely overlooked, situational antecedent of feeling empathy for a person in need. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
Iterative Feedback Tuning constitutes an attractive control loop tuning method for processes in the absence of an accurate process model. It is a purely data driven approach aiming at optimizing the closed loop performance. The standard formulation ensures an unbiased estimate of the loop performance cost function gradient with respect to the control parameters. This gradient is important in a search algorithm. The extension presented in this paper further ensures informative data to improve the convergence properties of the method and hence reduce the total number of required plant experiments especially when tuning for disturbance rejection. Informative data is achieved through application of an external probing signal in the tuning algorithm. The probing signal is designed based on a constrained optimization which utilizes an approximate black box model of the process. This model estimate is further used to guarantee nominal stability and to improve the parameter update using a line search algorithm for determining the iteration step size. The proposed algorithm is compared to the classical formulation in a simulation study of a disturbance rejection problem. This type of problem is notoriously difficult for Iterative Feedback Tuning due to the lack of excitation from the reference. 相似文献
We present a declarative language for compositional specification of contracts governing the exchange of resources. It extends
Eber and Peyton Jones’s declarative language for specifying financial contracts (Jones et al. in The Fun of Programming. 2003)
to the exchange of money, goods and services amongst multiple parties and complements McCarthy’s Resources, Events and Agents
(REA) accounting model (McCarthy in Account Rev. LVII(3), 554–578, 1982) with a view- independent formal contract model that supports definition of user-defined contracts, automatic
monitoring under execution and user-definable analysis of their state before, during and after execution. We provide several
realistic examples of commercial contracts and their analyses. A variety of (real) contracts can be expressed in such a fashion
as to support their integration, management and analysis in an operational environment that registers events. The language
design is driven by both domain considerations and semantic language design methods: a contract denotes a set of traces of
events, each of which is an alternative way of concluding the contract successfully, which gives rise to a CSP-style (Brooker
et al. in J.ACM 31(3), 560–599, 1984; Hoare in Communicating Sequential Processes, 1985) denotational semantics. The denotational semantics
drives the development of a sound and complete small-step operational semantics, where a partially executed contract is represented
as a (full) contract that represents the remaining contractual commitments. This operational semantics is then systematically
refined in two stages to an instrumented operational semantics that reflects the bookkeeping practice of identifying the specific
contractual commitment a particular event matches at the time the event occurs, as opposed to delaying this matching until
the contract is concluded. 相似文献
Maintaining an awareness of the working context of fellow co-workers is crucial to successful cooperation in a workplace.
For mobile, non co-located workers, however, such workplace awareness is hard to maintain. This paper investigates how context-aware
computing can be used to facilitate workplace awareness. In particular, we present the concept of Context-Based Workplace Awareness, which is derived from years of in-depth studies of hospital work and the design of computer supported cooperative work technologies
to support the distributed collaboration and coordination of clinical work within large hospitals. This empirical background
has revealed that an awareness especially of the social, spatial, temporal, and activity context plays a crucial role in the coordination of work in hospitals. The paper then presents and discusses technologies designed
to support context-based workplace awareness, namely the AWARE architecture, and the AwarePhone and AwareMedia applications.
Based on almost 2 year’ deployment of the technologies in a large hospital, the paper discuss how the four dimension of context-based
workplace awareness play out in the coordination of clinical work. 相似文献