Vollständiges taschen-wörterbuch der čechoslavischen u. deutschen sprache, mit der neuen orthographie.

1. Deutsch-čechoslavischer theil.--2. Čechoslavisch-deutscher theil.

Time complexity and convergence analysis of domain theoretic Picard method

We present an implementation of the domain-theoretic Picard method for solving initial value problems (IVPs) introduced by Edalat and Pattinson [1]. Compared to Edalat and Pattinson's implementation, our algorithm uses a more efficient arithmetic based on an arbitrary precision floating-point library. Despite the additional overestimations due to floating-point rounding, we obtain a similar bound on the convergence rate of the produced approximations. Moreover, our convergence analysis is detailed enough to allow a static optimisation in the growth of the precision used in successive Picard iterations. Such optimisation greatly improves the efficiency of the solving process. Although a similar optimisation could be performed dynamically without our analysis, a static one gives us a significant advantage: we are able to predict the time it will take the solver to obtain an approximation of a certain (arbitrarily high) quality.

A type system with usage aspects

Linear typing schemes can be used to guarantee non-interference and so the soundness of in-place update with respect to a functional semantics. But linear schemes are restrictive in practice, and more restrictive than necessary to guarantee soundness of in-place update. This limitation has prompted research into static analysis and more sophisticated typing disciplines to determine when in-place update may be safely used, or to combine linear and non-linear schemes. Here we contribute to this direction by defining a new typing scheme that better approximates the semantic property of soundness of in-place update for a functional semantics. We begin from the observation that some data are used only in a read-only context, after which it may be safely re-used before being destroyed. Formalising the in-place update interpretation in a machine model semantics allows us to refine this observation, motivating three usage aspects apparent from the semantics that are used to annotate function argument types. The aspects are (1) used destructively, (2), used read-only but shared with result, and (3) used read-only and not shared with the result. The main novelty is aspect (2), which allows a linear value to be safely read and even aliased with a result of a function without being consumed. This novelty makes our type system more expressive than previous systems for functional languages in the literature. The system remains simple and intuitive, but it enjoys a strong soundness property whose proof is non-trivial. Moreover, our analysis features principal types and feasible type reconstruction, as shown in M. Konen'y (In TYPES 2002 workshop, Nijmegen, Proceedings, Springer-Verlag, 2003).

Semantics of query-driven communication of exact values

We address the question of how to communicate among distributed processes valuessuch as real numbers, continuous functions and geometrical solids with arbitrary precision, yet efficiently. We extend the established concept of lazy communication using streams of approximants by introducing explicit queries. We formalise this approach using protocols of a query-answer nature. Such protocols enable processes to provide valid approximations with certain accuracy and focusing on certain locality as demanded by the receiving processes through queries. A lattice-theoretic denotational semantics of channel and process behaviour is developed. Thequery space is modelled as a continuous lattice in which the top element denotes the query demanding all the information, whereas other elements denote queries demanding partial and/or local information. Answers are interpreted as elements of lattices constructed over suitable domains of approximations to the exact objects. An unanswered query is treated as an error anddenoted using the top element. The major novel characteristic of our semantic model is that it reflects the dependency of answerson queries. This enables the definition and analysis of an appropriate concept of convergence rate, by assigning an effort indicator to each query and a measure of information content to eachanswer. Thus we capture not only what function a process computes, but also how a process transforms the convergence rates from its inputs to its outputs. In future work these indicatorscan be used to capture further computational complexity measures. A robust prototype implementation of our model is available.

Enclosing the behavior of a hybrid system up to and beyond a Zeno point

Even simple hybrid systems like the classic bouncing ball can exhibit Zeno behaviors. The existence of this type of behavior has so far forced simulators to either ignore some events or risk looping indefinitely. This in turn forces modelers to either insert ad hoc restrictions to circumvent Zeno behavior or to abandon hybrid modeling. To address this problem, we take a fresh look at event detection and localization. A key insight that emerges from this investigation is that an enclosure for a given time interval can be valid independently of the occurrence of a given event. Such an event can then even occur an unbounded number of times, thus making it possible to handle certain types of Zeno behavior.

Function interval arithmetic

We propose an arithmetic of function intervals as a basis for convenient rigorous numerical computation. Function intervals can be used as mathematical objects in their own right or as enclosures of functions over the reals. We present two areas of application of function interval arithmetic and associated software that implements the arithmetic: (1) Validated ordinary differential equation solving using the AERN library and within the Acumen hybrid system modeling tool. (2) Numerical theorem proving using the PolyPaver prover. © 2014 Springer-Verlag.

Polynomial function intervals for floating-point software verification

The focus of our work is the verification of tight functional properties of numerical programs, such as showing that a floating-point implementation of Riemann integration computes a close approximation of the exact integral. Programmers and engineers writing such programs will benefit from verification tools that support an expressive specification language and that are highly automated. Our work provides a new method for verification of numerical software, supporting a substantially more expressive language for specifications than other publicly available automated tools. The additional expressivity in the specification language is provided by two constructs. First, the specification can feature inclusions between interval arithmetic expressions. Second, the integral operator from classical analysis can be used in the specifications, where the integration bounds can be arbitrary expressions over real variables. To support our claim of expressivity, we outline the verification of four example programs, including the integration example mentioned earlier. A key component of our method is an algorithm for proving numerical theorems. This algorithm is based on automatic polynomial approximation of non-linear real and real-interval functions defined by expressions. The PolyPaver tool is our implementation of the algorithm and its source code is publicly available. In this paper we report on experiments using PolyPaver that indicate that the additional expressivity does not come at a performance cost when comparing with other publicly available state-of-the-art provers. We also include a scalability study that explores the limits of PolyPaver in proving tight functional specifications of progressively larger randomly generated programs. © 2014 Springer International Publishing Switzerland.

Regrouping metric-space search index for search engine size adaptation

This work contributes to the development of search engines that self-adapt their size in response to fluctuations in workload. Deploying a search engine in an Infrastructure as a Service (IaaS) cloud facilitates allocating or deallocating computational resources to or from the engine. In this paper, we focus on the problem of regrouping the metric-space search index when the number of virtual machines used to run the search engine is modified to reflect changes in workload. We propose an algorithm for incrementally adjusting the index to fit the varying number of virtual machines. We tested its performance using a custom-build prototype search engine deployed in the Amazon EC2 cloud, while calibrating the results to compensate for the performance fluctuations of the platform. Our experiments show that, when compared with computing the index from scratch, the incremental algorithm speeds up the index computation 2–10 times while maintaining a similar search performance.

Estimation of a Regression Function on a Point Process and its Application to Financial Ruin Risk Forecast

2000 Mathematics Subject Classification: Primary 60G55; secondary 60G25.

Enclosing the behavior of a hybrid automaton up to and beyond a Zeno point

Even simple hybrid automata like the classic bouncing ball can exhibit Zeno behavior. The existence of this type of behavior has so far forced a large class of simulators to either ignore some events or risk looping indefinitely. This in turn forces modelers to either insert ad-hoc restrictions to circumvent Zeno behavior or to abandon hybrid automata. To address this problem, we take a fresh look at event detection and localization. A key insight that emerges from this investigation is that an enclosure for a given time interval can be valid independent of the occurrence of a given event. Such an event can then even occur an unbounded number of times. This insight makes it possible to handle some types of Zeno behavior. If the post-Zeno state is defined explicitly in the given model of the hybrid automaton, the computed enclosure covers the corresponding trajectory that starts from the Zeno point through a restarted evolution.

Characterizing Internet worm spatial-temporal infection structures

Since the Morris worm was released in 1988, Internet worms continue to be one of top security threats. For example, the Conficker worm infected 9 to 15 million machines in early 2009 and shut down the service of some critical government and medical networks. Moreover, it constructed a massive peer-to-peer (P2P) botnet. Botnets are zombie networks controlled by attackers setting out coordinated attacks. In recent years, botnets have become the number one threat to the Internet. The objective of this research is to characterize spatial-temporal infection structures of Internet worms, and apply the observations to study P2P-based botnets formed by worm infection. First, we infer temporal characteristics of the Internet worm infection structure, i.e., the host infection time and the worm infection sequence, and thus pinpoint patient zero or initially infected hosts. Specifically, we apply statistical estimation techniques on Darknet observations. We show analytically and empirically that our proposed estimators can significantly improve the inference accuracy. Second, we reveal two key spatial characteristics of the Internet worm infection structure, i.e., the number of children and the generation of the underlying tree topology formed by worm infection. Specifically, we apply probabilistic modeling methods and a sequential growth model. We show analytically and empirically that the number of children has asymptotically a geometric distribution with parameter 0.5, and the generation follows closely a Poisson distribution. Finally, we evaluate bot detection strategies and effects of user defenses in P2P-based botnets formed by worm infection. Specifically, we apply the observations of the number of children and demonstrate analytically and empirically that targeted detection that focuses on the nodes with the largest number of children is an efficient way to expose bots. However, we also point out that future botnets may self-stop scanning to weaken targeted detection, without greatly slowing down the speed of worm infection. We then extend the worm spatial infection structure and show empirically that user defenses, e.g. , patching or cleaning, can significantly mitigate the robustness and the effectiveness of P2P-based botnets. To counterattack, we evaluate a simple measure by future botnets that enhances topology robustness through worm re-infection.

Assessing the Knowledge and Attitude Among Somali Men In King County Towards Female Genital Mutilation

Thesis (Master's)--University of Washington, 2016-06

Musings of a private research funder on scholarly journals in Finland

Presentation at the seminar "Publishers and Funders for OA in Finland", Helsinki, May 24, 2016

Integrating corporate responsbility into investor relations. Sustainability report as a part of investor relations.

Corporate responsibility is a question that many stakeholders are interested in. These stakeholders can be e.g. company’s employees, partners, clients, media or investors. Especially for listed companies, investors are one of the most important stakeholders. It is essential for a company to maintain the trust of current investors and gain the trust of potential investors. Investors cannot be divided only into two groups, individual and institutional investors. Investors differ a lot, especially when it comes to investment decisions. Investors can make their investment decisions based on many things, and strong financial performance is not necessarily good enough a reason. Socially responsible investors value responsibility and sustainability related factors when making investment decisions. These things can be divided into three dimensions: environmental, social and economic responsibility. Many companies disclose a sustainability report in order to be able to answer to the needs of different stakeholders, including investors. The purpose of this thesis was to study how companies integrate corporate responsibility into investor relations, and how sustainability report can be used in investor relations. Furthermore, this thesis examined the key elements of sustainability reports. The research was made by a qualitative study in two phases. In the first phase five representatives of two Finnish listed companies, KONE and Kesko were interviewed. The interviewees are professionals within investor relations and corporate responsibility communications. In the second phase of the study the sustainability reports of these two companies were analyzed with content analysis. The existing theory and the interviews created the base for the content analysis. This study suggests that there is a connection between corporate responsibility and investor relations, and those should be integrated. Socially responsible investors are an important target group for companies, and companies should be able to respond to their and other stakeholders’ needs. Sustainability report can be used as a tool both within the company and in external communication for these purposes.

Cost efficient supply processes for the Compact Slim Elevator Door

The aim of this thesis was to observe possibilities to enhance the development of manufacturing costs savings and competitiveness related to the compact KONE Renova Slim elevator door. Compact slim doors are especially designed for EMEA markets. EMEA market area is characterized by highly competitive pricing and lead times which are manifested as pressures to decrease manufacturing costs and lead times of the compact elevator door. The new elevator safety code EN81-20 coming live during the spring 2016 will also have a negative impact on the cost and competitiveness development making the situation more acute. As a sheet metal product the KONE Renova slim is highly variable. Manufacturing methods utilized in the production are common and robust methods. Due to the low volumes, high variability and tight lead times the manufacturing of the doors is facing difficulties. Manufacturing of the doors is outsourced to two individual suppliers Stera and Wittur. This thesis was implemented in collaboration with Stera. KONE and Stera pursue a long term and close partnership where the benefits reached by the collaboration are shared equally. Despite the aims, the collaboration between companies is not totally visible and various barriers are hampering the development towards more efficient ways of working. Based on the empirical studies related to this thesis, an efficient standardized (A+) process was developed for the main variations of the compact elevator door. Using the standardized process KONE is able to order the most important AMDS door variations from Stera with increased quality, lower manufacturing costs and manufacturing lead time compared to the current situation. In addition to all the benefits, the standardized (A+) process also includes risks in practice. KONE and the door supplier need to consider these practical risks together before decisions are made.