FROM OUR SPECIAL CORRESPONDENT, FROM OUR TENNIS CORRESPONDENT, From Our Racing Correspondent, FROM OUR NORTHERN CORRESPONDENT, FROM OUR RACKETS CORRESPONDENT, From Our Association Football Correspondent, FROM OUR ASSOCIATION FOOTBALL CORRESPONDENT, FROM A STAFF REPORTER, From Our Hockey Correspondent, FROM OUR ROWING CORRESPONDENT, From Our Rugby Football Correspondent, FROM OUR RUGBY CORRESPONDENT, From Our Squash Rackets Correspondent, FROM OUR LABOUR CORRESPONDENT, From Our Labour Correspondent, FROM OUR CORRESPONDENT, FROM OUR UNIVERSITY CORRESPONDENT, FROM OUR POLITICAL CORRESPONDENT, FROM OUR LABOUR STAFF, From Our Political Correspondent, FROM OUR MOTORING CORRESPONDENT, From Our Special Correspondent, From Our Own Correspondent-BONN, FEB. 21, FROM OUR OWN CORRESPONDENT, From Our Correspondent-DELHI, FEB. 21, From Our Special Correspondent-SHIGA HEIGHTS, CENTRAL JAPAN, FROM OUR DIPLOMATIC CORRESPONDENT, From Our Own Correspondent-NEW YORK, FEB. 21, FROM A SPECIAL CORRESPONDENT, FROM OUR MIDDLE EAST CORRESPONDENT, From Our Own Correspondent, From Our Defence Correspondent, From Our European Economic Correspondent-GENEVA, FEB. 21, F. J. BELLENGER., NICHOLAS M. COHEN., GRAHAM HUTTON., R. P. ERNLE ERLE DRAX., ROBIN TURTON. RONALD RUSSELL., MARK BONHAM CARTER., EDWARD GARDNER., From Our Athens Correspondent, A. C. MUFFETT, Claims Manager., FROM A CORRESPONDENT, FROM OUR ESTATES CORRESPONDENT, FROM A MOTHER, From Our Special Correspondent-PARIS, By Our City Editor, From Our Correspondent-ZURICH, By Our City Staff, FROM A MANCHESTER CORRESPONDENT, BY OUR CITY STAFF, From Our Agricultural Correspondent, From a Correspondent,
... Court Circular. Obituaries: Lady Susan Hicks Beach, Mr. Eljas Erkko Finnish Journalist And Politician, Mr. James E. ...
1965 - Gale Group | TDA
... and Their Use in LR Parser Optimization Author: Eljas Soisalon-Soininen Department of Computer Science, University of ...
Tópico(s): Evolutionary Algorithms and Applications
1982 - Association for Computing Machinery | ACM Transactions on Programming Languages and Systems
Seppo Sippu, Eljas Soisalon-Soininen,
... Box 111, SF-80101 Joensuu 10, FinlandView Profile , Eljas Soisalon-Soininen Institut für Angewandte Informatik und Formale ...
Tópico(s): Distributed systems and fault tolerance
1983 - Association for Computing Machinery | ACM Transactions on Programming Languages and Systems
Martti Takala, Eljas Siro, Yrjö Toivainen,
Tópico(s): Suicide and Self-Harm Studies
1958 - Alcohol Research Documentation | Quarterly Journal of Studies on Alcohol
Climatic fluctuation is a serious problem for forestry in Lapland. Some indications about the nature and causal relationships of such fluctuation have been discussed. Cyclic variation can be explained by a “memory” in the atmosphere, variation in the Moons's gravitation, and solar activity. The index of atmospheric circulation over the northern hemisphere was the most effective climatic parameter in explaining the growth variation of Scots pine.
Tópico(s): Botany and Plant Ecology Studies
1980 - Wiley | Ecography
Eljas Soisalon-Soininen, Esko Ukkonen,
Tópico(s): Natural Language Processing Techniques
1979 - Springer Science+Business Media | Acta Informatica
Abstract By the end of the Middle Ages both the southern inland areas and all the coastal districts of Finland had been permanently settled. Inland the northern border of the settled area ran along the 62nd parallel of latitude, but in the east, near the border between Sweden—Finland and Russia, settlement had expanded somewhat further north. On the coast of the Gulf of Bothnia and in the valleys of the Tornio and Kemi rivers which empty into it, permanent settlements extended as far as the arctic ...
Tópico(s): Historical and Archaeological Studies
1981 - Taylor & Francis | Scandinavian Economic History Review
Eljas Soisalon-Soininen, Derick Wood,
Three varieties of the closure of a set of iso-(oriented) rectangles, i.e., rectilin-early-oriented rectangles, are introduced. These are uni-directional, diagonal, and rectangular closure. First a strong decomposition theorem for diagonal closure in terms of uni-directional closure is proved. Then time and space optimal algorithms to compute uni-directional and diagonal closure, each running in O(nlogn) time and O(n) space, are described. An O(nlogn) time and space algorithm for rectangular closure ...
Tópico(s): Optimization and Search Problems
1984 - Academic Press | Journal of Algorithms
Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood,
We study the difficulty of solving instances of a new family of sliding block puzzles called SEPARATION TM. Each puzzle in the family consists of an arrangement in the plane of n rectilinear wooden blocks, n > 0. The aim is to discover a sequence of rectilinear moves which when carried out will separate each piece to infinity. If there is such a sequence of moves we say the puzzle or arrangement is separable and if each piece is moved only once we say it is one-separable. Furthermore if it is one- ...
Tópico(s): Digital Image Processing Techniques
1984 - Springer Science+Business Media | Lecture notes in computer science
Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood,
Recently the computation of the rectilinear convex hull of a collection of rectilinear polygons has been studied by a number of authors. From these studies three distinct definitions of rectilinear convex hulls have emerged. We examine these three definitions for point sets in general, pointing out some of their consequences, and we give optimal algorithms to compute the corresponding rectilinear convex hulls of a finite set of points in the plane.
Tópico(s): Optimization and Packing Problems
1984 - Elsevier BV | Information Sciences
Esko Nuutila, Eljas Soisalon-Soininen,
We present two improved versions of Tarjan's algorithm for the detection of strongly connected components in a directed graph. Our new algorithms handle sparse graphs and graphs with many trivial components (containing only one node) more economically than Tarjan's original algorithm. As an application we present an efficient transitive closure algorithm.
Tópico(s): Graph Labeling and Dimension Problems
1994 - Elsevier BV | Information Processing Letters
Tuukka Haapasalo, Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen,
We consider the recoverability of traditional R-tree index structures under concurrent updating transactions, an important issue that is neglected or treated inadequately in many proposals of R-tree concurrency control. We present two solutions to ARIES-based recovery of transactions on R-trees. These assume a standard fine-grained single-version update model with physiological write-ahead logging and steal-and-no-force buffering where records with uncommitted updates by a transaction may migrate ...
Tópico(s): Advanced Data Storage Technologies
2011 - IEEE Computer Society | IEEE Transactions on Knowledge and Data Engineering
Tuukka Haapasalo, Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen,
The string-matching problem with wildcards is considered in the context of online matching of multiple patterns. Our patterns are strings of characters in the input alphabet and of variable-length gaps, where the width of a gap may vary between two integer bounds or from an integer lower bound to infinity. Our algorithm is based on locating "keywords" of the patterns in the input text, that is, maximal substrings of the patterns that contain only input characters. Matches of prefixes of patterns ...
Tópico(s): Web Data Mining and Analysis
2011 - Springer Science+Business Media | Lecture notes in computer science
Zeinab Ibrahim, Seppo Sippu, Eljas Soisalon-Soininen,
We develop new algorithms for the management of transactions in a page-shipping client-server database system in which the physical database is organized as a sparse B-tree index. Our starvation-free fine-grained locking protocol combines adaptive callbacks with key-range locking and guarantees repeatable-read-level isolation (i.e., serializability) for transactions containing any number of record insertions, record deletions, and key-range scans. Partial and total rollbacks of client transactions ...
Tópico(s): Parallel Computing and Optimization Techniques
2006 - Association for Computing Machinery | ACM Transactions on Database Systems
Heikki Kallio, Eljas-Veli T. Snäll, Sami Suvanto, Carl A. Tuomas, Mauri Iivonen, Juha‐Pekka Pokki, Per H. Rosenberg,
Background: Adequate intraoperative analgesia combined with faster mobilization might be achieved by replacing hyperbaric ropivacaine partly with fentanyl. Methods: Sixty spinal anesthesia patients were randomized into 2 groups of either fentanyl 20 μg mixed with hyperbaric ropivacaine 10 mg (group FR10) or hyperbaric ropivacaine 15 mg (group R15). Forty-five patients underwent inguinal hernia repair and 15 patients had lower extremity surgery. Sensory block was tested by pinprick, and motor block was tested ...
Tópico(s): Pain Mechanisms and Treatments
2005 - BMJ | Regional Anesthesia & Pain Medicine
Helena Kallio, Eljas-Veli T. Snäll, Sami Suvanto, Carl A. Tuomas, Mauri Iivonen, Juha‐Pekka Pokki, Per H. Rosenberg,
Tópico(s): Nausea and vomiting management
2005 - BMJ | Regional Anesthesia & Pain Medicine
Otto Nurmi, Eljas Soisalon-Soininen,
Tópico(s): Data Management and Algorithms
1996 - Springer Science+Business Media | Acta Informatica
Otto Nurmi, Eljas Soisalon-Soininen,
Tópico(s): Caching and Content Delivery
1996 - Springer Science+Business Media | Acta Informatica
Kerttu Pollari-Malmi, Eljas Soisalon-Soininen, Tatu Ylönen,
In many applications it is important to be able to insert (or delete) keys into a B-tree as a batch, instead of inserting them one by one. Moreover, it may be necessary to search the B-tree concurrently with the batch update. An example of this is a text database system supporting a newspaper house: all words (keys) of each article obtained from a news agency should be inserted at once, and, at the same time, searches for documents containing certain words should be allowed as efficiently as possible. ...
Tópico(s): Distributed systems and fault tolerance
1996 - IEEE Computer Society | IEEE Transactions on Knowledge and Data Engineering
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen,
Tópico(s): Advanced Database Systems and Queries
2004 - Springer Science+Business Media | The VLDB Journal
Helena Kallio, Eljas-Veli T. Snäll, Markku P. Kero, Per H. Rosenberg,
In Brief Ropivacaine, which blocks sensory nerve fibers more readily than motor fibers, is considered to be less potent than bupivacaine. Our hypothesis was that, when used in spinal anesthesia for day surgery, ropi-vacaine 15 and 20 mg would provide faster motor recovery than bupivacaine 10 mg. This prospective, randomized, double-blinded study included 90 ambulatory lower-extremity surgery patients who received 2 mL of ropivacaine 1%, ropivacaine 0.75%, or bupivacaine 0.5%. Motor block was tested ...
Tópico(s): Intraoperative Neuromonitoring and Anesthetic Effects
2004 - Lippincott Williams & Wilkins | Anesthesia & Analgesia
Eljas Soisalon-Soininen, Tatu Ylönen,
Two-phase locking is a standard method for managing concurrent transactions in database systems. In order to guarantee good recovery properties, two-phase locking should be strict, meaning that locks can be released only after the transaction's commit or abort. In this paper we show that even exclusive locks can be released immediately after the commit request has arrived, without sacrificing any important recovery properties. This optimization is especially useful if the commit operation takes ...
Tópico(s): Optimization and Search Problems
1995 - Springer Science+Business Media | Lecture notes in computer science
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Georg Gottlob, Moshe Vardi, Marco Cadoli, Surajit Chauduri, Marco Colombetti, Alexander Dikovsky, Martin Erwig, Piero Rag, Hartmut Giiting, Willem Jonker, Brigitte Krsll, Nicola Leone, Victor Markowitz, Thomas A. Mueck, Frank Olken, Günther Pernul, Kenneth G. Ross, Marco Schaerf, Klaus‐Dieter Schewe, Michael Schrefl, Wolfgang Slany, Christian Stary, Alexei P. Stolboushkin, Christophe Tollu, Heinz Uphoff, Mark Wallace, Pierre Wolper, Meike Albrecht, Luca Cabibbo, Amy Chen, Anuj Dawar, Marie Duží, Fei Shi, Mike Freeston, Alois Heinz, Gerti Kappel, Eva Maria Kuehn, Bertram Lud cher Tibor, Markus Muth, Pekka Orponen, Riccardo Torlone, Yehoshua Sagiv, Peter Sch iuble, G.A. Schloss, Heribert Schuetz, Eljas Soisalon-Soininen, Ulrike Stege, Markus Stumptner, Petr Váňa, Gerhard Weikum, Haiyan Ye, Andreas Benczur, Silvana Castano, Qiming Chen, Michael Dekhtyar, Thomas Eiter, Andrew U. Frank, O Gorochinskaya, Friedbert Huber-W chle, Peter Kirschenhofer, Gabriel M. Kuper, Robert Manthey, Bernd Meyer, Otto Nurmi, Stefano Paraboschi, Lajos Ronyai, Vladimir Sazonov, H. J. Schek, Markus Schneider, Konrad Schwarz, I-Iua Nam, Son Stepanek, Jianwen Su, Bela Uhrin, H. Veith, Ouri Wolfson,
Tópico(s): Advanced Database Systems and Queries
1995 - Springer Science+Business Media | Lecture notes in computer science
Seppo Sippu, Eljas Soisalon-Soininen,
We consider transactions running on a database that consists of records with unique totally-ordered keys and is organized as a sparse primary search tree such as a B-tree index on disk storage. We extend the classical read-write model of transactions by considering inserts, deletes and key-range scans and by distinguishing between four types of transaction states: forward-rolling, committed, backward-rolling, and rolled- back transactions. A search-tree transaction is modelled as a two-level transaction ...
Tópico(s): Advanced Data Storage Technologies
2001 - Springer Science+Business Media | Lecture notes in computer science
Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer,
We consider binary search trees, where rebalancing transformations need not be connected with updates but may be delayed. For standard AVL tree rebalancing, we prove that even though the rebalancing operations are uncoupled from updates, their total number is bounded by O(Mlog(M + N)), where M is the number of updates to an AVL tree of initial size N. Hence, relaxed balancing of AVL trees comes at no extra cost asymptotically. Furthermore, our scheme differs from most other relaxed balancing schemes ...
Tópico(s): Advanced Data Storage Technologies
1997 - Springer Science+Business Media | Lecture notes in computer science
Sabine Hanke, Th. Ottmann, Eljas Soisalon-Soininen,
Tópico(s): Graph Theory and Algorithms
1997 - Springer Science+Business Media | Lecture notes in computer science
Małgorzata Zięba, Eljas Johansson,
Sustainability reporting (SR) allows organisations to communicate their non-financial impacts to stakeholders. It has also become a widespread business practice in aviation, a transport sector that contributes significantly to global warming. Academia has begun to examine SR in the context of airlines surprisingly late, and no comprehensive reviews of its respective developments have been made so far. Consequently, a systematic literature review was performed with an exclusive focus on airline SR ...
Tópico(s): Sustainable Supply Chain Management
2021 - Elsevier BV | Transportation Research Part D Transport and Environment
Eljas Pohtila, Tapani Pohjola,
Tópico(s): Forest Ecology and Biodiversity Studies
1985 - Finnish Society of Forest Science | Silva Fennica
Iris Aalto, Eduardo Eiji Maeda, Janne Heiskanen, Eljas Kullervo Aalto, Petri Pellikka,
Abstract. Climate change is expected to have detrimental consequences on fragile ecosystems, threatening biodiversity, as well as food security of millions of people. Trees are likely to play a central role in mitigating these impacts. The microclimatic conditions below tree canopies usually differ substantially from the ambient macroclimate as vegetation can buffer temperature changes and variability. Trees cool down their surroundings through several biophysical mechanisms, and the cooling benefits ...
Tópico(s): Land Use and Ecosystem Services
2022 - Copernicus Publications | Biogeosciences
Seppo Sippu, Eljas Soisalon-Soininen, Esko Ukkonen,
... Tukholmankatu 2, SF-00250, Helsinki 25, FinlandView Profile , Eljas Soisalon-Soininen Department of Computer Science, University of ...
Tópico(s): Model-Driven Software Engineering Techniques
1983 - Association for Computing Machinery | Journal of the ACM