Correcting Interdevice Bias of Horizontal White-to-White and Sulcus-to-Sulcus Measures Used for Implantable Collamer Lens Sizing.

PURPOSE: To assess the agreement and repeatability of horizontal white-to-white (WTW) and horizontal sulcus-to-sulcus (STS) diameter measurements and use these data in combination with available literature to correct for interdevice bias in preoperative implantable collamer lens (ICL) size selection. DESIGN: Interinstrument reliability and bias assessment study. METHODS: A total of 107 eyes from 56 patients assessed for ICL implantation at our institution were included in the study. This was a consecutive series of all patients with suitable available data. The agreement and bias between WTW (measured with the Pentacam and BioGraph devices) and STS (measured with the HiScan device) were estimated. RESULTS: The mean spherical equivalent was -8.93 ± 5.69 diopters. The BioGraph measures of WTW were wider than those taken with the Pentacam (bias = 0.26 mm, P < .01), and both horizontal WTW measures were wider than the horizontal STS measures (bias >0.91 mm, P < .01). The repeatability (Sr) of STS measured with the HiScan was 0.39 mm, which was significantly reduced (Sr = 0.15 mm) when the average of 2 measures was used. Agreement between the horizontal WTW measures and horizontal STS estimates when bias was accounted for was г = 0.54 with the Pentacam and г = 0.64 with the BioGraph. CONCLUSIONS: Large interdevice bias was observed for WTW and STS measures. STS measures demonstrated poor repeatability, but the average of repeated measures significantly improved repeatability. In order to conform to the US Food and Drug Administration's accepted guidelines for ICL sizing, clinicians should be aware of and account for the inconsistencies between devices.

Many valued algebraic structures as measures of comparison

This thesis studies the properties and usability of operators called t-norms, t-conorms, uninorms, as well as many valued implications and equivalences. Into these operators, weights and a generalized mean are embedded for aggregation, and they are used for comparison tasks and for this reason they are referred to as comparison measures. The thesis illustrates how these operators can be weighted with a differential evolution and aggregated with a generalized mean, and the kinds of measures of comparison that can be achieved from this procedure. New operators suitable for comparison measures are suggested. These operators are combination measures based on the use of t-norms and t-conorms, the generalized 3_-uninorm and pseudo equivalence measures based on S-type implications. The empirical part of this thesis demonstrates how these new comparison measures work in the field of classification, for example, in the classification of medical data. The second application area is from the field of sports medicine and it represents an expert system for defining an athlete's aerobic and anaerobic thresholds. The core of this thesis offers definitions for comparison measures and illustrates that there is no actual difference in the results achieved in comparison tasks, by the use of comparison measures based on distance, versus comparison measures based on many valued logical structures. The approach has been highly practical in this thesis and all usage of the measures has been validated mainly by practical testing. In general, many different types of operators suitable for comparison tasks have been presented in fuzzy logic literature and there has been little or no experimental work with these operators.

Conservation Laws in Cellular Automata

Conservation laws in physics are numerical invariants of the dynamics of a system. In cellular automata (CA), a similar concept has already been defined and studied. To each local pattern of cell states a real value is associated, interpreted as the “energy” (or “mass”, or . . . ) of that pattern.The overall “energy” of a configuration is simply the sum of the energy of the local patterns appearing on different positions in the configuration. We have a conservation law for that energy, if the total energy of each configuration remains constant during the evolution of the CA. For a given conservation law, it is desirable to find microscopic explanations for the dynamics of the conserved energy in terms of flows of energy from one region toward another. Often, it happens that the energy values are from non-negative integers, and are interpreted as the number of “particles” distributed on a configuration. In such cases, it is conjectured that one can always provide a microscopic explanation for the conservation laws by prescribing rules for the local movement of the particles. The onedimensional case has already been solved by Fuk´s and Pivato. We extend this to two-dimensional cellular automata with radius-0,5 neighborhood on the square lattice. We then consider conservation laws in which the energy values are chosen from a commutative group or semigroup. In this case, the class of all conservation laws for a CA form a partially ordered hierarchy. We study the structure of this hierarchy and prove some basic facts about it. Although the local properties of this hierarchy (at least in the group-valued case) are tractable, its global properties turn out to be algorithmically inaccessible. In particular, we prove that it is undecidable whether this hierarchy is trivial (i.e., if the CA has any non-trivial conservation law at all) or unbounded. We point out some interconnections between the structure of this hierarchy and the dynamical properties of the CA. We show that positively expansive CA do not have non-trivial conservation laws. We also investigate a curious relationship between conservation laws and invariant Gibbs measures in reversible and surjective CA. Gibbs measures are known to coincide with the equilibrium states of a lattice system defined in terms of a Hamiltonian. For reversible cellular automata, each conserved quantity may play the role of a Hamiltonian, and provides a Gibbs measure (or a set of Gibbs measures, in case of phase multiplicity) that is invariant. Conversely, every invariant Gibbs measure provides a conservation law for the CA. For surjective CA, the former statement also follows (in a slightly different form) from the variational characterization of the Gibbs measures. For one-dimensional surjective CA, we show that each invariant Gibbs measure provides a conservation law. We also prove that surjective CA almost surely preserve the average information content per cell with respect to any probability measure.

View-dependent information theory quality measures for pixel sampling and scene discretization in flatland

In this paper, we present view-dependent information theory quality measures for pixel sampling and scene discretization in flatland. The measures are based on a definition for the mutual information of a line, and have a purely geometrical basis. Several algorithms exploiting them are presented and compare well with an existing one based on depth differences

Informational Aesthetics Measures

The Birkhoff aesthetic measure of an object is the ratio between order and complexity. Informational aesthetics describes the interpretation of this measure from an information-theoretic perspective. From these ideas, the authors define a set of ratios based on information theory and Kolmogorov complexity that can help to quantify the aesthetic experience

Reward networks in the brain as captured by connectivity measures

An assortment of human behaviors is thought to be driven by rewards including reinforcement learning, novelty processing, learning, decision making, economic choice, incentive motivation, and addiction. In each case the ventral tegmental area/ventral striatum (nucleus accumbens) (VTAVS) system has been implicated as a key structure by functional imaging studies, mostly on the basis of standard, univariate analyses. Here we propose that standard functional magnetic resonance imaging analysis needs to be complemented by methods that take into account the differential connectivity of the VTAVS system in the different behavioral contexts in order to describe reward based processes more appropriately. We fi rst consider the wider network for reward processing as it emerged from animal experimentation. Subsequently, an example for a method to assess functional connectivity is given. Finally, we illustrate the usefulness of such analyses by examples regarding reward valuation, reward expectation and the role of reward in addiction.

Cross-country data on the quantity of schooling: a selective survey and some quality measures

We survey a number of papers that have focused on the construction of cross-country data sets on average years of schooling. We discuss the construction of the different series, compare their profiles and construct indicators of their information content. The discussion focuses on a sample of OECD countries but we also provide some results for a large non-OECD sample.

Governmental Measures to Enhance the Finnish Innovation System to Respond to the Challenge of Mitigating Climate Change

Climate innovations, that cover both technological applications and process and service innovations, play a key role in climate change mitigation. The purpose of this study was to examine how the Finnish innovation system could be enhanced with governmental measures so that the diffusion of climate innovations could be speeded up. During the study, it became evident that the governmental measures need to support the whole innovation chain, which comprises of research, development, demonstration and deployment. Only this can lead to the successful birth and diffusion of low carbon innovations. The study found that the strengths of the Finnish innovation system are research and development, and the current national innovation policies strongly support these activities. However, these have been emphasised at the expense of the demonstration and deployment. Consequently, the biggest bottlenecks in the Finnish innovation landscape are the lack of pilot and demonstration projects and slow commercialisation, thus the high price of the innovation. To meet with the challenge, the government should firstly promote strict greenhouse gas emission reduction targets. This would boost up the innovation activities, which would also lower the prices of the innovations. To speed up the commercialisation process, measures that stimulate the domestic market, such as feed-in-tariffs and public procurements, are needed. Special attention should also be paid to the measures that could shift the traditional closed innovation chain towards open innovation. This means that the product development should involve experts from several fields such as the user and marketing experts to speed up the commercialisation. In addition, efficient innovation co-operation between both private and public sector is essential. Finally, as the domestic resources are not adequate for producing all the innovations needed, the domestic innovation activities should be focused on a few sectors, and at the same time promote efficient import policies.

Tool-supported invariant-based programming

The development of correct programs is a core problem in computer science. Although formal verification methods for establishing correctness with mathematical rigor are available, programmers often find these difficult to put into practice. One hurdle is deriving the loop invariants and proving that the code maintains them. So called correct-by-construction methods aim to alleviate this issue by integrating verification into the programming workflow. Invariant-based programming is a practical correct-by-construction method in which the programmer first establishes the invariant structure, and then incrementally extends the program in steps of adding code and proving after each addition that the code is consistent with the invariants. In this way, the program is kept internally consistent throughout its development, and the construction of the correctness arguments (proofs) becomes an integral part of the programming workflow. A characteristic of the approach is that programs are described as invariant diagrams, a graphical notation similar to the state charts familiar to programmers. Invariant-based programming is a new method that has not been evaluated in large scale studies yet. The most important prerequisite for feasibility on a larger scale is a high degree of automation. The goal of the Socos project has been to build tools to assist the construction and verification of programs using the method. This thesis describes the implementation and evaluation of a prototype tool in the context of the Socos project. The tool supports the drawing of the diagrams, automatic derivation and discharging of verification conditions, and interactive proofs. It is used to develop programs that are correct by construction. The tool consists of a diagrammatic environment connected to a verification condition generator and an existing state-of-the-art theorem prover. Its core is a semantics for translating diagrams into verification conditions, which are sent to the underlying theorem prover. We describe a concrete method for 1) deriving sufficient conditions for total correctness of an invariant diagram; 2) sending the conditions to the theorem prover for simplification; and 3) reporting the results of the simplification to the programmer in a way that is consistent with the invariantbased programming workflow and that allows errors in the program specification to be efficiently detected. The tool uses an efficient automatic proof strategy to prove as many conditions as possible automatically and lets the remaining conditions be proved interactively. The tool is based on the verification system PVS and i uses the SMT (Satisfiability Modulo Theories) solver Yices as a catch-all decision procedure. Conditions that were not discharged automatically may be proved interactively using the PVS proof assistant. The programming workflow is very similar to the process by which a mathematical theory is developed inside a computer supported theorem prover environment such as PVS. The programmer reduces a large verification problem with the aid of the tool into a set of smaller problems (lemmas), and he can substantially improve the degree of proof automation by developing specialized background theories and proof strategies to support the specification and verification of a specific class of programs. We demonstrate this workflow by describing in detail the construction of a verified sorting algorithm. Tool-supported verification often has little to no presence in computer science (CS) curricula. Furthermore, program verification is frequently introduced as an advanced and purely theoretical topic that is not connected to the workflow taught in the early and practically oriented programming courses. Our hypothesis is that verification could be introduced early in the CS education, and that verification tools could be used in the classroom to support the teaching of formal methods. A prototype of Socos has been used in a course at Åbo Akademi University targeted at first and second year undergraduate students. We evaluate the use of Socos in the course as part of a case study carried out in 2007.

Comparison measures of maps generated by geostatistical methods

This study uses several measures derived from the error matrix for comparing two thematic maps generated with the same sample set. The reference map was generated with all the sample elements and the map set as the model was generated without the two points detected as influential by the analysis of local influence diagnostics. The data analyzed refer to the wheat productivity in an agricultural area of 13.55 ha considering a sampling grid of 50 x 50 m comprising 50 georeferenced sample elements. The comparison measures derived from the error matrix indicated that despite some similarity on the maps, they are different. The difference between the estimated production by the reference map and the actual production was of 350 kilograms. The same difference calculated with the mode map was of 50 kilograms, indicating that the study of influential points is of fundamental importance to obtain a more reliable estimative and use of measures obtained from the error matrix is a good option to make comparisons between thematic maps.

Feature selection using Fuzzy Entropy measures with Yu's Similarity measure

In this study, feature selection in classification based problems is highlighted. The role of feature selection methods is to select important features by discarding redundant and irrelevant features in the data set, we investigated this case by using fuzzy entropy measures. We developed fuzzy entropy based feature selection method using Yu's similarity and test this using similarity classifier. As the similarity classifier we used Yu's similarity, we tested our similarity on the real world data set which is dermatological data set. By performing feature selection based on fuzzy entropy measures before classification on our data set the empirical results were very promising, the highest classification accuracy of 98.83% was achieved when testing our similarity measure to the data set. The achieved results were then compared with some other results previously obtained using different similarity classifiers, the obtained results show better accuracy than the one achieved before. The used methods helped to reduce the dimensionality of the used data set, to speed up the computation time of a learning algorithm and therefore have simplified the classification task

Containment Measures in Adolescent Psychiatric Care - Focus on Mechanical Restrain

Rajoitetoimet, erityisesti sitominen, nuorisopsykiatrisessa hoitotyössä Tutkimuksen tavoitteena oli kuvata ja syventää tietoa rajoitetoimien, erityisesti sitomisen, käytöstä nuorisopsykiatrisessa vastentahtoisessa osastohoidossa. Tutkimuksen tavoitteena oli kuvata hoitajien, lääkäreiden ja potilaiden asenteita eri rajoittamiskeinoja kohtaan nuorisopsykiatrisessa osastohoidossa, kerätä tietoa yhden vuoden aikana tapahtuneiden sitomisten määrästä ja luonteesta sekä kuvata potilaiden kokemuksia sitomisesta nuorisopsykiatrisen osastohoidon aikana. Tutkimus tuottaa arvokasta tietoa korkeatasoisten sitomiskäytäntöjen kehittämiseen nuorisopsykiatrisessa osastohoidossa, sekä sitomisten määrää vähentämällä että sitomistapoja kehittämällä. Tavoitteena on parantaa sidottujen potilaiden kliinistä hoitoa. Tutkimusaineisto kerättiin suomalaisilla, pääkaupunkiseudulle sijoittuvilla, nuorisopsykiatrisilla osastoilla neljässä vaiheessa lokakuun 2009 ja huhtikuun 2012 välisenä aikana. Helsingin ja Uudenmaan sairaanhoitopiirin (HUS) nuorisopsykiatrian erikoisalan seitsemän suljetun osaston hoitohenkilökunta sekä lääkärit suhtautuivat myönteisesti rajoittamistoimenpiteisiin. Nuorisopsykiatriset potilaat suhtautuivat rajoittamistoimenpiteisiin kriittisemmin kuin henkilökunta. Nuoret suhtautuivat myönteisimmin tarvittaessa annettavaan lääkitykseen, ajoittaiseen tarkkailuun ja kulun rajoittamiseen. Vähiten hyväksytty menetelmä oli verkkosänky. Nuoret arvioivat sitomisen kolmen vähiten hyväksytyn menetelmän joukkoon. Sitomisen esiintyvyys ja pitkien sitomisten määrä olivat korkeita tutkimukseen valituissa yksiköissä. Useimmat sidotut nuoret tiesivät syyn sitomiseensa, suhtautuivat siihen ambivalentisti nähden siinä sekä hyötyä että haittaa, pitäen sitä kuitenkin rangaistuksena. Huolimatta tästä, suurin osa haastatelluista nuorista koki, että joissain tilanteissa sitomista tarvitaan nuorisopsykiatrisessa osastohoidossa. Nuorilla oli monia ehdotuksia, kuinka parantaa sitomista käytännön osastohoidossa. Tämä väitöskirja tuottaa uutta tietoa eri rajoittamistoimenpiteiden ja sitomisen toteuttamisesta nuorisopsykiatrisessa osastohoidossa. Käytännön hoitotyön parantamiseksi nuorisopsykiatrisilla osastoilla tarvitaan laaja-alaista ja syvälle luotaavaa koulutusta, jotta rajoittamis-toimenpiteiden määrää voidaan vähentää. Myös kriisitilanteiden hallintaan tarvitaan uusia keinoja. Tietoa, kuvausta toimenpiteistä ja tilanteiden käsittelyä jälkikäteen tulee tarjota ala-ikäiselle potilaalle hänen kehitystasonsa huomioiden. Sitomisten määrää tulee vähentää ja niiden kestoa lyhentää. Nuorten tulee olla aktiivisesti mukana kehittämässä aggression hallintamenetelmiä suomalaisessa nuorisopsykiatrisessa osastohoidossa.