Institution
Turku Centre for Computer Science
Facility•Turku, Finland•
About: Turku Centre for Computer Science is a facility organization based out in Turku, Finland. It is known for research contribution in the topics: Decidability & Word (group theory). The organization has 382 authors who have published 1027 publications receiving 19560 citations.
Papers published on a yearly basis
Papers
More filters
••
20 Sep 2015TL;DR: There are areas to improve in each stage of the MAP from the RNs perspective, and real-time and ubiquitous documentation along with software including the data and knowledge required in medication management, is needed.
Abstract: Background. Registered nurses (RNs) have a role in the medication administration process (MAP) multiple times per day in a hectic hospital environment. This requires a great deal from the RNs in order to accomplish the demanding task of avoiding adverse drug events. However, the process has not been widely studied from the nurses’ perspective. Aim. The aim of this study was to describe the different stages of MAP from the RNs’ perspective. Methods. A qualitative descriptive research design, with a purposive sample involving thematic interviews of 20 RNs and questions to them in a paper form, was conducted in two medical units. Data was analyzed by using deductive content analysis. Results. The results revealed that RNs confront numerous problems such as equivocal prescriptions, problems with information technology (IT), unavailability or incompatibility of the medicines, a substantial amount of generic substitutions, and changing medicine brands. Disruptions and distraction run through each stage of the MAP, excluding prescribing. The RNs desire support in all stages of the MAP. Conclusion. There are areas to improve in each stage of the MAP from the RNs perspective. Real-time and ubiquitous documentation, along with software including the data and knowledge required in medication management, is needed.
23 citations
••
TL;DR: The decidability/undecidability-boundary between marked and 2-marked PCP is located and it is proved that the PCP remains undecidable if it only requires the words to differ in the first two letters.
23 citations
••
22 Mar 2010TL;DR: In this article, the authors outline metrics functions that can take advantage of more advanced information of the development artifacts and provide the lean or agile team with partially automated decision support for quality assurance actions.
Abstract: Agile and lean approaches favor self-organizing teams that use low-tech solutions for communicating and negotiating project content and scope in software projects. We consider this approach to have many benefits, but we also recognize that there is information in software projects that does not readily lend itself to low-tech types of visualization. Different characteristics of the code base is one such example. In this paper, we outline metrics functions that can take advantage of more advanced information of the development artifacts and provide the lean or agile team with partially automated decision support for quality assurance actions.
23 citations
••
TL;DR: It is proved that (r,@?@?)-identifying codes can be constructed from known ones using a suitable direct sum when @?>=2 and constructed with the best known cardinalities.
Abstract: Let @?, n and r be positive integers. Define F^n={0,1}^n. The Hamming distance between words x and y of F^n is denoted by d(x,y). The ball of radius r is defined as B"r(X)={y@?F^n|@?x@?X:d(x,y)@?r}, where X is a subset of F^n. A code C@?F^n is called (r,@?@?)-identifying if for all X,Y@?F^n such that |X|@?@?, |Y|@?@? and X Y, the sets B"r(X)@?C and B"r(Y)@?C are different. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. In this paper, we present various results concerning (r,@?@?)-identifying codes in the Hamming space F^n. First we concentrate on improving the lower bounds on (r,@?1)-identifying codes for r>1. Then we proceed by introducing new lower bounds on (r,@?@?)-identifying codes with @?>=2. We also prove that (r,@?@?)-identifying codes can be constructed from known ones using a suitable direct sum when @?>=2. Constructions for (r,@?2)-identifying codes with the best known cardinalities are also given.
23 citations
••
TL;DR: In this paper, the authors discuss the structure and operation of an interactive scheduling system for surface mount component printing involving multiple criteria, and present statistical data of the effect of the system in an actual production environment.
Abstract: In flexible manufacturing systems (FMS) the interaction between the production planner and the scheduling system is essential. This is a typical situation in printed circuit board (PCB) assembly. We discuss the structure and operation of an interactive scheduling system for surface mount component printing involving multiple criteria. The user can compose a schedule by using a heuristic algorithm, but the schedule can be manipulated also directly via a graphical user interface. In addition to system description, we present statistical data of the effect of the system in an actual production environment.
23 citations
Authors
Showing all 383 results
Name | H-index | Papers | Citations |
---|---|---|---|
José A. Teixeira | 101 | 1414 | 47329 |
Cunsheng Ding | 61 | 254 | 11116 |
Jun'ichi Tsujii | 59 | 389 | 15985 |
Arto Salomaa | 56 | 374 | 17706 |
Tero Aittokallio | 52 | 271 | 8689 |
Risto Lahdelma | 48 | 149 | 6637 |
Hannu Tenhunen | 45 | 819 | 11661 |
Mats Gyllenberg | 44 | 204 | 8029 |
Sampo Pyysalo | 42 | 153 | 8839 |
Olli Polo | 42 | 140 | 5303 |
Pasi Liljeberg | 40 | 306 | 6959 |
Tapio Salakoski | 38 | 231 | 7271 |
Filip Ginter | 37 | 156 | 7294 |
Robert Fullér | 37 | 152 | 5848 |
Juha Plosila | 35 | 342 | 4917 |