The use of branched ketenedimers in solving the deposit problems related to the internal sizing of uncoated fine paper

Alkyl ketene dimers (AKD) are effective and highly hydrophobic sizing agents for the internal sizing of alkaline papers, but in some cases they may form deposits on paper machines and copiers. In addition, alkenyl succinic anhydrides (ASA)- based sizing agents are highly reactive, producing on-machine sizing, but under uncontrolled wet end conditions the hydrolysis of ASA may cause problems. This thesis aims at developing an improved ketene dimer based sizing agent that would have a lower deposit formation tendency on paper machines and copiers than a traditional type of AKD. The aim is also to improve the ink jet printability of a AKD sized paper. The sizing characteristics ofketene dimers have been compared to those of ASA. A lower tendency of ketene dimer deposit formation was shown in paper machine trials and in printability tests when branched fatty acids were used in the manufacture of a ketene dimer basedsizing agent. Fitting the melting and solidification temperature of a ketene dimer size to the process temperature of a paper machine or a copier contributes to machine cleanliness. A lower hydrophobicity of the paper sized with branched ketene dimer compared to the paper sized with traditional AKD was discovered. However, the ink jet print quality could be improved by the use of a branched ketene dimer. The branched ketene dimer helps in balancing the paper hydrophobicity for both black and color printing. The use of a high amount of protective colloidin the emulsification was considered to be useful for the sizing performance ofthe liquid type of sizing agents. Similar findings were indicated for both the branched ketene dimer and ASA.

Improving Information Problem Solving skills in Secondary Education through embedded instruction

This empirical study consists in an investigation of the effects, on the development of Information Problem Solving (IPS) skills, of a long-term embedded, structured and supported instruction in Secondary Education. Forty secondary students of 7th and 8th grades (13–15 years old) participated in the 2-year IPS instruction designed in this study. Twenty of them participated in the IPS instruction, and the remaining twenty were the control group. All the students were pre- and post-tested in their regular classrooms, and their IPS process and performance were logged by means of screen capture software, to warrant their ecological validity. The IPS constituent skills, the web search sub-skills and the answers given by each participant were analyzed. The main findings of our study suggested that experimental students showed a more expert pattern than the control students regarding the constituent skill ‘defining the problem’ and the following two web search sub-skills: ‘search terms’ typed in a search engine, and ‘selected results’ from a SERP. In addition, scores of task performance were statistically better in experimental students than in control group students. The paper contributes to the discussion of how well-designed and well-embedded scaffolds could be designed in instructional programs in order to guarantee the development and efficiency of the students’ IPS skills by using net information better and participating fully in the global knowledge society.

Generating highly balanced sudoku problems as hard problems

Sudoku problems are some of the most known and enjoyed pastimes, with a never diminishing popularity, but, for the last few years those problems have gone from an entertainment to an interesting research area, a twofold interesting area, in fact. On the one side Sudoku problems, being a variant of Gerechte Designs and Latin Squares, are being actively used for experimental design, as in [8, 44, 39, 9]. On the other hand, Sudoku problems, as simple as they seem, are really hard structured combinatorial search problems, and thanks to their characteristics and behavior, they can be used as benchmark problems for refining and testing solving algorithms and approaches. Also, thanks to their high inner structure, their study can contribute more than studies of random problems to our goal of solving real-world problems and applications and understanding problem characteristics that make them hard to solve. In this work we use two techniques for solving and modeling Sudoku problems, namely, Constraint Satisfaction Problem (CSP) and Satisfiability Problem (SAT) approaches. To this effect we define the Generalized Sudoku Problem (GSP), where regions can be of rectangular shape, problems can be of any order, and solution existence is not guaranteed. With respect to the worst-case complexity, we prove that GSP with block regions of m rows and n columns with m = n is NP-complete. For studying the empirical hardness of GSP, we define a series of instance generators, that differ in the balancing level they guarantee between the constraints of the problem, by finely controlling how the holes are distributed in the cells of the GSP. Experimentally, we show that the more balanced are the constraints, the higher the complexity of solving the GSP instances, and that GSP is harder than the Quasigroup Completion Problem (QCP), a problem generalized by GSP. Finally, we provide a study of the correlation between backbone variables – variables with the same value in all the solutions of an instance– and hardness of GSP.

Statistical modelling of CSP solving algorithms performance

The goal of this work is to try to create a statistical model, based only on easily computable parameters from the CSP problem to predict runtime behaviour of the solving algorithms, and let us choose the best algorithm to solve the problem. Although it seems that the obvious choice should be MAC, experimental results obtained so far show, that with big numbers of variables, other algorithms perfom much better, specially for hard problems in the transition phase.

Measurement Problems and Problem-Solving in Kraft Pulping

Tämän työn tarkoituksena on koota yhteen selluprosessin mittausongelmat ja mahdolliset mittaustekniikat ongelmien ratkaisemiseksi. Pääpaino on online-mittaustekniikoissa. Työ koostuu kolmesta osasta. Ensimmäinen osa on kirjallisuustyö, jossa esitellään nykyaikaisen selluprosessin perusmittaukset ja säätötarpeet. Mukana on koko kuitulinja puunkäsittelystä valkaisuun ja kemikaalikierto: haihduttamo, soodakattila, kaustistamo ja meesauuni. Toisessa osassa mittausongelmat ja mahdolliset mittaustekniikat on koottu yhteen ”tiekartaksi”. Tiedot on koottu vierailemalla kolmella suomalaisella sellutehtaalla ja haastattelemalla laitetekniikka- ja mittaustekniikka-asiantuntijoita. Prosessikemian paremmalle ymmärtämiselle näyttää haastattelun perusteella olevan tarvetta, minkä vuoksi konsentraatiomittaukset on valittu jatkotutkimuskohteeksi. Viimeisessä osassa esitellään mahdollisia mittaustekniikoita konsentraatiomittausten ratkaisemiseksi. Valitut tekniikat ovat lähi-infrapunatekniikka (NIR), fourier-muunnosinfrapunatekniikka (FTIR), online-kapillaarielektroforeesi (CE) ja laserindusoitu plasmaemissiospektroskopia (LIPS). Kaikkia tekniikoita voi käyttää online-kytkettyinä prosessikehitystyökaluina. Kehityskustannukset on arvioitu säätöön kytketylle online-laitteelle. Kehityskustannukset vaihtelevat nollasta miestyövuodesta FTIR-tekniikalle viiteen miestyövuoteen CE-laitteelle; kehityskustannukset riippuvat tekniikan kehitysasteesta ja valmiusasteesta tietyn ongelman ratkaisuun. Työn viimeisessä osassa arvioidaan myös yhden mittausongelman – pesuhäviömittauksen – ratkaisemisen teknis-taloudellista kannattavuutta. Ligniinipitoisuus kuvaisi nykyisiä mittauksia paremmin todellista pesuhäviötä. Nykyään mitataan joko natrium- tai COD-pesuhäviötä. Ligniinipitoisuutta voidaan mitata UV-absorptiotekniikalla. Myös CE-laitetta voitaisiin käyttää pesuhäviön mittauksessa ainakin prosessikehitysvaiheessa. Taloudellinen tarkastelu pohjautuu moniin yksinkertaistuksiin ja se ei sovellu suoraan investointipäätösten tueksi. Parempi mittaus- ja säätöjärjestelmä voisi vakauttaa pesemön ajoa. Investointi ajoa vakauttavaan järjestelmään on kannattavaa, jos todellinen ajotilanne on tarpeeksi kaukana kustannusminimistä tai jos pesurin ajo heilahtelee eli pesuhäviön keskihajonta on suuri. 50 000 € maksavalle mittaus- ja säätöjärjestelmälle saadaan alle 0,5 vuoden takaisinmaksuaika epävakaassa ajossa, jos COD-pesuhäviön vaihteluväli on 5,2 – 11,6 kg/odt asetusarvon ollessa 8,4 kg/odt. Laimennuskerroin vaihtelee tällöin välillä 1,7 – 3,6 m3/odt asetusarvon ollessa 2,5 m3/odt.

Early childhood constraint therapy for sensory/motor impairment in cerebral palsy: a randomised clinical trial protocol.

INTRODUCTION: Cerebral palsy (CP) is the most common physical disability in childhood. It is a disorder resulting from sensory and motor impairments due to perinatal brain injury, with lifetime consequences that range from poor adaptive and social function to communication and emotional disturbances. Infants with CP have a fundamental disadvantage in recovering motor function: they do not receive accurate sensory feedback from their movements, leading to developmental disregard. Constraint-induced movement therapy (CIMT) is one of the few effective neurorehabilitative strategies shown to improve upper extremity motor function in adults and older children with CP, potentially overcoming developmental disregard. METHODS AND ANALYSIS: This study is a randomised controlled trial of children 12-24 months corrected age studying the effectiveness of CIMT combined with motor and sensory-motor interventions. The study population will comprise 72 children with CP and 144 typically developing children for a total of N=216 children. All children with CP, regardless of group allocation will continue with their standard of care occupational and physical therapy throughout the study. The research material collected will be in the form of data from high-density array event-related potential scan, standardised assessment scores and motion analysis scores. ETHICS AND DISSEMINATION: The study protocol was approved by the Institutional Review Board. The findings of the trial will be disseminated through peer-reviewed journals and scientific conferences. TRIAL REGISTRATION NUMBER: NCT02567630.

Estimating the effects of fiscal policy under the budget constraint

I reconsider the short-term effects of fiscal policy when both government spending and taxes are allowed to respond to the level of public debt. I embed the long-term government budget constraint in a VAR, and apply this common trends model to US quarterly data. The results overturn some widely held beliefs on fiscal policy effects. The main finding is that expansionary fiscal policy has contractionary effects on output and inflation. Ricardian effects may dominate when fiscal expansions are expected to be adjusted by future tax rises or spending cuts. The evidence supports RBC models with distortionary taxation. We can discard some alternative interpretations that are based on monetary policy reactions or supply-side effects.

Solving Schrödinger equation for two dimensional potentials using supersymmetry

The formalism of supersymmetric Quantum Mechanics can be extended to arbitrary dimensions. We introduce this formalism and explore its utility to solve the Schrödinger equation for a bidimensinal potential. This potential can be applied in several systems in physical and chemistry context , for instance, it can be used to study benzene molecule.

Varieties of the generality constraint

Since its introduction by Evans (1982), the generality constraint (GC) has been invoked by various philosophers for different purposes. Our purpose here is, first, to clarify what precisely the GC states by way of an interpretive framework, the GC Schema, and second, to demonstrate in terms of this framework some problems that arise if one invokes the GC (or systematicity) without clearly specifying an appropriate interpretation. By utilizing the GC Schema these sorts of problems can be avoided, and we thus propose it as a tool to facilitate argumentation that appeals to the GC.

Solving the puzzle of mobile learning adoption

The dissertation seeks to explore how to improve users‘ adoption of mobile learning in current education systems. Considering the difference between basic and tertiary education in China, the research consists of two separate but interrelated parts, which focus on the use of mobile learning in basic and tertiary education contexts, respectively. In the dissertation, two adoption frameworks are developed based on previous studies. The frameworks are then evaluated using different technologies. Concerning mobile learning use in basic education settings, case study methodology is utilized. A leading provider of mobile learning services and products in China, Noah Ltd., is investigated. Multiple sources of evidence are collected to test the framework. Regarding mobile learning adoption in tertiary education contexts, survey research methodology is utilized. Based on 209 useful responses, the framework is evaluated using structural equation modelling technology. Four proposed determinants of intention to use are evaluated, which are perceived ease of use, perceived near-term usefulness, perceived ong-term usefulness and personal innovativeness. The dissertation provides a number of new insights for both researchers and practitioners. In particular, the dissertation specifies a practical solution to deal with the disruptive effects of mobile learning in basic education, which keeps the use of mobile learning away from the schools across such as European countries. A list of new and innovative mobile learning technologies is systematically introduced as well. Further, the research identifies several key factors driving mobile learning adoption in tertiary education settings. In theory, the dissertation suggests that since the technology acceptance model is initiated in work-oriented innovations by testing employees, it is not necessarily the best model for studying educational innovations. The results also suggest that perceived longterm usefulness for educational systems should be as important as perceived usefulness for utilitarian systems, and perceived enjoyment for hedonic systems. A classification based on the nature of systems purpose (utilitarian, hedonic or educational) would contribute to a better understanding of the essence of IT innovation adoption.

Solving Leontief Input-Output Model with Trapezoidal Fuzzy Numbers and Gauss-Seidel Algorithm

In this work a fuzzy linear system is used to solve Leontief input-output model with fuzzy entries. For solving this model, we assume that the consumption matrix from di erent sectors of the economy and demand are known. These assumptions heavily depend on the information obtained from the industries. Hence uncertainties are involved in this information. The aim of this work is to model these uncertainties and to address them by fuzzy entries such as fuzzy numbers and LR-type fuzzy numbers (triangular and trapezoidal). Fuzzy linear system has been developed using fuzzy data and it is solved using Gauss-Seidel algorithm. Numerical examples show the e ciency of this algorithm. The famous example from Prof. Leontief, where he solved the production levels for U.S. economy in 1958, is also further analyzed.

Solving Challenging Real-World Scheduling Problems

This work contains a series of studies on the optimization of three real-world scheduling problems, school timetabling, sports scheduling and staff scheduling. These challenging problems are solved to customer satisfaction using the proposed PEAST algorithm. The customer satisfaction refers to the fact that implementations of the algorithm are in industry use. The PEAST algorithm is a product of long-term research and development. The first version of it was introduced in 1998. This thesis is a result of a five-year development of the algorithm. One of the most valuable characteristics of the algorithm has proven to be the ability to solve a wide range of scheduling problems. It is likely that it can be tuned to tackle also a range of other combinatorial problems. The algorithm uses features from numerous different metaheuristics which is the main reason for its success. In addition, the implementation of the algorithm is fast enough for real-world use.

The knapsack problem approach in solving partial hedging problems of options

En option är ett finansiellt kontrakt som ger dess innehavare en rättighet (men medför ingen skyldighet) att sälja eller köpa någonting (till exempel en aktie) till eller från säljaren av optionen till ett visst pris vid en bestämd tidpunkt i framtiden. Den som säljer optionen binder sig till att gå med på denna framtida transaktion ifall optionsinnehavaren längre fram bestämmer sig för att inlösa optionen. Säljaren av optionen åtar sig alltså en risk av att den framtida transaktion som optionsinnehavaren kan tvinga honom att göra visar sig vara ofördelaktig för honom. Frågan om hur säljaren kan skydda sig mot denna risk leder till intressanta optimeringsproblem, där målet är att hitta en optimal skyddsstrategi under vissa givna villkor. Sådana optimeringsproblem har studerats mycket inom finansiell matematik. Avhandlingen "The knapsack problem approach in solving partial hedging problems of options" inför en ytterligare synpunkt till denna diskussion: I en relativt enkel (ändlig och komplett) marknadsmodell kan nämligen vissa partiella skyddsproblem beskrivas som så kallade kappsäcksproblem. De sistnämnda är välkända inom en gren av matematik som heter operationsanalys. I avhandlingen visas hur skyddsproblem som tidigare lösts på andra sätt kan alternativt lösas med hjälp av metoder som utvecklats för kappsäcksproblem. Förfarandet tillämpas även på helt nya skyddsproblem i samband med så kallade amerikanska optioner.