PokerMapper: : mapping executive functions, poker playing ability and responsible gambling in online environments

Research objectives Poker and responsible gambling both entail the use of the executive functions (EF), which are higher-level cognitive abilities. The main objective of this work was to assess if online poker players of different ability show different performances in their EF and if so, which functions are the most discriminating ones. The secondary objective was to assess if the EF performance can predict the quality of gambling, according to the Gambling Related Cognition Scale (GRCS), the South Oaks Gambling Screen (SOGS) and the Problem Gambling Severity Index (PGSI). Sample and methods The study design consisted of two stages: 46 Italian active players (41m, 5f; age 32±7,1ys; education 14,8±3ys) fulfilled the PGSI in a secure IT web system and uploaded their own hand history files, which were anonymized and then evaluated by two poker experts. 36 of these players (31m, 5f; age 33±7,3ys; education 15±3ys) accepted to take part in the second stage: the administration of an extensive neuropsychological test battery by a blinded trained professional. To answer the main research question we collected all final and intermediate scores of the EF tests on each player together with the scoring on the playing ability. To answer the secondary research question, we referred to GRCS, PGSI and SOGS scores.  We determined which variables that are good predictors of the playing ability score using statistical techniques able to deal with many regressors and few observations (LASSO, best subset algorithms and CART). In this context information criteria and cross-validation errors play a key role for the selection of the relevant regressors, while significance testing and goodness-of-fit measures can lead to wrong conclusions.   Preliminary findings We found significant predictors of the poker ability score in various tests. In particular, there are good predictors 1) in some Wisconsin Card Sorting Test items that measure flexibility in choosing strategy of problem-solving, strategic planning, modulating impulsive responding, goal setting and self-monitoring, 2) in those Cognitive Estimates Test variables related to deductive reasoning, problem solving, development of an appropriate strategy and self-monitoring, 3) in the Emotional Quotient Inventory Short (EQ-i:S) Stress Management score, composed by the Stress Tolerance and Impulse Control scores, and in the Interpersonal score (Empathy, Social Responsibility, Interpersonal Relationship). As for the quality of gambling, some EQ-i:S scales scores provide the best predictors: General Mood for the PGSI; Intrapersonal (Self-Regard; Emotional Self-Awareness, Assertiveness, Independence, Self-Actualization) and Adaptability  (Reality Testing, Flexibility, Problem Solving) for the SOGS, Adaptability for the GRCS. Implications for the field Through PokerMapper we gathered knowledge and evaluated the feasibility of the construction of short tasks/card games in online poker environments for profiling users’ executive functions. These card games will be part of an IT system able to dynamically profile EF and provide players with a feedback on their expected performance and ability to gamble responsibly in that particular moment. The implementation of such system in existing gambling platforms could lead to an effective proactive tool for supporting responsible gambling. 

Cooperação em sagüis comuns callithrix jacchus: condições e restrições

The cooperative behavior is no longer a dilemma for the theory of evolution, since there are models that explain the evolution of this behavior by means of natural selection at the individual level. However, there have been few studies on the proximal factors that interfere with cooperative behavior. In the study of the influence of cognition on cooperation, many authors have been interested in situations in which individuals decide whether to act cooperatively and select partners with different qualities to cooperate. Of the factors studied, we highlight the need for understanding the apparatus and communication between partners to the occurrence of cooperation. Recently, highlight is the proposal that the ability to cooperate would be greater in species with cooperative breeding system. Thus, the common marmoset (Callithrix jacchus) is a New World monkey which stands as a valuable species for this type of study because it presents cooperative actions in nature, such as sharing food and protection of the community territory. Our experiment investigated whether common marmosets unrelated females (n = 6) were able to cooperate using an electrical and a mechanical apparatus, if this cooperation is a byproduct of individual actions or involve social attention, if it occurs inter-individual variation in the use of devices and formation of roles (producer / scrounger) in dyads. We use the number of rewards obtained by animals (Ratio of Correct Pulls) as indicators of cooperation and glances for partners (Ratio of Correct Glances) as indicators of social attention and communication. The results indicate that the type of apparatus was not a constraint for the occurrence of cooperation between the marmosets, but still has not been verified formation of roles in the dyads. The performance of animals in the two devices showed a large variation in the learning time, not having relationship with the performance in the tests phase. In both devices the level of social glances at control phases were casually correlated with any other phase, but the data showed that there was not social attention, that is, the monkeys realized that they gave food to the partners, but the partners did

Investigação da influência do cochilo na aprendizagem escolar

There is a known positive effect of nocturnal sleep for brain plasticity and the consolidation of declarative and procedural memories, as well as for the facilitation of insight in problem solving. However, a possible pro-mnemonic effect of daytime naps after learning is yet to be properly characterized. The goal of this project was to evaluate the influence of daytime naps on learning among elementary and middleschool students, measuring the one-day (acute), and semester-long (chronic) effects of post-learning naps on performance. In the Acute Day-Nap condition, the elementary students were exposed to a class and then randomly divided into three groups: Nap (N), Game-based English Class (GBEC) and Traditional English Class (TEC). There were 2 multiple-choice follow-up tests to evaluate students performance in the short and long runs. In the short run, the N group outperformed the other two groups; and such tendency was maintained in the long run. In the chronic condition, the middle-school students were randomly separated into two groups: Nap (N) and Class (C) and were observed during one academic term. The N group had increased school performance in relation to the C group. In the statistical analyses, independent t-tests were applied considering the scores significant when p<0,05, expressed in terms of average ± average standard error. Results can be interpreted as an indication that a single daytime nap opportunity is not enough to ensure learning benefits. Therefore, more research is needed in order to advocate in favor of a daytime nap as a pedagogical means of promoting enhanced school performance

Prospecção e formação no domínio das competências e habilidades em tecnologia da informação: o caso do projeto metrópole digital em Natal/RN

This study deals with cognitive competences and abilities that are relevant to selection and education regarding Information Technology (IT). These competences relate to problem solving, decision making, and practical intelligence that regard scholar and extracurricular knowledge mobilization. The research aimed to contribute for the improvement of a selection instrument, consisting of five arrays of skills (dealing with objectives and prospection), as well as the development and comprehension of those skills that are involved in IT education. This is done by means of an analysis on the selection instrument used in the first selective process that occurred at Metropole Digital an Institute at the Federal University of Rio Grande do Norte in Brazil. This was evaluated aiming to acknowledge IT education (with basic training and emphasis on Web programming and electronics). The methodology used was of quantitative method involving performance scores relating education delivery. An Anova analysis of variance was done along with descriptive analysis involving socioeconomic data that was not observed in the meaningful relations between parental instruction and student performance in the graduate course. These analyses were able to point out the importance and need of the policies for vacancy reservation on behalf of public school students. A Spearman correlation analysis was done considering the instrument selection performance in the training course. The instrument is presented as a predictor that is significantly moderate and presents a good performance in the course as a whole. A Cluster and Regression analysis was also realized in the process. The first analysis allowed finding performance groups (Clusters) that ranged from medium and inferior. The regression analysis was able to point out association amongst criterion variables and the (average performance in basic and advanced modules) and explanatory (five matrixes). Regression analysis indicated that matrix 1 and matrix 3 were pointed out as being the strongest ones. In all the above analysis, the correlation between the instrument and the course was considered moderate. Thus this can be related in some of the aspects present in the course such as emphasis on evaluation itself as well as in technical contents and practical skills (educational ones) and competences and selection skills. It is known that the mediation of technological artifact in cultural context can foster the development of skills and abilities relevant to IT training. This study provides subsidies to reflect on the adoption of selection instrument and IT training in the Institute. Thus the research offers means to achieve a interdisciplinary discussion and enriching of areas such as Psychology and Information Technology; all of which regarding competencies and skills relevant in IT training

Modelo operacional do estudo de caso como estratégia de ensino na disciplina de enfermagem médico-cirúrgica: avaliação dos alunos

O estudo trata-se de uma pesquisa descritiva, com o objetivo de avaliar as contribuições e dificuldades sentidas pelos alunos, na utilização do Modelo Operacional do Estudo de Caso, proposto pelas autoras como uma das estratégias de ensino utilizada pela disciplina de Enfermagem Médico-Cirúrgica. Para instrumentalizar e operacionalizar a análise de conteúdo das respostas concedidas pelos alunos, utilizamos da análise temática, segundo Bardin. Com a realização desta investigação concluímos que os alunos reconhecem o modelo como estratégia de ensino na formação dos mesmos, principalmente, quanto ao conhecimento teórico-prático da assistência (70%) que este oferece, estimulando-os à autonomia na tomada de decisões e solução de problemas na área, além de incentivá-los na utilização do acervo da biblioteca. A outra contribuição está relacionada ao conhecimento referente à metodologia científica (30%), onde o modelo emerge a eles como uma estratégia de iniciação a esta atividade. As dificuldades sentidas pelos alunos na elaboração do estudo de caso ocorreram nas seguintes etapas: - no levantamento bibliográfico (58%), principalmente, quanto a falta de bibliografia específica e recente na área de enfermagem e ao não acesso dos alunos da graduação aos índices informatizados: - na redação do trabalho(27%), porém ao mesmo tempo revelando que o estudo de caso propiciou conhecimentos básicos de como elaborar e escrever um trabalho científico; dentre outras (15%).

Fundamentos de otimização por inteligência de enxames: uma visão geral

Este artigo apresenta uma breve revisão de alguns dos mais recentes métodos bioinspirados baseados no comportamento de populações para o desenvolvimento de técnicas de solução de problemas. As metaheurísticas tratadas aqui correspondem às estratégias de otimização por colônia de formigas, otimização por enxame de partículas, algoritmo shuffled frog-leaping, coleta de alimentos por bactérias e colônia de abelhas. Os princípios biológicos que motivaram o desenvolvimento de cada uma dessas estratégias, assim como seus respectivos algoritmos computacionais, são introduzidos. Duas aplicações diferentes foram conduzidas para exemplificar o desempenho de tais algoritmos. A finalidade é enfatizar perspectivas de aplicação destas abordagens em diferentes problemas da área de engenharia.

The application of preprocessing and cutting plane techniques for a class of production planning problems

This paper investigates properties of integer programming models for a class of production planning problems. The models are developed within a decision support system to advise a sales team of the products on which to focus their efforts in gaining new orders in the short term. The products generally require processing on several manufacturing cells and involve precedence relationships. The cells are already (partially) committed with products for stock and to satisfy existing orders and therefore only the residual capacities of each cell in each time period of the planning horizon are considered. The determination of production recommendations to the sales team that make use of residual capacities is a nontrivial optimization problem. Solving such models is computationally demanding and techniques for speeding up solution times are highly desirable. An integer programming model is developed and various preprocessing techniques are investigated and evaluated. In addition, a number of cutting plane approaches have been applied. The performance of these approaches which are both general and application specific is examined.

Algorithms for network piecewise-linear programs: A comparative study

Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.

Fourth-order method for solving the Navier-Stokes equations in a constricting channel

A fourth-order numerical method for solving the Navier-Stokes equations in streamfunction/vorticity formulation on a two-dimensional non-uniform orthogonal grid has been tested on the fluid flow in a constricted symmetric channel. The family of grids is generated algebraically using a conformal transformation followed by a non-uniform stretching of the mesh cells in which the shape of the channel boundary can vary from a smooth constriction to one which one possesses a very sharp but smooth corner. The generality of the grids allows the use of long channels upstream and downstream as well as having a refined grid near the sharp corner. Derivatives in the governing equations are replaced by fourth-order central differences and the vorticity is eliminated, either before or after the discretization, to form a wide difference molecule for the streamfunction. Extra boundary conditions, necessary for wide-molecule methods, are supplied by a procedure proposed by Henshaw et al. The ensuing set of non-linear equations is solved using Newton iteration. Results have been obtained for Reynolds numbers up to 250 for three constrictions, the first being smooth, the second having a moderately sharp corner and the third with a very sharp corner. Estimates of the error incurred show that the results are very accurate and substantially better than those of the corresponding second-order method. The observed order of the method has been shown to be close to four, demonstrating that the method is genuinely fourth-order. © 1977 John Wiley & Sons, Ltd.

Concept of Matching Parallelepiped and its use in the correspondence problem

In this paper, the concept of Matching Parallelepiped (MP) is presented. It is shown that the volume of the MP can be used as an additional measure of `distance' between a pair of candidate points in a matching algorithm by Relaxation Labeling (RL). The volume of the MP is related with the Epipolar Geometry and the use of this measure works as an epipolar constraint in a RL process, decreasing the efforts in the matching algorithm since it is not necessary to explicitly determine the equations of the epipolar lines and to compute the distance of a candidate point to each epipolar line. As at the beginning of the process the Relative Orientation (RO) parameters are unknown, a initial matching based on gradient, intensities and correlation is obtained. Based on this set of labeled points the RO is determined and the epipolar constraint included in the algorithm. The obtained results shown that the proposed approach is suitable to determine feature-point matching with simultaneous estimation of camera orientation parameters even for the cases where the pair of optical axes are not parallel.

On the regular-geometric-figure solution to the N-body problem

The regular-geometric-figure solution to the N-body problem is presented in a very simple way. The Newtonian formalism is used without resorting to a more involved rotating coordinate system. Those configurations occur for other kinds of interactions beyond the gravitational ones for some special values of the parameters of the forces. For the harmonic oscillator, in particular, it is shown that the N-body problem is reduced to N one-body problems.

Analysis of a sub-optimal scheme of drug dosage in the AIDS treatment

Here the results for CD4+T cells count and the viral load obtained from HIV sero-positive patients are compared with results from numerical simulations by computer. Also, the standard scheme of administration of drugs anti HIV (HAART schemes) which uses constant doses is compared with an alternative sub-optimal teatment scheme which uses variable drug dosage according to the evolution of a quantitative measure of the side effects. The quantitative analysis done here shows that it is possible to obtain, using the alternative scheme, the same performance of actual data but using variable dosage and having fewer side effects. Optimal control theory is used to solve and also to provide a prognosis related to the strategies for control of viraemia.

A constructive heuristic algorithm to Short Term Transmission Network Expansion Planning

In this paper a method for solving the Short Term Transmission Network Expansion Planning (STTNEP) problem is presented. The STTNEP is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In this work we present a constructive heuristic algorithm to find a solution of the STTNEP of excellent quality. In each step of the algorithm a sensitivity index is used to add a circuit (transmission line or transformer) to the system. This sensitivity index is obtained solving the STTNEP problem considering as a continuous variable the number of circuits to be added (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an interior points method that uses a combination of the multiple predictor corrector and multiple centrality corrections methods, both belonging to the family of higher order interior points method (HOIPM). Tests were carried out using a modified Carver system and the results presented show the good performance of both the constructive heuristic algorithm to solve the STTNEP problem and the HOIPM used in each step.

A branch-and-bound algorithm for the multi-stage transmission expansion planning

This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models or to more complex ones such as the DC model. Tests with a realistic power system were carried out in order to show the performance of the algorithm for the expansion plan executed for different time frames. © 2005 IEEE.