Easy PRAM-based High-performance Parallel Programming with ICE

A poster of this paper will be presented at the 25th International Conference on Parallel Architecture and Compilation Technology (PACT ’16), September 11-15, 2016, Haifa, Israel.

Self-regulated learning in computer programming : strategies students adopted during an assignment

The SimProgramming teaching approach has the goal to help students overcome their learning difficulties in the transition from entry-level to advanced computer programming and prepare them for real-world labour environments, adopting learning strategies. It immerses learners in a businesslike learning environment, where students develop a problem-based learning activity with a specific set of tasks, one of which is filling weekly individual forms. We conducted thematic analysis of 401 weekly forms, to identify the students’ strategies for self-regulation of learning during assignment. The students are adopting different strategies in each phase of the approach. The early phases are devoted to organization and planning, later phases focus on applying theoretical knowledge and hands-on programming. Based on the results, we recommend the development of educational practices to help students conduct self-reflection of their performance during tasks.

Self-regulated learning in higher education : strategies adopted by computer programming students

Trabalho apresentado em PAEE/ALE’2016, 8th International Symposium on Project Approaches in Engineering Education (PAEE) and 14th Active Learning in Engineering Education Workshop (ALE)

Ontogeny and nutritional programming of the hepatic growth hormone-insulin-like growth factor-prolactin axis in the sheep

The liver is an important metabolic and endocrine organ in the fetus but the extent to which its hormone receptor (R) sensitivity is developmentally regulated in early life is not fully established. We, therefore, examined developmental changes in mRNA abundance for the growth hormone (GH) and prolactin (PRL) receptors (R) plus insulin-like growth factor (IGF)-I and –II and their receptors. Fetal and postnatal sheep were sampled at either 80, or 140 days gestation, 1, 30 days or six months of age. The effect of maternal nutrient restriction between early to mid (i.e. 28 to 80 days gestation, the time of early liver growth) gestation on gene expression was also examined in the fetus and juvenile offspring. Gene expression for the GHR, PRLR and IGF-IR increased through gestation peaking at birth, whereas IGF-I was maximal near to term. In contrast, IGF-II mRNA decreased between mid and late gestation to increase after birth whereas IGF-IIR remained unchanged. A substantial decline in mRNA abundance for GHR, PRLR and IGF-IR then occurred up to six months. Maternal nutrient restriction reduced GHR and IGF-IIR mRNA abundance in the fetus, but caused a precocious increase in the PRLR. Gene expression for IGF-I and –II were increased in juvenile offspring born to nutrient restricted mothers. In conclusion, there are marked differences in the developmental ontogeny and nutritional programming of specific hormones and their receptors involved in hepatic growth and development in the fetus. These could contribute to changes in liver function during adult life.

Ontogeny and nutritional programming of mitochondrial proteins in the ovine kidney, liver and lung

This study investigated the developmental and nutritional programming of two important mitochondrial proteins, namely voltage dependent anion channel (VDAC) and cytochrome c in the sheep kidney, liver and lung. The effect of maternal nutrient restriction between early to mid gestation (i.e. 28 to 80 days gestation, the period of maximal placental growth) on the abundance of these proteins was also examined in fetal and juvenile offspring. Fetuses were sampled at 80 and 140 days gestation (term ~147 days), and postnatal animals at 1 and 30 days and 6 months of age. The abundance of VDAC peaked at 140 days gestation in the lung, compared with 1 day after birth in the kidney and liver, whereas cytochrome c abundance was greatest at 140 days gestation in the liver, 1 day after birth in the kidney and 6 months of age in lungs. This differential ontogeny in mitochondrial protein abundance between tissues was accompanied with very different tissue specific responses to changes in maternal food intake. In the liver, maternal nutrient restriction only increased mitochondrial protein abundance at 80 days gestation, compared with no effect in the kidney. In contrast, in the lung mitochondrial protein abundance was raised near to term, whereas VDAC abundance was decreased by 6 months of age. These findings demonstrate the tissue specific nature of mitochondrial protein development that reflects differences in functional adaptation after birth. The divergence in mitochondrial response between tissues to maternal nutrient restriction early in pregnancy further reflects these differential ontogeny’s.

Programming Assignment of Programming 3: an Object-Oriented Version of Conway’s Game of Life

These are the instructions for a programming assignment of the subject Programming 3 taught at University of Alicante in Spain. The objective of the assignment is to build an object-oriented version of Conway's game of life in Java. The assignment is divided into four sub-assignments.

Mathematical Programming Models for Influence Maximization on Social Networks

In this dissertation, we apply mathematical programming techniques (i.e., integer programming and polyhedral combinatorics) to develop exact approaches for influence maximization on social networks. We study four combinatorial optimization problems that deal with maximizing influence at minimum cost over a social network. To our knowl- edge, all previous work to date involving influence maximization problems has focused on heuristics and approximation. We start with the following viral marketing problem that has attracted a significant amount of interest from the computer science literature. Given a social network, find a target set of customers to seed with a product. Then, a cascade will be caused by these initial adopters and other people start to adopt this product due to the influence they re- ceive from earlier adopters. The idea is to find the minimum cost that results in the entire network adopting the product. We first study a problem called the Weighted Target Set Selection (WTSS) Prob- lem. In the WTSS problem, the diffusion can take place over as many time periods as needed and a free product is given out to the individuals in the target set. Restricting the number of time periods that the diffusion takes place over to be one, we obtain a problem called the Positive Influence Dominating Set (PIDS) problem. Next, incorporating partial incentives, we consider a problem called the Least Cost Influence Problem (LCIP). The fourth problem studied is the One Time Period Least Cost Influence Problem (1TPLCIP) which is identical to the LCIP except that we restrict the number of time periods that the diffusion takes place over to be one. We apply a common research paradigm to each of these four problems. First, we work on special graphs: trees and cycles. Based on the insights we obtain from special graphs, we develop efficient methods for general graphs. On trees, first, we propose a polynomial time algorithm. More importantly, we present a tight and compact extended formulation. We also project the extended formulation onto the space of the natural vari- ables that gives the polytope on trees. Next, building upon the result for trees---we derive the polytope on cycles for the WTSS problem; as well as a polynomial time algorithm on cycles. This leads to our contribution on general graphs. For the WTSS problem and the LCIP, using the observation that the influence propagation network must be a directed acyclic graph (DAG), the strong formulation for trees can be embedded into a formulation on general graphs. We use this to design and implement a branch-and-cut approach for the WTSS problem and the LCIP. In our computational study, we are able to obtain high quality solutions for random graph instances with up to 10,000 nodes and 20,000 edges (40,000 arcs) within a reasonable amount of time.

Corrigendum to “The envelope theorem for multiobjective convex programming via contingent derivatives” [J. Math. Anal. Appl. 372 (1) (2010) 197–207]

The aim of this note is to formulate an envelope theorem for vector convex programs. This version corrects an earlier work, “The envelope theorem for multiobjective convex programming via contingent derivatives” by Jiménez Guerra et al. (2010) [3]. We first propose a necessary and sufficient condition allowing to restate the main result proved in the alluded paper. Second, we introduce a new Lagrange multiplier in order to obtain an envelope theorem avoiding the aforementioned error.

A natural extension of the classical envelope theorem in vector differential programming

The aim of this paper is to extend the classical envelope theorem from scalar to vector differential programming. The obtained result allows us to measure the quantitative behaviour of a certain set of optimal values (not necessarily a singleton) characterized to become minimum when the objective function is composed with a positive function, according to changes of any of the parameters which appear in the constraints. We show that the sensitivity of the program depends on a Lagrange multiplier and its sensitivity.

Integer Linear Programming for Sequence Problems: A general approach to reduce the problem size

Sequence problems belong to the most challenging interdisciplinary topics of the actuality. They are ubiquitous in science and daily life and occur, for example, in form of DNA sequences encoding all information of an organism, as a text (natural or formal) or in form of a computer program. Therefore, sequence problems occur in many variations in computational biology (drug development), coding theory, data compression, quantitative and computational linguistics (e.g. machine translation). In recent years appeared some proposals to formulate sequence problems like the closest string problem (CSP) and the farthest string problem (FSP) as an Integer Linear Programming Problem (ILPP). In the present talk we present a general novel approach to reduce the size of the ILPP by grouping isomorphous columns of the string matrix together. The approach is of practical use, since the solution of sequence problems is very time consuming, in particular when the sequences are long.

Empirical studies of pair programming for CS/SE teaching in higher education: a systematic literature review

The objective of this paper is to present the current evidence relative to the effectiveness of pair programming (PP) as a pedagogical tool in higher education CS/SE courses. We performed a systematic literature review (SLR) of empirical studies that investigated factors affecting the effectiveness of PP for CS/SE students and studies that measured the effectiveness of PP for CS/SE students. Seventy-four papers were used in our synthesis of evidence, and 14 compatibility factors that can potentially affect PP's effectiveness as a pedagogical tool were identified. Results showed that students' skill level was the factor that affected PP's effectiveness the most. The most common measure used to gauge PP's effectiveness was time spent on programming. In addition, students' satisfaction when using PP was overall higher than when working solo. Our meta-analyses showed that PP was effective in improving students' grades on assignments. Finally, in the studies that used quality as a measure of effectiveness, the number of test cases succeeded, academic performance, and expert opinion were the quality measures mostly applied. The results of this SLR show two clear gaps in this research field: 1) a lack of studies focusing on pair compatibility factors aimed at making PP an effective pedagogical tool and 2) a lack of studies investigating PP for software design/modeling tasks in conjunction with programming tasks.

A unified mixed-integer programming model for simultaneous fluence weight and aperture optimization in VMAT, tomotherapy, and cyberknife

All rights reserved. In this paper, we propose and study a unified mixed-integer programming model that simultaneously optimizes fluence weights and multi-leaf collimator (MLC) apertures in the treatment planning optimization of VMAT, Tomotherapy, and CyberKnife. The contribution of our model is threefold: (i) Our model optimizes the fluence and MLC apertures simultaneously for a given set of control points. (ii) Our model can incorporate all volume limits or dose upper bounds for organs at risk (OAR) and dose lower bound limits for planning target volumes (PTV) as hard constraints, but it can also relax either of these constraint sets in a Lagrangian fashion and keep the other set as hard constraints. (iii) For faster solutions, we propose several heuristic methods based on the MIP model, as well as a meta-heuristic approach. The meta-heuristic is very efficient in practice, being able to generate dose- and machinery-feasible solutions for problem instances of clinical scale, e.g., obtaining feasible treatment plans to cases with 180 control points, 6750 sample voxels and 18,000 beamlets in 470 seconds, or cases with 72 control points, 8000 sample voxels and 28,800 beamlets in 352 seconds. With discretization and down-sampling of voxels, our method is capable of tackling a treatment field of 8000-64,000cm3, depending on the ratio of critical structure versus unspecified tissues.

On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches

The Kidney Exchange Problem (KEP) is a combinatorial optimization problem and has attracted the attention from the community of integer programming/combinatorial optimisation in the past few years. Defined on a directed graph, the KEP has two variations: one concerns cycles only, and the other, cycles as well as chains on the same graph. We call the former a Cardinality Constrained Multi-cycle Problem (CCMcP) and the latter a Cardinality Constrained Cycles and Chains Problem (CCCCP). The cardinality for cycles is restricted in both CCMcP and CCCCP. As for chains, some studies in the literature considered cardinality restrictions, whereas others did not. The CCMcP can be viewed as an Asymmetric Travelling Salesman Problem that does allow subtours, however these subtours are constrained by cardinality, and that it is not necessary to visit all vertices. In existing literature of the KEP, the cardinality constraint for cycles is usually considered to be small (to the best of our knowledge, no more than six). In a CCCCP, each vertex on the directed graph can be included in at most one cycle or chain, but not both. The CCMcP and the CCCCP are interesting and challenging combinatorial optimization problems in their own rights, particularly due to their similarities to some travelling salesman- and vehicle routing-family of problems. In this paper, our main focus is to review the existing mathematical programming models and solution methods in the literature, analyse the performance of these models, and identify future research directions. Further, we propose a polynomial-sized and an exponential-sized mixed-integer linear programming model, discuss a number of stronger constraints for cardinality-infeasible-cycle elimination for the latter, and present some preliminary numerical results.

Overcoming solvent mismatch limitations in 2D-HPLC with temperature programming of isocratic mobile phases

This work describes a method for two-dimensional high performance liquid chromatography (2D-HPLC) that uses an isocratic mobile phase with a temperature gradient in the first dimension. Temperature programming was used to manipulate solvent elution strength in place of a mobile phase concentration gradient. This ensured that all eluent fractions transferred into the second dimension were of an identical solvent composition, i.e. the second dimension injection solvent did not increase during the course of the analysis. When applied to a complex natural product extract of coffee, the separation was completed in 35 min and had an orthogonality of 35% (calculated using the bins method) and a spreading angle of 52° as determined via a geometric approach to factor analysis. This approach, incorporating a temperature gradient in the first dimension, compared favourably to previously reported 2D-HPLC separations of coffee, with similar or shorter analysis times.

Domain-driven classification based on multiple criteria and multiple constraint-level programming for intelligent credit scoring

Extracting knowledge from the transaction records and the personal data of credit card holders has great profit potential for the banking industry. The challenge is to detect/predict bankrupts and to keep and recruit the profitable customers. However, grouping and targeting credit card customers by traditional data-driven mining often does not directly meet the needs of the banking industry, because data-driven mining automatically generates classification outputs that are imprecise, meaningless, and beyond users' control. In this paper, we provide a novel domain-driven classification method that takes advantage of multiple criteria and multiple constraint-level programming for intelligent credit scoring. The method involves credit scoring to produce a set of customers' scores that allows the classification results actionable and controllable by human interaction during the scoring process. Domain knowledge and experts' experience parameters are built into the criteria and constraint functions of mathematical programming and the human and machine conversation is employed to generate an efficient and precise solution. Experiments based on various data sets validated the effectiveness and efficiency of the proposed methods. © 2006 IEEE.