scispace - formally typeset
Search or ask a question
Institution

Turku Centre for Computer Science

FacilityTurku, 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
More filters
Journal ArticleDOI
20 Sep 2015
TL;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

Journal ArticleDOI
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

Proceedings ArticleDOI
22 Mar 2010
TL;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

Journal ArticleDOI
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

Journal ArticleDOI
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

NameH-indexPapersCitations
José A. Teixeira101141447329
Cunsheng Ding6125411116
Jun'ichi Tsujii5938915985
Arto Salomaa5637417706
Tero Aittokallio522718689
Risto Lahdelma481496637
Hannu Tenhunen4581911661
Mats Gyllenberg442048029
Sampo Pyysalo421538839
Olli Polo421405303
Pasi Liljeberg403066959
Tapio Salakoski382317271
Filip Ginter371567294
Robert Fullér371525848
Juha Plosila353424917
Network Information
Related Institutions (5)
Vienna University of Technology
49.3K papers, 1.3M citations

84% related

Eindhoven University of Technology
52.9K papers, 1.5M citations

83% related

Aalto University
32.6K papers, 829.6K citations

83% related

Carnegie Mellon University
104.3K papers, 5.9M citations

82% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20231
20223
20213
20209
20198
201816