杭州湾跨海大桥的公共政策过程分析

通过对杭州湾跨海大桥案例的政策过程分析研究,揭示了一个从政策需要出发的、系统的政策过程范式.这种政策过程分析范式对主流政策过程分析范式遭遇到的许多问题,如界定问题的困难、政策发展上的单极论、保守性等,都提供了比较满意的解释.它无论从政策过程的研究上讲,还是从实践来看,新的政策过程分析范式都无疑是一种对政策过程理论的有益探索.     

无锡公众太湖蓝藻风险感知分析

2007年太湖蓝藻事件引起社会各界的广泛关注,对无锡市公众的正常生活产生极大的影响。本文以无锡市公众为调查对象,采用心理测量范式方法,研究公众太湖蓝藻与其它9种灾害风险感知比较,探讨蓝藻风险信息的获取渠道。结果表明,在10种灾害中,蓝藻排名前两位的风险因子为发生灾害可能性和后果可控程度。蓝藻排名后两位的风险因子是熟悉度和风险总评价。公众对蓝藻的发生可控程度及后果可控程度的感知均明显高于10种灾害平均水平。研究表明,公众虽然认识到太湖蓝藻暴发频繁及其暴发将带来重大的损失,但蓝藻事件并没有对当地公众造成很大心理影响,反映出公众对政府的信任与依赖较大。     

Between control and creativity: challenging co-creation and social media use in a museum context

Abstract

This article addresses the challenges and limitations of co-creation processes in museums based on an exemplary case of the design of a Danish museum-related campaign on Facebook. The article adds to the ongoing discussion on the paradigm shift in the museum by analysing potential problematical issues of including multiple agents in creative processes in museums. It concludes that it is arduous to establish a truly creative co-creative process, when the design team needs to accommodate to a well-established artistic vision as well as to the limited resources of the museum and the other participants. We argue that one cannot in advance predict or ascertain that social media users will find a campaign compelling and want to participate and engage with the content, even if substantial resources have gone into its creation. Furthermore, the complexity of many art projects is likely to make their dissemination on social media difficult.     

Low-cost clock synchronization

Summary We show how synchronized clocks can be realized in a distributed system as a byproduct of a common communication paradigm where processors periodically perform broadcasts. Our approach decouples theprecision concern of clock synchronization—limiting how much correct clocks can differ from each other—from theaccuracy concern—limiting the rate at which any correct clock may drift from real time. Given a system that guarantees only precision, we develop a protocol whereby high accuracy can be achieved on demand. In this manner, the lazy protocol we obtain incurs the cost of high accuracy only when needed while keeping the basic synchronization procedure extremely simple and cheap. Rogério Drummond is Associate Professor of Computer Science at the Universidade de Campinas (Unicamp), Brazil. He received his Ph.D. in computer science from Cornell University in 1986. He has previously worked on distributed fault-tolerant computing, such as the present paper. Currently, he heads the A_HAND project which aims to provide an object-oriented distributed programming environment for the development of very large software systems. Özalp Babaolu is Professor of Computer Science at the University of Bologna, Italy. His research interests include distributed algorithms, fault tolerance and parallel computing. He received a BS in electrical engineering from George Washington University, Washington, D.C. in 1976. From the University of California, Berkeley, he received a MS in 1977 and a Ph.D. in 1981, both in computer science. While at Berkeley, he designed and implemented the virtual memory extensions to BSD Unix. From 1981 to 1987 he was on the faculty at the Department of Computer Science, Cornell University.Partial support for this work was provided by the National Science Foundation under Grant DCR-86-01864, AT&T under a Foundation Grant, the Commission of the European Communities under the ESPRIT Programme Basic Research Action Number 3092 (Predictably Dependable Computing Systems) and the Italian Ministry of University and Research. Drummond was partially supported through a Fellowship from the CAPES Agency of the Government of Brazil     

Linear logic as a tool for planning under temporal uncertainty

The typical AI problem is that of making a plan of the actions to be performed by a controller so that it could get into a set of final situations, if it started with a certain initial situation.The plans, and related winning strategies, happen to be finite in the case of a finite number of states and a finite number of instant actions.The situation becomes much more complex when we deal with planning under temporal uncertainty caused by actions with delayed effects.Here we introduce a tree-based formalism to express plans, or winning strategies, in finite state systems in which actions may have quantitatively delayed effects. Since the delays are non-deterministic and continuous, we need an infinite branching to display all possible delays. Nevertheless, under reasonable assumptions, we show that infinite winning strategies which may arise in this context can be captured by finite plans.The above planning problem is specified in logical terms within a Horn fragment of affine logic. Among other things, the advantage of linear logic approach is that we can easily capture ‘preemptive/anticipative’ plans (in which a new action β may be taken at some moment within the running time of an action α being carried out, in order to be prepared before completion of action α).In this paper we propose a comprehensive and adequate logical model of strong planning under temporal uncertainty which addresses infinity concerns. In particular, we establish a direct correspondence between linear logic proofs and plans, or winning strategies, for the actions with quantitative delayed effects.     

Making epistemological trouble: Third-paradigm HCI as successor science

Epistemological issues have long been debated by feminist philosophers aiming to answer the question, “what difference does it make to take gendered points of view seriously in the construction of knowledge?” Coming out of this history, a strand of work in feminist science studies has argued for the necessity of “successor science:” new forms of science based in standpoint epistemology, i.e. a recognition of the necessarily situated points of view of scientific knowledge-makers. In this paper, we argue that such a successor science has already come into being within the field of HCI, though it is perhaps not recognized as such by its practitioners.In particular, we identify a cluster of research we term the ‘third paradigm.’ This cluster of research cuts across HCI research areas as typically organized by topic area. Instead, this research shares an underlying epistemological orientation closely aligned with standpoint epistemology, focused around an acknowledgment of the social, cultural, and physical situatedness of both users and analysts. Feminist philosophers of science argue that a logical outcome of standpoint epistemology is the need for science to reflexively grapple with the limitations of its own ways of knowing; we conclude such an outcome may also be in store for the third paradigm.     

面向制造网格的任务管理系统研究

为协调和共享制造网格中分布的资源，设计并实现了一个面向网格服务的任务管理系统。建立了该系统的功能模型和工作流程，定义了面向零件和组件加工任务的网格资源节点模型和任务模型；基于任务时间、成本和服务质量的约束，建立了任务分解规则和资源节点的匹配规则，设计了任务调度及状态监控方案；最后构建了系统实现的体系结构和信息交换过程。基于网格原理，系统各功能被封装为网格服务，通过任务管理中心实现对服务的调用。系统已被集成到某区域网络化制造服务平台，为企业提供了与制造过程相关的网格服务。     

S-ABC: A paradigm of service domain-oriented artificial bee colony algorithms for service selection and composition

With the rapid development of Cloud Computing, Big Data, Social Networks, and the Internet of Things, typical service optimization problems (SOPs) such as service selection, service composition and service resource scheduling in the service computing field have become more and more complicated due to the constant enrichment and dynamic aggregation of large number of services, as well as the unceasing variation of user requirements. Meanwhile, with the long-term development and evolution of business in many application domains, some service domain features (such as priori, correlation and similarity) are usually formed, which have strong influences on solving SOPs. Unfortunately, the existing research efforts on SOPs primarily concentrate on designing general algorithms for specific problems without considering the service domain features. This often leads to undesirable results of SOPs. Therefore, how to design a paradigm of service domain-oriented optimization algorithms with service domain features becomes a challenge for providing optimization strategies and algorithms to solve SOPs effectively. By considering the influences of service domain features on solving SOPs, this paper proposes a set of service domain-oriented artificial bee colony algorithms (S-ABC) based on the optimization mechanism of Artificial Bee Colony (ABC) method. Furthermore, by configuring the items and parameters of the S-ABC paradigm in detail, optimization algorithms for particular SOPs (e.g., service selection and composition) could be derived. In this paper, the superiority of our proposed S-ABC is verified through solving concurrent service selection and service composition problem. By exploiting the artificial bee colony algorithms for the optimization problems in service domains, this work makes novel contributions for solving SOPs, as well as extends the theory of the swarm intelligence optimization.     

A priori error estimation of finite element models from first principles

The quality of finite element computational results can be assessed only by providing rational criteria for evaluating errors. Most exercises in this direction are based ona posteriori error estimates, based primarily on experience and intuition. If finite element analysis has to be considered a rational science, it is imperative that procedures to computea priori error estimates from first principles are made available. This paper captures some efforts in this direction.     

Conceptual coherence affects phonological activation of context objects during object naming.

In 4 picture-word interference experiments, speakers named a target object that was presented with a context object. Using auditory distractors that were phonologically related or unrelated either to the target object or the context object, the authors assessed whether phonological processing was confined to the target object or not. Phonological activation of the context objects was reliably observed if the target and context objects were embedded in a conceptually coherent scene (e.g., if the picture showed a mouse eating some cheese), regardless of whether the target was cued by its thematic role (agent vs. patient) or by color. However, this activation dissipated if the two objects were presented in an arbitrary object array (e.g., if the cheese was presented along with a finger). These findings suggest that conceptual coherence among multiple objects affects the information flow in the conceptual-lexical system during speech planning. (PsycINFO Database Record (c) 2010 APA, all rights reserved)