Going Dutch in the Mekong Delta:a framing perspective on water policy translation

In response to the rising climatic impacts on worldwide urbanized deltas, the Netherlands has strategically and politically framed Dutch water management as a global water solution for improving water safety and flood protection in other countries such as Vietnam. Being renowned for its water management approach, the Netherlands is particularly active in sharing water knowledge, insights, and policies internationally. This paper connects a framing perspective to policy translation studies to understand the role of language and meaning-making in the cross-border travel of policies. Adopting a framing perspective, it presents four dimensions of water policy translation concerning how policy frames are being created and interpreted - during the cross-border travel. The paper follows the process of the Dutch water management approach being 'packaged' as global water solutions and 'translated' to inform the development of the Vietnamese Mekong Delta Plan of 2013. The results show that although similar concepts, metaphors and narratives could be witnessed in this translation process, the local use and interpretation of these concepts remain challenging. Inclusive engagement, shared and comprehensive understanding, and continuous exchange and learning processes could help to improve cross-border policy-making for sustainable delta management

Aperture array development for future large radio telescopes

We present the design of a phased array system for future radio telescopes. This includes a system overview and recent results of the designed and implemented system, the Electronic Multi-Beam Radio Astronomy Concept (EMBRACE). Furthermore, simulations with a full-EM antenna simulator, combined with measurements on actual hardware, will provide information for the next design step, the Aperture Array Verification System (AAVS). With AAVS, we will prove design readiness of this novel array technology

New highway development in the Netherlands: A residents’ perspective

This study investigates the impacts of new highway development from a residents’ perspective. Data were collected by questionnaire in two residential areas, Son and Uden, both situated along the new A50 highway in the Netherlands. The objectives of this study are: 1) to analyse the extent to which highway development has impacted the residents’ self-reported residential satisfaction through the use of Structural Equation Modeling, and 2) to explore residential self-selection, by comparing characteristics of the original population with those who have relocated into the area during and after highway development using Multinomial Logistic Regression. The results indicate that a small majority of the residents perceived an increase in residential satisfaction due to the highway development. Living in the sampled area in Son (compared to Uden), living on close proximity to the A50 highway, having a low preference for car accessibility, and a strong preference for environmental quality were negatively associated with the change in residential satisfaction, mostly via a negative association with the perceived change in liveability or accessibility. The findings of our second analysis show that residents who had relocated into the area after the highway development have a slightly more ‘highway-oriented’ profile than the original population, i.e. a marginally higher preference for car accessibility and lower preference for environmental quality. The study sheds light on the importance of accounting for the perceptions of the wider residential population and reveals how the impacts of new highway development differ between and within residential areas

Chapter Modern Orthopaedic Implant Coatings — Their Pro’s, Con’s and Evaluation Methods

Environmental monitorin

It would be a Pleasure : Augmented Reality and Engagement in a Heritage Context

The interchangeability, confusion and conflict of what constitutes audience engagement has a long history, with much disagreement concerning boundaries and definitions. Dewey states that it is a mistake to see the artist as active and the audience as purely passive, and argues that “the active engagement of the audience is required to fully realise any work” (Dewey 1934). This predates the notions of “interactive” or “participatory” as understood today, but highlights the longstanding appreciation of the role the audience plays in the consumption of artworks. A sentiment echoed by Duchamp (1957) stating that “the spectator adds his contribution to the creative act”. The research project presented at EVA 2017 seeks to offer a model for engagement, that of pleasure, which explores methods to motivate active participation

Towards Erlang Verification by Term Rewriting

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-14125-1_7This paper presents a transformational approach to the verification of Erlang programs. We define a stepwise transformation from (first-order) Erlang programs to (non-deterministic) term rewrite systems that compute an overapproximation of the original Erlang program. In this way, existing techniques for term rewriting become available. Furthermore, one can use narrowing as a symbolic execution extension of rewriting in order to design a verification technique. We illustrate our approach with some examples, including a deadlock analysis of a simple Erlang program.Vidal Oriola, GF. (2013). Towards Erlang Verification by Term Rewriting. En Logic-Based Program Synthesis and Transformation. Springer. 109-126. doi:10.1007/978-3-319-14125-1_7S109126Albert, E., Arenas, P., Gómez-Zamalloa, M.: Symbolic Execution of Concurrent Objects in CLP. In: Russo, C., Zhou, N.-F. (eds.) PADL 2012. LNCS, vol. 7149, pp. 123–137. Springer, Heidelberg (2012)Albert, E., Vidal, G.: The narrowing-driven approach to functional logic program specialization. New Generation Computing 20(1), 3–26 (2002)Joe, A., Robert, V., Williams, M.: Concurrent programming in ERLANG. Prentice Hall (1993)Arts, T., Earle, C.B., Derrick, J.: Development of a verified Erlang program for resource locking. STTT 5(2–3), 205–220 (2004)Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)Caballero, R., Martin-Martin, E., Riesco, A., Tamarit, S.: A Declarative Debugger for Sequential Erlang Programs. In: Veanes, M., Viganò, L. (eds.) TAP 2013. LNCS, vol. 7942, pp. 96–114. Springer, Heidelberg (2013)Claessen, K., Svensson, H.: A semantics for distributed Erlang. In: Sagonas, K.F., Armstrong, J. (eds.). In: Proc. of the 2005 ACM SIGPLAN Workshop on Erlang, pp. 78–87. ACM (2005)Earle, C.B.: Symbolic program execution using the Erlang verification tool. In: Alpuente, M. (eds.) Proc. of the 9th International Workshop on Functional and Logic Programming (WFLP 2000), pp. 42–55 (2000)Felleisen, M., Friedman, D.P., Kohlbecker, E.E., Duba, B.F.: A syntactic theory of sequential control. Theor. Comput. Sci. 52, 205–237 (1987)Fredlund, L.-A., Svensson, H.: McErlang: a model checker for a distributed functional programming language. In: Hinze, R., Ramsey, N. (eds). In: Proc. of ICFP 2007, pp. 125–136. ACM (2007)Giesl, J., Arts, T.: Verification of Erlang Processes by Dependency Pairs. Appl. Algebra Eng. Commun. Comput. 12(1/2), 39–72 (2001)Hanus, M. (ed.): Curry: An integrated functional logic language (vers. 0.8.3) (2012), http://www.curry-language.orgHuch, F.: Verification of Erlang Programs using Abstract Interpretation and Model Checking. In: Rémi, D., Lee, P. (eds.) Proc. of ICFP 1999, pp. 261–272. ACM (1999)J.-M., H.: Canonical forms and unification. In: Bibel, W., Kowalski, R. (eds.) 5th Conference on Automated Deduction Les Arcs. LNCS, pp. 318–334. Springer, Heidelberg (1980)Leucker, M., Noll, T.: Rewriting Logic as a Framework for Generic Verification Tools. Electr. Notes Theor. Comput. Sci. 36, 121–137 (2000)Meseguer, J.: Conditioned Rewriting Logic as a United Model of Concurrency. Theor. Comput. Sci. 96(1), 73–155 (1992)Neuhäußer, M.R., Noll, T.: Abstraction and Model Checking of Core Erlang Programs in Maude. Electr. Notes Theor. Comput. Sci. 176(4), 147–163 (2007)Nishida, N., Vidal, G.: A finite representation of the narrowing space. In: Proc. of the 23th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2013). Technical Report TR-11-13, Universidad Complutense de Madrid, pp. 113–128 (To appear in Springer LNCS, 2013). http://users.dsic.upv.es/~gvidal/Noll, T.: A Rewriting Logic Implementation of Erlang. Electr. Notes Theor. Comput. Sci. 44(2), 206–224 (2001)Noll, T.: Equational Abstractions for Model Checking Erlang Programs. Electr. Notes Theor. Comput. Sci. 118, 145–162 (2005)Noll, T.G., Fredlund, L., Gurov, D.: The Erlang Verification Tool. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 582–586. Springer, Heidelberg (2001)Roy, C.K.: Thomas Noll, Banani Roy, and James R. Cordy. Towards automatic verification of Erlang programs by pi-calculus translation. In: Feeley,M., Trinder, P.W. (eds.) Proc. of the 2006 ACM SIGPLAN Workshop on Erlang, pp. 38–50. ACM (2006)Slagle, J.R.: Automated theorem-proving for theories with simplifiers, commutativity and associativity. Journal of the ACM 21(4), 622–642 (1974)Svensson, H., Fredlund, L.-A.: A more accurate semantics for distributed Erlang. In: Thompson, S.J., Fredlund. L.-A., (eds.) Proceedings of the 2007 ACM SIGPLAN Workshop on Erlang, pp. 43–54. ACM (2007)Vidal, G.: Closed symbolic execution for verifying program termination. In: Proc. of the 12th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2012), pp. 34–43. IEEE (2012)Visser, W., Havelund, K., Brat, G.P., Park, S., Lerda, F.: Model checking programs. Autom. Softw. Eng. 10(2), 203–232 (2003

Computer simulation of diffusion processes in tilt spatio-periodic potentials

Нещодавно було показано, що в істотно нерівноважних системах коефіцієнт дифузії може вести себе немонотонно з температурою. Одним із прикладів таких систем з аномальною температурної залежністю є рух броунівських часток в просторово-періодичних структурах. Метою статті було дослідження зміни температурної залежності дифузії в недодемпфованих системах з низьким коефіцієнтом тертя. В роботі методами комп'ютерного моделювання вивчено зміна коефіцієнта дифузії частинок в широкому діапазоні температур в нахилених просторово-періодичних потенціалах для різних значень коефіцієнта тертя. Показано, що дифузія досягає максимуму при певній величині зовнішньої сили. Її значення залежить від величини коефіцієнта тертя. Показано, що на відміну від звичайної залежності Аррениуса, в разі нахиленого періодичного потенціалу, максимальний коефіцієнт дифузії зростає, а не зменшується з пониженням температури експоненціальним чином. Встановлено, що така залежність характерна для всіх недодемпфованих систем. Показано, що для просторово-періодичних структур існує обмежена ділянка сил, в якому спостерігається зростання коефіцієнта дифузії зі зменшенням температури. Це область так званої температурно-аномальної дифузії (ТАД). Визначено ширина і положення області ТАД в залежності від коефіцієнта тертя γ і параметрів системи. Показано, що зі зменшенням γ, ширина області ТАД зменшується пропорційно γ. При цьому коефіцієнт дифузії в області ТАД, навпаки зростає ~γ. Отримані дані про температурно-аномальної дифузії мають важливе значення для різних областей фізики і техніки та відкривають перспективи створення новітніх технологій управління процесами дифузії.It was recently shown that in essentially nonequilibrium systems, the diffusion coefficient can behave nonmonotonically with temperature. One example of such systems with anomalous temperature dependence is the motion of Brownian particles in spatially periodic structures. The aim of the article was to study the change in the temperature dependence of diffusion in underdamped systems with a low coefficient of friction. In this paper, computer simulation methods are used to study the change in the diffusion coefficient of particles in a wide range of temperatures in oblique spatially periodic potentials for different values of the friction coefficient. It is shown that diffusion reaches a maximum at a certain external force. Its value depends on the coefficient of friction. It is shown that, in contrast to the usual Arrhenius dependence, in the case of an inclined periodic potential, the maximum diffusion coefficient increases while temperature is decreasing exponentially. It is established that such a dependence is common to all underdamped systems. It is shown that for spatially periodic structures there is a limited portion of forces in which an increase in the diffusion coefficient while decreasing temperature is observed. This is the area of the so-called temperature-anomalous diffusion (TAD). The width and position of the TAD region are determined depending on the friction coefficient γ and the system parameters. It has been shown that a decrease in γ, width TAD region decreases proportionally γ. In this case, the diffusion coefficient in the TAD region, on the contrary, increases ~γ. The data obtained on the temperature and the anomalous diffusion are important for various fields of physics and engineering, and opens new prospects for a diffusion process control technology

A Finite Representation of the Narrowing Space

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-14125-1_4Narrowing basically extends rewriting by allowing free variables in terms and by replacing matching with unification. As a consequence, the search space of narrowing becomes usually infinite, as in logic programming. In this paper, we introduce the use of some operators that allow one to always produce a finite data structure that still represents all the narrowing derivations. Furthermore, we extract from this data structure a novel, compact equational representation of the (possibly infinite) answers computed by narrowing for a given initial term. Both the finite data structure and the equational representation of the computed answers might be useful in a number of areas, like program comprehension, static analysis, program transformation, etc.Nishida, N.; Vidal, G. (2013). A Finite Representation of the Narrowing Space. En Logic-Based Program Synthesis and Transformation. Springer. 54-71. doi:10.1007/978-3-319-14125-1_4S5471Albert, E., Vidal, G.: The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing 20(1), 3–26 (2002)Alpuente, M., Falaschi, M., Vidal, G.: Partial Evaluation of Functional Logic Programs. ACM Transactions on Programming Languages and Systems 20(4), 768–844 (1998)Alpuente, M., Falaschi, M., Vidal, G.: Compositional Analysis for Equational Horn Programs. In: Rodríguez-Artalejo, M., Levi, G. (eds.) ALP 1994. LNCS, vol. 850, pp. 77–94. Springer, Heidelberg (1994)Antoy, S., Ariola, Z.: Narrowing the Narrowing Space. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 1–15. Springer, Heidelberg (1997)Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1–2), 133–178 (2000)Arts, T., Zantema, H.: Termination of Logic Programs Using Semantic Unification. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol. 1048, pp. 219–233. Springer, Heidelberg (1996)Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)Bae, K., Escobar, S., Meseguer, J.: Abstract Logical Model Checking of Infinite-State Systems Using Narrowing. In: Proceedings of the 24th International Conference on Rewriting Techniques and Applications. LIPIcs, vol. 21, pp. 81–96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)De Schreye, D., Glück, R., Jørgensen, J., Leuschel, M., Martens, B., Sørensen, M.: Conjunctive partial deduction: foundations, control, algorihtms, and experiments. Journal of Logic Programming 41(2&3), 231–277 (1999)Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties. Theoretical Computer Science 367(1–2), 162–202 (2006)Escobar, S., Meseguer, J.: Symbolic Model Checking of Infinite-State Systems Using Narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 153–168. Springer, Heidelberg (2007)Fribourg, L.: SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. In: Proceedings of the Symposium on Logic Programming, pp. 172–185. IEEE Press (1985)Gnaedig, I., Kirchner, H.: Proving weak properties of rewriting. Theoretical Computer Science 412(34), 4405–4438 (2011)Hanus, M.: The integration of functions into logic programming: From theory to practice. Journal of Logic Programming 19&20, 583–628 (1994)Hanus, M. (ed.): Curry: An integrated functional logic language (vers. 0.8.3) (2012). http://www.curry-language.orgHermenegildo, M., Rossi, F.: On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs. In: Lusk, E., Overbeck, R. (eds.) Proceedings of the 1989 North American Conf. on Logic Programming, pp. 369–389. The MIT Press, Cambridge (1989)Hölldobler, S. (ed.): Foundations of Equational Logic Programming. LNCS, vol. 353. Springer, Heidelberg (1989)Meseguer, J., Thati, P.: Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols. Electronic Notes in Theoretical Computer Science 117, 153–182 (2005)Middeldorp, A., Okui, S.: A Deterministic Lazy Narrowing Calculus. Journal of Symbolic Computation 25(6), 733–757 (1998)Nishida, N., Sakai, M., Sakabe, T.: Generation of Inverse Computation Programs of Constructor Term Rewriting Systems. IEICE Transactions on Information and Systems J88–D–I(8), 1171–1183 (2005) (in Japanese)Nishida, N., Sakai, M., Sakabe, T.: Partial Inversion of Constructor Term Rewriting Systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 264–278. Springer, Heidelberg (2005)Nishida, N., Vidal, G.: Program inversion for tail recursive functions. In: Schmidt-Schauß, M. (ed.) Proceedings of the 22nd International Conference on Rewriting Techniques and Applications. LIPIcs, vol. 10, pp. 283–298. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)Nishida, N., Vidal, G.: Computing More Specific Versions of Conditional Rewriting Systems. In: Albert, E. (ed.) LOPSTR 2012. LNCS, vol. 7844, pp. 137–154. Springer, Heidelberg (2013)Nutt, W., Réty, P., Smolka, G.: Basic Narrowing Revisited. Journal of Symbolic Computation 7(3/4), 295–317 (1989)Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, London, UK (2002)Palamidessi, C.: Algebraic Properties of Idempotent Substitutions. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 386–399. Springer, Heidelberg (1990)Ramos, J.G., Silva, J., Vidal, G.: Fast Narrowing-Driven Partial Evaluation for Inductively Sequential Systems. In: Danvy, O., Pierce, B.C. (eds.) Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, pp. 228–239. ACM Press (2005)Slagle, J.R.: Automated theorem-proving for theories with simplifiers, commutativity and associativity. Journal of the ACM 21(4), 622–642 (1974