Search

Your search keyword '"Guala', L"' showing total 15 results
Start Over Author "Guala', L"
15 results on '"Guala', L"'

2. On the complexity of two dots for narrow boards and few colors

Author

Bilo, D, Guala, L, Leucci, S, Misra, N, Ito, Hiro, Leonardi, Stefano, Pagli, Linda, and Prencipe, Giuseppe

Subjects
000 Computer science, knowledge, general works, Settore INF/01 - Informatica, Combinatorial game theory, NP-complete, Perfect information, Puzzle, puzzle, puzzle, NP-complete, perfect information, combinatorial game theory, 0102 computer and information sciences, 02 engineering and technology, perfect information, Condensed Matter::Mesoscopic Systems and Quantum Hall Effect, 01 natural sciences, combinatorial game theory, 010201 computation theory & mathematics, Computer Science, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing
Abstract

Two Dots is a popular single-player puzzle video game for iOS and Android. A level of this game consists of a grid of colored dots. The player connects two or more adjacent dots, removing them from the grid and causing the remaining dots to fall, as if influenced by gravity. One special move, which is frequently a game-changer, consists of connecting a cycle of dots: this removes all the dots of the given color from the grid. The goal is to remove a certain number of dots of each color using a limited number of moves. The computational complexity of Two Dots has already been addressed in [Misra, FUN 2016], where it has been shown that the general version of the problem is NP-complete. Unfortunately, the known reductions produce Two Dots levels having both a large number of colors and many columns. This does not completely match the spirit of the game, where, on the one hand, only few colors are allowed, and on the other hand, the grid of the game has only a constant number of columns. In this paper, we partially fill this gap by assessing the computational complexity of Two Dots instances having a small number of colors or columns. More precisely, we show that Two Dots is hard even for instances involving only 3 colors or 2 columns. As a contrast, we also prove that the problem can be solved in polynomial-time on single-column instances with a constant number of goals., Leibniz International Proceedings in Informatics (LIPIcs), 100, ISSN:1868-8969, 9th International Conference on Fun with Algorithms (FUN 2018), ISBN:978-3-95977-067-5

Published
2018

12. [To reduce the pain of heel prick in the newborn: comparison of six types of lancets].

Author

Ballardini G, Spruzzola A, Boneschi L, Visentin R, Boscardini L, Barbaglia M, and Guala LA

Subjects
Equipment Design, Humans, Infant, Newborn, Neonatal Screening, Pain Measurement, Surgical Instruments standards, Time Factors, Blood Specimen Collection instrumentation, Blood Specimen Collection methods, Heel blood supply, Pain etiology, Pain prevention & control
Abstract

Heel prick is an usual method performed to get a blood sample for newborn screening. Its wide use justifies the effort in reducing the pain as much as possible and some simple steps, including the use of spring heelsticks, are recommended by national and international guide-lines. But not all the heelsticks cause the same pain and allow to get enough blood for the screening. The aim of this work was to test six automatic heelstick devices with regard to the pain in heel prick measured with NIPS scale and, at the same time, to value their effectiveness in getting a blood sample suitable for filter paper for newborn screening. The following devices were assessed: Amnes Minilet Lancets, Wuxi Xinda Ltd, Exxe Safe Blade, Lifescan Stik Johnson & Johnson, One Touch Ultra Soft, Accu-Chek Safe T Pro Plus. The device Exxe Safe Blade statistically differs from all others: it is the least painful and it doesn't need any prick repetition.

Published
2012
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results